%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.215", %%% date = "23 April 2024", %%% time = "12:19:16 MST", %%% 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", %%% FAX = "+1 801 581 4148", %%% checksum = "64607 111059 551940 5195861", %%% 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.215, the COMPLETE year coverage %%% looked like this: %%% %%% 1954 ( 29) 1978 ( 57) 2002 ( 31) %%% 1955 ( 29) 1979 ( 59) 2003 ( 53) %%% 1956 ( 48) 1980 ( 61) 2004 ( 33) %%% 1957 ( 62) 1981 ( 52) 2005 ( 30) %%% 1958 ( 45) 1982 ( 65) 2006 ( 31) %%% 1959 ( 54) 1983 ( 51) 2007 ( 32) %%% 1960 ( 43) 1984 ( 52) 2008 ( 28) %%% 1961 ( 48) 1985 ( 51) 2009 ( 38) %%% 1962 ( 41) 1986 ( 39) 2010 ( 34) %%% 1963 ( 50) 1987 ( 48) 2011 ( 26) %%% 1964 ( 43) 1988 ( 48) 2012 ( 32) %%% 1965 ( 58) 1989 ( 42) 2013 ( 45) %%% 1966 ( 56) 1990 ( 37) 2014 ( 41) %%% 1967 ( 64) 1991 ( 37) 2015 ( 51) %%% 1968 ( 53) 1992 ( 38) 2016 ( 49) %%% 1969 ( 57) 1993 ( 45) 2017 ( 56) %%% 1970 ( 64) 1994 ( 47) 2018 ( 42) %%% 1971 ( 52) 1995 ( 46) 2019 ( 45) %%% 1972 ( 55) 1996 ( 32) 2020 ( 38) %%% 1973 ( 53) 1997 ( 34) 2021 ( 49) %%% 1974 ( 64) 1998 ( 35) 2022 ( 46) %%% 1975 ( 53) 1999 ( 32) 2023 ( 42) %%% 1976 ( 66) 2000 ( 35) 2024 ( 16) %%% 1977 ( 51) 2001 ( 38) %%% %%% Article: 3205 %%% Book: 2 %%% %%% Total entries: 3207 %%% %%% 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 %%% ctantug.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, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-CACM = "Communications of the 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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", 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 Association for Computing Machinery", 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", 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 Association for Computing Machinery", 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", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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/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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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/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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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/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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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", 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/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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "compilation; computer programming; valid", } %% Page 280 is blank @Article{Nelson:1980:FDP, author = "Greg Nelson and Derek C. Oppen", title = "Fast Decision Procedures Based on Congruence Closure", journal = j-J-ACM, volume = "27", number = "2", pages = "356--364", 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 = "The notion of the congruence closure of a relation on a graph is defined and several algorithms for computing it are surveyed. A simple proof is given that the congruence closure algorithm provides a decision procedure for the quantifier-free theory of equality. A decision procedure is then given for the quantifier-free theory of LISP list structure based on the congruence closure algorithm. Both decision procedures determine the satisfiability of a conjunction of literals of length $n$ in average time $O(n \log n)$ using the fastest known congruence closure algorithm. It is also shown that if the axiomatization of the theory of list structure is changed slightly, the problem of determining the satisfiability of a conjunction of literals becomes NP-complete. The decision procedures have been implemented in the authors' simplifier for the Stanford Pascal Verifier.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{Ward:1980:STM, author = "Stephen A. Ward and Robert H. {Halstead, Jr.}", title = "A Syntactic Theory of Message Passing", journal = j-J-ACM, volume = "27", number = "2", pages = "365--383", 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 = "Recent developments by Hewitt and others have stimulated interest in message-passing constructs as an alternative to the more conventional applicative semantics on which most current languages are based. The present work illuminates the distinction between applicative and message-passing semantics by means of the $\mu$-calculus, a syntactic model of message-passing systems similar in mechanism to the $\lambda$-calculus. Algorithms for the translation of expressions from the $\lambda$ --- to the $\mu$-calculus are presented, and differences between the two approaches are discussed. Message-passing semantics seem particularly applicable to the study of multiprocessing. The $\mu$-calculus, through the mechanism of conduits, provides a simple model for a limited but interesting class of parallel computations. Multiprocessing capabilities of the $\mu$-calculus are illustrated, and multiple-processor implementations are discussed briefly.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems programming", } @Article{Abelson:1980:LBI, author = "Harold Abelson", title = "Lower Bounds on Information Transfer in Distributed Computations", journal = j-J-ACM, volume = "27", number = "2", pages = "384--392", month = apr, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:53:46 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Lower bounds on the interprocessor communication required for computing a differentiable real-valued function in a distributed network are derived. These bounds are independent of the network interconnection configuration, and they impose no assumptions other than differentiability constraints on the computations performed by individual processors. As a sample application, lower bounds on information transfer in the distributed computation of some typical matrix operations are exhibited.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Lichtenstein:1980:GPS, author = "David Lichtenstein and Michael Sipser", title = "{GO} is Polynomial-Space Hard", journal = j-J-ACM, volume = "27", number = "2", pages = "393--401", month = apr, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:19: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Parchmann:1980:CCS, author = "R. Parchmann", title = "Corrigendum: ``{Control} System Model for Critically Timed Sources''", journal = j-J-ACM, volume = "27", number = "2", pages = "402--402", month = apr, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Nov 19 23:27:05 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Parchmann:1979:CSM}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Oppen:1980:RAR, author = "Derek C. Oppen", title = "Reasoning About Recursively Defined Data Structures", journal = j-J-ACM, volume = "27", number = "3", pages = "403--411", month = jul, year = "1980", 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Altenkamp:1980:CUP, author = "Doris Altenkamp and Kurt Mehlhorn", title = "Codes: {Unequal} Probabilities, Unequal Letter Costs", journal = j-J-ACM, volume = "27", number = "3", pages = "412--427", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:22: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Graham:1980:IBW, author = "Ronald L. Graham and Andrew C. Yao and F. Frances Yao", title = "Information Bounds Are Weak in the Shortest Distance Problem", journal = j-J-ACM, volume = "27", number = "3", pages = "428--444", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:23: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Shiloach:1980:PSU, author = "Yossi Shiloach", title = "A Polynomial Solution in the Undirected Two Paths Problem", journal = j-J-ACM, volume = "27", number = "3", pages = "445--456", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:23: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Trivedi:1980:OSC, author = "Kishor S. Trivedi and Robert A. Wagner and Timothy M. Sigmon", title = "Optimal Selection of {CPU} Speed, Device Capacities, and File Assignments", journal = j-J-ACM, volume = "27", number = "3", pages = "457--473", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:24:31 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mendelson:1980:NAA, author = "Haim Mendelson and Uri Yechiali", title = "A New Approach to the Analysis of Linear Probing Schemes", journal = j-J-ACM, volume = "27", number = "3", pages = "474--483", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:27:19 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A new approach to the analysis of hash table performance is presented. This approach is based on a direct probabilistic analysis, where the underlying probabilities are derived by using the ballot theorem and its ramifications. The method is first applied to analyze the performance of the classical (cyclic) linear probing scheme, and the results are used to solve an optimal storage allocation problem. A scheme frequently used in practice where the table is linear rather than cyclic is then analyzed using the same methodology.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abramson:1980:CPG, author = "Fred G. Abramson and Yuri Breitbart and Forbes D. Lewis", title = "Complex Properties of Grammars", journal = j-J-ACM, volume = "27", number = "3", pages = "484--498", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:33: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Engelfriet:1980:FPL, author = "J. Engelfriet and G. Rozenberg", title = "Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages", journal = j-J-ACM, volume = "27", number = "3", pages = "499--518", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:33: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fayolle:1980:SPA, author = "G. Fayolle and I. Mitrani and R. Iasnogorodski", title = "Sharing a Processor Among Many Job Classes", journal = j-J-ACM, volume = "27", number = "3", pages = "519--532", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:42:15 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A single-server processor-sharing system with $M$ job classes is analyzed in the steady state. The scheduling strategy considered divides the total processor capacity in unequal fractions among the different job classes. More precisely, if there are $N_j$ jobs of class $j$ in the system, $j=1,2, \ldots{},M$, each class $k$ job receives a fraction $g_k/(\sum_{j=1}^M g_jN_j)$ of the processor capacity.\\ Earlier analyses of this system are shown to be incorrect and new expressions for the conditional expected response times $W_k(t)$ of class $k$ jobs with required service time $t$ are obtained (for general required service time distributions). These yield the asymptotic behavior of $W_k(t)$ at $t\rightarrow\infty$ and rather simple formulas in the exponential case. The unconditional average response times are also obtained.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", descriptors = "Processor sharing; priority; Laplace transform; characteristic function", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "discriminatory job classes; egalitarian; Fourier--Stieltjes transform; Laplace transform; operating systems scheduling priority; processor sharing; strategy", } @Article{Papadimitriou:1980:FSL, author = "Christos H. Papadimitriou and Paris C. Kanellakis", title = "Flowshop Scheduling with Limited Temporary Storage", journal = j-J-ACM, volume = "27", number = "3", pages = "533--549", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:43:02 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "scheduling database", } @Article{Sahni:1980:SIT, author = "Sartaj Sahni and Yookun Cho", title = "Scheduling Independent Tasks with Due Times on a Uniform Processor System", journal = j-J-ACM, volume = "27", number = "3", pages = "550--563", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:43:37 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1980.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", descriptors = "Process management; evaluation; independent tasks; preemptive scheduling; due time; complexity", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "operating real-time multiprocessor", } @Article{Ghezzi:1980:APS, author = "Carlo Ghezzi and Dino Mandrioli", title = "Augmenting Parsers to Support Incrementality", journal = j-J-ACM, volume = "27", number = "3", pages = "564--579", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:43:59 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "extensibility", } @Article{Sethi:1980:CCV, author = "Ravi Sethi and Adrian Tang", title = "Constructing Call-by-value Continuation Semantics", journal = j-J-ACM, volume = "27", number = "3", pages = "580--597", month = jul, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:44:37 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aronson:1980:NFD, author = "Alan R. Aronson and Barry E. Jacobs and Jack Minker", title = "A Note on Fuzzy Deduction", journal = j-J-ACM, volume = "27", number = "4", pages = "599--603", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:45:16 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lee:1980:TDV, author = "D. T. Lee", title = "Two-dimensional {Voronoi} diagrams in the {$L_p$}-metric", journal = j-J-ACM, volume = "27", number = "4", pages = "604--618", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/siggraph/80.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tsukiyama:1980:AEA, author = "S. Tsukiyama and I. Shirakawa and H. Ozaki and H. Ariyoshi", title = "An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset", journal = j-J-ACM, volume = "27", number = "4", pages = "619--632", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sagiv:1980:EAR, author = "Yehoshua Sagiv and Mihalis Yannakakis", title = "Equivalences Among Relational Expressions with the Union and Difference Operators", journal = j-J-ACM, volume = "27", number = "4", pages = "633--655", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:48:43 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "database query optimization", } @Article{Ehrenfeucht:1980:SEP, author = "A. Ehrenfeucht and G. Rozenberg", title = "The Sequence Equivalence Problem Is Decidable for {0S} Systems", journal = j-J-ACM, volume = "27", number = "4", pages = "656--663", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:49: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Maier:1980:MCR, author = "David Maier", title = "Minimum Covers in the Relational Database Model", journal = j-J-ACM, volume = "27", number = "4", pages = "664--674", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:50:11 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "database", } @Article{Greibach:1980:SPS, author = "S. A. Greibach and E. P. Friedman", title = "Superdeterministic {PDA}s: a Subclass with a Decidable Inclusion Problem", journal = j-J-ACM, volume = "27", number = "4", pages = "675--700", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:51: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Schwartz:1980:FPA, author = "J. T. Schwartz", title = "Fast Probabilistic Algorithms for Verification of Polynomial Identities", journal = j-J-ACM, volume = "27", number = "4", pages = "701--717", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:51: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fisher:1980:DLC, author = "Marshall L. Fisher and Dorit S. Hochbaum", title = "Database Location in Computer Networks", journal = j-J-ACM, volume = "27", number = "4", pages = "718--735", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:52:02 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ramakrishnan:1980:STC, author = "K. G. Ramakrishnan", title = "Solving Two-Commodity Transportation Problems with Coupling Constraints", journal = j-J-ACM, volume = "27", number = "4", pages = "736--757", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:52:29 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Downey:1980:VCS, author = "Peter J. Downey and Ravi Sethi and Robert Endre Tarjan", title = "Variations on the Common Subexpression Problem", journal = j-J-ACM, volume = "27", number = "4", pages = "758--771", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:52:49 1994", 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "optimization", } @Article{Raoult:1980:OSE, author = "Jean-Claude Raoult and Jean Vuillemin", title = "Operational and Semantic Equivalence Between Recursive Programs", journal = j-J-ACM, volume = "27", number = "4", pages = "772--796", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:53:16 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Huet:1980:CRA, author = "G\'erard Huet", title = "Confluent Reductions: {Abstract} Properties and Applications to Term Rewriting Systems", journal = j-J-ACM, volume = "27", number = "4", pages = "797--821", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/LF.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Preliminary version in {\em Proceedings}, 18th IEEE Symposium on Foundations of Computer Science, IEEE, 1977, pages 30--45", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "One of the best single papers in this area and a must for anyone working on rewriting. Is importance for theorem proving stems from the fact that the best known techniques for dealing with equational problems are based on rewriting.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "functional Church Rosser theorems", } @Article{JaJa:1980:CBF, author = "Joseph Ja'Ja'", title = "Computation of Bilinear Forms over Finite Fields", journal = j-J-ACM, volume = "27", number = "4", pages = "822--830", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:54: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ladner:1980:PPC, author = "Richard E. Ladner and Michael J. Fischer", title = "Parallel Prefix Computation", journal = j-J-ACM, volume = "27", number = "4", pages = "831--838", month = oct, year = "1980", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/322217.322232", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:55:08 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Par.Arch.Indep.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The prefix problem is to compute all the products $ x_1 * x_2 * \cdots * x_k $ for $ 1 \leq k \leq n $, where $*$ is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly $ \lceil \log n \rceil $ and size bounded by $ 4 n $ An application yields fast, small Boolean circuits to simulate finite-state transducers. By simulating a sequential adder, a Boolean circuit which has depth $ 2 \lceil \log_2 n \rceil + 2 $ and size bounded by $ 14 n $ is obtained for $n$-bit binary addition. The size can be decreased significantly by permitting the depth to increase by an additive constant.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } %% Page 298 is blank @Article{Reischuk:1980:IBP, author = "R{\"{u}}diger Reischuk", title = "Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game", journal = j-J-ACM, volume = "27", number = "4", pages = "839--849", month = oct, year = "1980", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 26 22:56: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Even:1981:LED, author = "Shimon Even and Yossi Shiloach", title = "An On-Line Edge-Deletion Problem", journal = j-J-ACM, volume = "28", number = "1", pages = "1--4", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Heaps.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Perl:1981:MMT, author = "Yehoshua Perl and Stephen R. Schach", title = "Max-Min Tree Partitioning", journal = j-J-ACM, volume = "28", number = "1", pages = "5--15", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:04: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rodeh:1981:LAD, author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even", title = "Linear Algorithm for Data Compression via String Matching", journal = j-J-ACM, volume = "28", number = "1", pages = "16--24", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:05:19 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bernstein:1981:USJ, author = "Philip A. Bernstein and Dah-Ming W. Chiu", title = "Using Semi-Joins to Solve Relational Queries", journal = j-J-ACM, volume = "28", number = "1", pages = "25--40", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:06:02 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lipski:1981:DII, author = "Witold {Lipski, Jr.}", title = "On Databases with Incomplete Information", journal = j-J-ACM, volume = "28", number = "1", pages = "41--70", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 15:18:35 1991", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/incomplete.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Semantic and logical problems arising in an incomplete information database are investigated. A simple query language is described, and its semantics, which refers the queries to the information about reality contained in a database, rather than to reality itself, is defined. This approach, called the internal interpretation, is shown to lead in a natural way to the notions of a topological Boolean algebra and a model logic related to S4 in the same way as referring queries directly to reality (external interpretation) leads to Boolean algebras and classical logic. An axiom system is given for equivalent (with respect to the internal interpretation) transformation of queries, which is then exploited as a basic tool in a method for computing the internal interpretation for a broad class of queries. An interesting special case of the problem of determining the internal interpretation amounts to deciding whether an assertion about reality (a ``yes-no'' query) is consistent with the incomplete information about reality contained in a database. A solution to this problem, which relies on the classical combinatorial problem of distinct representatives of subset, is given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "database; implicit information; incomplete information; modal logic; null values; query language semantics; relational model", } @Article{Wasilkowski:1981:ECM, author = "G. W. Wasilkowski", title = "$n$-Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations", journal = j-J-ACM, volume = "28", number = "1", pages = "71--80", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:07: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Achugbue:1981:BSI, author = "James O. Achugbue and Francis Y. Chin", title = "Bounds on Schedules for Independent Tasks with Similar Execution Times", journal = j-J-ACM, volume = "28", number = "1", pages = "81--99", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:07: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bruno:1981:STE, author = "J. Bruno and P. Downey and G. N. Frederickson", title = "Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan", journal = j-J-ACM, volume = "28", number = "1", pages = "100--113", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chandra:1981:A, author = "Ashok K. Chandra and Dexter C. Kozen and Larry J. Stockmeyer", title = "Alternation", journal = j-J-ACM, volume = "28", number = "1", pages = "114--133", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:09:34 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "alternation; complexity", } @Article{Galil:1981:SMR, author = "Z. Galil", title = "String Matching in Real Time", journal = j-J-ACM, volume = "28", number = "1", pages = "134--149", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:10:20 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A sufficient condition for an on-line algorithm to be transformed into a real-time algorithm is given. This condition is used to construct real-time algorithms for various string-matching problems by random access machines and by Turing machines.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kirkpatrick:1981:ULB, author = "David G. Kirkpatrick", title = "A Unified Lower Bound for Selection and Set Partitioning Problems", journal = j-J-ACM, volume = "28", number = "1", pages = "150--165", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:11: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Leong:1981:NRT, author = "Benton L. Leong and Joel I. Seiferas", title = "New Real-Time Simulations of Multihead Tape Units", journal = j-J-ACM, volume = "28", number = "1", pages = "166--180", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:12: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rowland:1981:UTP, author = "John H. Rowland and Philip J. Davis", title = "On the Use of Transcendentals for Program Testing", journal = j-J-ACM, volume = "28", number = "1", pages = "181--190", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 09 01:43: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andrews:1981:TPM, author = "Peter B. Andrews", title = "Theorem Proving by Matings", journal = j-J-ACM, volume = "28", number = "2", pages = "193--214", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:14: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "automatic theorem proving; matings", } @Article{Mateti:1981:DPC, author = "Prabhaker Mateti", title = "A Decision Procedure for the Correctness of a Class of Programs", journal = j-J-ACM, volume = "28", number = "2", pages = "215--222", month = apr, year = "1981", CODEN = "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 = "Verification of certain properties of a class of programs is considered. The programs are written in a miniprogramming language that has variables of only two data types: a linear array of elements, and pointers to these elements. The array elements can only be exchanged; pointers can only be incremented or decremented by one. Program properties to be verified are expressed in a severely restricted assertion language which contains essentially Boolean expressions of comparisons among pointers and among array elements. Several in-place sorting algorithms can be readily written and asserted in these languages. A decision procedure for the truthhood of the verification conditions generated for the above class of asserted programs is presented. An algorithm for generating counterexamples for false verification conditions is also given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{Peterson:1981:CSR, author = "Gerald E. Peterson and Mark E. Stickel", title = "Complete Sets of Reductions for Some Equational Theories", journal = j-J-ACM, volume = "28", number = "2", pages = "223--264", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:15:27 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chu:1981:NME, author = "C. K. Chu", title = "A Note on Multiple Error Detection in {ASCII} Numeric Data Communication", journal = j-J-ACM, volume = "28", number = "2", pages = "265--269", month = apr, year = "1981", CODEN = "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 = "Numeric data communication generally calls upon a check sum to detect single transmission errors. Multiple errors, which cannot be detected by simple check sums alone, necessitate additional check symbol(s). A check scheme is defined to consist of a (simple) check sum and a (positional) check product. A ``perfect'' $p$-error check scheme is a check scheme that detects all combinations of $p$ or fewer errors in a logical record of length $n$. It is shown that a check scheme, as specified by the modulo factor mod $m$, is a ``perfect'' double-error check scheme when $m$ is a prime number that is greater than or equal to the maximum of $n$ and 11.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Although this paper makes no reference to the International Standard Book Number checksum process, first adopted in 1972, the positional check product in the paper is exactly that used for ISBNs. This suggests that the ISBN checksum choice was not accidental, and that there is likely earlier literature that justifies the choice. Nevertheless, it is gratifying to find a proof that the ISBN checksum scheme can detect all single- and double-digit errors, though not all triple-digit errors (a counterexample is exhibited in the paper).", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data transmission", } @Article{Trivedi:1981:ODL, author = "Kishor S. Trivedi and Timothy M. Sigmon", title = "Optimal Design of Linear Storage Hierarchies", journal = j-J-ACM, volume = "28", number = "2", pages = "270--288", month = apr, year = "1981", CODEN = "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 = "The performance-oriented design of linear storage hierarchies which are operating in multi-programming environments is considered. An optimization model is superimposed upon an experimental queuing network model of the hierarchy, yielding a problem whose objective is to maximize throughput subject to a cost constraint. The decision variables are the speeds and capacities of the various memory levels. It is shown that any local optimum is needed a globally optimal solution to the problem. Several special cases of and extensions to the basic problem are discussed, and some examples are given to illustrate the usefulness and computational tractability of the problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Gonnet:1981:ELL, author = "Gaston H. Gonnet", title = "Expected Length of the Longest Probe Sequence in Hash Code Searching", journal = j-J-ACM, volume = "28", number = "2", pages = "289--304", month = apr, year = "1981", CODEN = "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 = "An investigation is made of the expected value of the maximum number of accesses needed to locate any element in a hashing file under various collision resolution schemes. This differs from usual worst-case considerations which, for hashing, would be the largest sequence of accesses for the worst possible file. Asymptotic expressions of these expected values are found for full and partly full tables. Results are given for the open addressing scheme with a clustering-free model and the open addressing scheme which reorders the insertions to minimize the worst case. The results show that for these schemes, the actual behavior of the worst case in hash tables is quite good on the average.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data processing", } @Article{Karr:1981:SFT, author = "Michael Karr", title = "Summation in Finite Terms", journal = j-J-ACM, volume = "28", number = "2", pages = "305--350", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:27:45 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Comp.Alg.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Feldman:1981:MBF, author = "R. M. Feldman and G. W. Adkins and G. L. Curry and U. W. Pooch", title = "Measurement Bias in Feedback Queues", journal = j-J-ACM, volume = "28", number = "2", pages = "351--357", month = apr, year = "1981", CODEN = "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/1981.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A classical method of measuring the number of jobs in a time-shared computer system is to collect statistics at the epochs of quantum completions. A computer system utilizing round-robin quantum allocations is modeled as a feedback queue with Poisson arrivals and exponential service times, and the bias in the statistic taken at the quantum completions is quantified. The difference between this statistic and the true time-average system size is given for such a system including quanta and overhead.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A classical method of measuring the number of jobs in a time-shared computer system is to collect statistics at the epochs of quantum completions. A computer system utilizing round-robin quantum allocations is modeled as a feedback queue with poisson arrivals and exponential service times, and the bias in the statistic taken at the quantum completions is quantified. The difference between this statistic and the true time-average system size is given for such a system including quanta and overhead.", classification = "722; 723; 922", descriptors = "feedback; queue length; round robin; overhead time; priority", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; probability --- Queueing Theory", } @Article{Sevcik:1981:DQN, author = "K. C. Sevcik and I. Mitrani", title = "The Distribution of Queuing Network States at Input and Output Instants", journal = j-J-ACM, volume = "28", number = "2", pages = "358--371", month = apr, year = "1981", CODEN = "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/1981.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Queuing networks are studied at selected points in the steady state, namely, at the moments when jobs of a given class arrive into a given node and at the moments when jobs of a given class leave a given node. For a large class of networks having product-form equilibrium distributions it is shown that (a) if the given job class belongs to an open subchain, the state distributions at input points, output points, and random points are identical, and (b) if the job class belongs to a closed subchain, the distribution at input and output points is the same as the steady-state distribution of a network with one less job in that subchain.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "\ldots{} For a large class of networks having product-form equilibrium distributions it is shown that (a) if the given job class belongs to an open subchain, the state distributions at input points, output points, and random points are identical, and (b) if the job class belongs to a closed subchain, the distribution at input and output points is the same as the steady-state distribution of a network with one less job in that subchain.", classification = "922", descriptors = "Queueing network; waiting time; product form; network; queueing theory", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "probability", } @Article{Hogger:1981:DLP, author = "C. J. Hogger", title = "Derivation of Logic Programs", journal = j-J-ACM, volume = "28", number = "2", pages = "372--392", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:30: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rem:1981:CSP, author = "Martin Rem", title = "The Closure Statement: a Programming Language Construct Allowing Ultraconcurrent Execution", journal = j-J-ACM, volume = "28", number = "2", pages = "393--410", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:31: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lieberherr:1981:CPS, author = "K. J. Lieberherr and E. Specker", title = "Complexity of Partial Satisfaction", journal = j-J-ACM, volume = "28", number = "2", pages = "411--421", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:32: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stickel:1981:UAA, author = "Mark E. Stickel", title = "A Unification Algorithm for Associative-Commutative Functions", journal = j-J-ACM, volume = "28", number = "2", pages = "423--434", month = apr, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:33:21 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Logic", } @Article{Sagiv:1981:EBR, author = "Yehoshua Sagiv and Claude Delobel and D. Stott {Parker, Jr.} and Ronald Fagin", title = "An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic", journal = j-J-ACM, volume = "28", number = "3", pages = "435--453", month = jul, year = "1981", CODEN = "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{Sagiv:1987:CEB}.", abstract = "It is known that there is an equivalence between functional dependencies in a relational database and a certain fragment of propositional logic. This equivalence is extended to include both functional and multivalued dependencies. Thus, for each dependency there is a corresponding statement in propositional logic. It is then shown that a dependency (functional or multivalued) is a consequence of a set of dependencies if and only if the corresponding propositional statement is a consequence of the corresponding set of propositional statements. Examples are given to show that these techniques are valuable in providing much shorter proofs of theorems about dependencies than have been obtained by more traditional means. It is shown that this equivalence cannot be extended to include either join dependencies or embedded multivalued dependencies.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Dobkin:1981:OTM, author = "David Dobkin and J. Ian Munro", title = "Optimal Time Minimal Space Selection Algorithms", journal = j-J-ACM, volume = "28", number = "3", pages = "454--461", month = jul, year = "1981", CODEN = "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 = "Algorithms for finding medians and solving arbitrary selection problems using a minimum number of data storage locations are investigated. A linear-time algorithm is given in the first case, and it is shown that no such scheme exists for many other interesting selection problems, such as finding a quartile. A tight trade-off is demonstrated balancing extra space versus time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{Chin:1981:MMF, author = "Francis Y. Chin and Long Lieh Tsai", title = "On {$J$}-Maximal and {$J$}-Minimal Flow-Shop Schedules", journal = j-J-ACM, volume = "28", number = "3", pages = "462--476", month = jul, year = "1981", CODEN = "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 = "Scheduling problems are considered for a common kind of flow shop where the execution time for certain tasks in each job is always longer or shorter than that for the other tasks. NP-completeness is shown for some cases, simple optimal algorithms are found for the others, and bounds are given for the worst cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "operations research", } @Article{Kleinrock:1981:OSA, author = "Leonard Kleinrock and Arne Nilsson", title = "On Optimal Scheduling Algorithms for Time-Shared Systems", journal = j-J-ACM, volume = "28", number = "3", pages = "477--486", month = jul, year = "1981", CODEN = "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/1981.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The problem of finding those optimum scheduling algorithms for time-shared systems that minimize a cost function that depends on waiting time and required service time is considered. An optimality condition which sometimes leads to infeasible algorithms is established. The procedure is improved upon by use of a mathematical programming technique but still does not always generate feasible algorithms. These results are used as upper bounds on the performance of known feasible algorithms so that it is possible to evaluate how close to optimal the present algorithms come.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", descriptors = "time sharing; feedback; process management; queueing discipline; optimization; upper bound", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Samet:1981:CCL, author = "Hanan Samet", title = "Connected Component Labeling Using Quadtrees", journal = j-J-ACM, volume = "28", number = "3", pages = "487--501", month = jul, year = "1981", CODEN = "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/81.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An algorithm is presented for labeling the connected components of an image represented by a quadtree. The algorithm proceeds by exploring all possible adjacencies for each node once and only once. As soon as this is done, any equivalences generated by the adjacency labeling phase are propagated. Analysis of the algorithm reveals that its average execution time is of the order ($W$ plus $B \times \log B$) where $B$ and $W$ correspond to the number of blocks comprising the foreground and background, respectively, of the image. These results are relevant to image processing and pattern recognition.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "image processing; pattern recognition systems", } @Article{Kumar:1981:PAB, author = "Sarangan Krishna Kumar and Melvin A. Breuer", title = "Probabilistic Aspects of {Boolean} Switching Functions via a New Transform", journal = j-J-ACM, volume = "28", number = "3", pages = "502--520", month = jul, year = "1981", CODEN = "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 is introduced for computing the probability expression, F equals Pr(f equals 1), that a Boolean function $f$ equals $1$ as a function of the probabilities that its inputs equal 1. It is shown that this expression is uniquely characterized by a spectrum vector $S$. A new matrix $P$ which has the property that $S = AP$, where $A$ is the minterm vector of the function $f$, is then introduced. Next, $S$ is related to the Reed--Muller canonic (RMC) form of the function $f$, and it is shown that the RMC coefficient vector $a$ can be obtained trivially from the vector $S$. The reverse transformation is computationally harder. It is also shown how $S$ and $P$ can be used to compute the Walsh coefficients of $f$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; switching theory --- Switching Functions", } @Article{Brent:1981:ATC, author = "R. P. Brent and H. T. Kung", title = "The Area-Time Complexity of Binary Multiplication", journal = j-J-ACM, volume = "28", number = "3", pages = "521--534", month = jul, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:44:35 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See also \cite{Brent:1982:CAT}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gurari:1981:CEP, author = "Eitan M. Gurari and Oscar H. Ibarra", title = "The Complexity of the Equivalence Problem for Simple Programs", journal = j-J-ACM, volume = "28", number = "3", pages = "535--560", month = jul, year = "1981", CODEN = "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 complexity of the equivalence problem for several simple programming languages is investigated. In particular, it is shown that a class of programs, called XL, has an NP-complete inequivalence problem; hence its equivalence problem is decidable in deterministic time $2^{p(N)}$, where $p(N)$ is a polynomial in the sum of the sizes of the programs. This bound is a four-level exponential improvement over a previously known result. A very simple subset of XL, called SL, is also considered, and it is shown that every XL-program is polynomial-time reducible to an equivalent SL-program. Moreover, SL is minimal in the sense that all its instructions are independent. On the other hand, XL is maximal in that a ``slight'' generalization yields a language with an undecidable equivalence problem. XL-programs realize precisely the relations (functions) definable by Presburger formulas.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages", } @Article{Mayr:1981:CFC, author = "Ernst W. Mayr and Albert R. Meyer", title = "The Complexity of the Finite Containment Problem for {Petri} Nets", journal = j-J-ACM, volume = "28", number = "3", pages = "561--576", month = jul, year = "1981", 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tarjan:1981:UAP, author = "Robert Endre Tarjan", title = "A Unified Approach to Path Problems", journal = j-J-ACM, volume = "28", number = "3", pages = "577--593", month = jul, year = "1981", CODEN = "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 = "A general method is described for solving path problems on directed graphs. Such path problems include finding shortest paths, solving sparse systems of linear equations, and carrying out global flow analysis of computer programs. The method consists of two steps. First, a collection of regular expressions representing sets of paths in the graph is constructed. This can be done by using any standard algorithm, such as Gaussian or Gauss--Jordan elimination. Next, a natural mapping from regular expressions into the given problem domain is applied. The mappings required to find shortest paths are exhibited, sparse systems of linear equations are solved, and global flow analysis is carried out. The results provide a general-purpose algorithm for solving any path problem and show that the problem of constructing path expressions is in some sense the most general path problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques", } @Article{Tarjan:1981:FAS, author = "Robert Endre Tarjan", title = "Fast Algorithms for Solving Path Problems", journal = j-J-ACM, volume = "28", number = "3", pages = "594--614", month = jul, year = "1981", CODEN = "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 = "Let $G = (V, E)$ be a directed graph with a distinguished source vertex $s$. The single-source path expression problem is to find, for each vertex $v$, a regular expression $P(s,v)$ which represents the set of all paths in $G$ from $s$ to $v$. A solution to this problem can be used to solve shortest path problems, solve sparse systems of linear equations, and carry out global flow analysis. A method is described for computing path expressions by dividing $G$ into components, computing path expressions on the components by Gaussian elimination, and combining the solutions. This method requires $O(m \alpha (m, n))$ time on a reducible flow graph, where $n$ is the number of vertices in $G$, $m$ is the number of edges in $G$, and $\alpha$ is a functional inverse of Ackermann's function. The method makes use of an algorithm for evaluating functions defined on paths in trees. A simplified version of the algorithm, which runs in $O(m \log n)$ time on reducible flow graphs, is quite easy to implement and efficient in practice.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques --- Graph Theory", } @Article{Yao:1981:STS, author = "Andrew Chi Chih Yao", title = "Should Tables Be Sorted?", journal = j-J-ACM, volume = "28", number = "3", pages = "615--628", month = jul, year = "1981", CODEN = "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 = "Optimality questions are examined in the following information retrieval problem: Given a set $S$ of $n$ keys, store them so that queries of the form, ``Is $x$ an element of $S$?'' can be answered quickly. In a rather general model including all the commonly used schemes, the number probes to the table needed in the worst case is determined, for sufficiently large key space. The effects of smaller key space and arbitrary encoding are also explored.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "information science", } @Article{Reiser:1981:CMV, author = "M. Reiser and S. S. Lavenberg", title = "Corrigendum: ``{Mean-Value} Analysis of Closed Multichain Queuing Networks''", journal = j-J-ACM, volume = "28", number = "3", pages = "629--629", month = jul, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Nov 19 23:27:07 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Reiser:1980:MVA}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bibel:1981:MC, author = "Wolfgang Bibel", title = "On Matrices with Connections", journal = j-J-ACM, volume = "28", number = "4", pages = "633--645", month = oct, year = "1981", CODEN = "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 = "Theorem proving is considered as the problem of verifying that each path through a matrix consisting of a set of clauses can be made complementary. By introducing connections to such a matrix the following three results are derived from that conceptual basis. First, a simple and short proof for the consistency and completeness of the connection graph procedure is given. Second, a macrosimplification rule for the preparatory step of any ATP-method is defined which, like the deletion or subsumption rules, properly reduces a given matrix whenever it applies. It can be regarded as a generalization to arbitrary clauses of the well-known fact that sets of two-literal clauses can be decided quickly. Finally, in view of the relation between resolution-based and natural-deduction-based methods, a constructive transformation is specified which explicitly relates each resolution step to a pair of complementary literals in an axiom of a natural deduction, and vice versa. Although the treatment is restricted to the ground case, it is obvious that all results can be easily lifted to the general case in the usual way.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "systems science and cybernetics", } @Article{Loveland:1981:DRG, author = "D. W. Loveland and C. R. Reddy", title = "Deleting Repeated Goals in the Problem Reduction Format", journal = j-J-ACM, volume = "28", number = "4", pages = "646--661", month = oct, year = "1981", CODEN = "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 = "Although the classical problem reduction format for organizing automatic proof search is incomplete, a complete extension of the format is known. Elimination of identical descendent subgoals is a well-known deletion rule for the classical format but is not obviously valid in the extended format. Because of its intuitive appeal and ease of application, one would wish to know that the rule is safe to use in the extended format. It is shown here that the deletion rule is indeed safe. The result appears to be decidedly nontrivial.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "systems science and cybernetics", } @Article{Latouche:1981:AAM, author = "Guy Latouche", title = "Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System", journal = j-J-ACM, volume = "28", number = "4", pages = "662--679", month = oct, year = "1981", CODEN = "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/1981.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A computer system consisting of several identical CPU'S and several identical I/O units is described. The system works under light load conditions in a multiprogramming mode. Programs belong either to an incoming queue, which may be empty, or to an inner loop if they are allowed access to the resources of the system. The maximum number of programs in the inner loop is finite.\\ Under Markovian assumptions it is shown that the steady-state probability distribution is of matrix-geometric form. The stability condition is explicitly given. For stable systems it is shown how the stationary probability distribution, the virtual waiting time in the incoming queue, and other features of interest may be computed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", descriptors = "Model; multiprocessor system; multiprogramming; Queueing network; steady state probability; matrix geometric method", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems programming --- Multiprogramming; computer systems, digital", } @Article{Maier:1981:CTI, author = "David Maier and Yehoshua Sagiv and Mihalis Yannakakis", title = "On the Complexity of Testing Implications of Functional and Join Dependencies", journal = j-J-ACM, volume = "28", number = "4", pages = "680--695", month = oct, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:14:47 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is shown that testing whether a dependency $\sigma$ is implied by a set $\Sigma$ of functional and join dependencies is NP-hard if $\sigma$ is a join dependency, but it requires only $O(|U| \parallel \Sigma \parallel)$ time if $\sigma$ is either a functional or a multivalued dependency $|U|$ is the number of elements in the set of all the attributes $U$, and $\parallel \Sigma \parallel$ is the space required to write down $\Sigma$. It is also shown that the problem of deciding whether a JD-rule can be applied to a tableau $T$ and the problem of testing whether a relation tau does not obey a join dependency are NP-complete. Finally, it is proved that there is no universal constant $n$ such that for every set of multivalued dependencies $\Sigma$ and a join dependency $\sigma$ that is not implied by $\Sigma$, there is a relation with no more than $n$ tuples in which $\Sigma$ holds but $\sigma$ fails.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems; relational databases", } @Article{Fredman:1981:LBC, author = "Michael L. Fredman", title = "A Lower Bound on the Complexity of Orthogonal Range Queries", journal = j-J-ACM, volume = "28", number = "4", pages = "696--705", month = oct, year = "1981", CODEN = "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/81.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $S$ be an arbitrary commutative semigroup (set of elements closed under a commutative and associative addition operation, plus). Given a set of records with $d$-dimensional key vectors over an ordered key space, such that each record has associated with it a value in $S$, an orthogonal range query is a request for the sum of the values associated with each record in some specified hypercube (cross product of intervals). Data structures which accommodate insertions and deletions of records and orthogonal range queries, such that an arbitrary sequence of $n$ such operations takes time $O(n(\log N)^d)$, have been presented by G. Lueker and D. Willard. It is shown here that $\Omega (n(\log n)^d)$ is a lower bound on the inherent worst case time required to process a sequence of $n$ intermixed insertions, deletions, and range queries, which implies that the Lueker and Willard data structures are in some sense optimal.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Subroutines; data processing", } @Article{Ehrenfeucht:1981:MRC, author = "A. Ehrenfeucht and G. Rozenberg and K. Ruohonen", title = "A Morphic Representation of Complements of Recursively Enumerable Sets", journal = j-J-ACM, volume = "28", number = "4", pages = "706--714", month = oct, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:14:53 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "After extending two word morphisms $f$ and $g$ to languages, an equation $f(X) = g(X)$ can be written and its language solutions investigated. An elementary characterization of the family of all solutions of the equation is given, and it used to investigate the maximal solution which is the main subject of this paper. It turns out that going through all propagating morphisms $f$ and $g$, the family of maximal solutions obtained equals the family of complements of recursively enumerable languages after intersecting with regular languages and mapping with propagating morphisms. In the general case (of arbitrary morphisms $f$ and $g$) the corresponding family is larger and includes the full-AFL closure of the family of complements of recursively enumerable languages.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Jazayeri:1981:SCS, author = "Mehdi Jazayeri", title = "A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars", journal = j-J-ACM, volume = "28", number = "4", pages = "715--720", month = oct, year = "1981", CODEN = "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", note = "See also \cite{Dill:1989:CES}.", abstract = "The recognition problem for alternating Turing machines is reduced to the circularity problem for attribute grammars, and thus an inherently exponential lower bound for the complexity of the circularity problem is derived. Although the result is already known, the use of alternation allows a simpler construction.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "alternating Turing machines; attribute grammars; automata theory; circularity problem; computational complexity; exponential time", note2 = "A \'et\'e prouv\'e faux\ldots{} (mj)", } @Article{Davis:1981:AST, author = "Ernest Davis and Jeffrey M. Jaffe", title = "Algorithms for Scheduling Tasks on Unrelated Processors", journal = j-J-ACM, volume = "28", number = "4", pages = "721--736", month = oct, year = "1981", CODEN = "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 algorithms are presented for the nonpreemptive assignment of $n$ independent tasks to $m$ unrelated processors. One algorithm requires polynomial time in $n$ and $m$ and is at most $2m$ one-half times worse than optimal in the worst case. This is the best polynomial-time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in $n$ but exponential time in $m$. This is the best algorithm known that requires time $O(n \log n)$ for every fixed value of $m$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 912; 913", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Subroutines; computer systems, digital; operations research", } @Article{Gnesi:1981:DPG, author = "Stefania Gnesi and Ugo Montanari and Alberto Martelli", title = "Dynamic Programming as Graph Searching: {An} Algebraic Approach", journal = j-J-ACM, volume = "28", number = "4", pages = "737--751", month = oct, year = "1981", CODEN = "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 = "Finding the solution of a dynamic programming problem in the form of polyadic functional equations is shown to be equivalent to searching a minimal cost path in an AND\slash OR graph with monotone cost functions. The proof is given in an algebraic framework and is based on a commutativity result between solution and interpretation of a symbolic system. This approach is similar to the one used by some authors to prove the equivalence between the operational and denotational semantics of programming languages.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical programming, dynamic", } @Article{Katoh:1981:ABS, author = "N. Katoh and T. Ibaraki and H. Mine", title = "An Algorithm for the ${K}$ Best Solutions of the Resource Allocation Problem", journal = j-J-ACM, volume = "28", number = "4", pages = "752--764", month = oct, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:54:08 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An algorithm is presented for obtaining the K best solutions of the resource allocation problem with an objective function which is the sum of convex functions of one variable. It requires $O(T* + K\log K + K(n \log n))^{1/2}$ time and $O(K(n \log n)^{1/2} + n)$ space, where $n$ is the number of variables and $T*$ is the computational time to obtain the best solution.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Subroutines; operations research", } @Article{Papadimitriou:1981:CIP, author = "Christos H. Papadimitriou", title = "On the Complexity of Integer Programming", journal = j-J-ACM, volume = "28", number = "4", pages = "765--768", month = oct, year = "1981", CODEN = "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 proof that integer programming is in NP is given. The proof also establishes that there is a pseudopolynomial-time algorithm for integer programming with any (fixed) number of constraints.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "integer programming; mathematical programming", } @Article{Shostak:1981:DLI, author = "Robert Shostak", title = "Deciding Linear Inequalities by Computing Loop Residues", journal = j-J-ACM, volume = "28", number = "4", pages = "769--779", month = oct, year = "1981", CODEN = "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 = "V. R. Pratt has shown that the real and integer feasibility of sets of linear inequalities of the form $x \leq 20 \leq y + c$ can be decided quickly by examining the loops in certain graphs. Pratt's method is generalized, first to real feasibility of inequalities in two variables and arbitrary coefficients, and ultimately to real feasibility of arbitrary sets of linear inequalities. The method is well suited to applications in program verification.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; program verification", } @Article{Yao:1981:LBF, author = "Andrew Chi-Chih Yao", title = "A Lower Bound to Finding Convex Hulls", journal = j-J-ACM, volume = "28", number = "4", pages = "780--787", month = oct, year = "1981", CODEN = "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/81.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Given a set $S$ of $n$ distinct points, the convex hull problem is to determine the vertices of the convex hull H(S). All the known algorithms for solving this problem have a worst case running time of $cn \log n$ or higher and employ only quadratic tests, that is, tests of the form $f(x_0, y_0, x_1, y_1, \ldots{}, x_{n- 1}, y_{n-1}):O$, where $f$ is any polynomial of degree not exceeding $2$. It is shown here that any algorithm in the quadratic decision-tree model must make $cn \log n$ tests for some input.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory", } @Article{Ernst:1982:MDC, author = "George W. Ernst and Michael M. Goldstein", title = "Mechanical Discovery of Classes of Problem-Solving Strategies", journal = j-J-ACM, volume = "29", number = "1", pages = "1--23", month = jan, year = "1982", CODEN = "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/Learning.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is assumed that a problem-solving method has an applicability condition which specifies the properties of ``good'' problem-dependent parameters for the method. Such a condition is used as the basis of a computer program that mechanically generates good parameters for the method to use in solving the problem. Such problem-dependent parameters for a method constitute a problem-solving strategy. To show the feasibility of this approach, it is used on two different methods: the GPS method for solving problems and the Nim-like method for playing games.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; systems science and cybernetics", } @Article{Freuder:1982:SCB, author = "Eugene C. Freuder", title = "A Sufficient Condition of Backtrack-Free Search", journal = j-J-ACM, volume = "29", number = "1", pages = "24--32", month = jan, year = "1982", CODEN = "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/Reverse.eng.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A constraint satisfaction problem involves finding values for a set of variables subject to a set of constraints (relations) on those variables. Backtrack search is often used to solve such problems. A relationship involving the structure of the constraints is described which characterizes to some degree the extreme case of minimum backtracking (none). The relationship involves a concept called ``width,'' which may provide some guidance in the representation of constraint satisfaction problems and the order in which they are searched. The width concept is studied and applied, in particular, to constraints which form tree structures.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "graph coloring related algorithms; systems science and cybernetics", } @Article{McDermott:1982:NLI, author = "Drew McDermott", title = "Nonmonotonic Logic {II}: {Nonmonotonic} Modal Theories", journal = j-J-ACM, volume = "29", number = "1", pages = "33--57", month = jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Oct 24 23:50:43 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "prolog", } @Article{Becker:1982:SAM, author = "Ronald I. Becker and Stephen R. Schach and Yehoshua Perl", title = "A Shifting Algorithm for Min-Max Tree Partitioning", journal = j-J-ACM, volume = "29", number = "1", pages = "58--67", month = jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:54:15 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The problem of finding a min-max partition of a weighted tree $T$ with $n$ vertices into $q$ subtrees by means of $k = q -1 1$ cuts is considered. A top-down shifting algorithm for this problem is presented. An outline is given of an efficient implementation of the algorithm with complexity $O(k^3rd(T) + kn)$, where $rd(T)$ is the number of edges in the radius of $T$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques --- Trees; min-max tree partitioning; shifting algorithm", } @Article{Hoffmann:1982:PMT, author = "Christoph M. Hoffmann and Michael J. O'Donnell", title = "Pattern Matching in Trees", journal = j-J-ACM, volume = "29", number = "1", pages = "68--95", month = jan, year = "1982", CODEN = "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/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Five new techniques for tree pattern matching are presented, analyzed for time and space complexity, and compared with previously known methods. Particularly important are applications where the same patterns are matched against many subjects and where a subject may be modified incrementally. Therefore, methods which spend some time preprocessing patterns in order to improve the actual matching time are included.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; functional; mathematical techniques --- Trees; pattern matching", } @Article{Galil:1982:ALT, author = "Zvi Galil", title = "An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database", journal = j-J-ACM, volume = "29", number = "1", pages = "96--102", month = jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Oct 24 23:52: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sagiv:1982:SDC, author = "Yehoshua Sagiv and Scott F. Walecka", title = "Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies", journal = j-J-ACM, volume = "29", number = "1", pages = "103--117", month = jan, year = "1982", CODEN = "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/handbook.prob.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is shown that embedded multivalued dependencies do not have a complete axiomatization. A new type of dependencies, called subset dependencies, is introduced. Subset dependencies are a generalization of embedded multivalued dependencies. It is shown that a subclass of subset dependencies (that does not include all the embedded multivalued dependencies) has a complete axiomatization consisting of reflexivity and transitivity rules. As a result, it is shown how to test implications of embedded multivalued dependencies under some restricted conditions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Maurer:1982:DHG, author = "H. A. Maurer and A. Salomaa and D. Wood", title = "Dense Hierarchies of Grammatical Families", journal = j-J-ACM, volume = "29", number = "1", pages = "118--126", month = jan, year = "1982", CODEN = "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 technique is presented for constructing dense hierarchies of grammatical subfamilies of context-free languages. The question of ``where'' such dense hierarchies may lie is also investigated. Infinite hierarchies of successors are studied. The major open problems concern questions dealing with finite grammar forms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Chow:1982:CFQ, author = "D. Chow and C. T. Yu", title = "On the Construction of Feedback Queries", journal = j-J-ACM, volume = "29", number = "1", pages = "127--151", month = jan, year = "1982", CODEN = "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/bibdb.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Optimal feedback queries in information retrieval systems are constructed. An optimal retrieval rule is derived using the Neyman--Pearson decision rule. Three probabilistic models and the optimal queries to be used in the models are presented. Parameters which are required to construct these queries are estimated on the basis of relevance information from the user about the retrieved documents. Finally, the effects on retrieval performance of deleting a term from the optimal query in one of the three models are analyzed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 901", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "feedback queries; information science", } @Article{Yu:1982:TWI, author = "C. T. Yu and K. Lam and G. Salton", title = "Term Weighting in Information Retrieval Using the Term Precision Model", journal = j-J-ACM, volume = "29", number = "1", pages = "152--170", month = jan, year = "1982", CODEN = "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/bibdb.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is known that the use of weighted, as opposed to binary, content identifiers attached to the records of an information file improves the effectiveness of the retrieval operations. Under well-defined conditions the term precision offers the best possible term weighting system. A mathematical model is used in the present study to relate the term precision weights to the frequency of occurrence of the terms in a given document collection and to the number of relevant documents a user wishes to retrieve in response to a query. This provides for the assignment of user-dependent weights to the content identifiers and relates the term precision weights to other well-known term weighting systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A mathematical model is used to relate the term precision weights to the frequency of occurrence of the terms in a given document collection and to the number of relevant documents a user wishes to retrieve in response to a query.", classification = "723; 901", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "information science", notes = "H.3.1.RM.PR and", } @Article{Book:1982:COT, author = "Ronald V. Book", title = "Confluent and Other Types of {Thue} Systems", journal = j-J-ACM, volume = "29", number = "1", pages = "171--182", month = jan, year = "1982", CODEN = "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 = "Confluent and other types of finite Thue systems are studied. Sufficient conditions are developed for every congruence class and every finite union of congruence classes defined by such a system to be a deterministic context-free language. It is shown that the word problem for Church--Rosser systems is decidable in linear time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Burns:1982:DRI, author = "James E. Burns and Paul Jackson and Nancy A. Lynch and Michael J. Fischer and Gary L. Peterson", title = "Data Requirements for Implementation of ${N}$-Process Mutual Exclusion Using a Single Shared Variable", journal = j-J-ACM, volume = "29", number = "1", pages = "183--205", month = jan, year = "1982", CODEN = "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 analysis is made of the shared memory requirements for implementing mutual exclusion of $N$ asynchronous parallel processes in a model where the only primitive communication mechanism is a general test-and-set operation on a single shared variable. While two variable values suffice to implement simple mutual exclusion without deadlock, it is shown that any solution which avoids possible lockout of processes requires at least $(2 N)^{1/2} + 1/2$ values. A technical restriction on the model increases this requirement to $N / 2$ values, while achieving a fixed bound on waiting further increases the requirement to $N + 1$ values. These bounds are shown to be nearly optimal.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer systems, digital --- Parallel Processing", } @Article{Ehrich:1982:TSI, author = "H.-D. Ehrich", title = "On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types", journal = j-J-ACM, volume = "29", number = "1", pages = "206--227", month = jan, year = "1982", CODEN = "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/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the framework of a category spec of equational specifications of abstract data types, implementations are defined to be certain pairs of morphisms with a common target. This concept covers, among others, arbitrary recursion schemes for defining the derived operations. It is shown that for given single steps of a multilevel implementation, there is always a multilevel implementation composed of these steps, but there is no effective construction of this overall implementation. Some suggestions are given for practical composition of implementations utilizing pushouts. Parametric specifications and parameter assignments are defined to be special morphisms in spec, and parameter substitution is made precise by means of pushouts.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages", } @Article{Hunt:1982:CFL, author = "H. B. {Hunt, III}", title = "On the Complexity of Flowchart and Loop Program Schemes and Programming Languages", journal = j-J-ACM, volume = "29", number = "1", pages = "228--249", month = jan, year = "1982", CODEN = "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 = "Uniform NP-hard and PSPACE-hard lower bounds are presented for problems for various classes of flowchart and loop program schemes and programming languages. These lower bounds hold for the isomorphism, strong equivalence, containment, weak equivalence, totality, divergence, and executability problems. These lower bounds hold for any reasonably nontrivial flowchart and loop programming language.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; computer programming languages --- Theory", } @Article{Fredman:1982:CMA, author = "Michael L. Fredman", title = "The Complexity of Maintaining an Array and Computing Its Partial Sums", journal = j-J-ACM, volume = "29", number = "1", pages = "250--260", month = jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 1 09:57: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rackoff:1982:RQI, author = "Charles Rackoff", title = "Relativized Questions Involving Probabilistic Algorithms", journal = j-J-ACM, volume = "29", number = "1", pages = "261--268", month = Jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Oct 24 23:58:54 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Rackoff attempts to prove $R \not = P$ by assuming $P \not = NP$ and relativization (i.e., for a class of languages $C$, $C^A$ is the same as $C$ except that one can answer questions concerning membership in $A$ in constant time). Interestingly, he proves that for some oracle A, $P^A \not = NP^A$ and $R^A \not = P^A$, and at the same time, for some other oracle $B$, $P^B\not=NP^B$ and $R^B \not = P^B$. An earlier version of this paper appeared in {\em Proc. 10th Ann. ACM Symp. on Theory of Computing}, 1978, pp. 338--342.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Winker:1982:GVF, author = "Steve Winker", title = "Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions", journal = j-J-ACM, volume = "29", number = "2", pages = "273--284", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:00: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Papadimitriou:1982:CRS, author = "Christos H. Papadimitriou and Mihalis Yannakakis", title = "The Complexity of Restricted Spanning Tree Problems", journal = j-J-ACM, volume = "29", number = "2", pages = "285--309", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jacobs:1982:DL, author = "Barry E. Jacobs", title = "On Database Logic", journal = j-J-ACM, volume = "29", number = "2", pages = "310--332", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:01:25 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 = "Database logic is a proposed theory which can serve the relational, hierarchical, and network approaches as first-order logic serves the relational approach. The key definitions for database logic are established.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lien:1982:EDM, author = "Y. Edmund Lien", title = "On the Equivalence of Database Models", journal = j-J-ACM, volume = "29", number = "2", pages = "333--362", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:02:20 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/gesturing.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sadri:1982:TDL, author = "Fereidoon Sadri and Jeffrey D. Ullman", title = "Template Dependencies: a Large Class of Dependencies in Relational Databases and Its Complete Axiomatization", journal = j-J-ACM, volume = "29", number = "2", pages = "363--372", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:03:13 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Relational database theory has discovered complete axiomatizations for functional and multivalued dependencies. A database design system based on dependencies must deal with some more general kinds of dependencies; at least with embedded multivalued dependencies.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sciore:1982:CAF, author = "Edward Sciore", title = "A Complete Axiomatization of Full Join Dependencies", journal = j-J-ACM, volume = "29", number = "2", pages = "373--393", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:03:44 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 = "join dependencies, chase procedure.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sethi:1982:UAM, author = "Ravi Sethi", title = "Useless Actions Make a Difference: {Strict} Serializability of Database Updates", journal = j-J-ACM, volume = "29", number = "2", pages = "394--403", month = apr, year = "1982", CODEN = "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 several transactions read and write items in a database, the question of consistency of the database arises. Consistency is maintained if transactions are serial: the read and write actions of a transaction execute completely before the actions of the next transaction begin. A particular history of interleaved read and write actions belonging to several transactions is correct if it is equivalent to a serial history. Since serializability of histories is known to be NP-complete, subclasses of serializable histories have been studied. One such class consists of histories serializable in a strict sense; transactions that are already in serial in a history must remain in the same relative order. When there are no useless actions in a history, it is shown that strict serializability can be determined in polynomial time. If useless actions are permitted, then strict serializability becomes NP-complete. The results apply to two-step transactions in which there is a read step followed by a write step. Each step involves some subset of the items in the database. With multistep transactions strict serializability is NP-complete even if there are no useless actions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "NP completeness in 2-phase protocols.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Bader:1982:GOL, author = "Christopher Bader and Arnaldo Moura", title = "A Generalization of {Ogden}'s Lemma", journal = j-J-ACM, volume = "29", number = "2", pages = "404--406", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:05: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen:1982:UBS, author = "Jacques Cohen and Timothy Hickey and Joel Katcoff", title = "Upper Bounds for Speedup in Parallel Parsing", journal = j-J-ACM, volume = "29", number = "2", pages = "408--428", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:07: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hunt:1982:DGP, author = "H. B. {Hunt, III}", title = "On the Decidability of Grammar Problems", journal = j-J-ACM, volume = "29", number = "2", pages = "429--447", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brown:1982:DCR, author = "Theodore Brown", title = "Determination of the Conditional Response for Quantum Allocation Algorithms", journal = j-J-ACM, volume = "29", number = "2", pages = "448--460", month = apr, year = "1982", CODEN = "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 analytic-numeric procedure for finding the response time for a given job size ( ``conditional response'') is demonstrated for a wide class of quanta-of-service allocation disciplines. The procedure is demonstrated for a discipline that is like standard round robin except that the queue of waiting jobs is ordered by the number of services previously received. Laplace--Stieltjes transforms (LST) are found for this ``ordered round robin'' for an M/G/1 queue allowing allocation of nonidentical quanta of service for a job. The derivation of the mean is shown explicitly, and higher moments can be derived by differentiation of the LST. The mean conditional response is found for the steady state, and it is shown that the method is capable as well of determining the mean conditional response under specified initial conditions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Subroutines; probability --- Queueing Theory", } @Article{Bryant:1982:MPR, author = "R. M. Bryant", title = "Maximum Processing Rates of Memory Bound Systems", journal = j-J-ACM, volume = "29", number = "2", pages = "461--477", month = apr, year = "1982", CODEN = "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 = "Existing methods of determining maximum processing rates for multiresource queuing systems are limited to small memory sizes because problem complexity grows exponentially with increasing memory size. By restricting attention to a particular scheduling discipline (first-come-first-loaded or FCFL) and treating memory as the limiting resource, methods of calculating maximum processing rates of memory bound systems for realistic main memory sizes are derived. The distribution of the number of jobs loaded under the FCFL policy is given in terms of a convolution of the memory request size distribution. The time averaged behavior of the number of loaded jobs is also found. Finally, the framework is extended to allow multiple job classes in the input stream. The results of this approach allow one to estimate main memory size requirements from a workload characterization given in terms of arrival rate, memory size distribution, and CPU service rate.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability --- Queueing Theory", } @Article{Kameda:1982:FSQ, author = "Hisao Kameda", title = "A Finite-Source Queue with Different Customers", journal = j-J-ACM, volume = "29", number = "2", pages = "478--491", month = apr, year = "1982", CODEN = "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/1982.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A finite-source queuing model (sometimes called the finite-population, machine interference, or machine-repairman model), which has often been used in analyzing time-sharing systems and multiprogrammed computer systems, is investigated. The model studied has two service stations, a processor (single server) and peripherals (infinite server), and a finite number of customers (or jobs) that have a distinct service rate at the processor. The model is in equilibrium. It is shown that the utilization factor of the processor can be obtained in an analytic form and is independent of various scheduling disciplines employed at the processor, such as FCFS, generalized processor sharing, preemptive (resume) and nonpreemptive priority disciplines, under some condition. Other relevant properties of this model are also shown. The range within which these properties hold is discussed, and some examples are given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A finite-source queueing model, which has often been used in analyzing time-sharing sytems and multiprogrammed computer system $s$, is investigated. The model studied here has two service stations, a processor (single server) and peripherals (infinite server), and a finite number of customers (or jobs) that have a distinct service rate at the processor. The model is in equilibrium. it is shown that the utilization factor of the processor can be \ldots{}.", classification = "723; 922", descriptors = "Time sharing; model; multiprogramming; processor sharing; FIFO; priority; finite source", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability --- Queueing Theory", } @Article{Lam:1982:DSG, author = "Simon S. Lam", title = "Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants", journal = j-J-ACM, volume = "29", number = "2", pages = "492--513", month = apr, year = "1982", CODEN = "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/1982.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A simple dynamic scaling technique is shown that avoids both the overflow and underflow problems that are often encountered in the evaluation of normalization constants of closed product-form queuing networks. With dynamic scaling, normalization constants for very large routing chain population sizes can be evaluated within the bounds of a relatively small range of numbers. It is shown that the product-form solution possesses a local balance property and the M implies M property with respect to routing chains. The relationships between normalization constants of closed networks and certain equilibrium aggregate state probabilities in networks that permit external arrivals and departures are examined. The growth behavior of normalization constants is shown to be modeled by a birth-death process traversing over the set of chain population vectors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A simple dynamic scaling technique is shown that avoids both the overflow and underflow problems that are often encountered in the evaluation of normalization constants of closed product-form queueing networks. \ldots{}", classification = "723; 922", descriptors = "Queueing network; Poisson distribution; output process; product form; network; normalization constant; numerical evaluation; local balance", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability --- Queueing Theory", } @Article{Ruschitzka:1982:PJC, author = "Manfred Ruschitzka", title = "The Performance of Job Classes with Distinct Policy Functions", journal = j-J-ACM, volume = "29", number = "2", pages = "514--526", month = apr, year = "1982", CODEN = "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/1982.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Policy function schedulers provide a flexible framework for specifying the response behavior of a system. The latter is often expressed in terms of a response function, the equilibrium residence time of a job conditioned on its service requirement. Jobs of different classes typically require different responses and thus different policy functions. The relation between a set of policy functions (one per class) and the resulting set of response functions is derived for processor-sharing M/G/1 systems and a large variety of policy function shapes. Given a set of desirable response functions, this relation may be used to solve the performance synthesis problem. Two types of class notions, one with and one without preemption based on externally assigned priorities, are considered. Plots of corresponding sets of policy and response functions are displayed for specific examples, and the differences caused by the two class types are discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Policy function schedulers provide a flexible framework for specifying the response behavior of a system. The latter is often expressed in terms of a response function, the equilibrium residence time of a job conditioned on its service requirement. Jobs of different classes typically require different responses and thus different policy functions. The relation between a set of policy functions (one per class) and the resulting set of response \ldots{}.", classification = "723; 922", descriptors = "M/G/1; processor sharing; time in system; priority; queueing discipline; policy function", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability --- Queueing Theory", } @Article{Tzelnic:1982:APB, author = "Percy Tzelnic and Izidor Gertner", title = "An Approach to Program Behavior Modeling and Optimal Memory Control", journal = j-J-ACM, volume = "29", number = "2", pages = "525--554", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:12:22 1994", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A new technique is proposed for analyzing models of (paged) virtual memory management. This technique, which is based on recent developments in the theory of optimal control, permits the use of a very general model of program behavior. A general jump stochastic process is used to describe the page reference generator. A model of memory management is formally defined as three component processes: the program behavior, the memory allocation, and the control process. Equations linking the evolution of the memory allocation process with the other two processes are derived. Necessary and sufficient conditions for an optimal control policy are given as a set of optimality equations. An analytic solution is presented for the case of stationary ranking of pages. The equations of motion of the memory allocation process are used in applications where the performance of a given control policy is to be assessed for specified program behavior. Another use of the proposed technique is the formulation of a Markov phase behavior model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 731", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; control systems, optimal --- Theory", } @Article{Meyer:1982:ADP, author = "Albert R. Meyer and Joseph Y. Halpern", title = "Axiomatic Definitions of Programming Languages: a Theoretical Assessment", journal = j-J-ACM, volume = "29", number = "2", pages = "555--576", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:15: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arbib:1982:PCE, author = "Michael A. Arbib and Ernest G. Manes", title = "The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions", journal = j-J-ACM, volume = "29", number = "2", pages = "577--602", month = apr, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:16:02 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "functional", } @Article{Floyd:1982:CRE, author = "Robert W. Floyd and Jeffrey D. Ullman", title = "The Compilation of Regular Expressions into Integrated Circuits", journal = j-J-ACM, volume = "29", number = "3", pages = "603--622", month = jul, year = "1982", CODEN = "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 design of integrated circuits to implement arbitrary regular expressions is considered. In general, a regular expression with $n$ operands may be converted into a nondeterministic finite automaton with at most $n$ states and $n$ transitions. Instead of converting the nondeterministic device to a deterministic one, two ways of implementing the nondeterministic device directly are proposed. One approach is to produce a PLA (programmable logic array) of approximate dimensions $n$ rows and $2n$ columns by representing the states of the nondeterministic finite automaton directly by columns. Another approach is to use the hierarchical structure of the automaton produced from the regular expression by the McNaughton--Yamada algorithm to guide a hierarchical layout of the circuit. The advantages of each approach are discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "713; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automatic layout; integrated circuits", } @Article{Takamizawa:1982:LTC, author = "K. Takamizawa and T. Nishizeki and N. Saito", title = "Linear-Time Computability of Combinatorial Problems in Series-Parallel Graphs", journal = j-J-ACM, volume = "29", number = "3", pages = "623--641", month = jul, year = "1982", CODEN = "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 --- parallel graph can be constructed from a certain graph by recursively applying ``series'' and ``parallel'' connections. The class of such graphs, which is a well-known model of series --- parallel electrical networks, is a subclass of planar graphs. It is shown in a unified manner that there exist linear-time algorithms for many combinatorial problems if an input graph is restricted to the class of series --- parallel graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical techniques", } @Article{Nassimi:1982:PPS, author = "David Nassimi and Sartaj Sahni", title = "Parallel Permutation and Sorting Algorithms and a New Generalized Connection Network", journal = j-J-ACM, volume = "29", number = "3", pages = "642--667", month = jul, year = "1982", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/322326.322329", 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 = "$O(k \log N)$ algorithms are obtained to permute and sort $N$ data items on cube and perfect shuffle computers with $N^{1 + 1 / k}$ processing elements, $1 \leq k \leq \log N$. These algorithms lead directly to a generalized connection-network construction having $O(k \log N)$ delay and $O(k N^{1 + 1 / k} \log N)$ contact pairs. This network has the advantage that the switches can be set in $O(k \log N)$ time by either a cube or perfect shuffle computer with $N^{1 + 1 / k}$ processing elements.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer architecture; computer programming --- Subroutines", } @Article{Honeyman:1982:TSF, author = "Peter Honeyman", title = "Testing Satisfaction of Functional Dependencies", journal = j-J-ACM, volume = "29", number = "3", pages = "668--677", month = jul, year = "1982", CODEN = "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 = "Determining whether a single relation satisfies a set of functional dependencies is a straightforward task. However, determining whether a set of relations satisfies a set of functional dependencies is a more difficult problem. Even the meaning of this notion of ``satisfaction'' needs to be settled. Several definitions for satisfaction are considered, one of which is determined to be most sound. This definition requires that one can construct a single relation that satisfies the dependencies while containing all of the information in the set of relations. A polynomial-time algorithm is then developed to test satisfaction using this definition.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Ginsburg:1982:PFD, author = "Seymour Ginsburg and Sami Mohammed Zaiddan", title = "Properties of Functional-Dependency Families", journal = j-J-ACM, volume = "29", number = "3", pages = "678--698", month = jul, year = "1982", CODEN = "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 functional-dependency (FD-) family is defined here as the family of all instances satisfying a set of functional dependencies. These families are studied with respect to projection, join, and decomposition and their connection with generating families and generators. Typical results obtained are: (i) a characterization for when the projection of an FD-family is an FD-family; (ii) a characterization for when the join of two FD-families is an FD-family; (iii) a necessary and sufficient condition for an FD-family to be decomposable; and (iv) that every domain-infinite FD-family has a generator.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Klug:1982:ERA, author = "Anthony Klug", title = "Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions", journal = j-J-ACM, volume = "29", number = "3", pages = "699--717", month = jul, year = "1982", CODEN = "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 = "Aggregate functions in relational query languages allow intricate reports to be written. In this paper aggregate functions are precisely defined. The definition does not use the notion of `duplicates'. Relational algebra and relational calculus are extended in a general and natural fashion to include aggregate functions. It is shown that the languages so extended have equivalent expressive power.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Aggregate functions are precisely defined. Relational algebra and relational calculus are extended in a general and natural fashion to include aggregate functions.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems; database query optimization", } @Article{Yannakakis:1982:TSL, author = "Mihalis Yannakakis", title = "A Theory of Safe Locking Policies in Database Systems", journal = j-J-ACM, volume = "29", number = "3", pages = "718--740", month = jul, year = "1982", CODEN = "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 several transactions access (read and update) the same database concurrently, there must be some kind of coordination to ensure that all transactions receive a consistent view of the data. Such coordination is usually achieved by locking the transactions according to some locking policy. A locking policy that guarantees the preservation of consistency of the database is called safe. Necessary and sufficient conditions are found for a locking policy to be safe, but it is shown that in general it is NP-complete to test for these conditions. However, when the database has a given structure, a simple set of rules which is sufficient for safety and, moreover, necessary for a wide class of natural locking policies is developed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Necessary and sufficient conditions are found for a locking policy to be safe, in general it is NP-complete to test for these conditions. However, when the database has a given structure a simple set of rules which is sufficient for safety and, moreover, necessary for a wide class of natural locking policies is developed. Concurrency and deadlock avoidance --- 2 phase and hierarchical locks.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data base systems", } @Article{Angluin:1982:IRL, author = "Dana Angluin", title = "Inference of Reversible Languages", journal = j-J-ACM, volume = "29", number = "3", pages = "741--765", month = jul, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:22: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gabow:1982:ALA, author = "Harold N. Gabow", title = "An Almost-Linear Algorithm for Two-Processor Scheduling", journal = j-J-ACM, volume = "29", number = "3", pages = "766--780", month = jul, year = "1982", CODEN = "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 well-known problem in scheduling theory is to execute $n$ unit-length jobs subject to precedence constraints on two processors in minimum finish time. Previous algorithms begin by finding the transitive closure of the precedence dag and so use time $O(\min(e n, n^{2.61}))$. An $O(e + n \alpha (n))$ algorithm is presented which is based on the idea of a ``highest-level-first'' (HLF) schedule. Such a schedule always executes nodes on the longest paths of the precedence dag. An HLF schedule is guaranteed to be optimum and can be constructed efficiently.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Subroutines", } @Article{Lloyd:1982:CPS, author = "Errol L. Lloyd", title = "Critical Path Scheduling with Resource and Processor Constraints", journal = j-J-ACM, volume = "29", number = "3", pages = "781--811", month = jul, year = "1982", CODEN = "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 investigation is made of the worst-case performance of two related algorithms for scheduling unit-execution-time task systems with resources. Unlike most previous scheduling results for task systems with resources, it is assumed that there are a fixed number of processors in the system. This assumption has both practical and theoretical interest. An upper bound is given for the worst-case performance of critical path scheduling for these task systems. This bound depends on both the number of processors and the number of resources. Moreover, it is shown that this is (asymptotically) the best possible upper bound. It is also noted that exactly the same bound holds for the worst-case performance of Coffman --- Graham scheduling.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Subroutines", } @Article{Martel:1982:PSR, author = "Charles Martel", title = "Preemptive Scheduling with Release Times, Deadlines, and Due Times", journal = j-J-ACM, volume = "29", number = "3", pages = "812--829", month = jul, year = "1982", CODEN = "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 $n$ jobs, each of which has a release time, a deadline, and a processing requirement, the problem of determining whether there exists a preemptive schedule on $m$ uniform machines which completes each job in the time interval between its release time and its deadline is examined. An $O(m^2n^4+n^5)$ algorithm is presented which uses a generalization of network flow techniques to construct such a schedule whenever one exists. This algorithm is then used with search techniques to find a schedule which minimizes maximum lateness.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Subroutines", } @Article{Samelson:1982:NPF, author = "Christopher L. Samelson and William G. Bulgren", title = "A Note on Product-Form Solution for Queuing Networks with {Poisson} Arrivals and General Service-Time Distributions with Finite Means", journal = j-J-ACM, volume = "29", number = "3", pages = "830--840", month = jul, year = "1982", CODEN = "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/1982.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The steady-state joint probability distribution of queue lengths is obtained for queuing networks with Poisson arrivals in which some of the service-time distribution functions are general (e.g., not even differentiable). In particular, an analytical model for queuing networks which is more general than those considered to date is produced by using the concept of generalized function. Previous results on the relationships between the properties of queuing discipline, product form, and local balance can be shown to hold in this more general setting.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "The steady-state joint probability distribution of queue lengths is obtained for queuing networks with Poisson arrivals in which some of the service-time distribution functions are general (e.g., not even differentiable). In particular, an analytical model for queuing networks which is more general than those considered to date is produced by using the concept of generalized function. Previous results on the relationships between the properties\ldots{}", classification = "723; 922", descriptors = "Queueing network; product form; network; local balance", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; probability --- Queueing Theory", } @Article{Apt:1982:CTL, author = "Krzysztof R. Apt and M. H. {Van Emden}", title = "Contributions to the Theory of Logic Programming", journal = j-J-ACM, volume = "29", number = "3", pages = "841--862", month = jul, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:24:52 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "foundations; negation; prolog; SLD resolution", } @Article{Gurari:1982:TWC, author = "Eitan M. Gurari and Oscar H. Ibarra", title = "Two-Way Counter Machines and {Diophantine} Equations", journal = j-J-ACM, volume = "29", number = "3", pages = "863--873", month = jul, year = "1982", CODEN = "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 = "Let $Q$ be the class of deterministic two-way 1-counter machines accepting only bounded languages. Each machine in $Q$ has the property that in every accepting computation, the counter makes at most a fixed number of reversals. It is shown that the emptiness problem for $Q$ is decidable. When the counter is unrestricted or the machine is provided with two reversal-bounded counters, the emptiness problem becomes undecidable. The decidability of the emptiness problem for $Q$ is useful in proving the solvability of some number-theoretic problems. It can also be used to prove that a certain language cannot be accepted by any machine in $Q$ ($u_1$ and $u_2$ are distinct symbols).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Jerrum:1982:SEC, author = "Mark Jerrum and Marc Snir", title = "Some Exact Complexity Results for Straight-Line Computations over Semirings", journal = j-J-ACM, volume = "29", number = "3", pages = "874--897", month = jul, year = "1982", CODEN = "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 polynomials in certain semirings is considered. Precise bounds are obtained on the number of multiplications required by straight-line algorithms which compute such functions as iterated matrix multiplication, iterated convolution, and permanent. Using these bounds, it is shown that the use of branching can exponentially speed up computations using the min, plus operations, and that subtraction can exponentially speed up arithmetic computations. These results can be interpreted as denying the existence of fast ``universal'' algorithms for computing certain polynomials.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques --- Polynomials", } @Article{Yao:1982:PCK, author = "Andrew Chi Chih Yao", title = "On Parallel Computation for the Knapsack Problem", journal = j-J-ACM, volume = "29", number = "3", pages = "898--903", month = jul, year = "1982", CODEN = "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 complexity of solving the knapsack problem with $n$ input real numbers on a parallel computer with real arithmetic and branching operations is considered. A time--processor trade-off constraint is derived; in particular, it is shown that an exponential number of processors have to be used if the problem is to be solved in time $t \leq \sqrt{n^{1/2}/2}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; knapsack problem", } @Article{Brent:1982:CAT, author = "R. P. Brent and H. T. Kung", title = "Corrigendum: ``{The} Area-Time Complexity of Binary Multiplication''", journal = j-J-ACM, volume = "29", number = "3", pages = "904--904", month = jul, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Nov 19 23:27:10 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Brent:1981:ATC}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tobagi:1982:DPD, author = "Fouad A. Tobagi", title = "Distributions of Packet Delay and Interdeparture Time in Slotted {ALOHA} and Carrier Sense Multiple Access", journal = j-J-ACM, volume = "29", number = "3", pages = "907--927", month = jul, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:29:55 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Packet communication systems of the multiaccess\slash broadcast type, in which all communicating devices share a common channel that is multiaccessed in some random fashion, are considered. Among the various multiaccess schemes known, two prominent ones are considered: slotted Aloha and Carrier Sense Multiple Access (CSMA)\ldots{} Unfortunately, average performance is not adequate when designing communication systems intended for real-time \ldots{}", descriptors = "Distribution; time in system; interdeparture time; communication network; TDMA=time division multiple access; broadcast; communication; slotted ALOHA; CSMA=carrier sense multiple access", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Storer:1982:DCT, author = "James A. Storer and Thomas G. Szymanski", title = "Data Compression via Textual Substitution", journal = j-J-ACM, volume = "29", number = "4", pages = "928--951", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 01 09:59: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fagin:1982:HCD, author = "Ronald Fagin", title = "{Horn} Clauses and Database Dependencies", journal = j-J-ACM, volume = "29", number = "4", pages = "952--985", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:31:26 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grant:1982:FGD, author = "John Grant and Barry E. Jacobs", title = "On the Family of Generalized Dependency Constraints", journal = j-J-ACM, volume = "29", number = "4", pages = "986--997", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:32: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Papadimitriou:1982:TDC, author = "Christos H. Papadimitriou", title = "A Theorem in Database Concurrency Control", journal = j-J-ACM, volume = "29", number = "4", pages = "998--1006", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 1 10:04:43 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{Papadimitriou:1985:CTD}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Consider two straight-line programs $A$ and $B$, and let $H$ be a set of sequences of steps $A$ and $B$, possibly interleaved, but each containing all steps of $A$ and $B$ in the right order; a necessary and sufficient condition is given for $H$ to be realizable as the set of all sequences of steps that are legal under some insertion of lock-unlock steps between the steps of $A$ and $B$.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beatty:1982:RBL, author = "John C. Beatty", title = "On the Relationship Between the {LL(1)} and {LR(1)} Grammars", journal = j-J-ACM, volume = "29", number = "4", pages = "1007--1022", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:33: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Minoura:1982:DAR, author = "Toshimi Minoura", title = "Deadlock Avoidance Revisited", journal = j-J-ACM, volume = "29", number = "4", pages = "1023--1048", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 24 09:34:55 1996", 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 = "The algorithms mentioned are Havender (fixed ordering of resources), Modified Havender (dynamical ordering of resources), Habermann (do not let a process in execution unless all the resources are available), and Modfied Habermann (based on more localized resource claim). An extended model with multiple resources is introduced as well.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stark:1982:SPS, author = "Eugene W. Stark", title = "Semaphore Primitives and Starvation-Free Mutual Exclusion", journal = j-J-ACM, volume = "29", number = "4", pages = "1049--1072", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:34: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldschlager:1982:UIP, author = "Leslie M. Goldschlager", title = "A Universal Interconnection Pattern for Parallel Computers", journal = j-J-ACM, volume = "29", number = "4", pages = "1073--1086", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:36: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lengauer:1982:ATB, author = "Thomas Lengauer and Robert E. Tarjan", title = "Asymptotically Tight Bounds on Time-Space Trade-offs in a Pebble Game", journal = j-J-ACM, volume = "29", number = "4", pages = "1087--1130", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:36: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Matula:1982:BDS, author = "David W. Matula", title = "Basic Digit Sets for Radix Representation", journal = j-J-ACM, volume = "29", number = "4", pages = "1131--1143", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:37: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Smith:1982:PPA, author = "Carl H. Smith", title = "The Power of Pluralism for Automatic Program Synthesis", journal = j-J-ACM, volume = "29", number = "4", pages = "1144--1165", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:38:53 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.", annote = "Earlier version in FOCS81", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ukkonen:1982:EPS, author = "Esko Ukkonen", title = "The Equivalence Problem for Some Non-Real-Time Deterministic Pushdown Automata", journal = j-J-ACM, volume = "29", number = "4", pages = "1166--1181", month = oct, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 00:39: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bagchi:1983:SAU, author = "A. Bagchi and A. Mahanti", title = "Search Algorithms Under Different Kinds of Heuristics--{A} Comparative Study", journal = j-J-ACM, volume = "30", number = "1", pages = "1--21", month = jan, year = "1983", CODEN = "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 heuristic search algorithms, called Algorithms A, B, and C, are presented. Their performance, with the admissibility condition relaxed, is compared using the following two criteria: (i) number of node expansions and (ii) cost of solution found. First, a general comparison is made. In this process some variations and extensions of C are also considered. Subsequently, two types of heuristic estimates, called proper and path dependent, are defined, and the algorithms are reexamined. It is shown that on the whole A (Nilsson's algorithm) and B (Martelli's algorithm) are inferior to C, which is a slightly modified version of B.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{deChampeaux:1983:BHS, author = "Dennis {de Champeaux}", title = "Bidirectional Heuristic Search Again", journal = j-J-ACM, volume = "30", number = "1", pages = "22--32", month = jan, year = "1983", CODEN = "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 = "Extensive modifications of a previously published bidirectional heuristic search algorithm are presented in order to preserve the property that shortest solutions are found under appropriate circumstances. Theoretical results encompass the generalization of the unidirectional optimality theorem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{Sarwate:1983:NNM, author = "D. V. Sarwate", title = "A Note on ``{A} Note on Multiple Error Detection in {ASCII} Numeric Data Communication''", journal = j-J-ACM, volume = "30", number = "1", pages = "33--35", month = jan, year = "1983", CODEN = "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 recent paper by C. K. Chu proposes a scheme for double error detection which is based on naive and unrealistic assumptions about the data communication system. Under more realistic conditions, the scheme fails to work as claimed. Suitably modified versions of Chu's scheme do work: they are also well known in the coding literature as Reed--Solomon coding schemes.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "codes, symbolic --- Error Detection; data transmission", } @Article{Klug:1983:LEI, author = "Anthony Klug", title = "Locking Expressions for Increased Database Concurrency", journal = j-J-ACM, volume = "30", number = "1", pages = "36--54", month = jan, year = "1983", CODEN = "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", abstract = "Access to a relation $R$ in a relational database is sometimes based on how $R$ joins with other relations rather than on what values appear in the attributes of $R$-tuples. Using simple predicate locks forces the entire relation to be locked in these cases. A technique is presented which allows locking of the smallest possible set of tuples even when the selection is based on joins with other relations. The algorithms are based on a generalization of tableaux. The tableaux used here can represent relational algebra queries with any of the domain comparison operators $=$, $!=$, $\leq$, $>$, and $\geq$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems", } @Article{Korth:1983:LPD, author = "Henry F. Korth", title = "Locking Primitives in a Database System", journal = j-J-ACM, volume = "30", number = "1", pages = "55--79", month = jan, year = "1983", CODEN = "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", abstract = "Locking is a frequently used concurrency control mechanism in database systems. Most systems offer one or more lock modes, usually read and write modes. Here, one operational lock mode is assumed for each database operation, and a criterion for ``good'' lock compatibility functions, called maximal permissiveness, is given. Operational modes are used as a basis to define generalized update modes that correspond to arbitrary lock conversions. The notion of intention modes from System R is extended to arbitrary lock modes, and the interaction among the classes of lock modes thus created is studied.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "An arbitrary number of lock modes, operational modes and derived modes, combination mode, generalized update mode, and the intention mode.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems", } @Article{Frederickson:1983:IDS, author = "Greg N. Frederickson", title = "Implicit Data Structures for the Dictionary Problem", journal = j-J-ACM, volume = "30", number = "1", pages = "80--94", month = jan, year = "1983", CODEN = "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 new data structures for dictionaries are presented that use just one location in addition to those required for key values. The structures are generalizations of a rotated sorted list. Structures adapted to allow fast average search times and structures that allow partial match retrieval on records with $d$ keys, $d > 1$, are also considered.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data processing", } @Article{Maurer:1983:SFT, author = "H. A. Maurer and A. Salomaa and D. Wood", title = "A Supernormal-Form Theorem for Context-Free Grammars", journal = j-J-ACM, volume = "30", number = "1", pages = "95--102", month = jan, year = "1983", CODEN = "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 every triple $(k,l,m)$ of nonnegative integers, every context-free grammar $G$ can be transformed into a normal form where (i) each nonterminating production is of the type $A$ produces $w_kBw_lCw_m$, and (ii) each terminating production $A$ produces $w$ has the property that vertical $w$ vertical appears in the length set of $L(G)$. Applications and generalizations of this result are discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Lord:1983:SLA, author = "R. E. Lord and J. S. Kowalik and S. P. Kumar", title = "Solving Linear Algebraic Equations on an {MIMD} Computer", journal = j-J-ACM, volume = "30", number = "1", pages = "103--117", month = jan, year = "1983", CODEN = "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 practical parallel algorithms for solving systems of dense linear equations on an MIMD computer are presented. They are based on Gaussian elimination and Givens transformations. The algorithms are numerically stable and have been tested on the Denelcor HEP machine.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; computer systems, digital --- Parallel Processing", } @Article{Gavish:1983:FAC, author = "Bezalel Gavish", title = "Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem", journal = j-J-ACM, volume = "30", number = "1", pages = "118--132", month = jan, year = "1983", CODEN = "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 Capacitated Minimal Directed Tree Problem is fundamental in many network design problems. A new linear integer programming formulation of the problem which leads to a Dantzig-Wolfe decomposition and to a new Lagrangean relaxation procedure for the Capacitated Minimal Directed Tree Problem is presented. This relaxation is used for deriving tight lower bounds on the optimal solution and in heuristics for obtaining approximate solutions. The effectiveness of the procedure is demonstrated in computational tests.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks", } @Article{Kannan:1983:PTA, author = "Ravindran Kannan", title = "Polynomial-Time Aggregation of Integer Programming Problems", journal = j-J-ACM, volume = "30", number = "1", pages = "133--145", month = jan, year = "1983", CODEN = "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 set of linear Diophantine equations in nonnegative variables with nonnegative coefficients can be reduced to a single equation with the same solution set in polynomial time. A weaker version of the above statement is shown to be true when the coefficients are allowed to be negative. Beside being polynomial-time bounded, the present aggregation scheme differs from existing ones in that the final equation is in variables that are not explicitly bounded. Three applications of this aggregation technique are presented: (i) it is proved that a certain type of knapsack problem cannot have a polynomial-time approximation algorithm unless NP equals P; (ii) an analog of Farkas' lemma for integer programming is proved; and (iii) it is shown that a decision problem involving integer variables is NP-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "integer programming; mathematical programming", } @Article{Schassberger:1983:TRT, author = "R. Schassberger and H. Daduna", title = "The Time for a Round Trip in a Cycle of Exponential Queues", journal = j-J-ACM, volume = "30", number = "1", pages = "146--150", month = jan, year = "1983", CODEN = "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/1983.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The distribution of the time for a round trip of a job in a cycle of M exponential FIFO queues, where $N$ jobs are cycling, is derived.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "The distribution of the time for a round trip of a job in a cycle of $m$ exponential FIFO queues, where $n$ jobs are cycling, is derived.", classification = "922", descriptors = "Loop queue; exponential queueing network; FIFO; time in system; distribution; cycle time", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "probability", } @Article{Fortune:1983:ESS, author = "Steven Fortune and Daniel Leivant and Michael O'Donnell", title = "The Expressiveness of Simple and Second-Order Type Structures", journal = j-J-ACM, volume = "30", number = "1", pages = "151--185", month = jan, year = "1983", CODEN = "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 = "Typed lambda ( lambda -) calculi provide convenient mathematical settings in which to investigate the effects of type structure on the function definition mechanism in programming languages. Lambda expressions mimic programs that do not use while loops or circular function definitions. Two typed $\lambda$-calculi are investigated: the simply typed $\lambda$-calculus, whose types are similar to Pascal types, and the second-order typed $\lambda$-calculus, which has a type abstraction mechanism similar to that of modern data abstraction languages such as ALPHARD. Two related questions are considered for each calculus: (1) What functions are definable in the calculus? and (2) How difficult is the proof that all expressions in the calculus are normalizable (i.e., that all computations terminate)?", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", checked = "4 September 1990", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages; functional", } @Article{Strong:1983:VEF, author = "H. R. Strong", title = "Vector Execution of Flow Graphs", journal = j-J-ACM, volume = "30", number = "1", pages = "186--196", month = jan, year = "1983", CODEN = "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 = "Consideration is given to the optimal scheduling of an SIMD (Single Instruction Multiple Data) machine that is a set of processors synchronized at the instruction level so that only one instruction may be executed at a time, but that instruction may be executed by all or any subset of the set of processors. Each processor is assumed to be executing the same program; however, since each is operating on different data, each may take a different path through that program. A scheduler decides at each point in time which instruction to execute next without knowledge of the future paths through the program that each processor will take. An optimal scheduler would schedule these executions to minimize the total execution time (number of instructions executed). Programs for which such an optimal scheduler exists are characterized by graph-theoretic properties of the corresponding flow graph: They are exactly the reducible flow graphs with only disjoint cycles. Scheduling methods based on priority ordering and node listing are compared as to worst-case behavior on programs for which no optimal scheduler exists.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Apt:1983:FJP, author = "Krzysztof R. Apt", title = "Formal Justification of a Proof System for Communicating Sequential Processes", journal = j-J-ACM, volume = "30", number = "1", pages = "197--216", month = jan, year = "1983", CODEN = "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 previous paper a proof system dealing with partial correctness of communicating sequential processes was introduced. Soundness and relative completeness of this system are proved here. It is also indicated in what way the semantics and the proof system can be extended to deal with the total correctness of the programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory --- Programming Theory; computer programming", } @Article{Ibarra:1983:PAD, author = "Oscar H. Ibarra and Shlomo Moran", title = "Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs", journal = j-J-ACM, volume = "30", number = "1", pages = "217--228", month = Jan, year = "1983", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Oct 24 23:19:13 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "They study the complexity of deciding the equivalence of straight-line programs, i.e., those in which there are no loops, and only statements of the form $x := y$, $x := y + z$, $x := y - z$, and $x := y * z$ are permitted. Given two such programs $P$ and $Q$, Ibarra and Moran ask the question: Is $P = Q$? If the domain of the variables is an infinite field such as the integers, then they show that there exists a polynomial-time probabilistic algorithm to solve this problem. If the domain is a finite field, the problem is shown to be {\em NP\/}-hard.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vitter:1983:ASP, author = "Jeffrey Scott Vitter", title = "Analysis of the Search Performance of Coalesced Hashing", journal = j-J-ACM, volume = "30", number = "2", pages = "231--258", month = apr, year = "1983", CODEN = "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 = "An analysis is presented of the coalesced hashing method, in which a portion of memory (called the address region) serves as the range of the hash function while the rest of memory (called the cellar) is devoted solely to storing records that collide when inserted. If the cellar should get full, subsequent colliders must be stored in empty slots in the address region and thus may cause later collisions. Varying the relative size of the cellar affects search performance. The main result of this paper expresses the average search times as a function of the number of records and the cellar size, solving a long-standing open problem. These formulas are used to pick the cellar size that leads to optimum search performance, and it is shown that this ``tuned'' method outperforms several well-known hashing schemes. A discussion of past work on coalesced hashing and a generalization of the method of nonuniform hash functions is included.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Chaining and open addressing; by appropriate tuning outperforms other schemes.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data processing; database indexing", review = "ACM CR 40,398", } @Article{Sippu:1983:CLK, author = "Seppo Sippu and Eljas Soisalon-Soininen and Esko Ukkonen", title = "The Complexity of {LALR}(k) Testing", journal = j-J-ACM, volume = "30", number = "2", pages = "259--270", month = apr, year = "1983", CODEN = "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 testing whether or not a context-free grammar possesses the LALR(k) property is studied. For each fixed integer $k\geq 1$ (i.e., only the subject grammar is a problem parameter) the problem is shown to be complete for polynomial space (PSPACE). For free $k$ (i.e., both the grammar and the integer $k$ are problem parameters) the problem is shown to be PSPACE-complete when $k$ is expressed in unary and complete for nondeterministic one-level exponential time (NE) when $k$ is expressed in binary.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Stewart:1983:CEB, author = "G. W. Stewart", title = "Computable Error Bounds for Aggregated {Markov} Chains", journal = j-J-ACM, volume = "30", number = "2", pages = "271--285", month = apr, year = "1983", CODEN = "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 = "A method is described for computing the steady-state probability vector of a nearly completely decomposable Markov chain. The method is closely related to the one proposed by H. A. Simon and A. Ando and developed by P. J. Courtois. However, the method described here does not require the determination of a completely decomposable stochastic approximation to the transition matrix, and hence it is applicable to nonstochastic matrices. An error analysis of the procedure which results in effectively computable error bounds is given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "For some discrete finite Markov chains, the matrix a of transition probabilities can be partitioned so that the off diagonal blocks are smaller (in norm) than the square submatrices on the diagonal. Thus, a can be approximated by a block-diagonal matrix. The computation of the left eigenvector with eigenvalue 1, which gives the steady-state probabilities of the chain, then reduces to the computation of left eigenvectors of the submatrices on \ldots{}.", classification = "922", descriptors = "Markov process; transition matrix; eigenvalue; error bound; transient Markov chain; steady state", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "aggregation; eig; Markov chain; nla; pert; probability", } @Article{Chandy:1983:CPF, author = "K. M. Chandy and A. J. Martin", title = "A Characterization of Product-Form Queueing Networks", journal = j-J-ACM, volume = "30", number = "2", pages = "286--299", month = apr, year = "1983", CODEN = "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/1983.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Simple criteria are given for determining whether a queueing network model has a product-form solution and is thus computationally tractable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Simple criteria are given for determining whether a queuing network model has a product-from solution and is thus computationally tractable.", classification = "922", descriptors = "product form; network; stochastic analysis; performance; queuing theory; stochastic analysis; networks", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "probability", } @Article{Jaffe:1983:DSR, author = "Jeffrey M. Jaffe", title = "Decentralized Simulation of Resource Managers", journal = j-J-ACM, volume = "30", number = "2", pages = "300--322", month = apr, year = "1983", CODEN = "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 = "There are two primary means of resource allocation in computer systems. One is the powerful mechanism of using a centralized resource manager to allocate the resources. An apparently weaker mechanism is for the asynchronous processes of the system to allocate resources with some type of message passing. A unifying treatment of these two methods is provided. It is shown that a managed system may be simulated by the processes using test and set instructions. As a corollary, a wide variety of synchronization algorithms may be accomplished without a manager. The simulation works correctly even in an environment where processes die in an undetectable manner.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; performance modelling", } @Article{Brand:1983:CFS, author = "Daniel Brand and Pitro Zafiropulo", title = "On Communicating Finite-State Machines", journal = j-J-ACM, volume = "30", number = "2", pages = "323--342", month = apr, year = "1983", CODEN = "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/des.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A model of communications protocols based on finite-state machines is investigated. The problem is how to ensure certain generally desirable properties, which make protocols ``well-formed,'' that is, specify a response to those and only those events that can actually occur. It is determined to what extent the problem is solvable, and one approach to solving it is described.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", descriptors = "Protocol engineering", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks", } @Article{Nourani:1983:AIT, author = "C. Farshid Nourani", title = "Abstract Implementations and their Correctness Proofs", journal = j-J-ACM, volume = "30", number = "2", pages = "343--359", month = apr, year = "1983", CODEN = "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", abstract = "Formal implementations and their correctness proofs are studied. Properties of initial algebras are used to structure proofs of correctness of implementations. A new formulation of implementation is given incorporating parameter types. Canonical term algebras are argued to be the natural choice of representation for both the abstract and the more concrete specifications as far as correctness proofs are concerned. The ``fine structure'' of initial algebras is captured by the notion of signature of constructors. This notion leads to simple sufficient conditions for obtaining injective homomorphisms of algebras, a necessary step in algebraic correctness proofs. Signature of constructors is also used in connection with the deductive properties of the equational theory of the specification to arrive at sufficient conditions for injectivity of homorphisms of algebras modeling parameterized specifications. A proof methodology is prescribed and is demonstrated by a nontrivial example.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages; functional", } @Article{Galil:1983:EGP, author = "Zvi Galil and Wolfgang J. Pauli", title = "An Efficient General-Purpose Parallel Computer", journal = j-J-ACM, volume = "30", number = "2", pages = "360--387", month = apr, year = "1983", CODEN = "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 question of what is a good way to interconnect a large number of processors is investigated. The main result is the construction of a universal parallel machine that can simulate every reasonable parallel machine with only a small loss of time and with essentially the same number of processors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Tarsi:1983:OSS, author = "Michael Tarsi", title = "Optimal Search on Some Game Trees", journal = j-J-ACM, volume = "30", number = "3", pages = "389--396", month = jul, year = "1983", CODEN = "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/tree-search.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Also as Tech. Report UCLA-ENG-CSL-8108", abstract = "It is proved that the directional algorithm for solving a game tree is optimal, in the sense of average run time, for balanced trees (a family containing all uniform trees). This result implies that the alpha-beta pruning method is asymptotically optimal among all game searching algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; probability; systems science and cybernetics --- Artificial Intelligence", } @Article{Rosenberg:1983:TDV, author = "Arnold L. Rosenberg", title = "Three-Dimensional {VLSI}: a Case Study", journal = j-J-ACM, volume = "30", number = "3", pages = "397--416", month = jul, year = "1983", CODEN = "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 advantages of three-dimensional circuits are studied by comparing sample three-dimensional realizations of certain common families of circuits, namely, permutation networks, FFT circuits, and complete binary trees, with the families' optimal two-dimensional realizations. These circuits are then used as building blocks to obtain efficient three-dimensional realizations of arbitrary circuits. The results obtained indicate (roughly) that bounds on area (both upper and lower) in the neighborhood of order $n^2$ in the two-dimensional case translate to bounds on volume in the neighborhood of order $n^{3/2}$ in the three-dimensional case. Moreover, several of the upper bounds are attainable using (idealized) realizations that have active devices on only one level and that use the third dimension only for wire-routing. However, it is also shown that unrestricted use of the third dimension can yield realizations that are more conservative of volume (by the factor $\log^{1/2} n$) than any ``one-active-level'' realization can be. Finally, examples are presented wherein two-dimensional realizations require device-to-device wire lengths as large as $n/\log n$, while equivalent three-dimensional realizations can get by with wire lengths not exceeding $n^{1/2}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "713; 714", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "integrated circuits, VLSI", } @Article{Matula:1983:SLO, author = "David W. Matula and Leland L. Beck", title = "Smallest-Last Ordering and Clustering and Graph Coloring Algorithms", journal = j-J-ACM, volume = "30", number = "3", pages = "417--427", month = jul, year = "1983", CODEN = "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 = "Smallest-last vertex ordering and priority search are utilized to show for any graph $G$ equals (V, E) that the set of all connected subgraphs maximal with respect to their minimum degree can be determined in $O(|E| + |V|)$ time and $2 |E| + O(|V|)$ space. It is further noted that the smallest-last graph coloring algorithm can be implemented in $O(|E| + |V|)$ time, and particularly effective aspects of the resulting coloring are discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; mathematical techniques", } @Article{Supowit:1983:RNG, author = "Kenneth J. Supowit", title = "The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees", journal = j-J-ACM, volume = "30", number = "3", pages = "428--448", month = jul, year = "1983", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:56:08 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The relative neighborhood graph (RNG) of a set $V$ of points in Euclidean space is the graph $(V, E)$ where $(p, q)$ are elements $E$ if there is no point $z$ belonging to $V$ such that $d(p,z) < d(p,q)$ and $d(q,z) < d(p,q)$. It is shown that (1) the RNG of $n$ points in the plane can be found in $O(n \log n)$ time, which is optimal to within a multiplicative constant. (2) The RNG, as well as minimum spanning tree, of the vertices of a convex, $n$-vertex polygon can be found in $O(n)$ time, given the vertices in sorted clockwise order. (3) Under the assumption that no three input points form an isosceles triangle, the RNG of $n$ points in $r$-dimensional space can be found in $O(n^2)$ time for fixed $r$ greater than equivalent to $3$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "421; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; mathematical techniques", } @Article{Arjomandi:1983:ESV, author = "Eshrat Arjomandi and Michael J. Fischer and Nancy A. Lynch", title = "Efficiency of Synchronous Versus Asynchronous Distributed Systems", journal = j-J-ACM, volume = "30", number = "3", pages = "449--456", month = jul, year = "1983", CODEN = "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", abstract = "A system of parallel processes is said to be synchronous if all processes run using the same clock, and it is said to be asynchronous if each process has its own independent clock. For any $s$, $n$, a particular distributed problem is defined involving system behavior at $n$ ``ports''. This problem can be solved in time $s$ by a synchronous system but requires time at least $(s-1)(\log_b n)$ on any asynchronous system, where $b$ is a constant reflecting the communication bound in the model. This appears to be the first example of a problem for which an asynchronous system is provably slower than a synchronous one, and it shows that a straightforward step-by-step and process-by-process simulation of an $n$-process synchronous system by an $n$-process asynchronous system necessarily loses a factor of $\log_b n$ in speed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Coffman:1983:ISE, author = "E. G. {Coffman, Jr.} and Ravi Sethi", title = "Instruction Sets for Evaluating Arithmetic Expressions", journal = j-J-ACM, volume = "30", number = "3", pages = "457--478", month = jul, year = "1983", CODEN = "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 evaluation of arithmetic expressions on both register-oriented and stack-oriented machines can be studied using the same model because registers can be treated as a stack during the evaluation of expression trees, without loss in code efficiency. The machine model in this paper has a hardware stack in which all computations take place. Register-register and register-memory instructions are modeled by considering four possible instructions for each binary operator, depending on whether one or two operands are taken from the stack and on whether the left or the right operand is on top of the stack. There is a cost associated with each operation code, as well as costs for accessing a value in a register or in memory. The minimum cost of computing an expression tree is used to compare machines. As part of the framework that allows the comparisons to be performed, a parameterized algorithm for determining the number of stores that must occur in an optimal computation is developed. This algorithm forms the basis of an optimal code generation algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer architecture; computer programming --- Algorithms", } @Article{Beeri:1983:DAD, author = "Catriel Beeri and Ronald Fagin and David Maier and Mihalis Yannakakis", title = "On the Desirability of Acyclic Database Schemes", journal = j-J-ACM, volume = "30", number = "3", pages = "479--513", month = jul, year = "1983", CODEN = "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 class of database schemes, called acyclic, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been studied by other researchers in very different terms are all shown to be equivalent to acyclicity. In addition, several equivalent characterizations of the class in terms of graphs and hypergraphs are given, and a simple algorithm for determining acyclicity is presented. Also given are several equivalent characterizations of those sets M of multivalued dependencies such that M is the set of multivalued dependencies that are the consequences of a given join dependency. Several characterizations for a conflict-free ( in the sense of Lien) set of multivalued dependencies are provided.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems; database systems relational model graph theory", } @Article{Fagin:1983:DAH, author = "Ronald Fagin", title = "Degrees of Acyclicity for Hypergraphs and Relational Database Schemes", journal = j-J-ACM, volume = "30", number = "3", pages = "514--550", month = jul, year = "1983", CODEN = "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 = "Database schemes can be viewed as hypergraphs. A class of `acyclic' database schemes was recently introduced. A number of basic desirable properties of database schemes have been shown to be equivalent to acyclicity. This shows the naturalness of the concept. However, unlike the situation for ordinary, undirected graphs, there are several natural, nonequivalent motions of acyclicity for hypergraphs (and hence for database schemes). Various desirable properties of database schemes are considered and it is shown that they fall into several equivalence classes, each completely characterized by the degree of acyclicity of the scheme. The results are also of interest from a purely graph-theoretic viewpoint. The original notion of acyclicity has the counterintuitive property that a subhypergraph of an acyclic hypergraph can be cyclic. This strange behavior does not occur for the new degrees of acyclicity that are considered.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems; database systems relational model graph theory", } @Article{Gusfield:1983:PCC, author = "Dan Gusfield", title = "Parametric Combinatorial Computing and a Problem of Program Module Distribution", journal = j-J-ACM, volume = "30", number = "3", pages = "551--563", month = jul, year = "1983", CODEN = "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 = "A general parameteric computing method that works well for a large class of combinatorial problems is presented. The method is illustrated by solving a problem of distributing modules of a computer program between two processors. Associated with each module are processing costs on each processor, and associated with each pair of modules is a communication cost incurred by distributing the modules on different processors. The problem is to distribute the module to mimimize the total cost of comparison. Stone has solved this problem for fixed costs, and for costs of one processor varying as a function of a single parameter representing the varying load on one processor. The general parametric computing method is applied to solve the problem efficiently for costs of both processors varying as a function of two independent parameters.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical programming", } @Article{Suri:1983:RQN, author = "Rajan Suri", title = "Robustness of Queuing Network Formulas", journal = j-J-ACM, volume = "30", number = "3", pages = "564--594", month = jul, year = "1983", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:54:46 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Analytic models of queueing networks have been observed to give good results for systems which do not conform to the assumption of classical queueing theory. This has been explained to some extent by the recently proposed concept of operational analysis. However, the use of operational analysis for prediction of system performance involves a restrictive assumption, that of homogeneous service times (HST), and practical systems often deviate from HST behavior. It is shown that the main system performance measures are surprisingly insensitive to violations of the HST assumption. This further explains the robustness of analytical models for predicting performance of queueing networks. Some issues regarding the operational versus stochastic approaches are resolved, since it is claimed that the present analysis, which is carried out in the operational framework, cannot be meaningfully carried out in the stochastic framework.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Analytic models of queuing networks have been observed to give good results for systems which do not conform to the assumptions of classical queuing theory. This has been explained to some extent by the recently proposed concept of operational analysis. However, the use of operational analysis for prediction of system performance involves a restrictive assumption, that of homogeneous service times (HST), and practical systems often deviate from", classification = "922", descriptors = "Closed queueing network; operational analysis; modeling; prediction; stochastic analysis; analytical model; performance measure; inequality; reliability; sensitivity analysis", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "probability", } @Article{Raoult:1983:PNC, author = "Jean-Claude Raoult and Ravi Sethi", title = "Properties of a Notation for Combining Functions", journal = j-J-ACM, volume = "30", number = "3", pages = "595--611", month = jul, year = "1983", CODEN = "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 combinator called a pipe is proposed for combining functions in a linear order. Examples suggest that semantic rules using pipes are easy to read and understand, even for readers with little knowledge of semantics. The readability is a consequence of the operational intuition associated with pipes. The operational view is that each function connected by a pipe is handed a finite sequence of values. Each function takes zero or more argument from the right end of the sequence. The new idea is that a function may skip over some number of values before picking up its arguments. This approach is suited to expressing the consumption of operations on machine states in a programming language. Pipes allow continuation semantics to be written with direct operator: instead of the operator having to worry about its continuation, the second function in a pipe is essentially a continuation of the first. A connection is established between functions connected by pipes and more traditional continuation semantics.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages", } @Article{Clarke:1983:EAH, author = "Edmund M. {Clarke, Jr.} and Steven M. German and Joseph Y. Halpern", title = "Effective Axiomatizations of {Hoare} Logics", journal = j-J-ACM, volume = "30", number = "3", pages = "612--636", month = jul, year = "1983", CODEN = "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 a wide class of programming languages P and expressive interpretatIons I, it is shown that there exist sound and relatively complete Hoare logics for both partial-correctness and termination assertions. In fact, under mild assumptions on P and I it is shown that the assertions of the I ARE uniformly decidable in the theory of I (Th(I)) if the halting problem for P is decidable for finite interpretations. Moreover the set of true termination assertions is uniformity recursively enumerable in Th(I) even if the halting problem for P is not decidable for finite interpretations. Since total-correctness assertions coincide with termination assertions for deterministic programming languages, this last result unexpectedly suggests that good axiom systems for total correctness may exist for a wider spectrum of languages than is the case for partial correctness.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming languages", } @Article{Gati:1983:CSP, author = "Georg Gati", title = "The Complexity of Solving Polynomial Equations by Quadrature", journal = j-J-ACM, volume = "30", number = "3", pages = "637--640", month = jul, year = "1983", CODEN = "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 for infinitely many natural numbers $n$ there exist polynomials of degree $n$ with rational coefficient which are irreducible over the field of rational numbers and solvable by quadrature, and for which $n-1$ square root extractions are required in order to obtain all roots. This exponentially improves the obvious bound of $\log n$ and is also a lower bound for ruler-and-compass constructions. Furthermore, this lower bound is sharp.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical techniques", } @Article{Ibarra:1983:SEP, author = "Oscar H. Ibarra and Brian S. Leininger", title = "On the Simplification and Equivalence Problems for Straight-Line Programs", journal = j-J-ACM, volume = "30", number = "3", pages = "641--656", month = jul, year = "1983", 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{JaJa:1983:TST, author = "Joseph Ja'Ja'", title = "Time-Space Trade-Offs for Some Algebraic Problems", journal = j-J-ACM, volume = "30", number = "3", pages = "657--667", month = jul, year = "1983", CODEN = "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-space relationship of several algebraic problems is studied, using and extending previous known techniques. Several results relating the algebraic properties of a set of functions to the structure of the graph of any straight-line program that computes this set are shown. A surprising result is obtained, namely, that matrix inversion is harder than matrix multiplication in the sense that the time-space product TS is of higher order for matrix inversion. Other results are also shown.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory", } @Article{Lamport:1983:WBG, author = "L. Lamport", title = "The Weak {Byzantine} Generals Problem", journal = j-J-ACM, volume = "30", number = "3", pages = "668--676", month = jul, year = "1983", CODEN = "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", abstract = "The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fail. It is weakened by allowing them to agree upon an ``incorrect'' value if a failure occurs. The transaction commit problem for a distributed database is a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only if fewer than one-third of the processes may fail. Unlike the original problem, an approximate solution exists that can tolerate arbitrarily many failures.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital", } @Article{Xu:1983:RNR, author = "Mei-Rui Xu and John E. Doner and Ronald V. Book", title = "Refining Nondeterminism in Relativizations of Complexity Classes", journal = j-J-ACM, volume = "30", number = "3", pages = "677--685", month = jul, year = "1983", CODEN = "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 single result is a general theorem showing the existence of oracle set that allow infinite hierarchies of relativized classes to exist. The classes are specified by relativizations with bounds on the number of oracle queries. The separation between the classes in the hierarchies depends on increasing the number of nondeterminstic steps allowed by the oracle machines and used to specify the classes.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory", } @Article{Nau:1983:DQF, author = "Dana S. Nau", title = "Decision Quality As a Function of Search Depth on Game Trees", journal = j-J-ACM, volume = "30", number = "4", pages = "687--708", month = oct, year = "1983", CODEN = "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 author has developed a mathematical theory modeling the effects of search depth on a game tree on the probability of making a correct decision. In this theory, the errors made by the evaluation function are modeled as independent, identically distributed random errors superimposed on the true values of the nodes evaluated. This research has produced the surprising result that there is an infinite class of game trees for which searching deeper does not increase the probability of making a correct decision, but instead causes the decision to become more and more random. The paper contains a mathematical proof of this statement, experimental verification of it, and a discussion of its significance.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "decision theory and analysis; mathematical techniques --- Trees; systems science and cybernetics", } @Article{Hong:1983:CTO, author = "Jia-Wei Hong and Kurt Mehlhorn and Arnold L. Rosenberg", title = "Cost Trade-offs in Graph Embeddings, with Applications", journal = j-J-ACM, volume = "30", number = "4", pages = "709--728", month = oct, year = "1983", CODEN = "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 embedding of the graph $G$ in the graph $H$ is a one-to-one association of the vertices of $G$ with the vertices of H. There are two natural measures of the cost of a graph embedding, namely, the dilation-cost of the embedding: the maximum distance in $H$ between the images of vertices that are adjacent in G; and the expansion-cost of the embedding: the ratio of the size of $H$ to the size of $G$. The main result of this paper illustrate three situations wherein one of these cost can be minimized only at the expense of a dramatic increase in the other cost.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical techniques", } @Article{Wigderson:1983:IPG, author = "Avi Wigderson", title = "Improving the Performance Guarantee for Approximate Graph Coloring", journal = j-J-ACM, volume = "30", number = "4", pages = "729--735", month = oct, year = "1983", CODEN = "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 = "The performance guarantee of a graph coloring algorithm is the worst case ratio between the number of colors it uses on the input graph and the chromatic number of this graph. The previous best known polynomial-time algorithm had a performance guarantee $O(n/\log n)$ for graphs on $n$ vertices. This result stood unchallenged for eight years. This paper presents an efficient algorithm with performance guarantee of $O(n(\log \log n)^2/(\log n)^2)$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A modified successive approximation heuristic to reduce the worst case behavior of the heuristic.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "mathematical techniques", } @Article{Ibaraki:1983:DMC, author = "Toshihide Ibaraki and Hussein M. Abdel-Wahab and Tiko Kameda", title = "Design of Minimum-Cost Deadlock-Free Systems", journal = j-J-ACM, volume = "30", number = "4", pages = "736--751", month = oct, year = "1983", CODEN = "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 = "Consider a system consisting of a set of $n$ processes, $P_1$, $P_2$, \ldots{}, $P_n$, and a set of serially reusable resources of $m$ different types, $R_1$, $R_2$, \ldots{}, $R_m$. It is assumed that the system is `claim-limited,' that is, its `claim matrix' $C$, whose $(i,j)$ element $C(i,j)$ is the maximum number of units of $R_j$ that may be needed by $P_i$ at the same time, is known a priori. It is desired to design a deadlock-free system, that is, one which never deadlocks for any allocation sequence within the limits given by $C$. For $j = 1, 2, \ldots{}, m$, let $a_j$ ($> 0$) be the cost of one unit of $R_j$. An algorithm for designing a deadlock-free system with the minimum resource cost is presented. Its running time bounded by $O(c \alpha (m) + m \log m)$, where $c$ is the number of nonzero elements in $C$ and $\alpha$, is the inverse of Ackermann's function, which is very slowly growing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; database systems", } @Article{Ausiello:1983:GAF, author = "Giorgio Ausiello and Alessandro D'Atri and Domenico Sacc{\`{a}}", title = "Graph Algorithms for Functional Dependency Manipulation", journal = j-J-ACM, volume = "30", number = "4", pages = "752--766", month = oct, year = "1983", CODEN = "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-theoretic approach for the representation of functional dependencies in relational databases is introduced and applied in the construction of algorithms for manipulating dependencies. This approach allows a homogeneous treatment of several problems (closure, minimization, etc.), which leads to simpler proofs and, in some cases, more efficient algorithms than in the current literature.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; database systems; mathematical techniques --- Graph Theory", } @Article{Goodman:1983:SCT, author = "Nathan Goodman and Oded Shmueli", title = "Syntactic Characterization of Tree Database Schemas", journal = j-J-ACM, volume = "30", number = "4", pages = "767--786", month = oct, year = "1983", CODEN = "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 = "Tree schemas are database schemas with a simple, treelike structure. This paper provides several characterizations of tree schemas. It is proved that cyclic (i.e., nontree) schemas are built from simple building blocks, called Arings and Acliques; these play a role in the theory analogous to the role of simple cycles in graph theory. It is proved that a schema is a tree schema if and only if it is a conformal hypergraph and a natural graph representation (the 2-section) is chordal. Indeed, conformality is equivalent to the absence of Acliques, and chordality is equivalent to the absence of Arings. The present characterizations are also related to ones that appear elsewhere: acyclic hypergraphs, Graham reductions, the running intersection property, and maximal weight qual trees.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems", } @Article{Kedem:1983:LPE, author = "Zvi M. Kedem and Abraham Silberschatz", title = "Locking Protocols: {From} Exclusive to Shared Locks", journal = j-J-ACM, volume = "30", number = "4", pages = "787--804", month = oct, year = "1983", CODEN = "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", abstract = "This paper is concerned with the problem of developing a family of locking protocols which employ both SHARED and EXCLUSIVE locks and which ensure the consistency of database systems that are accessed concurrently by a number of asynchronously running transactions. First, a general result concerning extensions of all protocols that employ EXCLUSIVE locks only to also employ SHARED locks is presented. Then a family of protocols applicable to database systems that are modeled by directed acyclic graphs is presented.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database concurrency control; database systems", } @Article{Larson:1983:AUH, author = "Per-{\AA}ke Larson", title = "Analysis of Uniform Hashing", journal = j-J-ACM, volume = "30", number = "4", pages = "805--819", month = oct, year = "1983", CODEN = "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.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Uniform hashing or random probing is often used as a theoretical model of certain types of hashing schemes based on open addressing, and, in particular, of double hashing. Earlier analyses of uniform hashing are extended here to multirecord buckets. Three different situations are analysed: initial loading assuming uniform access frequencies, frequency loading assuming nonuniform access frequencies, and the dynamic behavior when insertions and deletions occur. Simple `closed' formulas cannot be found, but numerical results are readily computed. For larger bucket sizes the retrieval performance is significantly better than that of linear probing and separate chaining. Hence double hashing and similar techniques are competitive alternatives also for organizing externally stored files.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data processing; performance modelling", } @Article{Krevner:1983:ITS, author = "Yael Krevner and Amiram Yehudai", title = "An Iteration Theorem for Simple Precedence Languages", journal = j-J-ACM, volume = "30", number = "4", pages = "820--833", month = oct, year = "1983", CODEN = "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 iteration theorem for simple precedence languages is presented. The theorem is then used to prove very easily that certain languages are not simple precedence. In addition, a strong characterization of simple precedence languages is established. This is obtained by analyzing a nontrivial family of languages that includes typical languages which are not simple precedence languages and some similar languages which are in fact simple precedence. The iteration theorem is then generalized to deal with certain families of extended precedence languages. Using this theorem, it is shown that none of the languages proved to be nonsimple precedence is uniquely invertible (l, k) precedence for any $k$ greater than equivalent to 1.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory", } @Article{Hajek:1983:PFT, author = "Bruce Hajek", title = "The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks", journal = j-J-ACM, volume = "30", number = "4", pages = "834--851", month = oct, year = "1983", CODEN = "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/1983.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is shown that among all arrival process (not necessarily stationary or renewal type) for an exponential server queue with specified arrival and service rates, that the arrival process which minimizes the average delay and related quantities is the process with constant interarrival times. The proof is based on a convexity property of exponential server queues which is of independent interest. The folk theorem provides a lower bound, which is readily computable by existing methods, to the average delay in a network of queues under rather general routing disciplines. A sharper lower bound on average delay is provided for the special case of Generalized Round Robin routing for a Poisson arrival process.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "It is show that among all arrival processes (not necessarily stationary or renewal type) for an exponential server queue with specified arrival and service rates, that the arrival process which minimizes the average delay and related quantities is the process with constant interarrival times. The proof is based on a convexity property of exponential server queues which is of independent interest. The folk theorem provides a lower bound, which \ldots{}.", classification = "723; 922", descriptors = "G/M/1; D/M/1; lower bound; time in system; expectation; queueing network; routing algorithm; packet switching; round robin", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks; probability", } @Article{Megiddo:1983:APC, author = "Nimrod Megiddo", title = "Applying Parallel Computation Algorithms in the Design of Serial Algorithms", journal = j-J-ACM, volume = "30", number = "4", pages = "852--865", month = oct, year = "1983", CODEN = "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/83.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is shown that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A unified framework for cases like this is presented. Particular cases provide motivation for examining parallelism in sorting, selection, minimum-spanning-tree, shortest route, max-flow, and matrix multiplication problems, as well as in scheduling and locational problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "binary search; computer programming --- Algorithms; computer systems, digital; design of algorithms; parallel computation", } @Article{Shostak:1984:DCT, author = "Robert E. Shostak", title = "Deciding Combinations of Theories", journal = j-J-ACM, volume = "31", number = "1", pages = "1--12", month = jan, year = "1984", CODEN = "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 given for deciding formulas in combinations of unquantified first-order theories. Rather than coupling separate decision procedures for the contributing theories, the method makes use of a single, uniform procedure that minimizes the code needed to accommodate each additional theory. It is applicable to theories whose semantics can be encoded within a certain class of purely equational canonical form theories that is closed under combination. Examples are given from the equational theories of integer and real arithmetic, a subtheory of monadic set theory, the theory of cons, car, and cdr, and others. A discussion of the speed performance of the procedure and a proof of the theorem that underlies its completeness are also given. The procedure has been used extensively as the deductive core of a system for program specification and verification.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; computer programming --- Theory", } @Article{Hoover:1984:BFL, author = "H. J. Hoover and M. M. Klawe and N. J. Pippenger", title = "Bounding Fan-out in Logical Networks", journal = j-J-ACM, volume = "31", number = "1", pages = "13--18", month = jan, year = "1984", CODEN = "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 = "Algorithms are presented which modify logical networks of bounded fan-in to obtain functionally equivalent networks of bounded fan-in and fan-out, so that both size and depth are not increased by more than constant factors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "logic circuits", } @Article{Eades:1984:SHP, author = "Peter Eades and Michael Hickey and Ronald C. Read", title = "Some {Hamilton} Paths and a Minimal Change Algorithm", journal = j-J-ACM, volume = "31", number = "1", pages = "19--29", month = jan, year = "1984", CODEN = "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 graphs whose vertices represent certain combinatorial configurations and whose edges represent minimal changes is defined. A Hamilton path through such a graph indicates the existence of a minimal change algorithm for generating the configurations. Necessary and sufficient conditions for the existence of Hamilton paths are given for this class of graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; mathematical techniques", } @Article{Beeri:1984:SAR, author = "Catriel Beeri and Martin Dowd and Ronald Fagin and Richard Statman", title = "On the Structure of {Armstrong} Relations for Functional Dependencies", journal = j-J-ACM, volume = "31", number = "1", pages = "30--46", month = jan, year = "1984", CODEN = "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 Armstrong relation for a set of functional dependencies (FDs) is a relation that satisfies each FD implied by the set but no FD that is not implied by it. The structure and size (number of tuples) of Armstrong relations are investigated. Upper and lower bounds on the size of minimal-sized Armstrong relations are derived, and upper and lower bounds on the number of distinct entries that must appear in an Armstrong relation are given. It is shown that the time complexity of finding an Armstrong relation, given a set of functional dependencies, is precisely exponential in the number of attributes. Also shown is the falsity of a natural conjecture which says that almost all relations obeying a given set of FDs are Armstrong relations for that set of FDs. Finally, Armstrong relations are used to generalize a result, obtained by Demetrovics using quite complicated methods, about the possible sets of keys for a relation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems relational model", } @Article{Henschen:1984:CQR, author = "Lawrence J. Henschen and Shamim A. Naqvi", title = "On Compiling Queries in Recursive First-Order Databases", journal = j-J-ACM, volume = "31", number = "1", pages = "47--85", month = jan, year = "1984", CODEN = "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 first-order database is defined as a function-free, first-order theory in which the ground units serve as the extensional database and the proper nonlogical axioms serve as the intensional database. The following problem is addressed: ``Given a recursive nonlogical axiom and the form of a potential query, can one describe a set of database retrieval requests that gives the correct answers and is guaranteed to terminate.'' The solution uses resolution-proof techniques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a well-defined termination condition.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "stable linear rules permit transitive closure to be compiled.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; database systems; database systems logic artificial intelligence recursion; languages; logic and databases; logic program compilation; recursively defined relations; theory", } @Article{Lazar:1984:OFC, author = "Aurel A. Lazar", title = "Optimal Flow Control of an {M/M/m} Queue", journal = j-J-ACM, volume = "31", number = "1", pages = "86--98", month = jan, year = "1984", CODEN = "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 optimal flow control of an M/M/m queuing system in equilibrium is investigated. The rate of the Poisson input process to the system is controlled so as to maximize the throughput of the queue subject to a constraint that the average time delay not exceed a specified value $T$. The optimum control is shown to be a window type mechanism (bang-bang control). The input rate lambda and the window size L, the maximum number of packets in transit within the system, are determined as explicit functions of the maximum tolerated time delay $T$, the maximum input capacity to the queue $c$, the service rate $\mu$, and the number of servers $m$. The throughput as a function of the time delay for the M/M/m system is then discussed. These results are relevant to operating system performance.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability", } @Article{Feit:1984:FAT, author = "Sidnie Dresher Feit", title = "A Fast Algorithm for the Two-Variable Integer Programming Problem", journal = j-J-ACM, volume = "31", number = "1", pages = "99--113", month = jan, year = "1984", CODEN = "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 solves any two-variable integer programming problem is presented. A constant word-length model for the data is assumed. The complexity for a problem with m constraints and word length of $L$ digits is bounded by the maximum of two values. The first, which is $O(m\log m)$ steps, is a bound on the complexity of finding the convex region bounded by the constraints, each step being an arithmetic operation or a compare. The second, which is $O(mL)$ steps, is the complexity of solving $m$ greatest-common-divisor problems. The algorithm finds a minimal binding set of constraints for any given problem, in addition to finding the solution set. A new method of solving three constraint problems is introduced.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; mathematical programming", } @Article{Megiddo:1984:LPL, author = "Nimrod Megiddo", title = "Linear Programming in Linear Time When the Dimension Is Fixed", journal = j-J-ACM, volume = "31", number = "1", pages = "114--127", month = jan, year = "1984", CODEN = "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 demonstrated that the linear programming problem in d variables and $n$ constraints can be solved in $O(n)$ time when d is fixed. This bound follows from a multidimensional search technique which is applicable for quadratic programming as well. There is also developed an algorithm that is polynomial in both $n$ and d provided d is bounded by a certain slowly growing function of $n$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "design of algorithms; genuinely polynomial time; linear programming; linear time algorithms; mathematical programming, linear; multidimensional search; prune-and-search; quadratic programming; smallest ball problem; worst-case analysis", } @Article{Boxma:1984:PFS, author = "O. J. Boxma and F. P. Kelly and A. G. Konheim", title = "The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues", journal = j-J-ACM, volume = "31", number = "1", pages = "128--133", month = jan, year = "1984", CODEN = "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/1984.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Consider a closed cyclic queuing system consisting of M exponential queues. The Laplace--Stieltjes transform of the joint distribution of the consecutive sojourn times of a customer at the M queues is determined and shown to have a product form. The proof is based on a reversibility argument. These results are relevant to operating systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Consider a closed cyclic queuing system consisting of $m$ exponential queues. The Laplace--Stieltjes transform of the distribution of the consecutive sojourn times of a customer at the $m$ queues is determined and shown to have a product from. The proof is based on a reversibility argument.", classification = "723; 922", descriptors = "Queueing system; multiqueue; loop queue; time in system; product form; network; reversibility", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability", } @Article{Simon:1984:PQF, author = "B. Simon", title = "Priority Queues with Feedback", journal = j-J-ACM, volume = "31", number = "1", pages = "134--149", month = jan, year = "1984", CODEN = "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/1983.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A priority queuing system in which a customer can feed back and change priority after being served is analyzed. More exactly, there are $c$ customer types. Customer type $i$ feeds back after service $N(i) - 1$ times. The $k$th time a type $i$ customer is in the queue it has priority level $f(i, k)$ and requires a service time with arbitrary distribution $G_{i_k}$. Type $i$ customers enter from outside as a Poisson process with rate $\lambda_i$ and can be either preemptive or nonpreemptive. A customer who has been preempted must start service over from the beginning with a new (independently chosen) service time. The analysis gives mean waiting times for each customer type at each stage in its itinerary, the mean number of each customer type in the system, and other quantities of interest. It is also shown that bulk arrivals and branching can be included in the model without substantially changing the form of the solution. These results are relevant to operating systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A priority queuing system in which a customer can feed back and change priority after being served is analyzed. More exactly, there are $c$ customer types. Customer type $i$ feeds back after service $n(i)-1$ times. The $k$-th time a type $i$ customer is in the queue it has priority level $f(i,k)$ and requires a service time with arbitrary distribution $g(i,k)$. Type $i$ customer enter from outside as a Poisson process with rate $\lambda(i)$ and can be either preemptive \ldots{}.", classification = "723; 922", descriptors = "Queueing system; M/G/1; priority; feedback; waiting time; queue length", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; probability", } @Article{JaJa:1984:ITD, author = "J. Ja'Ja' and V. K. {Prasanna Kumar}", title = "Information Transfer in Distributed Computing with Applications to {VLSI}", journal = j-J-ACM, volume = "31", number = "1", pages = "150--162", month = jan, year = "1984", CODEN = "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 = "Simple general lower bound techniques are developed for measuring the amount of interprocessor communication required in distributed computing. Optimal bounds are shown for many problems, such as integer multiplication, integer division, matrix squaring, matrix inversion, solving a linear system of equations, and computing square roots. Using these techniques, one can unify and strengthen the area-time trade-off results known in the literature. Many new trade-off results are also shown in several of the existing models. The relationship between information transfer as defined here and the chip complexity of the corresponding problem is discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "713; 714; 722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; integrated circuits, VLSI", } @Article{Smith:1984:RTA, author = "Douglas R. Smith", title = "Random Trees and the Analysis of Branch and Bound Procedures", journal = j-J-ACM, volume = "31", number = "1", pages = "163--188", month = jan, year = "1984", CODEN = "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 procedures are the most efficient known means for solving many NP-hard problems. A special class of branch and bound procedures called relaxation-guided procedures is presented. While for some branch and bound procedures a worst-case complexity bound is known, the average case complexity is usually unknown, despite the fact that it may give more useful information about the performance of the algorithm. A random process which generates labeled trees is introduced as a model of the kind of trees that a relaxation-guided procedure generates over random instances of a problem. Results concerning the expected time and space complexity of searching these random trees are derived with respect to several search strategies. The best-bound search strategy is shown to be optimal in both time and space. These results are illustrated by data from random traveling salesman instances. Evidence is presented that the asymmetric traveling salesman problem can be solved exactly in time $O(n^3\ln(n))$ on the average.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming", } @Article{Gottlieb:1984:CRP, author = "Allan Gottlieb and Clyde P. Kruskal", title = "Complexity Results for Permuting Data and Other Computations on Parallel Processors", journal = j-J-ACM, volume = "31", number = "2", pages = "193--209", month = apr, year = "1984", CODEN = "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 a wide class of problems, we obtain lower bounds for algorithms executed on certain parallel processors. These bounds show that for sufficiently large problems many known algorithms are optimal. The central result of the paper is the following sharper lower bound for permutation algorithms. Any permutation algorithm for $N$ data items on a $P$ processor parallel machine without shared memory requires time on the order of $N$ $\log_k P / P$, where $K$ is the maximum number of processors directly connected to a single processor. In particular, a speedup on the order of $P$ is impossible if $K$ is bounded.", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, Courant Inst, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; complexity; computer programming; computer systems, digital --- Parallel Processing; lower bounds; parallel computation; shuffle-exchange machine", } @Article{Hull:1984:FSI, author = "Richard Hull", title = "Finitely Specifiable Implicational Dependency Families", journal = j-J-ACM, volume = "31", number = "2", pages = "210--226", month = apr, year = "1984", CODEN = "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 = "An implicational dependency (ID) family is a family of relational database instances consisting of all instances that satisfy a given set of IDs. It is known that the collection of ID families is closed under projection [10]. It is shown here that this collection is also closed under join. An ID family is finitely specifiable if it can be defined using a finite set of IDs. It is shown here that the collection of finitely specifiable ID families and also several natural subclasses of this collection are not closed under projection or join. These results suggest that the direct application of IDs as an integrity-checking mechanism for user views may not be appropriate.", acknowledgement = ack-nhfb, affiliation = "Univ of Southern California, Henry Salvatori Computer Science Cent, Los Angeles, CA, USA", affiliationaddress = "Univ of Southern California, Henry Salvatori Computer Science Cent, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "database approach, derivation of dependencies in views", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database dependencies; database systems; dependency families; finite specifiability; relational databases; relational operators", } @Article{Yannakakis:1984:SL, author = "Mihalis Yannakakis", title = "Serializability by Locking", journal = j-J-ACM, volume = "31", number = "2", pages = "227--244", month = apr, year = "1984", CODEN = "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 = "The power of locking as a primitive for controlling concurrency in database systems is examined. It is accepted that the concurrent execution (or schedule) of different transactions must be serializable; that is, it must behave like a serial schedule, one in which the transactions run one at a time. It is shown that locking cannot achieve the full power of serializability. An exact characterization of the schedules that can be produced if locking is used to control concurrency is given for two versions of serializability. In the first one, state serializability, only the effect of the schedule on the database is taken into account. In the second one, view serializability, the view of the data received by the transactions is also taken into account. We show that it is possible to determine efficiently whether the transactions in a given set can be permitted to run safely by themselves without the need of any control while ensuring view serializability, although the problem is NP-complete in the case of state serializability.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; concurrency control; database systems; locking; safety; serializability; theory", } @Article{Tarjan:1984:WCA, author = "Robert E. Tarjan and Jan {van Leeuwen}", title = "Worst-Case Analysis of Set Union Algorithms", journal = j-J-ACM, volume = "31", number = "2", pages = "245--281", month = apr, year = "1984", CODEN = "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 analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression for maintaining a collection of disjoint sets under union. We show that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas several other methods, including one proposed by Rem and advocated by Dijkstra, are slower than the best methods.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; computer programming; data processing --- Data Structures; graph algorithms; set union algorithms; worst-case analysis", } @Article{Culik:1984:SEP, author = "Karel {Culik, II} and Tero Harju", title = "The $\omega$-Sequence Equivalence Problem for {D0L} Systems Is Decidable", journal = j-J-ACM, volume = "31", number = "2", pages = "282--298", month = apr, year = "1984", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 11:32:26 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The following problem is shown to be decidable. Given are homomorphisms $h_1$ and $h_2$ from $\Sigma*$ to $\Sigma*$ and strings $\sigma_1$ and $\sigma_2$ over $\Sigma$ such that $h_i^n(\sigma_i)$ is a proper prefix of $h_i^n(\sigma_i)$ for $i = 1, 2$ and all $n \leq 0$; that is, for $i = 1, 2$, $h_i$ generates from $\sigma_i$ an infinite string $\alpha_i$ with prefixes $h_i^n(\sigma_i)$ for all $n \geq 0$. Test whether $\alpha_1 = \alpha_2$. From this result easily follows the decidability of limit language equivalence (omega-equivalence) for D0L systems.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "$l$-systems; automata theory; D0L systems; decidability; Formal Languages; morphisms; parallel rewriting systems", } @Article{Hunt:1984:TTM, author = "H. B. {Hunt III}", title = "Terminating {Turing} Machine Computations and the Complexity and\slash or Decidability of Correspondence Problems, Grammars, and Program Schemes", journal = j-J-ACM, volume = "31", number = "2", pages = "299--318", month = apr, year = "1984", CODEN = "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 natural decision problems are presented: one for correspondence problems and linear context-free grammars, one for arbitrary context-free grammars, and one for program schemes. Each of these three decision problems, although decidable, is shown to be of nonrecursive complexity. The complexities of these three decision problems are shown to easily imply nonrecursive lower bounds on the complexities of wide classes of decision problems for their respective structures. As corollaries, a number of new nonrecursive lower complexity bounds, undecidability results, and relative economy of description results are obtained for these structures. In addition, several decidable decision problems and effective procedures in the literature are shown to be of nonrecursive complexity.", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Computer Science Dep, Albany, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory; complexity; context-free grammars; decidability; program schemes; Turing Machines", } @Article{Clenshaw:1984:BFP, author = "C. W. Clenshaw and F. W. J. Olver", title = "Beyond Floating Point", journal = j-J-ACM, volume = "31", number = "2", pages = "319--328", month = apr, year = "1984", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/62.322429", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "65G05", MRnumber = "819 141", 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/fparith.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A new number system is proposed for computer arithmetic based on iterated exponential functions. The main advantage is to eradicate overflow and underflow, but there are several other advantages and these are described and discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Lancaster, Dep of Mathematics, Lancaster, Engl", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer arithmetic; computer metatheory; error analysis; mathematical techniques --- Digital Arithmetic; overflow; rounding error; underflow", } @Article{Trojan:1984:LBF, author = "George M. Trojan", title = "Lower Bounds and Fast Algorithms for Sequence Acceleration", journal = j-J-ACM, volume = "31", number = "2", pages = "329--335", month = apr, year = "1984", CODEN = "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 = "Tight upper and lower bounds are obtained for sequence accelerating. The lower bounds follow from a powerful asymptotic adversary principle. Algorithms are presented and shown to be almost optimal.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Ontario, Dep of Physics, London, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; computer programming; lower bounds; sequence acceleration; upper bounds", } @Article{Rock:1984:TMN, author = "Hans R{\"{o}}ck", title = "The Three-Machine No-Wait Flow Shop Is {NP}-Complete", journal = j-J-ACM, volume = "31", number = "2", pages = "336--345", month = apr, year = "1984", CODEN = "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 three-machine, minimum makespan, permutation flow shop with no wait in process is shown to be NP-hard in the strong sense. This settles a well-known open question in scheduling theory.", acknowledgement = ack-nhfb, affiliationaddress = "Technische Univ Berlin, Fachbereich Informatik, Berlin, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "912; 913", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "np-completeness; operations research; scheduling --- Theory; three-machine no-wait flow shop", } @Article{McKenna:1984:AEI, author = "J. McKenna and Debasis Mitra", title = "Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed {Markovian} Networks", journal = j-J-ACM, volume = "31", number = "2", pages = "346--360", month = apr, year = "1984", CODEN = "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/1984.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A method for calculating the first and higher order moments of the queue lengths for each customer class at each node in a closed Markovian queuing network is presented. The method is based on asymptotic expansions in powers of $N^{-1}$ for the moments of interest. $N$ is a parameter that reflects the size of the network. The derivation of the asymptotic expansions presented here is based on the techniques developed by us earlier to get asymptotic expansions in powers of $N^{-1}$ of the mean utilization of each processor by each class of customers. These expansions are valid in the `normal usage' case in which none of the processors are too heavily utilized. These expansions are particularly useful in the case of large networks with many classes of customers, each class having many customers. With these expansions, we are able to analyze very large networks that earlier were computationally intractable.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "In this paper a method for calculating the first and higher order moments of the queue lengths for each customer class at each node in a closed Markovian queuing network is presented. The method is based on asymptotic expansions in powers of $n-1$ for the moments of interest. $n$ is a parameter that reflects the size of the network\ldots{}", classification = "922", descriptors = "Time sharing; closed queueing network; exponential queueing network; Markov process; bibliography; product form; normalization constant; partition function", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "asymptotic expansions; closed Markovian networks; integral representations; moment of queue lengths; probability; Queueing Theory", } @Article{Adachi:1984:SCG, author = "Akeo Adachi and Shigeki Iwata and Takumi Kasai", title = "Some Combinatorial Game Problems Require ${\Omega}(n^k)$ Time", journal = j-J-ACM, volume = "31", number = "2", pages = "361--376", month = apr, year = "1984", CODEN = "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 first `natural' languages are established as solvable in deterministic polynomial time, for the recognition of which polynomial-time lower bounds can be shown. The $k$-pebble game problem is to determine whether the first player has a forced win in the pebble game using only $k$ pebbles. The main results of this paper is that the $k$-pebble game problem requires $\Omega(n^{(k - 1)^4} - \epsilon)$ time for its recognition on multitape Turing machines for any epsilon greater than $0$. The problem is solvable in deterministic polynomial time. Then we consider other combinatorial game problems that also have nontrivial polynomial deterministic lower time bounds.", acknowledgement = ack-nhfb, affiliationaddress = "IBM Japan Ltd, Science Inst, Toky, Jpn", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "$k$-pebble game problem; automata theory; combinatorial game problems; computational complexity; mathematical techniques --- Combinatorial Mathematics; polynomial-time lower bounds; Turing Machines", } @Article{JaJa:1984:VCS, author = "Joseph Ja'Ja'", title = "The {VLSI} Complexity of Selected Graph Problems", journal = j-J-ACM, volume = "31", number = "2", pages = "377--391", month = apr, year = "1984", CODEN = "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 = "General lower bound techniques are developed to determine the VLSI complexity of graph problems with some surprising results that show a striking difference between this class of problems and the other classes studied in the literature. The results show that the VLSI complexity of graph problems depends crucially on several parameters such as the I/O formats, the locations of the I/O ports, and the timing of the I/O bits. Almost all of our lower bounds can be matched with existing upper bounds or bounds obtained by some minor modifications of existing algorithms.", acknowledgement = ack-nhfb, affiliationaddress = "Pennsylvania State Univ, University Park, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Graph Theory; integrated circuits, VLSI; mathematical techniques; VLSI complexity", } @Article{Papadimitriou:1984:CUS, author = "Christos H. Papadimitriou", title = "On the Complexity of Unique Solutions", journal = j-J-ACM, volume = "31", number = "2", pages = "392--400", month = apr, year = "1984", CODEN = "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 = "We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for $\Delta_2^p$.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Dep of Computer Science, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "complexity; mathematical programming; operations research; traveling salesman problem", } @Article{Reif:1984:SC, author = "John H. Reif", title = "Symmetric Complementation", journal = j-J-ACM, volume = "31", number = "2", pages = "401--421", month = apr, year = "1984", CODEN = "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 introduces a new class of games called symmetric complementing games. These games are interesting since their related complexity classes include many well-nown graph problems: Finding minimum spanning forests; $k$-connectivity and $k$-blocks; and recognition of chordal graphs, comparability graphs, interval graphs, split graphs, permutation graphs, and constant valence planar graphs. For these problems probabilistic sequential algorithms requiring simultaneously logarithmic space and polynomial time are given. Furthermore, probabilistic parallelism algorithms requiring simultaneously logarithmic time and a polynomial number of processors are also given.", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Aiken Computation Lab, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; Graph Theory; mathematical techniques; probabilistic algorithms; symmetric complementation", } @Article{Savage:1984:STT, author = "John E. Savage", title = "Space-Time Trade-Offs for Banded Matrix Problems", journal = j-J-ACM, volume = "31", number = "2", pages = "422--437", month = apr, year = "1984", CODEN = "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 = "Trade-offs between space and time provide important information on the simultaneous use of these resources. They have been studied most successfully using Grigoryev method, which leads to lower bounds on the space-time product for certain models of computation. In this paper, we generalize the model to which the Grigoryev method applies and derive space-time lower bounds for banded matrix multiplication and inversion, and for the solution of a set of banded equations. We also investigate full matrix inversion and several other problems. The new computational model consists of algorithms on finite-state machine with the proviso that input and output are done at times that are data independent. Space is measured by the logarithm of the number of states in the machine, and time is measured by the number of cycles in which input and\slash or output is done. We show that standard algorithms for the multiplication of $p \times p$ matrices of bandwidth $b$, and for the inversion of such matrices when b equals 106 (p) are optimal to within multiplicative factors. Good algorithms are also presented for the solution of a set of banded equations and for banded matrix inversion.", acknowledgement = ack-nhfb, affiliationaddress = "Brown Univ, Dep of Computer Science, Providence, RI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; banded matrix problems; computer programming; mathematical techniques --- Matrix Algebra; space-time trade-offs", } @Article{Boyer:1984:MPU, author = "Robert S. Boyer and J. Strother Moore", title = "A Mechanical Proof of the Unsolvability of the Halting Problem", journal = j-J-ACM, volume = "31", number = "3", pages = "441--458", month = jul, year = "1984", CODEN = "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 proof by a computer program of the unsolvability of the halting problem is described. The halting problem is posed in a constructive, formal language. The computational paradigm formalized is Pure LISP, not Turing machines. The machine was led to the proof by the authors, who suggested certain function definitions and stated certain intermediate lemmas. The machine checked to ascertain that every suggested definition was admissible and the machine proved the main theorem and every lemma. It is believed this is the first instance of a machine checking that a given problem is not solvable by machine.", acknowledgement = ack-nhfb, affiliation = "Univ of Texas at Austin, Inst for Computing Science \& Computer Applications, Austin, TX, USA", affiliationaddress = "Univ of Texas at Austin, Inst for Computing Science \& Computer Applications, Austin, TX, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory --- Formal Languages; automatic theorem proving; computer metatheory; computer programming languages --- lisp; halting problem; program verification; Programming Theory", } @Article{Gurevich:1984:SNH, author = "Yuri Gurevich and Larry Stockmeyer and Uzi Vishkin", title = "Solving {NP}-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems", journal = j-J-ACM, volume = "31", number = "3", pages = "459--473", month = jul, year = "1984", CODEN = "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 general technique is described for solving certain NP-hard graph problems in time that is exponential in a parameter $k$ defined as the maximum, over all nonseparable components C of the graph, of the number of edges that must be added to a tree to produce C; for a connected graph, $k$ is no more than the number of edges of the graph minus the number of vertices plus one. The technique is illustrated in detail for the following facility location problem: Given a connected graph G$(V, E)$ such that each edge has an associated positive integer length and given a positive integer $r$, place the minimum number of centers on points of the graph such that every point of the graph is within distance r from some center (a `point' is either a vertex or a point on some edge). An algorithm is given. A parallel implementation of the algorithm, with optimal speedup over the sequential version for a fairly wide range for the number of processors, is presented.", acknowledgement = ack-nhfb, affiliation = "Univ of Michigan, Dep of Computer \& Communication Sciences, Ann Arbor, MI, USA", affiliationaddress = "Univ of Michigan, Dep of Computer \& Communication Sciences, Ann Arbor, MI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 912; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; computer systems, digital --- Parallel Processing; facility location problems; Graph Theory; mathematical techniques; np-hard problems; operations research; parallel algorithms", } @Article{Baccelli:1984:EEA, author = "Fran{\c{c}}ois Baccelli and Erol Gelenbe and Brigitte Plateau", title = "An End-to-End Approach to the Resequencing Problem", journal = j-J-ACM, volume = "31", number = "3", pages = "474--485", month = jul, year = "1984", CODEN = "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/1984.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The resequencing or serialization problem is of basic interest in distributed systems and computer communication systems. This is because a flow of packets, messages, or updates entering a communication system in chronological order from the same port or from different ports may be disordered. The receiving port must then ensure that these objects are resequenced in the appropriate order before they are fed to the output of the system. In this paper we analyze the end-to-end delay incurred by objects traversing such a system, including the disordering delay, the delay introduced by the resequencing algorithm, and the delay due to the output server at the receiving port. The analysis is carried out via factorization methods.", acknowledgement = ack-nhfb, affiliationaddress = "Inst Natl de Recherche en Informatique et en Automatique, Le Chesnay, Fr", ajournal = "J. Assoc. Comput. Mach.", annote = "The resequencing or serialization problem is of basic interest in distributed systems and computer communication systems. This is because a flow of packets, messages, or updates entering a communication system in chronological order from the same port or from different ports may be disordered. The receiving port must then ensure that these objects are resequenced in the appropriate order before they are fed to the output of the system. \ldots{}.", classification = "722; 723; 922", descriptors = "Packet switching; performance evaluation; analytical model; consistency control; serialization; resequencing", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks; computer systems, digital; consistency control; database systems --- Distributed; Distributed; packet-switching networks; performance analysis; probability --- Queueing Theory; resequencing problem; serialization", } @Article{Datta:1984:SCD, author = "Ajoy Datta and S. Ghosh", title = "Synthesis of a Class of Deadlock-Free {Petri} Nets", journal = j-J-ACM, volume = "31", number = "3", pages = "486--506", month = jul, year = "1984", CODEN = "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 Petri nets called regular nets is described. The structure of these nets guarantees liveness once the invariants are marked with tokens. Some graphical properties of invariants and variants are discussed. The concept of net labeling is introduced and a systematic method of synthesizing regular nets is presented. It is shown how the safety of such nets can be trivially assured, thus producing live and safe control structures.", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ, Dep of Computer \& Information Sciences, Columbus, OH, USA", affiliationaddress = "Ohio State Univ, Dep of Computer \& Information Sciences, Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks; computer systems, digital; deadlock-free Petri nets; Distributed", } @Article{Upfal:1984:ESP, author = "Eli Upfal", title = "Efficient Schemes for Parallel Communication", journal = j-J-ACM, volume = "31", number = "3", pages = "507--517", month = jul, year = "1984", CODEN = "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/Object/Nierstrasz.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A family of balanced communication schemes for connecting $N$ processors with only a constant number of lines entering or leaving each processor is defined. It is proved that this network topology enables a fully distributed probabilistic algorithm to execute a variety of communication requests efficiently. In particular it enables implementation of an arbitrary permutation, that is, a set of $N$ packets initially located in distinct processors and destined for distinct destinations in $O(\log_2 N)$ steps. Similar results are proved for randomly generated communication requests. These results suggest an efficient solution to a fundamental problem in the design of parallel computers.", acknowledgement = ack-nhfb, affiliation = "Hebrew Univ of Jerusalem, Inst of Mathematics \& Computer Science, Jerusalem, Isr", affiliationaddress = "Hebrew Univ of Jerusalem, Inst of Mathematics \& Computer Science, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; computer systems, digital; concurrency; network routing; parallel communication; Parallel Processing; probabilistic algorithm", } @Article{Hull:1984:FMT, author = "Richard Hull and Chee K. Yap", title = "The Format Model: a Theory of Database Organization", journal = j-J-ACM, volume = "31", number = "3", pages = "518--537", month = jul, year = "1984", CODEN = "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: ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1982, pp.205--211.", abstract = "A mathematical theory for the study of data representation in databases is introduced and developed. The theory focuses on three data constructs (collection, composition, and classification). `Formats' with semantically rich yet tractable structure are built recursively using these constructs. Using formats, we obtain several nontrivial results concerning notions of relative information capacity and restructuring of data sets. As such, the format model provides a new approach for the formal study of the construction of `user views' and other data manipulations in databases.", acknowledgement = ack-nhfb, affiliation = "Univ of Southern California, Dep of Computer Science, Los Angeles, CA, USA", affiliationaddress = "Univ of Southern California, Dep of Computer Science, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "objects as formats, in recursive hierarchies. No transforms or constants.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data processing --- Data Structures; database organization; database systems; format model; relative information capacity; semantic database models; Theory", } @Article{Fredman:1984:SST, author = "Michael L. Fredman and J{\'{a}}nos Koml{\'o}s and Endre Szemer{\'e}di", title = "Storing a Sparse Table with ${O(1)}$ Worst Case Access Time", journal = j-J-ACM, volume = "31", number = "3", pages = "538--544", month = jul, year = "1984", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:55:08 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Extends the work of Tarjan and Yao \cite{Tarjan:1979:SST}, using a two-level data structure, the first containing pointers to the second, and the second containing blocks accessible by a perfect hashing function.", abstract = "A data structure for representing a set of $n$ items from a universe of $m$ items, which uses space $n + o(n)$ and accommodates membership queries in constant time, is described. Both the data structure and the query algorithm are easy to implement.", acknowledgement = ack-nhfb, affiliation = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Science, La Jolla, CA, USA", affiliationaddress = "Univ of California, San Diego, Dep of Electrical Engineering \& Computer Science, La Jolla, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "access time; computer programming --- Algorithms; data processing; Data Structures; hashing; query algorithms; sparse tables", } @Article{Traub:1984:OSL, author = "J. F. Traub and H. Wo{\'{z}}niakowski", title = "On the Optimal Solution of Large Linear Systems", journal = j-J-ACM, volume = "31", number = "3", pages = "545--559", month = jul, year = "1984", CODEN = "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 information-based study of the optimal solution of large linear systems is initiated by studying the case of Krylov information. Among the algorithms that use Krylov information are minimal residual, conjugate gradient, Chebyshev, and successive approximation algorithms. A `sharp' lower bound on the number of matrix-vector multiplications required to compute an $\epsilon$-approximation is obtained for any orthogonally invariant class of matrices. It is shown that the minimal residual algorithm is within at most one matrix-vector multiplication of the lower bound. A similar result is obtained for the generalized minimal residual algorithm. The lower bound is computed for certain classes of orthogonally invariant matrices. How the lack of certain properties (symmetry, positive definiteness) increases the lower bound is shown. A conjecture and a number of open problems are stated.", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, Dep of Computer Science, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; conjugate gradient algorithm; Krylov information; large linear systems; lower bounds; mathematical techniques; Matrix Algebra; optimal algorithms", } @Article{Brookes:1984:TCS, author = "S. D. Brookes and C. A. R. Hoare and A. W. Roscoe", title = "A Theory of Communicating Sequential Processes", journal = j-J-ACM, volume = "31", number = "3", pages = "560--599", month = jul, year = "1984", CODEN = "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 = "A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondeterminism are fully taken into account.", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Dep of Computer Science, Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "asynchrony; communicating sequential processes; computer metatheory; computer programming languages; deadlock; liveness; mathematical models; nondeterminism; parallelism; pcalc equivalence binder (csp); safety; synchrony; Theory; theory", } @Article{McLean:1984:FMA, author = "John McLean", title = "A Formal Method for the Abstract Specification of Software", journal = j-J-ACM, volume = "31", number = "3", pages = "600--627", month = jul, year = "1984", CODEN = "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/softeng.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An intuitive presentation of the trace method for the abstract specification of software contains sample specifications, syntactic and semantic definitions of consistency and totalness, methods for proving specifications consistent and total, and a comparison of the method with the algebraic approach to specification. This intuitive presentation is underpinned by a formal syntax, semantics, and derivation system for the method. Completeness and soundness theorems establish the correctness of the derivation system with respect to the semantics, the coextensiveness of the syntactic definitions of consistency and totalness with their semantic counterparts, and the correctness of the proof methods presented. Areas for future research are discussed.", acknowledgement = ack-nhfb, affiliation = "US Naval Research Lab, Computer Science \& Systems Branch, Washington, DC, USA", affiliationaddress = "US Naval Research Lab, Computer Science \& Systems Branch, Washington, DC, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "abstract specification; computer software; formal specification; software specification; trace specification", } @Article{Hofri:1984:AIS, author = "Micha Hofri", title = "Analysis of Interleaved Storage via a Constant-Service Queuing System with {Markov}-Chain-Driven Input", journal = j-J-ACM, volume = "31", number = "3", pages = "628--648", month = jul, year = "1984", CODEN = "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/1984.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A popular means of increasing the effective rate of main storage accesses in a large computer is a multiplicity of memory modules accessible in parallel. Although such an organization usually achieves a net gain in access rate, it also creates new modes of congestion at the storage controller. This paper analyzes the variables that describe such a congestion: queue lengths and delays. A controller that maintains separate register sets to accommodate the request queue of each module is considered. The various processors attached to the storage are assumed to generate, in each memory cycle, a number of access requests with the same given distribution. The addresses specified by these requests (reduced to the module index) are further assumed to follow the states of a first-order Markov chain. The analysis then becomes one of a single-server queueing system with constant service time and indexed batch arrival process. Results are derived for several descriptors of the congestion and thus of the quality of service offered by such an organization. The aim throughout is to embody the results in a form readily suitable for numerical evaluation.", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Dep of Computer Science, Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", annote = "A popular means of increasing the effective rate of main storage accesses in a large computer is a multiplicity of memory accessible in parallel. Although such an organization usually achieves a net gain in access rate, it also creates new modes of congestion at the storage controller. This paper analyzes the variables that describe such a congestion: queue lengths and delays \ldots{}.", classification = "723; 922", descriptors = "Memory organization; performance evaluation; analytical model; GB/D/1; waiting time; interleaved memory", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "constant-service queueing system; data storage, digital; interleaved storage; probability --- Queueing Theory", } @Article{Atallah:1984:GPM, author = "Mikhail J. Atallah and S. Rao Kosaraju", title = "Graph Problems on a Mesh-Connected Processor Array", journal = j-J-ACM, volume = "31", number = "3", pages = "649--667", month = jul, year = "1984", CODEN = "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/partition.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Algorithms that run in $O(n)$ steps are given for solving a number of graph problems on an $n \times n$ array of processors. The problems considered include: finding the bridges and articulation points of an undirected graph, finding the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems.", acknowledgement = ack-nhfb, affiliation = "Johns Hopkins Univ, Dep of Electrical Engineering \& Computer Science, Baltimore, MD, USA", affiliationaddress = "Johns Hopkins Univ, Dep of Electrical Engineering \& Computer Science, Baltimore, MD, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; computer systems, digital --- Parallel Processing; graph algorithms; Graph Theory; Information processing; mathematical techniques; mesh-connected processor array; time", } @Article{MeyeraufderHeide:1984:PLS, author = "Friedhelm {Meyer auf der Heide}", title = "A Polynomial Linear Search Algorithm for the $n$-Dimensional Knapsack Problem", journal = j-J-ACM, volume = "31", number = "3", pages = "668--676", month = jul, year = "1984", CODEN = "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 search algorithm that recognizes the $n$-dimensional knapsack problem in $2 n^4 \log n + O(n^3)$ steps is presented. This algorithm works for inputs consisting of $n$ numbers for some arbitrary but fixed integer $n$. This result solves an open problem posed by Dobkin\slash Lipton and A. C. C. Yao, among others, and it destroys the hope of proving nonpolynomial lower bounds for this NP-complete problem in the model of linear search algorithms.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Frankfurt, Fachbereich Informatik, Frankfurt am Main, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "$n$-dimensional knapsack problem; Algorithms; computer programming; np-completeness; polynomial linear search algorithm", } @Article{Williamson:1984:DFS, author = "S. G. Williamson", title = "Depth-First Search and {Kuratowski} Subgraphs", journal = j-J-ACM, volume = "31", number = "4", pages = "681--693", month = oct, year = "1984", CODEN = "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$ equals $(V, E)$ be a nonplanar graph. The method of using depth-first techniques to extract a Kuratowski subgraph in time $O(|V|)$ is shown.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, San Diego, Dep of Mathematics, La Jolla, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; computer programming; depth-first search; graph algorithms; Kuratowski subgraphs; mathematical techniques --- Graph Theory", } @Article{Greene:1984:CVA, author = "Jonathan W. Greene and Abbas {El Gamal}", title = "Configuration of {VLSI} Arrays in the Presence of Defects", journal = j-J-ACM, volume = "31", number = "4", pages = "694--717", month = oct, year = "1984", CODEN = "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 penalties for configuring VLSI arrays for yield enhancement are assessed. Each element of the fabricated array is assumed to be defective with independent probability $p$. A fixed fraction $R$ of the elements are to be connected into a prespecified defect-free configuration by means of switched interconnections. The probability that this can be done, known as the yield, must be bounded away from zero. The additional interconnections required increase the integrated circuit's area by the area overhead ratio AOR. Propagation delay is determined by the maximum connection length $d$. A number of results are shown.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Information Systems Lab, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "integrated circuit manufacture; integrated circuits, VLSI; propagation delay; VLSI; yield enhancement", } @Article{Beeri:1984:PPD, author = "Catriel Beeri and Moshe Y. Vardi", title = "A Proof Procedure for Data Dependencies", journal = j-J-ACM, volume = "31", number = "4", pages = "718--741", month = oct, year = "1984", CODEN = "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 dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependencies. For total dependencies the chase is an exponential time decision procedure for the implication problem, and in some restricted cases it can be modified to run in polynomial time. For nontotal dependencies the chase is only a proof procedure. However, several cases for which it is a decision procedure are shown. It is also shown that equality is redundant for deciding implication of tuple-generating dependencies, and is `almost redundant' for deciding implication of equality-generating dependencies.", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data dependencies; database systems; proof procedure; relational databases; Theory", } @Article{Cosmadakis:1984:URV, author = "Stavros S. Cosmadakis and Christos H. Papadimitriou", title = "Updates of Relational Views", journal = j-J-ACM, volume = "31", number = "4", pages = "742--760", month = oct, year = "1984", CODEN = "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/database.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The problem of translating updates of database views is studied. View updates are disambiguated by requiring that a specified view complement (i.e., a second view that contains all the information omitted from the given view) remain constant during the translation. Some of the computational problems related to the application of this general methodology in the context of relational databases are studied. Projective views of databases that consist of a single relation and satisfy functional dependencies are emphasized. After characterizing complementary views, the authors show that finding a minimum complement of a given view is NP-complete. The problem of translating the insertion of a tuple into a view is then studied in detail, and the results are extended to the cases of deletion and replacement of a tuple. Finally, the explicit functional dependencies, a new kind of dependency that intuitively states that some part of the database information can be computed from the rest, are defined and studied.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Lab for Computer Science, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "based on constant complement criterium.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems; functional dependencies; join dependencies; relational database theory; relational databases; relational views; Theory; updates", } @Article{Imielinski:1984:IIR, author = "Tomasz Imieli{\'n}ski and Witold {Lipski, Jr.}", title = "Incomplete Information in Relational Databases", journal = j-J-ACM, volume = "31", number = "4", pages = "761--791", month = oct, year = "1984", CODEN = "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 = "This paper concerns the semantics of Codd's relational model of data. Formulated are precise conditions that should be satisfied in a semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on tables with ``null values'' of various kinds allowed. These conditions require that the system be safe in the sense that no incorrect conclusion is derivable by using a specified subset $\Omega$ of the relational operators; and that it be complete in the sense that all conclusions expressible by relational expressions using operators in $\Omega$ are in fact derivable in this system. Two such systems of practical interest are shown. The first, based on the usual Codd's null values, supports projection and selection. The second, based on many different (``marked'') null values or variables allowed to appear in a table, is shown to correctly support projection, positive selection (with no negation occurring in the selection condition), union, and renaming of attributes, which allows for processing arbitrary conjunctive queries. A very desirable property enjoyed by this system is that all relational operators on tables are performed in exactly the same way as in the case of the usual relations. A third system, mainly of theoretical interest, supporting projection, selection, union, join, and renaming, is also discussed. Under a so-called closed world assumption, it can also handle the operator of difference. It is based on a device called a conditional table and is crucial to the proof of the correctness of the second system. All systems considered allow for relational expressions containing arbitrarily many different relation symbols, and no form of the universal relation assumption is required.", acknowledgement = ack-nhfb, affiliationaddress = "Polish Acad of Sciences, Warsaw, Pol", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems; incomplete information; marked nulls; model null values; null values; query language semantics; query processing; relational algebra; Relational database; relational databases; Theory", } @Article{Bojanczyk:1984:OAN, author = "A. Boja{\'{n}}czyk", title = "Optimal Asynchronous {Newton} Method for the Solution of Nonlinear Equations", journal = j-J-ACM, volume = "31", number = "4", pages = "792--803", month = oct, year = "1984", CODEN = "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 modification of Newton's method for the solution of the equation F(x) equals 0 on a multiprocessor computer is studied. A class of asynchronous Newton methods is introduced and an optimal method in this class, as well as its optimal parallel implementation, is shown. Then the optimal asynchronous parallel method is compared with the optimal asynchronous sequential method. It turns out that no matter how many processes are used, a Newton process (in the class of asynchronous Newton methods) can be speeded up by at most a factor of 4.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warsaw, Warsaw, Pol", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "asynchronous algorithms; asynchronous newton method; computer programming --- Algorithms; computer systems, digital --- Multiprocessing; mathematical techniques; nonlinear equations; parallel algorithms", } @Article{Courtois:1984:BPE, author = "P.-J. Courtois and P. Semal", title = "Bounds for the Positive Eigenvectors of Nonnegative Matrices and for Their Approximations by Decomposition", journal = j-J-ACM, volume = "31", number = "4", pages = "804--825", month = oct, year = "1984", CODEN = "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 deals with the positive eigenvectors of nonnegative irreducible matrices that are merely characterized by a given upper bound lambda on their spectral radius and by a given matrix $L$ of lower bounds for their elements. For any such matrix, the normalized positive left (right) eigenvector is shown to belong to the polyhedron the vertices of which are given by the normalized rows (columns) of the matrix $(\lambda I - L)^{-1}$. This polyhedron is proved to be also the smallest closed convex set that is guaranteed to contain the positive left (right) normalized eigenvector; its vertices are therefore the best bounds one can obtain. These results are then used to obtain componentwise upper and lower bounds on the error that is made when the positive eigenvectors of a large nonnegative irreducible matrix have to be approximated by a block decomposition and aggregation technique. The computation of these bounds can itself be regarded as a new approximation technique, called here bounded aggregation. Finally, the particular case of stochastic matrices is analyzed and a numerical example is given.", acknowledgement = ack-nhfb, affiliationaddress = "Philips Research Lab, Brussels, Belg", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; decomposition; mathematical techniques; Matrix Algebra; nonnegative matrices; positive eigenvectors", } @Article{Calderbank:1984:OHS, author = "A. R. Calderbank and E. G. {Coffman, Jr.} and L. Flatto", title = "Optimum Head Separation in a Disk System with Two Read\slash Write Heads", journal = j-J-ACM, volume = "31", number = "4", pages = "826--838", month = oct, year = "1984", CODEN = "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 mathematical model of computer disk storage devices having two movable read\slash write heads is studied. Storage addresses are approximated by points in the continuous interval $[0,1]$, and requests for information on the disk are processed first-come-first-served. We assume that the disk heads are maintained a fixed distance d apart; that is, in processing a request, both heads are moved the same distance in the same direction. Assuming that successive requested locations are independently and uniformly distributed over $[0,1]$, we calculate the invariant measure of a Markov chain representing successive head positions under the nearer-server rule: Requests in $[0,d]$ are processed by the left head, those in $[1 - d, 1]$ by the right head, and those in $[d, 1 - d]$ by the nearer of the two heads. Our major objective is the equilibrium expected distance $E(d)$ that the heads are moved in processing a request. For the problem of designing the separation distance $d$, we show that $E(0.44657) = 0.16059 = \min_d E(d)$. Thus, a basic insight of the analysis is that a system with two heads performs more than twice as well as a system with a single head.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems --- Storage Allocation; data storage units; disk system; optimum head separation; read/write heads", } @Article{Melamed:1984:NCS, author = "Benjamin Melamed and Micha Yadin", title = "Numerical Computation of Sojourn-Time Distributions in Queuing Networks", journal = j-J-ACM, volume = "31", number = "4", pages = "839--854", month = oct, year = "1984", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:55:26 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1984.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Sojourn time distributions in queueing networks seldom possess closed-form analytical solutions. When overtaking is permitted, the sojourn times at individual anodes are usually dependent, in which case the attendant distribution is mathematically intractable. In a previous paper the authors proposed a methodology utilizing randomization procedures to approximate sojourn time distributions in arbitrary discrete-state Markovian queueing networks. This paper addresses the computational aspects of the methodology pertaining to implementation. Ways of improving the accuracy of the approximated distribution functions are also discussed.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Holmdel, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "\ldots{} In a previous paper the authors proposed a methodology utilizing randomization procedures to approximate sojourn time distributions in arbitrary discrete-state Markovian queuing networks. This paper addresses the computational aspects of the methodology pertaining to implementation. Ways of improving the accuracy of the approximated distribution functions are also discussed.", classification = "723; 921; 922", descriptors = "Exponential queueing network; queueing approximation; time in system", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; mathematical techniques --- Numerical Analysis; Performance; probability --- Queueing Theory; sojourn-time distributions", } @Article{Mitra:1984:PMD, author = "Debasis Mitra and P. J. Weinberger", title = "Probabilistic Models of Database Locking: {Solutions}, Computational Algorithms, and Asymptotics", journal = j-J-ACM, volume = "31", number = "4", pages = "855--878", month = oct, year = "1984", CODEN = "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 difficult feature in locking is the interference phenomenon, by which we mean that if a particular item in the database is locked, which is true in our model for all constituent items of all transactions undergoing processing, then all arriving transactions requiring this particular item are blocked. The interference phenomenon is exactly modeled, and exact formulas for equilibrium database performance, such as mean concurrency and throughput, and efficient algorithms for their computation, are obtained. Formulas for large databases are derived and proved to be asymptotic; this formula is insightful and found to fit well to exact solutions. The probabilistic model is a Markov process with combinatorial quantities as transition rates. This model is tractable because of the time reversibility of the equilibrium Markov process.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; concurrency; database locking; database systems; probability; serializability; Theory", } @Article{Bloniarz:1984:ASH, author = "P. A. Bloniarz and H. B. {Hunt, III} and D. J. Rosenkrantz", title = "Algebraic Structures with Hard Equivalence and Minimization Problems", journal = j-J-ACM, volume = "31", number = "4", pages = "879--904", month = oct, year = "1984", CODEN = "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 relationship between the setting in which an algebraic problem is posed and the complexity of solving the problem is considered. The problems studied are equivalence, minimization, and approximate minimization problems for formulas involving variables, parentheses, operators, and (optionally) constants. General sufficient conditions on an algebraic structure for these problems to be NP-or coNP-hard are presented. Applications are given to a number of specific algebraic structures of independent interest including lattices, semirings, regular algebras, finite fields, rings $Z_k$, and Boolean rings. Applications are also given to systems of rewrite rules and to several simple programming languages.", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Computer Science Dep, Albany, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algebraic structures; computer metatheory; computer programming languages --- Theory; hard equivalence; rewrite rules", } @Article{Pachl:1984:LBD, author = "J. Pachl and E. Korach and D. Rotem", title = "Lower Bounds for Distributed Maximum-Finding Algorithms", journal = j-J-ACM, volume = "31", number = "4", pages = "905--918", month = oct, year = "1984", CODEN = "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 establishes several lower bounds for the form $\Omega(n \log n)$ for the number of messages needed to find the maximum label in a circular configuration of $n$ labeled processes with no central controller.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Algorithms; distributed maximum-finding algorithms; lower bounds", } @Article{Bagchi:1985:TAH, author = "A. Bagchi and A. Mahanti", title = "Three Approaches to Heuristic Search in Networks", journal = j-J-ACM, volume = "32", number = "1", pages = "1--27", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2458.html", abstract = "Three different approaches to heuristic search in networks are analyzed. In the first approach, the basic idea is to choose for expansion that node for which the evaluation function has a minimum value. In the second approach, a node that is expanded once is not expanded again; instead, a `propagation' of values takes place. The third approach is an adaptation for networks of an AND\slash OR graph `marking' algorithm. Five algorithms are presented. The performances of these algorithms are compared for both admissible and inadmissible heuristics.", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Management Calcutta, Calcutta, India", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 731; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "admissible/inadmissible heuristics; algorithms; arc marking; computer networks --- Protocols; computer programming --- Algorithms; control systems --- Analysis; Heuristic Programming; heuristic search algorithms; mathematical techniques --- Graph Theory; measurement; performance; search graph; systems science and cybernetics; theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search.", } @Article{Mahanti:1985:GHS, author = "A. Mahanti and A. Bagchi", title = "{AND}/{OR} Graph Heuristic Search Methods", journal = j-J-ACM, volume = "32", number = "1", pages = "28--51", month = jan, year = "1985", CODEN = "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/database.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2459.html", abstract = "Two new marking algorithms for AND\slash OR graphs called CF and CS are presented. For admissible heuristics CS is not needed, and CF is shown to be preferable to the marking algorithms of Martelli and Montanari. When the heuristic is not admissible, the analysis is carried out with the help of the notion of the first and second discriminants of an AND\slash OR graph. It is proved that in this case CF can be followed by CS to get optimal solutions, provided the sumcost criterion is used and the first discriminant equals the second. Estimates of time and storage requirements are given. Other cost measures, such as maxcost, are also considered, and a number of interesting open problems are enumerated.", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Management Calcutta, Calcutta, India", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 731; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer networks --- Protocols; computer programming --- Algorithms; control systems --- Analysis; discriminant; Heuristic Programming; heuristic search methods; mathematical techniques --- Graph Theory; maxcost; potential solution graph; sumcost; systems science and cybernetics; theory; verification", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Lamport:1985:SCP, author = "Leslie Lamport and P. M. Melliar-Smith", title = "Synchronizing Clocks in the Presence of Faults", journal = j-J-ACM, volume = "32", number = "1", pages = "52--78", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2457.html", abstract = "Algorithms are described for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock. These algorithms work in the presence of arbitrary clock or process failures, including ``two-faced clocks'' that present different values to different processes. Two of the algorithms require that fewer than one-third of the processes be faulty. A third algorithm works if fewer than half the processes are faulty, but requires digital signatures.", acknowledgement = ack-nhfb, affiliationaddress = "SRI Int, Menlo Park, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "705; 722; 723; 943", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Byzantine failures; clocks, electric --- Synchronization; computer programming --- Algorithms; computer systems programming --- Multiprocessing Programs; computer systems, digital; Fault Tolerant Capability; interactive convergence algorithm; reliability; theory; verification; Zeitliche Ordnung", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Real-time and embedded systems.", } @Article{Abiteboul:1985:DD, author = "Serge Abiteboul", title = "Disaggregations in Databases", journal = j-J-ACM, volume = "32", number = "1", pages = "79--101", month = jan, year = "1985", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:55:43 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2463.html", abstract = "An algebraic foundation of database schema design is presented. A new database operator, namely, disaggregation, is introduced. Beginning with `free' families, repeated applications of disaggregation and three other operators (matching function, Cartesian product, and selection) yield families of increasingly elaborate structure. In particular, families defined by one join dependency and several `embedded' functional dependencies can be obtained in this manner.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Southern California, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 901; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Cartesian product; computer programming --- Theory; computer systems programming --- Design; data storage, digital --- Associative; database systems; dependency families; Design; design; disaggregation; functional dependencies; information retrieval systems; matching functions; mathematical techniques --- Algebra; theory; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models.", } @Article{Fuchs:1985:MCT, author = "Ken Fuchs and Dennis Kafura", title = "Memory-Constrained Task Scheduling on a Network of Dual Processors", journal = j-J-ACM, volume = "32", number = "1", pages = "102--129", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2456.html", abstract = "One aspect of network design is the extent to which memory is shared among the processing elements. In this paper a model with limited sharing (only two processors connected to each memory) is analyzed and its performance compared with the performance of two other models that have appeared in the literature. One of these is a model of multiple processors sharing a single memory; the other model considers a multiprocessor configuration in which each processor has its own dedicated memory. The tasks processed by these networks are described by both time and memory requirements. The largest-memory-first (LMF) scheduling algorithm is employed and its performance with respect to an enumerative optimal scheduling algorithm is bounded. On the basis of this measure it is concluded that memory sharing is only desirable on very small networks and is disadvantageous on networks of larger size.", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks --- Protocols; computer operating systems --- Storage Allocation; computer systems programming --- Time Sharing Programs; computer systems, digital; computers --- Operating Procedures; computers, digital --- Circuits; design; deterministic scheduling; distributed memories; dual processing; measurement; memory management; performance; Scheduling; scheduling algorithms; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Distributed memories. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems.", } @Article{Hochbaum:1985:ASC, author = "Dorit S. Hochbaum and Wolfgang Maass", title = "Approximation Schemes for Covering and Packing Problems in Image Processing and {VLSI}", journal = j-J-ACM, volume = "32", number = "1", pages = "130--136", month = jan, year = "1985", CODEN = "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/rosenfeld/1985.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214106.html", abstract = "A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete problems. The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems. The method of using the technique and how it varies with problem parameters are illustrated. A similar technique, independently devised by B. S. Baker, was shown to be applicable for covering and packing problems on planar graphs.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; covering; data storage, magnetic --- Storage Devices; geometrical problems; image part pattern; image processing; integrated circuits, VLSI; mathematical programming; mathematical techniques --- Polynomials; nonnumerical algorithms; polynomial approximation scheme; shifting strategy; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Hennessy:1985:ALN, author = "Matthew Hennessy and Robin Milner", title = "Algebraic Laws for Nondeterminism and Concurrency", journal = j-J-ACM, volume = "32", number = "1", pages = "137--161", month = jan, year = "1985", CODEN = "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/Object/Nierstrasz.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2460.html", abstract = "Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input\slash output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. First, a definition is given of what it is for two programs or program parts to be equivalent for all observers; then two program parts are said to be observation congruent if they are, in all program contexts, equivalent. The behavior of a program part, that is, its meaning, is defined to be its observation congruence class. The paper demonstrates, for a sequence of simple languages expressing finite (terminating) behaviors, that in each case observation congruence can be axiomatized algebraically. Moreover, with the addition of recursion and another simple extension, the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "communicating process; computer metatheory; computer programming languages; languages; logic design --- Computer Applications; mathematical techniques --- Algebra; nondeterministic programs; observation congruent; observational equivalence; pcalc equivalence ccs binder(ccs); semantics; Theory; theory; verification", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, CSP. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications.", } @Article{Vantilborgh:1985:AE, author = "Hendrik Vantilborgh", title = "Aggregation with an Error of ${O}(\epsilon^2)$", journal = j-J-ACM, volume = "32", number = "1", pages = "162--190", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214107.html", abstract = "An aggregative technique to obtain an improved approximation of the equilibrium vector of a Markov chain with a nearly completely decomposable transition matrix is presented. The technique is demonstrated on a model of a multiprogrammed computer system.", acknowledgement = ack-nhfb, affiliationaddress = "Commission of the European Communities, Brussels, Belg", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "aggregative techniques; computer systems programming; computers --- Operating Procedures; Markov chains; mathematical techniques --- Linear Algebra; Multiprogramming; near-complete decomposability; performance; probability --- Queueing Theory; queueing networks; systems performance; theory", subject = "{\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Dolev:1985:BIE, author = "Danny Dolev and R{\"u}diger Reischuk", title = "Bounds on Information Exchange for {Byzantine} Agreement", journal = j-J-ACM, volume = "32", number = "1", pages = "191--204", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214112.html", abstract = "Byzantine Agreement has become increasingly important in establishing distributed properties when errors may exist in the system. Recent polynomial algorithms for reaching Byzantine Agreement provide one with feasible solutions for obtaining coordination and synchronization in distributed systems. In this paper the amount of information exchange necessary to ensure Byzantine Agreement is studied. First it is shown that $\Omega(n t)$ is a lower bound for the number of signatures for any algorithm using authentication, where $n$ denotes the number of processors and t the upper bound on the number of faults the algorithm is supposed to handle. If $n$ is large compared to $t$, these bounds match the upper bounds from previously known algorithms. For the number of messages in the authenticated case the authors prove the lower bound $\Omega(n + t^2)$. Finally algorithms that achieve this bound are presented.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Research Lab, San Jose, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Byzantine agreement; computer networks --- Measurements; computer operating systems; computer programming --- Algorithms; computer systems, digital --- Distributed; mathematical techniques --- Polynomials; polynomial algorithms; reliability; reliability verification; Theory; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Verification.", } @Article{Even:1985:HCT, author = "Shimon Even and Alan L. Selman and Yacov Yacobi", title = "Hard-Core Theorems for Complexity Classes", journal = j-J-ACM, volume = "32", number = "1", pages = "205--217", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214111.html", abstract = "It has been proved that if a decision problem A is not solvable in polynomial time, then there exists an infinite recursive subset $X$ of its domain on which the decision is almost everywhere complex. In this paper, general theorems of this kind that can be applied to several well-known automata-based complexity classes, including a common class of randomized algorithms, are proved.", acknowledgement = ack-nhfb, affiliationaddress = "Technion, Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "alternation and nondeterminism; automata theory; complexity classes; computation theory; computer metatheory --- Probabilistic Logics; computer programming --- Algorithms; mathematical techniques --- Applications; probabilistic computation; randomized algorithms; systems science and cybernetics --- Hierarchical Systems; Theorem Proving; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{Klawe:1985:TBB, author = "Maria M. Klawe", title = "A Tight Bound for Black and White Pebbles on the Pyramid", journal = j-J-ACM, volume = "32", number = "1", pages = "218--228", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214115.html", abstract = "T. Lenguer and R. Tarjan proved that the number of black and white pebbles needed to pebble the root of a tree is at least half the number of black pebbles needed to pebble the root. This result is extended to a larger class of acyclic directed graphs including pyramid graphs.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Research Lab, San Jose, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory --- Computability and Decidability; computer programming --- Algorithms; computers, digital --- General Purpose Application; Coue generation; Graph Theory; mathematical techniques; nondeterminism; nonnumerical algorithms; pebbling; pyramid; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism.", } @Article{Lagarias:1985:SLD, author = "J. C. Lagarias and A. M. Odlyzko", title = "Solving Low-Density Subset Sum Problems", journal = j-J-ACM, volume = "32", number = "1", pages = "229--246", month = jan, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/2461.html", abstract = "The subset sum problem is to decide whether or not a $0$--$1$ integer programming problem which is NP-complete, has a solution. The difficulty of solving it is the basis of public-key cryptosystems of knapsack type. An algorithm is proposed that searches for a solution when given an instance of the subset sum problem. This algorithm always halts in polynomial time but does not always find a solution when one exists. It converts the problem to one of finding a particular short vector in a lattice, and then uses a lattice basis reduction algorithm to attempt to find this short vector. The performance of the proposed algorithm is analyzed.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; automata theory --- Theorem Proving; computer programming; computers, digital --- Special Purpose Application; cryptography --- Applications; data encryption; discrete mathematics; integer lattice; measurement; public-key cryptosystems; security; subset sum problems; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations. {\bf E.3}: Data, DATA ENCRYPTION. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf G.2.m}: Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous.", } @Article{Bauer:1985:SCS, author = "M. A. Bauer", title = "Soundness and Completeness of a Synthesis Algorithm Based on Example Computations", journal = j-J-ACM, volume = "32", number = "2", pages = "249--279", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3150.html", abstract = "The problem of synthesizing a procedure from example computations is examined. An algorithm for this task is presented, and its success is considered. To do this, a model of procedures and example computations is introduced, and the class of acceptable examples is defined. The synthesis algorithm is shown to be successful, with respect to the model of procedures and examples, from two perspectives. First, it is shown to be sound, that is, that the procedure synthesized from a set of examples produces the same result as the intended one on the inputs used to generate that set of examples. Second, it is shown to be complete, that is, that for any procedure in the class of procedures, there exists a finite set of examples such that the procedure synthesized behaves as the intended one on all inputs for which the intended one halts.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Ontario, London, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; automatic programming; computer metatheory --- Programming Theory; computer programming; synthesis algorithm; theory; verification", subject = "{\bf I.2.2}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } %% Page 196 is notice page @Article{Gottlob:1985:ESA, author = "G. Gottlob and A. Leitsch", title = "On the Efficiency of Subsumption Algorithms", journal = j-J-ACM, volume = "32", number = "2", pages = "280--295", month = apr, year = "1985", CODEN = "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/Comp.Alg.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214118.html", abstract = "The costs of subsumption algorithms are analyzed by an estimation of the maximal number of unification attempts (worst-case unification complexity) made for deciding whether a clause C subsumes a clause D. First, two well-known algorithms are investigated. Both algorithms are shown to have a very high worst-case time complexity. Then, a new subsumption algorithm is defined, which is based on an analysis of the connection between variables and predicates in C. An upper bound for the worst-case unification complexity of this algorithm, which is much lower than the lower bounds for the two other algorithms, is derived. Examples in which exponential costs are reduced to polynomial costs are discussed. Finally, the asymptotic growth of the worst-case complexity for all discussed algorithms is shown in a table (for several combinations of the parameters).", acknowledgement = ack-nhfb, affiliationaddress = "Technische Univ Wien, Vienna, Aust", ajournal = "J. Assoc. Comput. Mach.", annote = "unification, prolog", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer metatheory --- Programming Theory; computer programming; performance; subsumption algorithms; theorem-proving programs; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Wang:1985:FVS, author = "Ching-Chy Wang and Errol L. Lloyd and Mary Lou Soffa", title = "Feedback Vertex Sets and Cyclically Reducible Graphs", journal = j-J-ACM, volume = "32", number = "2", pages = "296--313", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3159.html", abstract = "The problem of finding a minimum cardinality feedback vertex set of a directed graph is considered. The main result is a new class of graphs --- the cyclically reducible graphs --- for which minimum feedback vertex sets can be found in polynomial time. This class is not restricted to flow graphs, and most small graphs (10 or fewer nodes) fall into this class. The identification of this class is particularly important since there do not exist approximation algorithms for this problem having a provably good worst case performance. Along with a simple polynomial-time algorithm for finding minimum feedback vertex sets of graphs in the class, it is shown that there is no `forbidden subgraph' characterization of the class and that there is no particular inclusion relationship between this class and the reducible flow graphs.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown Heights, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; cyclically reducible graphs; feedback vertex sets; Graph Theory; mathematical techniques; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Deadlocks. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Backup procedures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Buckley:1985:BTP, author = "G. N. Buckley and A. Silberschatz", title = "Beyond Two-Phase Locking", journal = j-J-ACM, volume = "32", number = "2", pages = "314--326", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3151.html", abstract = "Many database systems maintain the consistency of the data by using a locking protocol to restrict access of data items. It has been previously shown that if no information is known about the method of accessing items in the database, then the two-phase protocol is optimal. However, the use of structural information about the database allows development of non-two-phase protocols, called graph protocols, that can potentially increase efficiency. Yannakakis developed a general class of protocols that included many of the graph protocols. Graph protocols either are only usable in certain types of databases or can incur the performance liability of cascading rollback. In this paper, it is demonstrated that if the system has a priori information as to which data items will be locked first by various transactions, a new graph protocol that is outside the previous classes of graph protocols and is applicable to arbitrarily structured databases can be constructed. This new protocol avoids cascading rollback and its accompanying performance degradation, and extends the class of serializable sequences allowed by non-two-phase protocols. This is the first protocol shown to be always as effective as the two-phase protocol, and it can be more effective for certain types of database systems.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "graph protocols with a-priori knowledge outperform 2PL without deadlock.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; concurrency; database concurrency control; database systems; locking protocols; serializability; theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Baker:1985:ARC, author = "Brenda S. Baker and Edward G. {Coffman, Jr.} and Dan E. Willard", title = "Algorithms for Resolving Conflicts in Dynamic Storage Allocation", journal = j-J-ACM, volume = "32", number = "2", pages = "327--343", month = apr, year = "1985", CODEN = "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 dynamic storage allocation, successive allocation and freeing of blocks normally leads to fragmentation of storage. When a new block is to be allocated, fragmentation may prevent any single region of available storage from being large enough for the new block, even though the total amount of available space is sufficient. When such a conflict arises, dynamic storage allocation systems typically require time-consuming garbage collection or they simply break down. This paper investigates strategies for maintaining storage that allow allocation of blocks to proceed in spite of fragmentation conflicts, as the cost of moving some blocks already allocated are investigated.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Algorithms; conflict resolution; dynamic storage allocation; Storage Allocation", } @Article{GonzalezSmith:1985:PAD, author = "M. E. {Gonzalez Smith} and J. A. Storer", title = "Parallel Algorithms for Data Compression", journal = j-J-ACM, volume = "32", number = "2", pages = "344--373", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3152.html", abstract = "Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.", acknowledgement = ack-nhfb, affiliationaddress = "Brandeis Univ, Waltham, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; data compression; image information; parallel algorithms; statistics; theory; verification; VLSI", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Fischer:1985:IDC, author = "Michael J. Fischer and Nancy A. Lynch and Michael S. Paterson", title = "Impossibility of Distributed Consensus with One Faulty Process", journal = j-J-ACM, volume = "32", number = "2", pages = "374--382", month = apr, year = "1985", CODEN = "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", note = "This paper proves that every completely asynchronous, deterministic algorithm for Byzantine agreement has the possibility of nontermination, even with only one faulty processor. This impossibility result does not hold in the synchronous case. For completely asynchronous {\em probabilistic\/} algorithms, the problem is avoided since termination is only required with probability 1. See Section xxx for an example of such a probabilistic algorithm for asynchronous Byzantine agreement.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214121.html", abstract = "The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of a nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the `Byzantine Generals' problem.", acknowledgement = ack-nhfb, affiliationaddress = "Yale Univ, New Haven, CT, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Byzantine generals problem; computer metatheory; computer systems, digital; database operating system commit processing; Distributed; distributed consensus; fault tolerance; reliability; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol architecture. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems.", } @Article{Cornuejols:1985:TSP, author = "G. Cornu{\'e}jols and D. Naddef and W. Pulleyblank", title = "The Traveling Salesman Problem in Graphs with $3$-Edge Cutsets", journal = j-J-ACM, volume = "32", number = "2", pages = "383--410", month = apr, year = "1985", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 01 16:58:05 2002", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3154.html", abstract = "This paper analyzes decomposition of a graph that, when they occur, permit a polynomial solution of the traveling salesman problem and a description of the traveling salesman polytope by a system of linear equalities and inequalities. The central notion is that of a 3-edge cutset, namely, a set of 3 edges that, when removed, disconnects the graph. Conversely, our approach can be used to construct classes of graphs for which there exists a polynomial algorithm for the traveling salesman problem. The approach is illustrated on two examples, Halin graphs and prismatic graphs.", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; graph algorithms; graph decompositions; Graph Theory; mathematical programming, linear; mathematical techniques; optimization; polynomial algorithms; traveling salesman problem", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Staples:1985:FSN, author = "John Staples and V. L. Nguyen", title = "A Fixpoint Semantics for Nondeterministic Data Flow", journal = j-J-ACM, volume = "32", number = "2", pages = "411--444", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3155.html", abstract = "Criteria for adequacy of a data flow semantics are discussed and G. Kahn's successful semantics for functional (deterministic) data flow is reviewed. Problems arising from nondeterminism are introduced and the paper's approach to overcoming them is introduced. The approach is based on generalizing the notion of input-output relation, essentially to a partially ordered multiset of input-output histories. The Brock-Ackerman anomalies concerning the input-output relation model of nondeterministic data flow are reviewed, and it is indicated how the proposed approach avoids them. A new anomaly is introduced to motivate the use of multisets. A formal theory of asynchronous processes is then developed. The main result is that the operation of forming a process from a network of component processes is associative. This result shows that the approach is not subject to anomalies such as that of Brock and Ackerman.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Queensland, St. Lucia, Aust", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; computer programming languages; fixpoint semantics; languages; nondeterministic data flow; Theory; theory; verification", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism.", } @Article{Tantawi:1985:OSL, author = "Asser N. Tantawi and Don Towsley", title = "Optimal Static Load Balancing In Distributed Computer Systems", journal = j-J-ACM, volume = "32", number = "2", pages = "445--465", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3156.html", abstract = "A distributed computer system that consists of a set of heterogeneous host computers connected in an arbitrary fashion by a communications network is considered. A general model is developed for such a distributed computer system, in which the host computers and the communications network are represented by product-form queueing networks. Two efficient algorithms that determine the optimal load on each host computer are presented. The first, called the parametric-study algorithm, generates the optimal solution as a function of the communication time and is suited for the study of the effect of the speed of the communications network on the optimal solution. The second is a single-point algorithm; it yields the optimal solution for given system parameters. Queueing models of host computers, communications networks, and a numerical example are illustrated.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown Heights, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; computer systems, digital; design; Distributed; load balancing; load sharing; optimal static load balancing; parametric-study algorithm; performance; reliability; routing; single-point algorithm; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear programming. {\bf K.6.4}: Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, System Management, Centralization/decentralization.", } @Article{Gurari:1985:DPP, author = "Eitan M. Gurari", title = "Decidable Problems for Powerful Programs", journal = j-J-ACM, volume = "32", number = "2", pages = "466--483", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3157.html", abstract = "Two of the most powerful classes of programs for which interesting decision problems are known to be solvable are the class of finite-memory programs and the class of programs that characterize the Presburger, or semilinear, sets. In this paper, a new class of programs that present solvable decision problems similar to the other two classes of programs is introduced. However, the programs in the new class are shown to be computationally more powerful (i.e., capable of defining larger sets of input-output relations).", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory --- Programming Theory; computer programming; decidable problems; languages; pspace-completeness; Theory; theory", subject = "{\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @Article{Skyum:1985:CTB, author = "S. Skyum and L. G. Valiant", title = "A Complexity Theory Based on {Boolean} Algebra", journal = j-J-ACM, volume = "32", number = "2", pages = "484--502", month = apr, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3158.html", abstract = "A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Finer distinctions about the computational relationships among natural problems can be made than in previous formulations and some negative results are proved.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Boolean algebra; complexity theory; computer metatheory; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relations among modes.", } @Article{Dechter:1985:GBF, author = "Rina Dechter and Judea Pearl", title = "Generalized Best-First Search Strategies and the Optimality of {A*}", journal = j-J-ACM, volume = "32", number = "3", pages = "505--536", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3830.html", abstract = "This paper reports several properties of heuristic best-first search strategies whose scoring functions $f$ depend on all the information available from each candidate path, not merely on the current cost $g$ and the estimated completion cost $h$. It is shown that several known properties of A* retain their form (with the minmax of $f$ playing the role of the optimal cost), which helps establish general tests of admissibility and general conditions for node expansion for these strategies. On the basis of this framework the computational optimality of A*, in the sense of never expanding a node that can be skipped by some other algorithm having access to the same heuristic information that A* uses, is examined. A hierarchy of four optimality types is defined, and three classes of algorithms and four domains of problem instances are considered. Computational performances relative to these algorithms and domains are appraised.", acknowledgement = ack-nhfb, affiliation = "Univ of California, Los Angeles, Cognitive Systems Lab, Los Angeles, CA, USA", affiliationaddress = "Univ of California, Los Angeles, Cognitive Systems Lab, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Artificial Intelligence; best-first search strategies; computer programming --- Algorithms; heuristic search; measurement; performance; shortest path algorithms; systems science and cybernetics; theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies.", } @Article{Bender:1985:ESF, author = "Edward A. Bender and Jon T. Butler", title = "Enumeration of Structured Flowcharts", journal = j-J-ACM, volume = "32", number = "3", pages = "537--548", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3832.html", abstract = "An analysis of structured flowcharts is presented, where size is measured by the number, $n$, of decision nodes (IF-THEN-ELSE and DO-WHILE nodes). For all classes of structured flowcharts considered, the number of charts is approximately $c n^{-3/2} \gamma^n$ for large $n$, where $c$ and $\gamma$ are parameters that depend on the class. It is also shown that most large flowcharts consist of a short sequence of basic charts (IF-THEN-ELSE and DO-WHILE charts). The average length of such sequences is 2.5.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, San Diego, Dep of Mathematics, La Jolla, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "BJ-charts; computer programming; D-charts; flowchart enumeration; structured flowcharts; Structured Programming; theory", subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and Techniques, Flow charts. {\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and Techniques, Top-down programming. {\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and Techniques, Structured programming. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Generating functions. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures.", } @Article{Cunningham:1985:OAR, author = "William H. Cunningham", title = "Optimal Attack and Reinforcement of a Network", journal = j-J-ACM, volume = "32", number = "3", pages = "549--561", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3829.html", abstract = "In a nonnegative edge-weighted network, the weight of an edge represents the effort required by an attacker to destroy the edge, and the attacker derives a benefit for each new component created by destroying edges. The attacker may want to minimize over subsets of edges the difference between (or the ratio of) the effort incurred and the benefit received. This ideal leads to the definition of the `strength' of the network, a measure of the resistance of the network to such attacks. Efficient algorithms for the optimal attack problem, the problem of computing the strength, and the problem of finding a minimum cost `reinforcement' to achieve a desired strength are given. These problems are also solved for a different model, in which the attacker wants to separate vertices from a fixed central vertex.", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Dep of Mathematics \& Statistics, Ottawa, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; Graph Theory; greedy algorithm; mathematical techniques; networks; optimal attack and reinforcement; performance; polymatroids; strongly polynomial algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Lee:1985:SLP, author = "C. C. Lee and D. T. Lee", title = "A Simple On-Line Bin-Packing Algorithm", journal = j-J-ACM, volume = "32", number = "3", pages = "562--572", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3833.html", abstract = "The one-dimensional on-line bin-packing problem is considered. A simple $O(1)$-space and $O(n)$-time algorithm, called HARMONIC$_M$, is presented. It is shown that this algorithm can achieve a worst-case performance ratio of less than 1.692, which is better than that of the $O(n)$-space and $O(n \log n)$-time algorithm FIRST FIT. Also shown is that 1.691\ldots{} is a lower bound for all $O(1)$-space on-line bin-packing algorithms. Finally a revised version of HARMONIC$_M$, an $O(n)$-space and $O(n)$-time algorithm, is presented and is shown to have a worst-case performance ratio of less than 1.636.", acknowledgement = ack-nhfb, affiliation = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", affiliationaddress = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; bin-packing algorithm; computer programming; image part pattern; performance; suboptimal algorithms; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", } @Article{Chazelle:1985:MCV, author = "Bernard Chazelle and Louis Monier", title = "A Model of Computation for {VLSI} with Related Complexity Results", journal = j-J-ACM, volume = "32", number = "3", pages = "573--588", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3834.html", abstract = "A new model of computation for VLSI, based on the assumption that time for propagating information is at least linear in the distance, is proposed. While accommodating for basic laws of physics, the model is designed to be general and technology independent. Thus, from a complexity viewpoint, it is especially suited for deriving lower bounds and trade-offs. New results for a number of problems, including fan-in, transitive functions, matrix multiplication, and sorting are presented. As regards upper bounds, it must be noted that because of communication costs, the model clearly favors regular and pipelined architecture (e.g., systolic arrays).", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; chip complexity; fan-in; integrated circuits, VLSI; lower bounds; Mathematical Models; sorting; theory; transitive functions", subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration).", } @Article{Greenberg:1985:LBT, author = "Albert G. Greenberg and Shmuel Winograd", title = "A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels", journal = j-J-ACM, volume = "32", number = "3", pages = "589--596", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214125.html", abstract = "A problem related to the decentralized control of a multiple access channel is considered: Suppose $k$ stations from an ensemble of $n$ simultaneously transmit to a multiple access channel that provides the feedback $0$, $1$, or $2+$, denoting $k$ equals $0$, $k$ equals $1$, or $k \geq 2$, respectively. If $k$ equals $1$, then the transmission succeeds. But if $k \geq 2$, as a result of the conflict, none of the transmissions succeed. An algorithm to resolve a conflict determines how to schedule retransmissions so that each of the conflicting stations eventually transmits singly to the channel. In this paper, a general model of deterministic algorithms to resolve conflicts is introduced, and it is established that, for all $k$ and $n$ $(2 \leq k \leq n)$, $\Omega(k(\log n)/(\log k))$ time must elapse in the worst case before all $k$ transmissions succeed.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer networks; computer programming --- Algorithms; conflict resolution; decentralized control; deterministic algorithms; multiple access channels; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.5}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Access schemes. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Willard:1985:ARR, author = "Dan E. Willard and George S. Lueker", title = "Adding Range Restriction Capability to Dynamic Data Structures", journal = j-J-ACM, volume = "32", number = "3", pages = "597--617", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3839.html", abstract = "A database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query. A transformation is presented that enables range restrictions to be added to an arbitrary dynamic data structure on $n$ elements, provided that the problem satisfies a certain decomposability condition and that one is willing to allow increases by a factor of $O(\log n)$ in the worst-case time for an operation and in the space used. This is a generalization of a known transformation that works for static structures. This transformation is then used to produce a data structure for range queries in $k$ dimensions with worst-case times of $O(\log^kn)$ for each insertion, deletion, or query operation.", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; data processing; Data Structures; database systems; dynamic data structures; measurement; performance; range restriction; theory; verification", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Composite structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.3.2}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Tay:1985:MVP, author = "Y. C. Tay and Rajan Suri and Nathan Goodman", title = "A Mean Value Performance Model for Locking in Databases: {The} No-Waiting Case", journal = j-J-ACM, volume = "32", number = "3", pages = "618--651", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3831.html", abstract = "A new performance model for dynamic locking is proposed. It is based on a flow diagram and uses only the steady state average values of the variables. It is general enough to handle nonuniform access, shared locks, static locking, multiple transaction classes, and transactions of indeterminate length. The analysis is restricted to the case in which all conflicts are resolved by restarts. The model shows that data contention can cause the throughput to thrash, and gives a limit on the workload that will prevent this. It also shows that systems with a particular kind of nonuniform access and systems in which transactions share locks are equivalent to systems in which there is uniform access and only exclusive locking. Replacing updates by queries in a multiprogramming mix may degrade performance if the queries are longer than the updates.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Univ of Singapore, Dep of Mathematics, Singapore, Singapore", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; concurrency control; data contention; database locking; database systems; dynamic locking; mathematical models; measurement; Performance; performance; resource contention; theory; verification", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Sleator:1985:SAB, author = "Daniel Dominic Sleator and Robert Endre Tarjan", title = "Self-Adjusting Binary Search Trees", journal = j-J-ACM, volume = "32", number = "3", pages = "652--686", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3835.html", abstract = "The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an $n$-node splay tree, all the standard search tree operations have an amortized time bound of $O(\log n)$ per operation, where by `amortized time' is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access sequences, splay trees are as efficient, to within a constant factor, as static optimum search trees. The efficiency of splay trees comes not from an explicit structural constraint, as with balanced trees, but from applying a simple restructuring heuristic, called splaying, whenever the tree is accessed.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; data processing; Data Structures; mathematical techniques --- Trees; multidimensional searching; performance; self-adjusting binary search trees; self-organizing data structures; splay trees; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Yao:1985:UHO, author = "Andrew C. Yao", title = "Uniform Hashing is Optimal", journal = j-J-ACM, volume = "32", number = "3", pages = "687--693", month = jul, year = "1985", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3828.3836", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 14 10:47:04 1998", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/hash.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Also published in/as: Stanford Un., CSD, TR-CS-85-1038, Jan. 1985.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3836.html", abstract = "It was conjectured by J. Ullman that uniform hashing is optimal in its expected retrieval cost among all open-address hashing schemes. In this paper, it is shown that, for any open-address hashing scheme, the expected cost of retrieving a record from a large table that is $\alpha$-fraction full is at least $(1 / \alpha) \log(1 / (1 - \alpha)) + o(1)$. This proves Ullman's conjecture to be true in the asymptotic sense.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Computer Science Dep, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; data processing; Data Structures; open-address hashing; performance; retrieval cost; theory; uniform hashing; verification", remark = "The key of a record maps to a sequence that is a random permutation of all the locations of a hash table.", review = "ACM CR 8512-1135", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf E.1}: Data, DATA STRUCTURES, Arrays. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.1}: Data, DATA STRUCTURES, Tables.", } @Article{Zerling:1985:GBT, author = "David Zerling", title = "Generating Binary Trees Using Rotations", journal = j-J-ACM, volume = "32", number = "3", pages = "694--701", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214141.html", abstract = "A new algorithm that, for the first time, exploits the rotational geometry of binary trees is developed in order to allow for the lexicographic generation of computer representations of these trees in average time $O(1)$ per tree. `Rotation' codewords for these trees (in average time $O(1)$ per tree) are also generated. It is shown how these codewords relate to lattice paths, and, using this relationship, that $n(n 1)/(n + 2)$ is the average number of rotations needed to generate a binary tree on $n$ nodes. Finally, a necessary and sufficient condition that a codeword represent a full binary tree (each node has 0 or 2 sons) on $n = 2 m + 1$ nodes is given and how to contract this codeword to obtain the codeword for the binary tree on m nodes for which this full tree is the extended binary tree is shown.", acknowledgement = ack-nhfb, affiliationaddress = "Philadelphia Coll of Textiles \& Science, Philadelphia, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; backtracking; binary trees; computer programming --- Algorithms; data processing; Data Structures; mathematical techniques --- Trees; rotational geometry", subject = "{\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Cao:1985:IAD, author = "Wei-Lu Cao and William J. Stewart", title = "Iterative Aggregation\slash Disaggregation Techniques for Nearly Uncoupled {Markov} Chains", journal = j-J-ACM, volume = "32", number = "3", pages = "702--719", month = jul, year = "1985", CODEN = "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/1985.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214137.html", abstract = "Iterative aggregation\slash disaggregation methods provide an efficient approach for computing the stationary probability vector of nearly uncoupled (also known as nearly completely decomposable) Markov chains. Three such methods that have appeared in the literature recently are considered and their similarities and differences are outlined. For each of these methods, a lemma is established, which shows that the unique fixed point of the iterative scheme is the left eigenvector corresponding to the dominant unit eigenvalue of the stochastic transition probability matrix. In addition, conditions are established for the convergence of two of these methods; convergence conditions for the third having already been established. All three methods are shown to have the same asymptotic rate of convergence.", acknowledgement = ack-nhfb, affiliation = "North Carolina State Univ at Raleigh, Dep of Computer Science, Raleigh, NC, USA", affiliationaddress = "North Carolina State Univ at Raleigh, Dep of Computer Science, Raleigh, NC, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "912; 921; 922", descriptors = "Aggregation; decomposition; Markov chain", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "aggregation; algorithms; iter; iterative aggregation/disaggregation techniques; la; Markov chain; Mathematical Models; mathematical techniques --- Iterative Methods; nearly uncoupled Markov chains; nla; performance; probability --- Random Processes; systems science and cybernetics; theory", subject = "{\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Manber:1985:CPP, author = "Udi Manber and Martin Tompa", title = "Complexity of Problems on Probabilistic, Nondeterministic, and Alternating Decision Trees", journal = j-J-ACM, volume = "32", number = "3", pages = "720--732", month = jul, year = "1985", CODEN = "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/85.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "This paper compares lower bounds on the running times of algorithms that allow probabilistic, non-deterministic and alternating control on decision trees. Decision trees that allow internal randomization at the expense of a small probability of error are shown to run no faster asymptotically than ordinary decision trees for a collection of problems. An earlier version of this publication appeared in {\em Proc. 14th Ann. ACM Symp. on Theory of Computing}, 1982, pp. 234--244.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3838.html", abstract = "This work generalizes decision trees in order to study lower bounds on the running times of algorithms that allow probabilistic, nondeterministic, or alternating control. It is shown that decision trees that are allowed internal randomization (at the expense of introducing a small probability of error) run no faster asymptotically than ordinary decision trees for a collection of natural problems. Two geometric techniques from the literature for proving lower bounds on the time required by ordinary decision trees are shown to be special cases of one unified technique that, in fact, applies to nondeterministic decision trees as well. Finally, it is shown that any lower bound on alternating decision tree time also applies to alternating Turing machine time.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Washington, Seattle, WA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational complexity; computer programming --- Algorithms; decision theory and analysis; decision trees; lower bounds; mathematical statistics --- Monte Carlo Methods; mathematical techniques --- Trees; Monte Carlo algorithms; performance; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Sistla:1985:CPL, author = "A. P. Sistla and E. M. Clarke", title = "The Complexity of Propositional Linear Temporal Logics", journal = j-J-ACM, volume = "32", number = "3", pages = "733--749", month = jul, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3837.html", abstract = "The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional liner temporal logics. It is shown that these problems are NP-complete for the logic with $F$ and are PSPACE-complete for the logics with $F$, $X$, with $U$, with $U$, $S$, $X$ operators and for the extended logic with regular operators given by P. Wolper.", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts at Amherst, Dep of Electrical \& Computer Engineering, Amherst, MA, USA", affiliationaddress = "Univ of Massachusetts at Amherst, Dep of Electrical \& Computer Engineering, Amherst, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; complexity; computer metatheory; Formal Logic; np-completeness; propositional linear temporal logics; pspace-completeness; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf I.2.2}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program verification. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving.", } @Article{Papadimitriou:1985:CTD, author = "Christos H. Papadimitriou", title = "Correction to ``{A} Theorem in Database Concurrency Control''", journal = j-J-ACM, volume = "32", number = "3", pages = "750--750", month = jul, year = "1985", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 01 10:04:29 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Papadimitriou:1982:TDC}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Freuder:1985:SCB, author = "Eugene C. Freuder", title = "A Sufficient Condition for Backtrack-Bounded Search", journal = j-J-ACM, volume = "32", number = "4", pages = "755--761", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4225.html", abstract = "Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems. The solutions involve a combination of relaxation preprocessing and backtrack search. The bounds are expressed in terms of the structure of the constraint connections. Specifically, the effort is shown to have a bound exponential in the size of the largest biconnected component of the constraint graph, as opposed to the size of the graph as a whole.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of New Hampshire, Dep of Computer Science, Durham, NH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; backtrack-bounded search; combinatorial algorithms; computer programming; constraint consistency; constraint satisfaction; theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Karp:1985:FPA, author = "Richard M. Karp and Avi Wigderson", title = "A Fast Parallel Algorithm for the Maximal Independent Set Problem", journal = j-J-ACM, volume = "32", number = "4", pages = "762--773", month = oct, year = "1985", CODEN = "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/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "This important paper showed that the maximal independent set problem for graphs can be solved in polylogarithmic time using a polynomial number of processes on a PRAM in which concurrent reads and writes are disallowed. They derive their algorithm from a randomized one using a technique that has become known as derandomization via $k$-wise independence.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4226.html", abstract = "A parallel algorithm is presented that accepts as input a graph $G$ and produces a maximal independent set of vertices in $G$. On a P-RAM without the concurrent write or concurrent read features, the algorithm executes in $O((\log n)^4)$ time and uses $O((n/(\log n))^3)$ processors, where $n$ is the number of vertices in $G$. The algorithm has several novel features that may find other applications. These include the use of balanced incomplete block designs to replace random sampling by deterministic sampling, and the use of a `dynamic pigeonhole principle' that generalizes the conventional pigeonhole principle.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California at Berkeley, Computer Science Div, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; fast parallel algorithm; maximal independent set problem; performance; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Sacca:1985:CDH, author = "Domenico Sacc{\`{a}}", title = "Closures of Database Hypergraphs", journal = j-J-ACM, volume = "32", number = "4", pages = "774--803", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4997.html", abstract = "A hypergraph formalism is introduced to represent database schemata. In particular, a database schema B, described by one full join dependency and a set of functional dependencies, is represented by a (database) hypergraph H, containing both undirected and directed hyperedges. The closure of a database hypergraph is defined as the extension of the transitive closure of a graph. By using a lower bound and an upper bound of the hypergraph closure (called L-closure and U-closure, respectively), it is proved that two e-acyclic (e-independent) hypergraphs are equivalent if and only if they have the same closure. Moreover, a hypergraph is e-acyclic (e-independent) if and only if its closure is acyclic (independent) and, in most cases, such a recognition can be done in polynomial time. Finally, it is shown how to use the database hypergraph closure to solve some database design problems.", acknowledgement = ack-nhfb, affiliationaddress = "CRAI, Rende, Italy", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; closures; database hypergraphs; database systems; design; mathematical techniques --- Graph Theory; Theory; theory", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Awerbuch:1985:CNS, author = "Baruch Awerbuch", title = "Complexity of Network Synchronization", journal = j-J-ACM, volume = "32", number = "4", pages = "804--823", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4227.html", abstract = "The problem of simulating a synchronous network by an asynchronous network is investigated. A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designing efficient distributed algorithms in asynchronous networks, is proposed. The synchronizer exhibits a trade-off between its communication and time complexities, which is proved to be within a constant factor of the lower bound.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Lab for Computer Science, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; complexity; computer networks; computer programming --- Algorithms; Computer Simulation; network synchronization; performance; theory", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Store and forward networks. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures.", } @Article{Bracha:1985:ACB, author = "Gabriel Bracha and Sam Toueg", title = "Asynchronous Consensus and Broadcast Protocols", journal = j-J-ACM, volume = "32", number = "4", pages = "824--840", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214134.html", abstract = "A consensus protocol enables a system of $n$ asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated. With fail-stop processes, it is shown that (n + 1)/2 correct processes are necessary and sufficient to reach agreement. In the malicious case, it is shown that (2n + 1)/3 correct processes are necessary and sufficient to reach agreement. This is contrasted with an earlier result, stating that there is no consensus protocol for the fail-stop case that always terminates within a bounded number of steps, even if only one process can fail. The possibility of reliable broadcast (Byzantine Agreement) in asynchronous systems is also investigated. Asynchronous Byzantine Agreement is defined, and it is shown that (2n+1)/3 correct processes are necessary and sufficient to achieve it.", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; asynchronous processes; broadcast protocols; Byzantine agreement; computer networks; computer systems, digital --- Distributed; consensus protocols; Protocols; reliability; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol architecture. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Garcia-Molina:1985:HAV, author = "Hector Garcia-Molina and Daniel Barbara", title = "How to Assign Votes in a Distributed System", journal = j-J-ACM, volume = "32", number = "4", pages = "841--860", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4223.html", abstract = "In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail and it is shown that they are not equivalent in general (although they are in some cases). In doing so, a number of other interesting properties are proved. These properties will be of use to a system designer who is selecting a vote assignment or a set of groups for a specific application.", acknowledgement = ack-nhfb, affiliation = "Princeton Univ, Dep of Electrical Engineering \& Computer Science, Princeton, NJ, USA", affiliationaddress = "Princeton Univ, Dep of Electrical Engineering \& Computer Science, Princeton, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer systems, digital; database systems --- Distributed; Distributed; mutual exclusion; partitions; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems.", } @Article{Faigle:1985:OLO, author = "Ulrich Faigle", title = "On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms", journal = j-J-ACM, volume = "32", number = "4", pages = "861--870", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4998.html", abstract = "The optimization problem for linear functions on finite languages is studied, and an (almost) complete characterization of those functions for which a primal and a dual greedy algorithm work well with respect to a canonically associated linear programming problem is given. The discussion in this paper is within the framework of ordered languages, and the characterization uses the notion of rank feasibility of a weighting with respect to an ordered language. This yields a common generalization of a sufficient condition, for greedoids and a greedy algorithm for ordered sets. Ordered greedoids are considered the appropriate generalization of greedoids, and the connection is established between ordered languages, polygreedoids, and Coxeteroids. The author shows in particular that a polygreedoid is a Coxeteroid if and only if it is derived from an integral polymatroid.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Bonn, Inst fuer Oekonometrie und Operation Research, Bonn, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; automata theory --- Formal Languages; combinatorial optimization; computer programming --- Algorithms; greedy algorithms; languages; linear functions; mathematical techniques --- Combinatorial Mathematics; optimization; ordered languages", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Adler:1985:SAW, author = "Ilan Adler and Nimrod Megiddo", title = "A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension", journal = j-J-ACM, volume = "32", number = "4", pages = "871--895", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4222.html", abstract = "The average number of steps performed by a simplex algorithm, the so-called self-dual method, is analyzed. The algorithm is not started at the traditional point $(1, \ldots{}, 1)^T$, but points of the form $(1, \epsilon, \epsilon^2,\ldots{})^T$, with $\epsilon$ sufficiently small, are used. The result is better than those of the previous analyses.", acknowledgement = ack-nhfb, affiliation = "Univ of California, Dep of Industrial Engineering \& Operations Research, Berkeley, CA, USA", affiliationaddress = "Univ of California, Dep of Industrial Engineering \& Operations Research, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; average-case analysis; computer programming --- Algorithms; lexicographic pivoting; linear programming; mathematical programming; probabilistic analysis of algorithms; quadratic functions; simplex algorithm; simplex algorithms; theory", subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", } @Article{Hennessy:1985:AT, author = "M. Hennessy", title = "Acceptance Trees", journal = j-J-ACM, volume = "32", number = "4", pages = "896--928", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4249.html", abstract = "A simple model, $AT$, for nondeterministic machines is presented which is based on certain types of trees. A set of operations, $\Sigma$, is defined over $AT$ and it is shown to be completely characterized by a set of inequations over $\Sigma$. $AT$ is used to define the denotational semantics of a language for defining nondeterministic machines. The significance of the model is demonstrated by showing that this semantics reflects an intuitive operational semantics of machines based on the idea that machines should only be differentiated if there is some experiment that differentiates between them.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Edinburgh, Dep of Computer Science, Edinburgh, Scotl", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "acceptance trees; automata theory; Formal Languages; languages; mathematical techniques --- Trees; nondeterministic machines; pcalc equivalence ccs binder(ccs); theory", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @Article{MeyerAufDerHeide:1985:LBS, author = "Friedhelm {Meyer Auf Der Heide}", title = "Lower Bounds for Solving Linear {Diophantine} Equations on Random Access Machines", journal = j-J-ACM, volume = "32", number = "4", pages = "929--937", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4250.html", abstract = "The author proves lower bounds for the time complexity of deciding the solvability of Diophantine linear equations with $n$ variables; that is, of deciding whether a given linear equation has a solution with nonnegative integer coefficients.", acknowledgement = ack-nhfb, affiliationaddress = "Johann Wolfgang Goethe-Univ, Frankfurt, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; computer programming --- Algorithms; linear Diophantine equations; lower bounds; performance; random access machines; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf G.2.0}: Mathematics of Computing, DISCRETE MATHEMATICS, General.", } @Article{Moran:1985:ART, author = "Shlomo Moran and Marc Snir and Udi Manber", title = "Applications of {Ramsey}'s Theorem to Decision Tree Complexity", journal = j-J-ACM, volume = "32", number = "4", pages = "938--949", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4259.html", abstract = "Combinatorial techniques for extending lower bound results for decision trees to general types of queries are presented. Problems that are defined by simple inequalities between inputs, called order invariant problems, are considered. A decision tree is called $k$-bounded if each query depends on at most $k$ variables. No further assumptions on the type of queries are made. It is proved that one can replace the queries of any $k$-bounded decision tree that solves an order-invariant problem over a large enough input domain with $k$-bounded queries whose outcome depends only on the relative order of the inputs. As a consequence, all existing lower bounds for comparison-based algorithms are valid for general $k$-bounded decision trees, where $k$ is a constant. An $\Omega(n \log n)$ lower bound for the element uniqueness problem and several other problems for any $k$-bounded decision tree, such that $k = O(n^c)$ and $c < 1/2$ is proved.", acknowledgement = ack-nhfb, affiliationaddress = "Technion, Dep of Computer Science, Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Combinatorial Mathematics; decision theory and analysis; decision tree complexity; mathematical techniques; performance; Ramsey's theorem; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Yannakakis:1985:PAM, author = "Mihalis Yannakakis", title = "A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees", journal = j-J-ACM, volume = "32", number = "4", pages = "950--988", month = oct, year = "1985", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4228.html", abstract = "An algorithm is presented that finds a min-cut linear arrangement of a tree in $O(n \log n)$ time. An extension of the algorithm determines the number of pebbles needed to play the black and white pebble game on a tree.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; mathematical techniques; min-cut linear arrangement; pebbling; polynomial algorithm; theory; Trees", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Manna:1986:SRA, author = "Zohar Manna and Richard Waldinger", title = "Special Relations in Automated Deduction", journal = j-J-ACM, volume = "33", number = "1", pages = "1--59", month = jan, year = "1986", CODEN = "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/symbolic.math.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4905.html", abstract = "Two deduction rules are introduced to give streamlined treatment to relations of special importance in an automated theorem-proving system. These rules, the relation replacement and relation matching rules, generalize to an arbitrary binary relation the paramodulation and E-resolution rules, respectively, for equality, and may operate within a nonclausal or clausal system. The new rules depend on an extension of the notion of polarity to apply to subterms as well as to subsentences, with respect to a given binary relation. The rules allow us to eliminate troublesome axioms, such as transitivity and monotonicity, from the system; proofs are shorter and more comprehensible, and the search space is correspondingly deflated.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Dep of Computer Science, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; automated deduction; computer metatheory; theorem proving; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.2}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Mehlhorn:1986:RTR, author = "K. Mehlhorn and F. P. Preparata", title = "Routing through a Rectangle", journal = j-J-ACM, volume = "33", number = "1", pages = "60--85", month = jan, year = "1986", CODEN = "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/86.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4994.html", abstract = "An $O(N \log N)$ algorithm for routing through a rectangle is presented. Consider an $n$-by-$m$ rectangular grid and a set of $N$ two-terminal nets. A net is a pair of points on the boundary of the rectangle. A layout is a set of edge-disjoint paths, one for each net. Our algorithm constructs a layout, if there is one, in $O(N \log N)$ time; this contrasts favorably with the area of the layout that might be as large as $n^2$. The layout constructed can be wired using four layers of interconnect with only $O(N)$ contact cuts. A partial extension to multiterminal nets is also discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Univ des Saarlandes, Saarbruecken, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; automated layout; Computer Aided Design; computer programming --- Algorithms; design; integrated circuits; routing; theory; verification", subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Placement and routing. {\bf E.1}: Data, DATA STRUCTURES, Arrays. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Chor:1986:ANT, author = "Benny Chor and Charles E. Leiserson and Ronald L. Rivest and James B. Shearer", title = "An Application of Number Theory to the Organization of Raster-Graphics Memory", journal = j-J-ACM, volume = "33", number = "1", pages = "86--104", month = jan, year = "1986", CODEN = "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/rosenfeld/1986.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4800.html", abstract = "A high-resolution raster-graphics display is usually combined with processing power and a memory organization that facilitates basic graphics operations. For many applications, including interactive text processing, the ability to quickly move or copy small rectangles of pixels is essential. This paper proposes a novel organization of raster-graphics memory that permits all small rectangles to be moved efficiently. The memory organization is based on a doubly periodic assignment of pixels to M memory chips according to a `Fibonacci' lattice. The memory organization guarantees that, if a rectilinearly oriented rectangle contains fewer than M/ ROOT 5 pixels, then all pixels will reside in different memory chips and thus can be accessed simultaneously. Moreover, any M consecutive pixels, arranged either horizontally or vertically, can be accessed simultaneously.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Lab for Computer Science, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "data storage units; design; display devices; Fibonacci lattices; image part pattern; interleaving; mathematical techniques --- Number Theory; memory organization; raster-graphics memory; theory", subject = "{\bf I.3.1}: Computing Methodologies, COMPUTER GRAPHICS, Hardware architecture, Raster display devices. {\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Interleaved memories. {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Image display.", } @Article{Graham:1986:NDS, author = "Marc H. Graham and Alberto O. Mendelzon and Moshe Y. Vardi", title = "Notions of Dependency Satisfaction", journal = j-J-ACM, volume = "33", number = "1", pages = "105--129", month = jan, year = "1986", CODEN = "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 Un., 1984.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4798.html", abstract = "Two notions of dependency satisfaction, consistency and completeness, are introduced. Consistency is the natural generalization of weak-instance satisfaction and seems appropriate when only equality-generating dependencies are given, but disagrees with the standard notion in the presence of tuple-generating dependencies. Completeness is based on the intuitive semantics of tuple-generating dependencies but differs from the standard notion for equality-generating dependencies. It is argued that neither approach is the correct one, but rather that they correspond to different policies on constraint enforcement, and each one is appropriate in different circumstances. Consistency and completeness of a state are characterized in terms of the tableau associated with the state and in terms of logical properties of a set of first-order sentences associated with the state. A close relation between the problems of testing for consistency and completeness and of testing implication of dependencies is established, leading to lower and upper bounds for the complexity of consistency and completeness. The possibility of formalizing dependency satisfaction without using a universal relation scheme is examined.", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technology, Sch of Information \& Computer Science, Atlanta, GA, USA", affiliationaddress = "Georgia Inst of Technology, Sch of Information \& Computer Science, Atlanta, GA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; completeness; consistency; database systems; dependency satisfaction; design; Relational; theory; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures.", } %% Page 408 is blank @Article{Lubachevsky:1986:CAA, author = "Boris Lubachevsky and Debasis Mitra", title = "A Chaotic Asynchronous Algorithm for Computing the Fixed Point of a Nonnegative Matrix of Unit Spectral Radius", journal = j-J-ACM, volume = "33", number = "1", pages = "130--150", month = jan, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4801.html", abstract = "Given a nonnegative, irreducible matrix P of spectral radius unity, there exist a positive vector pi such that pi equals pi P. If P also happens to be stochastic, then pi gives the stationary distribution of the Markov chain that has state-transition probabilities given by the elements of P. This paper gives an algorithm for computing pi that is particularly well suited for parallel processing. The main attraction of our algorithm is that the timing and sequencing restrictions on individual processors are almost entirely eliminated and, consequently, the necessary coordination between processors is negligible and the enforced idle time is also negligible.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; asynchronous algorithm; chaotic algorithm; computer programming; computer systems, digital --- Parallel Processing; Markov chains; probability --- Random Processes; theory", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra.", } @Article{Emerson:1986:SNR, author = "E. Allen Emerson and Joseph Y. Halpern", title = "``Sometimes'' and ``Not Never'' Revisited: {On} Branching versus Linear Time Temporal Logic", journal = j-J-ACM, volume = "33", number = "1", pages = "151--178", month = jan, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4999.html", abstract = "The differences between and appropriateness of branching versus linear time temporal logic for reasoning about concurrent programs are studied. These issues have been previously considered by L. Lamport. To facilitate a careful examination of these issues, a language, CTL*, in which a universal or existential path quantifier can prefix an arbitrary linear time assertion, is defined. The expressive power of a number of sublanguages is then compared. CTL* is also related to the logics MPL of Abrahamson and PL of Harel, Kozen, and Parikh. The paper concludes with a comparison of the utility of branching and linear time temporal logics.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas, Computer Science Dep, Austin, TX, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory --- Programming Theory; computer programming; computer programming languages; concurrent programs; design; languages; temporal logic; theory; Theory; verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Assertions. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages.", } @Article{Eager:1986:BHM, author = "Derek L. Eager and Kenneth C. Sevcik", title = "Bound Hierarchies for Multiple-Class Queuing Networks", journal = j-J-ACM, volume = "33", number = "1", pages = "179--206", month = jan, year = "1986", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:56:00 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4992.html", abstract = "An algorithm for computing bounds on the performance measures of multiple-class, product-form queuing networks is presented. The algorithm offers the user a hierarchy of bounds with differing accuracy levels and computational cost requirements. Unlike previously proposed bounding algorithms, the algorithm is applicable to all of the types of product-form queueing networks that are commonly used in computer system and computer-communication network applications.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; bound hierarchies; bounding algorithms; computer networks --- Performance; computer programming --- Algorithms; computer systems, digital --- Performance; mean value analysis; multiple-class queueing networks; performance; probability; product-form queueing networks; Queueing Theory; theory", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Operational analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{vandeLiefvoort:1986:MAS, author = "Appie van de Liefvoort and Lester Lipsky", title = "A Matrix-Algebraic Solution to Two ${K}_m$ Servers in a Loop", journal = j-J-ACM, volume = "33", number = "1", pages = "207--223", month = jan, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5391.html", abstract = "An explicit steady-state solution is given for any queuing loop made up of two general servers, whose distribution functions have rational Laplace transforms. The solution is in matrix geometric form over a vector space that is itself a direct or Kronecker product of the internal state spaces of the two servers. The algebraic properties of relevant entities in this space are given in an appendix. The closed-form solution yields simple recursive relations that in turn lead to an efficient algorithm for calculating various performance measures such as queue length and throughput. A computational-complexity analysis shows that the algorithm requires at least an order of magnitude less computational effort than any previously reported algorithm.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Kansas, Dep of Computer Science, Lawrence, KS, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer systems, digital; finite population; mathematical techniques --- Matrix Algebra; mathematical transformations --- Laplace Transforms; matrix-geometric solution; Performance; performance; probability --- Queueing Theory; queue length; theory", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", } @Article{Harel:1986:ETI, author = "David Harel", title = "Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes, and Fairness", journal = j-J-ACM, volume = "33", number = "1", pages = "224--248", month = jan, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/4993.html", abstract = "Elementary translation between various kinds of recursive trees are presented. It is shown that trees of either finite or countably infinite branching can be effectively put into one-one correspondence with infinitely branching trees in such a way that the infinite paths of the latter correspond to the `phi-abiding' infinite paths of the former. Here phi can be any member of a very wide class of properties of infinite paths. For many properties phi, the converse holds too. Two of the applications involve (a) the formulation of large classes of highly undecidable variants of classical computational problems, and in particular, easily describable domino problems that are NP-complete, and (b) the existence of a general method for proving termination of nondeterministic or concurrent programs under any reasonable notion of fairness.", acknowledgement = ack-nhfb, affiliationaddress = "Weizmann Inst of Science, Dep of Applied Mathematics, Rehovot, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; domino problems; fairness; high undecidability; infinite trees; languages; mathematical techniques --- Trees; recursive trees; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems.", } @Article{Digricoli:1986:EBB, author = "Vincent J. Digricoli and Malcolm C. Harrison", title = "Equality-Based Binary Resolution", journal = j-J-ACM, volume = "33", number = "2", pages = "253--289", month = apr, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5389.html", abstract = "A major event in automated reasoning was the introduction by J. A. Robinson of resolution as an inference principle that is complete for the first-order predicate calculus. Here the theory of binary resolution, based strictly on unification, is recast to incorporate the axioms of equality. Equality-based binary resolution is complete without making use of paramodulation and leads to refutations that are less than half as long as standard refutations with the equality axioms. A detailed discussion is given of the first major use of a theorem prover based on this new method.", acknowledgement = ack-nhfb, affiliationaddress = "Fordham Univ, Bronx, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; completeness; computer metatheory --- Formal Logic; equality-based binary resolution; experimentation; mechanical theorem proving; performance; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving.", } @Article{Asano:1986:PPR, author = "Takao Asano and Tetsuo Asano and Hiroshi Imai", title = "Partitioning a Polygonal Region into Trapezoids", journal = j-J-ACM, volume = "33", number = "2", pages = "290--312", month = apr, year = "1986", CODEN = "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/86.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5387.html", abstract = "The problem of partitioning a polygonal region into a minimum number of trapezoids with two horizontal sides is discussed. A triangle with a horizontal side is considered to be a trapezoid with two horizontal sides one of which is degenerate. First, a method of achieving a minimum partition is presented. Next, this problem is shown to be polynomially equivalent to the problem of finding a maximum independent set of a straight-lines-in-the-plane graph, and consequently, it is shown to be NP-complete. However, for a polygonal region without windows, an $O(n^2)$-time algorithm for partitioning it into a minimum number of trapezoids is presented. Finally, an $O(n \log n)$-time approximation algorithm with the performance bound 3 is presented. The results are relevant to VLSI design.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tokyo, Tokyo, Jpn", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "approximation; computational complexity; computational geometry; computer metatheory; computer programming --- Algorithms; decomposition; dynamic programming; image part form; integrated circuits, VLSI --- Computer Aided Design; mathematical techniques --- Graph Theory; np-completeness; partitioning; polygon triangulation; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf I.4.6}: Computing Methodologies, IMAGE PROCESSING, Segmentation, Region growing, partitioning. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems. {\bf J.6}: Computer Applications, COMPUTER-AIDED ENGINEERING, Computer-aided design (CAD).", } @Article{Lamport:1986:MEPa, author = "Leslie Lamport", title = "The Mutual Exclusion Problem: {Part I} --- The Theory of Interprocess Communication", journal = j-J-ACM, volume = "33", number = "2", pages = "313--326", month = apr, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5384.html", abstract = "A novel formal theory of concurrent systems that does not assume any atomic operations is introduced. The execution of a concurrent program is modeled as an abstract set of operation executions with two temporal ordering relations: ``precedence'' and ``can causally affect''. A primitive interprocess communication mechanism is then defined. In Part II, the mutual exclusion is expressed precisely in terms of this model, and solutions using the communication mechanisms are given.", acknowledgement = ack-nhfb, affiliationaddress = "Digital Equipment Corp, Palo Alto, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming; computer systems, digital; concurrent systems; Distributed; interprocess communication; mutual exclusion problem; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Mutual exclusion. {\bf H.1.1}: Information Systems, MODELS AND PRINCIPLES, Systems and Information Theory, Information theory. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf F.3.m}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Miscellaneous.", } @Article{Lamport:1986:MEPb, author = "Leslie Lamport", title = "The Mutual Exclusion Problem: {Part II} --- Statement and Solutions", journal = j-J-ACM, volume = "33", number = "2", pages = "327--348", month = apr, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5385.html", abstract = "The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure-tolerance requirements. Four ``distributed'' $N$-process solutions are given, ranging from a solution requiring only one communication bit per process that permits individual starvation, to one requiring about $N!$ communication bits per process that satisfies every reasonable fairness and failure-tolerance requirement that we can conceive of.", acknowledgement = ack-nhfb, affiliationaddress = "Digital Equipment Corp, Palo Alto, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer operating systems; computer systems, digital; Distributed; fault-tolerance; mutual exclusion problem; reliability; synchronization; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Mutual exclusion. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability.", } @Article{Reiter:1986:SSC, author = "Raymond Reiter", title = "A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values", journal = j-J-ACM, volume = "33", number = "2", pages = "349--370", month = apr, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5388.html", abstract = "A sound and, in certain cases, complete method is described for evaluating queries in relational databases with null values where these nulls represent existing but unknown individuals. The soundness and completeness results are proved relative to a formalization of such databases as suitable theories of first-order logic. Because the algorithm conforms to the relational algebra, it may easily be incorporated into existing relational systems.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of British Columbia, Vancouver, BC, Can", ajournal = "J. Assoc. Comput. Mach.", annote = "nulls are unique", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; completeness; completeness proofs; computer programming --- Algorithms; database systems; design; first-order logic; integrity constraints; languages; null values; query evaluation; query evaluation algorithm; Relational; relational algebra; relational databases; soundness; soundness proofs; theory; verification", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic.", } @Article{Flajolet:1986:PMR, author = "Philippe Flajolet and Claude Puech", title = "Partial Match Retrieval of Multidimensional Data", journal = j-J-ACM, volume = "33", number = "2", pages = "371--407", month = apr, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5453.html", abstract = "A precise analysis of partial match retrieval of multidimensional data is presented. The structures considered here are multidimensional search trees (k-d-trees) and digital tries (k-d-tries), as well as structures designed for efficient retrieval of information stored on external devices. The methods used include a detailed study of a differential system around a regular singular point in conjunction with suitable contour integration techniques for the analysis of $k$-d-trees, and properties of the Mellin integral transform for $k$-d-tries and extendible cell algorithms.", acknowledgement = ack-nhfb, affiliationaddress = "INRIA, Rocquencourt, Fr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; data processing; Data Structures; database indexing; K-D trees; K-D tries; mathematical techniques --- Trees; multidimensional data; partial match retrieval; performance; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Counting problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Generating functions.", } @Article{Abiteboul:1986:TSL, author = "Serge Abiteboul and Seymour Ginsburg", title = "Tuple Sequences and Lexicographic Indexes", journal = j-J-ACM, volume = "33", number = "3", pages = "409--422", month = jul, year = "1986", CODEN = "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/database.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5926.html", abstract = "The concept of a tuple sequence is introduced in order to investigate structure connected with relational model implementation. Analogs are presented for the relational operations of projection, join, and selection, and the decomposition problems for tuple sequences is considered. The lexicographical ordering of tuple sequences is studied via the notion of (lexicographic) index. A sound and complete set of inference rules for indexes is exhibited, and two algorithmic questions related to indexes examined. Finally, indexes and functional dependencies in combination are studied.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Southern California, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; database systems; dependencies inference rules; design; inference rules; lexicographic indexes; management; Relational; structure connected with relational implementation; theory; tuple sequences; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.3.1}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing.", } @Article{Beeri:1986:EIA, author = "Catriel Beeri and Michael Kifer", title = "Elimination of Intersection Anomalies from Database Schemes", journal = j-J-ACM, volume = "33", number = "3", pages = "423--450", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5927.html", abstract = "The desirability of acyclic (conflict-free) schemes has been well argued. When a scheme is described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand side and do not form intersection anomalies. It is shown that if the second condition fails to hold, the scheme can be amended so that it does hold. The basic step is to add one attribute and some dependencies to resolve one intersection anomaly. This step generates an extension of the given scheme in which the anomaly does not exist. Also, the iterative use of the basic step is analyzed and it is proved that the transformation so defined terminates and removes all intersection anomalies.", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", annote = "remove cyclic dependencies.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "acyclic schemes; algorithms; database systems; design; mathematical techniques --- Graph Theory; multivalued dependencies; Relational; theory; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Chin:1986:SPI, author = "Francis Chin", title = "Security Problems on Inference Control for {SUM}, {MAX}, and {MIN} queries", journal = j-J-ACM, volume = "33", number = "3", pages = "451--464", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5928.html", abstract = "The basic inference problem is defined as follows: For a finite set $X$ equals $\{x_1, \ldots{}, x_n\}$, we wish to infer properties of elements of $X$ on the basis of sets of `queries' regarding subsets of $X$. By restricting these queries to statistical queries, the statistical database (SDB) security problem is obtained. The security problem for the SDB is to limit the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained the SDB is said to be compromised. In this paper, two applications concerning the security of the SDB are considered: (1) On-line application. The queries are answered one by one in sequence and it is necessary to determine whether the SDB is compromised if a new query is answered. (2) Off-line application. All queries are available at the same time and it is necessary to determine the maximum subset of queries to be answered without compromising the SDB.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Hong Kong, Hong Kong", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; data processing --- Security of Data; database systems; inference control; max/min queries; security; security problems; statistical databases; sum query; theory; verification", subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection. {\bf D.4.6}: Software, OPERATING SYSTEMS, Security and Protection. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing.", } @Article{Ginsburg:1986:SSR, author = "Seymour Ginsburg and Richard Hull", title = "Sort Sets in the Relational Model", journal = j-J-ACM, volume = "33", number = "3", pages = "465--488", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5929.html", abstract = "The notion of {\em sort set\/} is introduced here to formalize the fact that certain database relations can be sorted so that two or more columns are simultaneously listed in order. This notion is shown to be applicable in several ways to enhance the efficiency of an implemented database. A characterization of when order dependency implies the existence of sort sets in a database is presented, along with several corollaries concerning complexity, Armstrong directions, and cliques of certain graphs. Sort-set dependencies are then introduced. A (finite) sound and complete set of inference rules for sort-set dependencies is presented, as well as a proof that there is no such set for functional and sort-set dependencies taken together. Deciding logical implication for sort-set dependencies is proved to be polynomial, but if functional dependencies are included the problem is co-NP-complete. Each set of sort-set and functional dependencies is shown to have an Armstrong relation. A natural generalization of Armstrong relation, here called separator, is given and then used to study the relationship between order and sort-set dependencies.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Southern California, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "ordered relations and theorems about them.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database systems; dependencies; design; logical implication; management; ordered domains; performance; Relational; sort sets; theory; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms.", } @Article{Devroye:1986:NHB, author = "Luc Devroye", title = "A Note on the Height of Binary Search Trees", journal = j-J-ACM, volume = "33", number = "3", pages = "489--498", month = jul, year = "1986", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/5925.5930", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 22 07:19:01 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5930.html", abstract = "Let $H_n$ be the height of a binary search tree with $n$ nodes constructed by standard insertions from a random permutation of $1, \ldots{}, n$. It is shown that $H_n / \log n \to c = 4.31107\ldots{}$ in probability as $n \to \infty$, where $c$ is the unique solution of $(c \log(2e)/c) = 1$, $c \geq 2$. Also, for all $p > 0$, $\lim_{n \to \infty} E(H^p_n) / \log^p n = c^p$. Finally, it is proved that $S_n /\log n \to c* = 0.3733\ldots{}$, in probability, where $c*$ is defined by $c \log((2e)/c) = 1$, $c \leq 1$, and $S_n$ is the saturation level of the same tree, that is, the number of full levels in the tree.", acknowledgement = ack-nhfb, affiliationaddress = "McGill Univ, Montreal, Que, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; binary search trees; computer programming --- Algorithms; data processing; Data Structures; mathematical techniques --- Trees; probability --- Random Processes; theory; verification", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Dolev:1986:RAA, author = "Danny Dolev and Nancy A. Lynch and Shlomit S. Pinter and Eugene W. Stark and William E. Weihl", title = "Reaching Approximate Agreement in the Presence of Faults", journal = j-J-ACM, volume = "33", number = "3", pages = "499--516", month = jul, year = "1986", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:56:44 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5931.html", abstract = "This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Boolean values or values from some bounded range, and in which approximate, rather than exact, agreement is the desired goal. Algorithms are presented to reach approximate agreement in asynchronous, as well as synchronous systems. The asynchronous agreement algorithm is an interesting contrast to a result of M. Fischer et al, who show that exact agreement with guaranteed termination is not attainable in an asynchronous system with as few as one faulty process. The algorithms work by successive approximation, with a provable convergence rate that depends on the ratio between the number of faulty processes and the total number of processes. Lower bounds on the convergence rate for algorithms of this form are proved, and the algorithms presented are shown to be optimal.", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "agreement in presence of faults; algorithms; Byzantine generals problem; computer networks; computer programming --- Algorithms; computer systems, digital; Distributed; reliability; theory; verification", subject = "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems.", } @Article{Coleman:1986:PFS, author = "Thomas F. Coleman and Anders Edenbrandt and John R. Gilbert", title = "Predicting Fill for Sparse Orthogonal Factorization", journal = j-J-ACM, volume = "33", number = "3", pages = "517--532", month = jul, year = "1986", CODEN = "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", 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}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5932.html", abstract = "In solving large sparse linear least squares problems Ax approximately equals $b$, several different numeric methods involve computing the same upper triangular factor $R$ of $A$. It is of interest to be able to compute the nonzero structure of R, given only the structure of $A$. The solution to this problem comes from the theory of matchings in bipartite graphs. The structure of $A$ is modeled with a bipartite graph, and it is shown how the rows and columns of $A$ can be rearranged into a structure from which the structure of its upper triangular factor can be correctly computed. Also, a new method for solving sparse least squares problems, called block back-substitution, is presented. This method assures that no unnecessary space is allocated for fill, and that no unnecessary space is needed for intermediate fill.", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; bipartite graphs; computer programming --- Algorithms; least-squares problems; mathematical techniques; Matrix Algebra; nla; qrd; sparse; sparse matrices; sparse orthogonal factorization; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Least squares approximation. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods). {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse and very large systems. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Least squares methods. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Hochbaum:1986:UAA, author = "Dorit S. Hochbaum and David B. Shmoys", title = "A Unified Approach to Approximation Algorithms for Bottleneck Problems", journal = j-J-ACM, volume = "33", number = "3", pages = "533--550", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5933.html", abstract = "In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design is investigated. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P equals NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Berkeley, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "718; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; approximation algorithms; bottleneck problems; computer programming; np-completeness; telecommunication systems --- Design; theory; verification; worst-case analysis", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Singh:1986:IMS, author = "Samar Singh", title = "Improved Methods for Storing and Updating Information in the Out-of-Kilter Algorithm", journal = j-J-ACM, volume = "33", number = "3", pages = "551--567", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5934.html", abstract = "Currently, network codes based on the primal simplex algorithm are believed to be computationally superior to those based on other methods. Some modifications of the out-of-kilter algorithm of Ford and Fulkerson are given, together with proofs of their correctness and computer implementations using appropriate data structures. The computational tests in this paper indicate that the final code based on these modifications is superior to any previously implemented version of this algorithm. Although this code is not competitive with state-of-the-art primal simplex codes, its performance is encouraging, especially in the case of assignment problems.", acknowledgement = ack-nhfb, affiliationaddress = "Bharat Heavy Electricals Ltd, New Delhi, India", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; mathematical programming; minimum-cost network flow; out-of-kilter algorithm; performance; primal simplex algorithm; theory; verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @Article{Mitra:1986:AEC, author = "Debasis S. Mitra and J. McKenna", title = "Asymptotic Expansions for Closed {Markovian} Networks with State-Dependent Service Rates", journal = j-J-ACM, volume = "33", number = "3", pages = "568--592", month = jul, year = "1986", CODEN = "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/1986.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5935.html", abstract = "A method is presented for calculating the partition function, and from it, performance measures, for closed Markovian stochastic networks with queuing centers in which the service or processing rate depends on the center's state or load. The analysis on which this method is based is new and a major extension of our earlier work on load-independent queuing networks. The method gives asymptotic expansions for the partition function in powers of 1/N, where $N$ is a parameter that reflects the size of the network. The expansions are particularly useful for large networks with many classes, each class having many customers. The end result is a decomposition by which expansion coefficients are obtained exactly by linear combinations of partition function values of small network constructs called pseudonetworks. Effectively computable bounds are given for errors arising from the use of a finite number of expansion terms.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "A method is presented for calculating the partition function, and from it, performance measures, for closed Markovian stochastic networks with queuing centers in which the service or processing rate depends on the center's state or load. The analysis on which this method is based is new and a major extension of our earlier work on load-independent queuing networks. The method gives asymptotic expansions for the partition function in powers of $1/n$.", classification = "722; 723; 922", descriptors = "Method; closed queueing network; decomposition; state dependent service; performance evaluation", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; closed Markovian stochastic networks; computer systems, digital --- Performance; partition function; performance; performance measures; probability; Queueing Theory; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Tsitsiklis:1986:PPB, author = "John N. Tsitsiklis and Christos H. Papadimitriou and Pierre Humblet", title = "The Performance of a Precedence-Based Queueing Discipline", journal = j-J-ACM, volume = "33", number = "3", pages = "593--602", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5936.html", abstract = "A queuing system with infinitely many servers, and with the following queuing discipline is considered: For any two jobs $i$ and $j$ in the system, such that $i$ arrived later than $j$, there is a fixed probability $p$ that $i$ will have to wait for j's execution to terminate before $i$ starts executing. This queuing system is a very simple model for database concurrency control via `static' locking, as well as of parallel execution of programs consisting of several interdependent processes. Results suggest that the degree of multiprogramming of multiuser databases, or the level of parallelism of concurrent programs, is inversely proportional to the probability of conflict, and that the constant is small and known within a factor of 2. The technique used involves the computation of certain asymptotic parameters of a random infinite directed a cyclic graph (dag) that seem of interest by themselves.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921; 922", descriptors = "Performance evaluation; queueing system; physical design; verification", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems programming --- Multiprogramming; computer systems, digital --- Parallel Processing; database concurrency control; database systems; design; mathematical techniques --- Graph Theory; performance; probability; Queueing Theory; random directed acyclic graphs; theory", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Design studies. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency.", } @Article{Balcazar:1986:PTH, author = "Jose L. Balc{\'{a}}zar and Ronald V. Book and Uwe Sch{\"{o}}ning", title = "The Polynomial-Time Hierarchy and Sparse Oracles", journal = j-J-ACM, volume = "33", number = "3", pages = "603--617", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5937.html", abstract = "Questions about the polynomial-time hierarchy are studied. In particular, the questions, `Does the polynomial-time hierarchy collapse? ' and `Is the union of the hierarchy equal to PSPACE? ' are considered, along with others comparing the union of the hierarchy with certain probabilistic classes. In each case it is shown that the answer is `yes' if and only if for every sparse set S, the answer is `yes' when the classes are relativized to $S$ if and only if there exists a sparse set $S$ such that the answer is `yes' when the classes are relativized to S. Thus, in each case the question is answered if it is answered for any arbitrary sparse oracle set.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Politecnica de Barcelona, Barcelona, Spain", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "complexity classes; computer metatheory; polynomial-time hierarchy; probability; sparse oracles; theory; verification", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation.", } @Article{Long:1986:RCC, author = "Timothy J. Long and Alan L. Selman", title = "Relativizing Complexity Classes with Sparse Oracles", journal = j-J-ACM, volume = "33", number = "3", pages = "618--627", month = jul, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/5938.html", abstract = "T. Baker et al. constructed sparse sets A and B such that P(A) does not equal NP(A) and NP(B) does not equal co-NP(B). In contrast to their results, we prove that P equals NP if and only if for every tally language T, P(T) equals NP(T), and that NP equals co-NP if and only if for every tally language T, NP(T) equals co-NP(T). We show that the polynomial hierarchy collapses if and only if there is a sparse set $S$ such that the polynomial hierarchy relative to $S$ collapses. Similar results are obtained for several other complexity classes.", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; complexity classes; computer metatheory; polynomial hierarchy; sparse oracles; tally languages; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{deChampeaux:1986:SFI, author = "Dennis {de Champeaux}", title = "Subproblem Finder and Instance Checker, Two Cooperating Modules for Theorem Provers", journal = j-J-ACM, volume = "33", number = "4", pages = "633--657", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6491.html", abstract = "Properties are proved about INSTANCE, a theorem prover module that recognizes that a formula is a special case and\slash or an alphabetic variant of another formula, and about INSURER, another theorem prover module that decomposes a problem, represented by a formula, into independent subproblems, using a conjunction. The main result of INSTANCE is soundness; the main result of INSURER is a maximum decomposition into subproblems (with some provisos). Experimental results show that a connection graph theorem prover extended with these modules is more effective than the resolution-based connection graph theorem prover alone.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Amsterdam, Neth", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; computer programming --- Algorithms; experimentation; instance checker; subproblem finder; theorem provers; theory; verification", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction.", } @Article{Grimson:1986:CLC, author = "W. Eric L. Grimson", title = "The Combinatorics of Local Constraints in Model-Based Recognition and Localization from Sparse Data", journal = j-J-ACM, volume = "33", number = "4", pages = "658--686", month = oct, year = "1986", CODEN = "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/Reverse.eng.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6492.html", abstract = "The problem of recognizing what objects are where in the workspace of a robot can be cast as one of searching for a consistent matching between sensory data elements and equivalent model elements. In principle, this search space is enormous, and to control the potential combinatorial explosion, constraints between the data and model elements are needed. A set of constraints for sparse sensory data that are applicable to a wide variety of sensors are derived, and their characteristics are examined. Known bounds on the complexity of constraint satisfaction problems are used, together with explicit estimates of the effectiveness of the constraints derived for the case of sparse, noisy, three-dimensional sensory data, to obtain general theoretical bounds on the number of interpretations expected to be consistent with the data. It is shown that these bounds are consistent with empirical results reported previously.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "artificial intelligence; constrained search; image part form; large dimensionality; local constraints; object recognition; pattern recognition; robotics; theory", subject = "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Vision and Scene Understanding.", } @Article{Ramachandran:1986:DML, author = "Vijaya Ramachandran", title = "On Driving Many Long Wires in a {VLSI} Layout", journal = j-J-ACM, volume = "33", number = "4", pages = "687--701", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6784.html", abstract = "It is assumed that long wires represent large capacitive loads, and the effect on the area of a VLSI layout when drivers are introduced along many long wires in the layout is investigated. A layout is presented for which the introduction of standard drivers along long wires squares the area of the layout; it is shown, however, that the increase in area is never greater than the layout's area squared if the driver can be laid out in a square region. This paper also shows an area-time trade-off for the driver of a single long wire of length l by which the area of the driver from $\Theta(l)$, to $\Theta(l^q)$, $q < 1$, can be reduced if a delay of $\Theta(l^{1 - q})$ rather than $\Theta(\log l)$ can be tolerated. Tight bounds are also obtained on the worst-case area increase in general layouts having these drivers.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Computer Aided Design; computer programming --- Algorithms; design; drivers and area bounds; integrated circuits, VLSI; performance; theory; verification; VLSI layout", subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids.", } @Article{Chaudhuri:1986:AGP, author = "R. Chaudhuri and A. N. V. Rao", title = "Approximating Grammar Probabilities: {Solution} of a Conjecture", journal = j-J-ACM, volume = "33", number = "4", pages = "702--705", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214099.html", abstract = "It is proved that the production probabilities of a probabilistic context-free grammar may be obtained as the limit of the estimates inferred from an increasing sequence of randomly drawn samples from the language generated by the grammar.", acknowledgement = ack-nhfb, affiliationaddress = "Eastern Michigan Univ, Ypsilanti, MI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "approximation; automata theory; Context Free Grammars; estimation; languages; probabilistic grammars; probability; theory; verification", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types.", } @Article{Collings:1986:IGF, author = "Bruce Jay Collings and G. Barry Hembree", title = "Initializing Generalized Feedback Shift Register Pseudorandom Number Generators", journal = j-J-ACM, volume = "33", number = "4", pages = "706--711", month = oct, year = "1986", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/6490.6493", 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/1986.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", note = "See also \cite{Collings:1988:AIG}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6493.html", abstract = "The generalized feedback shift register pseudorandom number generators proposed by T. G. Lewis and W. H. Payne provide a very attractive method of random number generation. Unfortunately, the published initialization procedure can be extremely time consuming. This paper considers an alternative method of initialization based on a natural polynomial representation for the terms of a feedback shift register sequence that results in substantial improvements in the initialization process.", acknowledgement = ack-nhfb, affiliationaddress = "Montana State Univ, Bozeman, MT, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", descriptors = "Shift register sequences", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computers, digital --- Shift Registers; generalized feedback shift register; mathematical statistics; measurement; performance; pseudorandom number generators; Random Number Generation", subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Random number generation.", } @Article{Cosnard:1986:CPQ, author = "M. Cosnard and Y. Robert", title = "Complexity of Parallel {QR} Factorization", journal = j-J-ACM, volume = "33", number = "4", pages = "712--723", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214102.html", abstract = "An optimal algorithm to perform the parallel QR decomposition of a dense matrix of size $N$ is proposed. It is deduced that the complexity of such a decomposition is asymptotically 2N, when an unlimited number of processors is available.", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Grenoble, Fr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; givens triangularization; mathematical techniques; Matrix Algebra; parallel qr factorization; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods).", } @Article{Apt:1986:CNR, author = "K. R. Apt and G. D. Plotkin", title = "Countable Nondeterminism and Random Assignment", journal = j-J-ACM, volume = "33", number = "4", pages = "724--767", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6494.html", abstract = "Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise an operational semantics, two state transformation semantics based on the Egli-Milner and Smyth orders, respectively, and a weakest precondition semantics. Their equivalence is proved. A Hoare-like proof system for total correctness is also introduced and its soundness and completeness in an appropriate sense are shown. Finally, the recursion theoretic complexity of the notions introduced is studied.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Paris 7, Paris, Fr", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; computer programming languages; countable nondeterminism; languages; random assignment; semantics; Theory; theory; verification", subject = "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @Article{Conway:1986:RNE, author = "A. E. Conway and N. D. Georganas", title = "{RECAL}--{A} New Efficient Algorithm for the Exact Analysis of Multiple-Chain Queuing Networks", journal = j-J-ACM, volume = "33", number = "4", pages = "768--791", month = oct, year = "1986", CODEN = "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/1986.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6495.html", abstract = "RECAL, a Recursion by Chain Algorithm for computing the mean performance measures of product-form multiple-chain closed queuing networks, is presented. It is based on a new recursive expression that relates the normalization constant of a network with r closed routing chains to those of a set of networks having (r minus 1) chains. It relies on the artifice of breaking down each chain into constituent subchains that each have a population of one. The time and space requirements of the algorithm are shown to be polynomial in the number of chains. When the network contains many routing chains, the proposed algorithm is substantially more efficient than the convolution or mean value analysis algorithms. The algorithm, therefore, extends the range of queuing networks that can be analyzed efficiently by exact means.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Ottawa, Ottawa, Ont Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", descriptors = "Queueing system; MVA", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; multiple-chain closed queuing networks; performance; probability; Queueing Theory; recursion by chain algorithm; theory; verification", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Network communication. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, RECAL. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory.", } @Article{Goldreich:1986:HCR, author = "Oded Goldreich and Shafi Goldwasser and Silvio Micali", title = "How to Construct Random Functions", journal = j-J-ACM, volume = "33", number = "4", pages = "792--807", month = oct, year = "1986", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/6490.6503", 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/ProbAlgs.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", note = "A computational complexity measure of the randomness of functions is introduced, and, assuming the existence of one-way functions, a pseudo-random function generator is presented.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6503.html", abstract = "A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. The generator is a deterministic polynomial-time algorithm that transforms pairs $(g, r)$, where $g$ is any one-way function and $r$ is a random $k$-bit string, to polynomial-time computable functions that cannot be distinguished from random functions by any probabilistic polynomial-time algorithm that asks and receives the value of a function at arguments of its choice. The result has applications in cryptography, random constructions, and complexity theory.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational complexity; computer metatheory; computer programming --- Algorithms; cryptography; probability; pseudorandom function generator; random functions; Random Processes; security; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Random number generation.", } @Article{Kannan:1986:PTA, author = "R. Kannan and R. J. Lipton", title = "Polynomial-Time Algorithm for the Orbit Problem", journal = j-J-ACM, volume = "33", number = "4", pages = "808--821", month = oct, year = "1986", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/6496.html", abstract = "The accessibility problem for linear sequential machines is the problem of deciding whether there is an input $x$ such that on x the machine starting in a given state $q_1$ goes to a given state $q_2$. It has been shown that this problem is reducible to the following simply stated linear algebra problem, which we call the `orbit problem': Given $(n, A, x, y)$, where $n$ is a natural number and $A$, $x$, and $y$ are $n \times n$, $n \times 1$, and $n \times 1$ matrices of rationals, respectively, decide whether there is a natural number $i$ such that $A^i x = y$. This paper shows that the orbit problem for general $n$ is decidable and in polynomial time.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational complexity; computer metatheory; computer programming --- Algorithms; languages; orbit problem; polynomial-time algorithm; theory", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf G.2.0}: Mathematics of Computing, DISCRETE MATHEMATICS, General.", } @Article{Rowland:1986:SSA, author = "John H. Rowland and John R. Cowles", title = "Small Sample Algorithms for the Identification of Polynomials", journal = j-J-ACM, volume = "33", number = "4", pages = "822--829", month = oct, year = "1986", CODEN = "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/Comp.Alg.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $P_n$ be the class of polynomials of degree less than equivalent to $n$. It is well known that the coefficients of any polynomial p belonging to $P_n$ can be recovered by sampling p at $n$ + 1 distinct points. In this paper a sample is considered to be small if it can be used to recover the coefficients of polynomials having arbitrarily large degree. It is shown that small samples do exist for the class P(M) of polynomials with integer coefficients bounded in magnitude by M. Algorithms, based on the Chinese Remainder Theorem and the theory of generalized Vandermonde determinants, are developed that recover the coefficients of polynomials from the class P(M) using small samples.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wyoming, Laramie, WY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Chinese remainder theorem; computer programming --- Algorithms; identification of polynomials; mathematical techniques; Polynomials; small sample algorithms; Vandermonde determinants", } @Article{Chazelle:1987:ICO, author = "B. Chazelle and D. P. Dobkin", title = "Intersection of Convex Objects in Two and Three Dimensions", journal = j-J-ACM, volume = "34", number = "1", pages = "1--27", month = jan, year = "1987", CODEN = "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/87.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/24036.html", abstract = "One of the basic geometric operations involves determining whether a pair of convex objects intersect. This problem is well understood in a model of computation in which the objects are given as input and their intersection is returned as output. For many applications, however, it may be assumed that the objects already exist within the computer and that the only output desired is a single piece of data giving a common point if the objects intersect or reporting no intersection if they are disjoint. For this problem, none of the previous lower bounds are valid and algorithms are proposed requiring sublinear time for their solution in two and three dimensions.", acknowledgement = ack-nhfb, affiliationaddress = "Yale Univ, New Haven, CT, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; convex sets; Fibonacci search; image part form; intersection of convex objects; mathematical techniques --- Geometry; theory; verification", subject = "{\bf E.1}: Data, DATA STRUCTURES. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Vianu:1987:DFD, author = "Victor Vianu", title = "Dynamic Functional Dependencies and Database Aging", journal = j-J-ACM, volume = "34", number = "1", pages = "28--59", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7918.html", abstract = "A simple extension of the relational model is introduced to study the effects of dynamic constraints on database evolution. Both static and dynamic constraints are used in conjunction with the model. The static constraints considered here are functional dependencies (FDs). The dynamic constraints involve global updates and are restricted to certain analogs of FDs, called ``dynamic'' FDs. The results concern the effect of the dynamic constraints on the static constraints satisfied by the database in the course of time. The effect of the past history of the database on the static constraints is investigated using the notions of age and age closure. The connection between the static constraints and the potential future evolution of the database is briefly discussed using the notions of survivability and survivability closure.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, San Diego, La Jolla, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "database aging; database systems; dynamic constraints; functional dependencies; Relational; static constraints; survivability; theory", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Data description languages (DDL).", } @Article{Reif:1987:LTS, author = "John H. Reif and Leslie G. Valiant", title = "A Logarithmic Time Sort for Linear Size Networks", journal = j-J-ACM, volume = "34", number = "1", pages = "60--76", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7532.html", abstract = "A randomized parallel algorithm that sorts on an $N$ node network with constant valence in $O(\log N)$ time is given. More particularly, the algorithm sorts $N$ items on an $N$-node cube-connected cycles graph, and, for some constant $k$,for all large enough alpha, it terminates with $k \alpha \log N$ time with probability at least $1 - N^{-\alpha}$.", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; computer systems programming; linear size networks; logarithmic time sort; parallel algorithms; randomized algorithms; Sorting; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Dolev:1987:MSN, author = "Danny Dolev and Cynthia Dwork and Larry Stockmeyer", title = "On the Minimal Synchronism Needed for Distributed Consensus", journal = j-J-ACM, volume = "34", number = "1", pages = "77--97", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7533.html", abstract = "Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to some number of failures. M. J. Fischer et al. have shown that in a completely asynchronous model, even one failure cannot be tolerated. In this paper their work is extended: Several critical system parameters, including various synchrony conditions, are identified and how varying these affects the number of faults that can be tolerated is examined. The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others.", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer networks --- Protocols; computer systems, digital; design; Distributed; distributed consensus; general heuristic principles; minimal synchronism; reliability; synchrony conditions", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability.", } @Article{Frederickson:1987:ELS, author = "Greg N. Frederickson and Nancy A. Lynch", title = "Electing a Leader in a Synchronous Ring", journal = j-J-ACM, volume = "34", number = "1", pages = "98--115", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7919.html", abstract = "The problem of electing a leader in a synchronous ring of $n$ processors is considered. Both positive and negative results are obtained. On the one hand, if processor IDs are chosen from some countable set, then there is an algorithm that uses only $O(n)$ messages in the worst case. On the other hand, any algorithm that is restricted to use only comparisons of IDs requires $\Omega (n \log n)$ messages in the worst case. Alternatively, if the number of rounds is required to be bounded by some $t$ in the worst case, and IDs are chosen from any set having at least $f(n, t)$ elements, for a certain very fast-growing function $f$, then any algorithm requires $\Omega(n \log n)$ messages in the worst case.", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; comparison algorithms; computer networks; computer programming --- Algorithms; computer systems, digital; Distributed; distributed algorithms; leader election; ring networks; synchronous ring; theory; verification", subject = "{\bf C.2.5}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Upfal:1987:HSM, author = "Eli Upfal and Avi Wigderson", title = "How to Share Memory in a Distributed System", journal = j-J-ACM, volume = "34", number = "1", pages = "116--127", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7926.html", abstract = "The power of shared-memory in models of parallel computation is studied, and a novel distributed data structure that eliminates the need for shared memory without significantly increasing the run time of the parallel computation is described. More specifically, it is shown how a complete network of processors can deterministically simulate one PRAM step in $O(\log n (\log\log n)hoch2)$ time when both models use $n$ processors and the size of the PRAM's shared memory is polynomial in $n$. (The best previously known upper bound was the trivial $O(n)$). It is established that this upper bound is nearly optimal, and it is proved that an one-line simulation of $T$ PRAM steps by a complete network of processors requires $\omega(T(\log n/\log\log n))$ time. A simple consequence of the upper bound is that an Ultracomputer (the currently feasible general-purpose parallel machine) can simulate one step of a PRAM (the most convenient parallel model to program) in $O((\log n)hoch2 \log\log n)$ steps.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer operating systems; computer programming --- Algorithms; computer simulation; computer systems, digital --- Parallel Processing; data processing --- Data Structures; design; parallel algorithms; performance; shared memory; Storage Allocation; theory; ultracomputer", subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Distributed memories. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf B.3.3}: Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids, Formal models.", } @Article{Toyama:1987:CRP, author = "Yoshihito Toyama", title = "On the {Church--Rosser} Property for the Direct Sum of Term Rewriting Systems", journal = j-J-ACM, volume = "34", number = "1", pages = "128--143", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7534.html", abstract = "The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that if two term rewriting systems both have the Church--Rosser property, then the direct sum of these systems also has this property.", acknowledgement = ack-nhfb, affiliationaddress = "NTT, Electrical Communication Lab, Tokyo, Jpn", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory; Church--Rosser property; computer programming languages --- Theory; disjoint sets of function symbols; Formal Languages; term rewriting systems", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Hochbaum:1987:UDA, author = "Dorit S. Hochbaum and David B. Shmoys", title = "Using Dual Approximation Algorithms for Scheduling Problems: {Theoretical} and Practical Results", journal = j-J-ACM, volume = "34", number = "1", pages = "144--162", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7535.html", abstract = "The problem of scheduling a set of $n$ jobs on $m$ identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper the strongest possible type of result for this problem, a polynomial approximation scheme, is presented. The scheme is based on a new approach to constructing approximation algorithms, which is called dual approximation algorithms, where the aim is to find superoptimal, but infeasible, solutions, and the performance is measured by the degree of infeasibility allowed. This notion should find wide applicability in its own right and should be considered for any optimization problem where traditional approximation algorithms have been particularly elusive.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Berkeley, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912; 913", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; combinatorial optimization; computer programming --- Algorithms; dual approximation algorithms; makespan time minimization; operations research; performance; Scheduling; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Reischuk:1987:SWP, author = "R{\"{u}}diger Reischuk", title = "Simultaneous {WRITES} of Parallel Random Access Machines Do Not Help to Compute Simple Arithmetic Functions", journal = j-J-ACM, volume = "34", number = "1", pages = "163--178", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/22944.html", abstract = "The ability of the strongest parallel random access machine model WRAM is investigated. In this model different processors may simultaneously try to write into the same cell of the common memory. It has been shown that a parallel RAM without this option (PRAM), even with arbitrarily many processors, can almost never achieve sublogarithmic time. On the contrary, every function with a small domain like binary values in case of Boolean functions can be computed by a WRAM in constant time. The machine makes fast table look-ups using its simultaneous write ability. The main result of this paper implies that in general this is the ``only way'' to perform such fast computations and that a domain of small size is necessary. Functions with large domains for which any change of one of the $n$ arguments also changes the result are considered, and a logarithmic lower time bound for WRAMs is proved.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Bielefeld, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; computer systems, digital; Parallel Processing; parallel random access machines; simple arithmetic functions; simultaneous writes; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures.", } @Article{Donatiello:1987:ACP, author = "Lorenzo Donatiello and Balakrishna R. Iyer", title = "Analysis of a Composite Performance Reliability Measure for Fault-Tolerant Systems", journal = j-J-ACM, volume = "34", number = "1", pages = "179--199", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7536.html", abstract = "A composite measure for the performance and reliability of a fault-tolerant system observed over a finite mission time is analyzed. A Markov chain model is used for system state-space representation, and transient analysis is performed to obtain closed-form solutions for the density and moments of the composite measure. Only failures that cannot be repaired until the end of the mission are modeled. The time spent in a specific system configuration is assumed to be large enough to permit the use of a hierarchical model and static measures to quantify the performance of the system in individual configurations. For a multiple-processor system, where performance measures are usually associated with and aggregated over many jobs, this is tantamount to assuming that the time to process a job is much smaller than the time between failures. An extension of the results to general acyclic Markov chain models is included.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown Heights, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer systems, digital; computers, digital --- Reliability; Fault Tolerant Capability; hierarchical model; Markov chain model; performance; reliability; reliability measure; reliability theory", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability.", } @Article{Cole:1987:SSN, author = "Richard Cole", title = "Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms", journal = j-J-ACM, volume = "34", number = "1", pages = "200--208", month = jan, year = "1987", CODEN = "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/87.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/7537.html", abstract = "N. Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of $O(\log n)$ time (or more) for many applications of this technique.", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; computer systems programming; design; parallel algorithms; Sorting; sorting algorithms; sorting networks; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relations among modes. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Urquhart:1987:HER, author = "Alasdair Urquhart", title = "Hard Examples for Resolution", journal = j-J-ACM, volume = "34", number = "1", pages = "209--219", month = jan, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/8928.html", abstract = "Exponential lower bounds are proved for the length-of-resolution refutations of sets of disjunctions constructed from expander graphs, using the method of G. S. Tseitin. Since these sets of clauses encode biconditionals, they have short (polynomial-length) refutations in a standard axiomatic formulation of propositional calculus.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; expander graphs; length-of-resolution refutations; lower bounds; mathematical techniques --- Graph Theory; performance; resolution method; sets of disjunctions; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Murray:1987:IPR, author = "Neil V. Murray and Erik Rosenthal", title = "Inference with Path Resolution and Semantic Graphs", journal = j-J-ACM, volume = "34", number = "2", pages = "225--254", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23716.html", abstract = "A graphical representation of quantifier-free predicate calculus formulas in negation normal form and a new rule of inference that employs this representation are introduced. The new rule, path resolution, is an amalgamation of resolution and Prawitz analysis. The goal in the design of path resolution is to retain some of the advantages of both Prawitz analysis and resolution methods, and yet to avoid to some extent their disadvantages. Path resolution allows Prawitz analysis of an arbitrary subgraph of the graph representing a formula. If such a subgraph is not large enough to demonstrate a contradiction, a path resolvent of the subgraph may be generated with respect to the entire graph. This generalizes the notions of large inference present in hyperresolution, clash-resolution, NC-resolution, and UR-resolution. A class of subgraphs is described for which deletion of some of the links resolved upon preserves the spanning property.", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Albany, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; mathematical techniques --- Graph Theory; path resolution; semantic graphs; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Metatheory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Hsu:1987:RPP, author = "Wen-Lian Hsu", title = "Recognizing Planar Perfect Graphs", journal = j-J-ACM, volume = "34", number = "2", pages = "255--288", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31330.html", abstract = "An $O(n^3)$ algorithm for recognizing planar graphs that do not contain induced odd cycles of length greater than 3 (odd holes) is presented. A planar graph with this property satisfies the requirement that its maximum clique size equal the minimum number of colors required for the graph (graphs all of whose induced subgraphs satisfy the latter property are perfect as defined by Berge). The algorithm presented is based on decomposing these graphs into essentially two special classes of inseparable component graphs that are easy to recognize. The algorithm can also be adapted to solve the corresponding maximum independent set and minimum coloring problems. Finally, the path-parity problem on planar perfect graphs is considered.", acknowledgement = ack-nhfb, affiliationaddress = "Northwestern Univ, Evanston, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; decomposition algorithms; graph algorithms; graph coloring; graph decomposition; Graph Theory; mathematical techniques; planar perfect graphs; theory; verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf I.5.3}: Computing Methodologies, PATTERN RECOGNITION, Clustering, Algorithms.", } @Article{Greenberg:1987:EMC, author = "Albert G. Greenberg and Philippe Flajolet and Richard E. Ladner", title = "Estimating the Multiplicities of Conflicts to Speed Their Resolution in Multiple Access Channels", journal = j-J-ACM, volume = "34", number = "2", pages = "289--325", month = apr, year = "1987", CODEN = "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/CCR.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "{\em Reviews\/}: Computing Reviews, Vol. 30, No. 7", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23006.html", abstract = "New, improved algorithms are proposed for regulating access to a common channel shared by many geographically distributed computing stations. A conflict of multiplicity $n$ occurs when $n$ stations transmit simultaneously to the channel. Stations receive feedback indicating whether $n$ is 0, 1, or less than equivalent to 2. If $n = 1$, the transmission succeeds; whereas if $n \geq 2$, all the transmissions fail. Algorithms are presented and analyzed that allow the conflicting stations to compute a stochastic estimate of $n$, cooperatively, at small cost, as a function of the feedback elicited during its execution. An algorithm to resolve a conflict among two or more stations controls the retransmissions of the conflicting stations so that each eventually transmits singly to the channel. Combining one of these estimation algorithms with a tree algorithm leads to a hybrid algorithm for conflict resolution.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer networks --- Local Networks; computer programming --- Algorithms; computer systems, digital; conflict resolution; Distributed; Lower-Layer Protocols; multiple access channels; performance; random-access schemes; theory; verification", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.5}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Access schemes.", } @Article{Lee:1987:ORS, author = "Yann-Hang Lee and Kang G. Shin", title = "Optimal Reconfiguration Strategy for a Degradable Multimodule Computing System", journal = j-J-ACM, volume = "34", number = "2", pages = "326--348", month = apr, year = "1987", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:57:16 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23016.html", abstract = "A quantitative approach to the problem of reconfiguring a degradable multimodule system is presented. The approach is concerned with both assigning some modules for computation and arranging others for reliability. Conventionally, a fault-tolerant system performs reconfiguration only upon a subsystem failure. Since there exists an inherent trade-off between the computation capacity and fault tolerance of a multimodule computing system, the conventional approach is a passive action and does not yield a configuration that provides an optimal compromise for the trade-off. By using the expected total reward as the optimal criterion, the need and existence of an active reconfiguration strategy, in which the system reconfigures itself on the basis of not only the occurrence of a failure but also the progression of the mission, are shown. Some important properties of an optimal reconfiguration strategy.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; degradable multimodule computing system; dynamic failure; Fault Tolerant Capability; optimal reconfiguration strategy; optimization; performance; reliability; verification", subject = "{\bf B.2.3}: Hardware, ARITHMETIC AND LOGIC STRUCTURES, Reliability, Testing, and Fault-Tolerance. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming.", } @Article{Chan:1987:AQE, author = "Edward P. F. Chan and Alberto O. Mendelzon", title = "Answering Queries on Embedded-Complete Database Schemes", journal = j-J-ACM, volume = "34", number = "2", pages = "349--375", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23007.html", abstract = "It has been observed that, for some database schemes, users may have difficulties retrieving correct information, even for simple queries. The problem occurs when some implicit ``piece'' of information, defined on some subset of a relation scheme, is not explicitly represented in the database state. In this situation, users may be required to know how the state and the constraints interact before they can retrieve the information correctly. In this paper, the formal notion of embedded-completeness is proposed, and it is shown that schemes with this property avoid the problem described above. A polynomial-time algorithm is given to test whether a database scheme is independent and embedded-complete.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; database systems; design; embedded-complete database schemes; functional dependencies; join dependencies; query-answering; Relational; theory", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.1.1}: Information Systems, MODELS AND PRINCIPLES, Systems and Information Theory. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms.", } @Article{Papachristou:1987:ATL, author = "Christos A. Papachristou", title = "Associative Table Lookup Processing for Multioperand Residue Arithmetic", journal = j-J-ACM, volume = "34", number = "2", pages = "376--396", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23017.html", abstract = "This paper investigates the complexity of multioperand residue addition and multiplication implemented by associative table lookup processing. The complexity measure used is the size of the associative memory, that is, the number of matching words in memory. This measure largely depends on the residue recurrencies, or multiplicities, in the addition and multiplication tables modulo M. The major effort in this work is to evaluate the recurrencies in simultaneous multioperand residue addition and multiplication. The evaluation is simple in case of addition mode M, and also in multiplication mod M if M is prime. To treat the more difficult case of M nonprime, a recursive procedure was developed for computing the 2-operand multiplication recurrencies mod M. Computation results of 2-operand residue arithmetic operations are provided. Applications to RNS arithmetic implementation are discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Case Western Reserve Univ, Cleveland, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "addition; data processing; data storage, digital --- Associative; multiplication; residue number system; table lookup processing", subject = "{\bf B.2.1}: Hardware, ARITHMETIC AND LOGIC STRUCTURES, Design Styles, Parallel. {\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Associative memories. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Counting problems.", } @Article{Pflug:1987:LPN, author = "Georg Ch. Pflug and Hans W. Kessler", title = "Linear Probing with a Nonuniform Address Distribution", journal = j-J-ACM, volume = "34", number = "2", pages = "397--410", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42225.html", abstract = "This paper presents a new approach to the analysis of hashing with linear probing for nonuniformly distributed hashed keys. The use of urn models is avoided. Instead, some facts about empirical processes, which are well known in statistics, are used. In particular, an asymptotic formula for the expected probe length for both a successful and an unsuccessful search is obtained. The accuracy of the approximation is confirmed by simulation.", acknowledgement = ack-nhfb, affiliationaddress = "Justus Liebig Univ, Giessen, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer simulation; data processing; File Organization; hash-table representations; linear probing; nonuniform address distribution; performance; theory; verification", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @Article{Degano:1987:MDS, author = "Pierpaolo Degano and Ugo Montanari", title = "A Model for Distributed Systems Based on Graph Rewriting", journal = j-J-ACM, volume = "34", number = "2", pages = "411--449", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/24038.html", abstract = "In our model, a graph describes a net of processes communicating through ports and, at the same time, its computation history consisting of a partial ordering of events. Stand-alone evolution of processes is specified by context-free productions. From productions and a basic synchronization mechanism, a set of context-sensitive rewriting rules that models the evolution of processes connected to the same ports can be derived. A computation is a sequence of graphs obtained by successive rewritings. The result of a finite computation is its last graph, whereas the result of an infinite computation is the limit, infinite graph defined through a completion technique based on metric spaces. A result characterizes a concurrent computation, since it abstracts from any particular interleaving of concurrent events, while in the meantime providing information about termination, partial or complete deadlocks, and fairness.", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Pisa, Italy", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital; concurrent computation; context-sensitive rewriting rules; Distributed; graph rewriting; languages; mathematical techniques --- Graph Theory; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @Article{Peleg:1987:CDL, author = "David Peleg", title = "Concurrent Dynamic Logic", journal = j-J-ACM, volume = "34", number = "2", pages = "450--479", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23008.html", abstract = "In this paper concurrent dynamic logic (CDL) is introduced as an extension of dynamic logic tailored toward handling concurrent programs. Properties of CDL are discussed, both on the propositional and first-order level, and the extension is shown to possess most of the desirable properties of DL. Its relationships with the $\mu$-calculus, game logic, DL with recursive procedures, and PTIME are further explored, revealing natural connections between concurrency, recursion, and alternation.", acknowledgement = ack-nhfb, affiliationaddress = "Weizmann Inst of Science, Rehovot, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory --- Programming Theory; computer programming; concurrent dynamic logic; concurrent programs; languages; logics of programs; program constructs; Theory; theory; verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes.", } @Article{Homer:1987:MDP, author = "Steven Homer", title = "Minimal Degrees for Polynomial Reducibilities", journal = j-J-ACM, volume = "34", number = "2", pages = "480--491", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/23009.html", abstract = "The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result of R. E. Ladner in which only recursive sets are considered. A polynomial reducibility is defined. This reducibility is a strengthening of polynomial Turing reducibility, and its properties relate to the P equals ? NP question. For this new reducibility, a set of minimal degree is constructed under the assumption that P equals NP. However, the set constructed is nonrecursive.", acknowledgement = ack-nhfb, affiliationaddress = "Boston Univ, Boston, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "complexity theory; computer metatheory; languages; mathematical techniques --- Polynomials; minimal degrees; polynomial reducibilities; recursion theory; theory; verification", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness.", } @Article{Venkataraman:1987:DPE, author = "K. N. Venkataraman", title = "Decidability of the Purely Existential Fragment of the Theory of Term Algebras", journal = j-J-ACM, volume = "34", number = "2", pages = "492--510", month = apr, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/24037.html", abstract = "This paper is concerned with the question of the decidability and the complexity of the decision problem for certain fragments of the theory of free term algebras. The existential fragment of the theory of term algebras is shown to be decidable through the presentation of a nondeterministic algorithm, which, given a quantifier-free formula P, constructs a solution for P if it has one and indicates failure if there are no solutions. It is shown that the decision problem is in NP by proving that if a quantifier-free formula P has a solution, then there is one that can be represented as a directed acyclic graph in space at most cubic in the length of P. The decision problem is shown to be complete for NP by reducing 3-SAT to that problem. Thus it is established that the existential fragment of the theory of pure list structures in the language of NIL, CONS, CAR, CDR, equals, less than equivalent to (subexpression) is NP-complete. It is further shown that even a slightly more expressive fragment of the theory of term algebras, the one that allows bounded universal quantifiers, is undecidable.", acknowledgement = ack-nhfb, affiliationaddress = "Tufts Univ, Medford, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; bounded universal quantifiers; computer metatheory; computer programming languages; decidability; Theory; theory; theory of term algebras; verification", subject = "{\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness.", } @Article{Galil:1987:DVI, author = "Zvi Galil and Christoph M. Hoffmann and Eugene M. Luks and Claus P. Schnorr and Andreas Weber", title = "An ${O}(n^3 \log n)$ Deterministic and an ${O}(n^3)$ {Las Vegas} Isomorphism Test for Trivalent Graphs", journal = j-J-ACM, volume = "34", number = "3", pages = "513--531", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28870.html", abstract = "This paper describes an $O(n^3 \log n)$ deterministic algorithm and an $O(n^3)$ Las Vegas algorithm for testing whether two given trivalent graphs on $n$ vertices are isomorphic. In fact, the algorithms construct the set of all isomorphisms between two such graphs, presenting, in particular, generators for the group of all automorphisms of a trivalent graph. The algorithms are based upon the original polynomial-time solution to these problems by E. M. Luks but they introduce numerous speedups. These include improved permutation-group algorithms that exploit the structure of the underlying 2-groups. A remarkable property of the Las Vegas algorithm is that it computes the set of all isomorphisms between two trivalent graphs for the cost of computing only those isomorphisms that map a specified edge to a specified edge.", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; deterministic algorithm; Graph Theory; Las Vegas isomorphism test; mathematical techniques; probabilistic algorithms; theory; trivalent graphs; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Irving:1987:EAO, author = "Robert W. Irving and Paul Leather and Dan Gusfield", title = "An Efficient Algorithm for the ``Optimal'' Stable Marriage", journal = j-J-ACM, volume = "34", number = "3", pages = "532--543", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28871.html", abstract = "In an instance of size $n$ of the stable marriage problem each of $n$ men and $n$ women ranks the members of the opposite sex in order of preference. A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. The problem arises of finding a stable matching that is optimal under an equitable or egalitarian criterion of optimality. This problem was posed by D. E. Knuth and has remained unsolved for some time. Here, the objective of maximizing the average (or, equivalently, the total) `satisfaction' of all people is used. This objective is achieved when a person's satisfaction is measured by the position of his\slash her partner in his\slash her preference list. By exploiting the structure of the set of all stable matchings, and using graph-theoretic methods, an $O(n^4)$ algorithm for this problem is derived.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Glasgow, Glasgow, Scotl", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; mathematical techniques --- Graph Theory; stable marriage problem; stable matching; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Beeri:1987:TIA, author = "Catriel Beeri and Michael Kifer", title = "A Theory of Intersection Anomalies in Relational Database Schemes", journal = j-J-ACM, volume = "34", number = "3", pages = "544--577", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28872.html", abstract = "For schemas described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand sides and do not form intersection anomalies. In a recent work it is argued that real-world database schemes always meet the former requirement, and in another study it is shown that any given real-world scheme can be made to satisfy also the latter requirement, after being properly extended. However, the method of elimination of intersection anomalies proposed in the latter is intrinsically non-deterministic --- an undesirable property for a design tool. In the present work i is shown that this nondeterminism does not, however, affect the final result of the design process. In addition, we present an efficient deterministic algorithm, which is equivalent to the nondeterministic process. Along the way a study of intersection anomalies is performed.", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", annote = "Intersection anomalies due to multivalued dependencies, that need to be removed from real-world databases to make them acyclic. Transformation algorithm.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "acyclic database schemes; computer programming --- Algorithms; database systems; design; deterministic algorithm; functional dependencies; intersection anomalies; multivalued dependencies; Relational; theory; verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema.", } @Article{Blumer:1987:CIF, author = "A. Blumer and J. Blumer and D. Haussler and R. McConnell and A. Ehrenfeucht", title = "Complete Inverted Files for Efficient Text Retrieval and Analysis", journal = j-J-ACM, volume = "34", number = "3", pages = "578--595", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28873.html", abstract = "Given a finite set of texts $S$ equals $\{w_1, \ldots{}, w_k\}$ over some fixed finite alphabet $\Sigma$, a complete inverted file for $S$ is an abstract data type that provides the functions {\tt find}($w$), which returns the longest prefix of $w$ that occurs (as a subword of a word) in $S$; {\tt freq}($w$), which returns the number of times $w$ occurs in $S$; and {\tt locations}($w$), which returns the set of positions where $w$ occurs in $S$. A data structure that implements a complete inverted file for $S$ that occupies linear space and can be built in linear time, using the uniform-cost RAM model, is given. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, techniques from the theory of finite automata and the work on suffix trees are used to build a deterministic finite automation that recognizes the set of all subwords of the set $S$. This automation is then annotated with additional information and compacted to facilitate the desired query functions. The result is a data structure that is smaller and more flexible than the suffix tree.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Denver, Denver, CO, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "Data structure is a compact directed acyclic word graph. Searches for arbitrary strings are allowed. Suggest searching DNA sequences. Linear times for finding the longest prefix of a keyword.", classification = "721; 723; 903", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; automata theory --- Finite Automata; complete inverted files; data processing; Data Structures; information science --- Information Retrieval; mathematical techniques --- Trees; suffix trees; text retrieval and analysis; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf H.3.1}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Indexing methods.", } @Article{Fredman:1987:FHT, author = "Michael L. Fredman and Robert Endre Tarjan", title = "{Fibonacci} Heaps and Their Uses in Improved Network Optimization Algorithms", journal = j-J-ACM, volume = "34", number = "3", pages = "596--615", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28874.html", abstract = "In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated $F$-heaps), extends the binomial queues proposed by J. Vuillemin. $F$-heaps support arbitrary deletion from an $n$-item heap in $O(\log n)$ amortized time and all other standard heap operations in $O(1)$ amortized time. Using $F$-heaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain several worst-case bounds. Of the results, an improved bound for minimum spanning trees is the most striking, although all the results give asymptotic improvements for graphs of appropriate densities.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California at San Diego, La Jolla, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; binomial queues; computer networks --- Optimization; computer programming --- Algorithms; data processing; Data Structures; Fibonacci heaps; mathematical techniques --- Graph Theory; network optimization algorithms; theory; worst-case bounds", subject = "{\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Hirschberg:1987:NAF, author = "D. S. Hirschberg and L. L. Larmore", title = "New Applications of Failure Functions", journal = j-J-ACM, volume = "34", number = "3", pages = "616--625", month = jul, year = "1987", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 28 09:27:41 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28875.html", abstract = "Presented are several algorithms whose operations are governed by a principle of failure functions. When searching for an extremal value within a sequence, it suffices to consider only the subsequence of items each of which is the first possible improvement of its predecessor. These algorithms are more efficient than their more traditional counterparts.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California at Irvine, Irvine, CA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "This paper discusses line-breaking and page-breaking algorithms at length, proving the correctness of an improvement on the Knuth/Plass line-breaking algorithm used in the \TeX{} typesetting system.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; data processing; Data Structures; extremal value; failure functions; mathematical programming, dynamic; search methods; theory; verification", subject = "{\bf E.1}: Data, DATA STRUCTURES, Arrays. {\bf E.1}: Data, DATA STRUCTURES, Lists. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Srikanth:1987:OCS, author = "T. K. Srikanth and Sam Toueg", title = "Optimal Clock Synchronization", journal = j-J-ACM, volume = "34", number = "3", pages = "626--645", month = jul, year = "1987", CODEN = "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/dist-time.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28876.html", abstract = "We present a simple, efficient, and unified solution to the problems of synchronizing, initializing, and integrating clocks for systems with different types of failures: crash, omission, and arbitrary failures with and without message authentication. This is the first known solution that achieves optimal accuracy - the accuracy of synchronized clocks (with respect to real time) is as good as that specified for the underlying hardware clocks. The solution is also optimal with respect to the number of faulty processes that can be tolerated to achieve this accuracy.", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Byzantine failures; computer programming --- Algorithms; computer systems, digital; Distributed; message authentication; optimal clock synchronization; reliability; synchronizing in presence of faults; theory; verification", subject = "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Distributed systems.", } @Article{Cabay:1987:SLE, author = "Stanley Cabay and Bart Domzy", title = "Systems of Linear Equations with Dense Univariate Polynomial Coefficients", journal = j-J-ACM, volume = "34", number = "3", pages = "646--660", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28877.html", abstract = "An algorithm for computing the power series solution of a system of linear equations with components that are dense univariate polynomials over a field is described and analyzed. A method for converting the power series solution to rational form is derived. Theoretical and experimental cost estimates are obtained and used to identify classes of problems for which the power series method outperforms modular methods. Finally, it is shown that the power series method also provides an effective mechanism for solving the problem in which the coefficients of the polynomials are from the ring of integers.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Alberta, Edmonton, Alberta, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; dense univariate polynomial coefficients; design; experimentation; Linear Algebra; mathematical techniques; systems of linear equations; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations in finite fields. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms. {\bf I.1.4}: Computing Methodologies, ALGEBRAIC MANIPULATION, Applications.", } @Article{Nelson:1987:SCT, author = "Randolph Nelson", title = "Stochastic Catastrophe Theory in Computer Performance Modeling", journal = j-J-ACM, volume = "34", number = "3", pages = "661--685", month = jul, year = "1987", CODEN = "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/1987.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28878.html", abstract = "In this paper catastrophic behavior found in computer systems is investigated. Deterministic Catastrophe theory is introduced first. Then it is shown how the theory can be applied in a stochastic framework, which is useful for understanding computer system performance models. Computer system models that exhibit stochastic cusp catastrophe behavior are then analyzed. These models include slotted ALOHA, multiprogramming in computer systems, and buffer flow control in computer networks.", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Yorktown Heights, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", descriptors = "Computer system; performance evaluation; model; stochastic theory; slotted ALOHA; multiprogramming; buffer; flow control", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "buffer flow control; computer networks --- Performance; computer systems programming --- Multiprogramming; computer systems, digital; Performance; slotted aloha; stochastic catastrophe theory; theory; verification", subject = "{\bf B.3.3}: Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids, Formal models. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Formal models. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance.", } @Article{Suri:1987:IPA, author = "Rajan Suri", title = "Infinitesimal Perturbation Analysis for General Discrete Event Systems", journal = j-J-ACM, volume = "34", number = "3", pages = "686--717", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28879.html", abstract = "A rigorous extension of the recent perturbation analysis approach to more general discrete event systems is given. First, a general class of systems and performance measures is defined, and some basic representational and linearity properties are derived. Next a sample gradient of performance with respect to a parameter of the system is defined. Then, for certain parameters of such systems, an infinitesimal perturbation analysis algorithm is derived. It is proved that this algorithm gives exact values for the sample gradients of performance with respect to the parameters, by observing only one sample path of the DEDS. The computational complexity of this algorithm is bound to be linear in the number of events. These results offer the potential for very efficient calculation of the gradients, a fact that can be used for design/ operation of computer systems, communication networks, manufacturing systems, and many other real-world systems.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wisconsin, Madison, WI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "716; 717; 718; 723; 912; 921", descriptors = "Performance evaluation; simulation; stochastic analysis; operational analysis", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Analysis; computer networks --- Design; computer programming --- Algorithms; computer systems, digital --- Design; discrete event dynamic systems; experimentation; general discrete event systems; infinitesimal perturbation analysis; mathematical techniques --- Perturbation Techniques; measurement; performance; Performance and Parameters; Perturbation; systems science and cybernetics; telecommunication systems --- Design; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Operational analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Simulation. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Book:1987:EDG, author = "Ronald V. Book and Ding-Zhu Du", title = "The Existence and Density of Generalized Complexity Cores", journal = j-J-ACM, volume = "34", number = "3", pages = "718--730", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28880.html", abstract = "The concept of complexity cores is extended to the notion of a proper hard core, and an existence theorem for these cores is proved. In addition, the density of such generalized complexity cores is studied.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Santa Barbara, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer metatheory; generalized complexity cores; mathematical techniques --- Set Theory; proper hard cores; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Machine-independent complexity.", } @Article{Oyamaguchi:1987:EPR, author = "Michio Oyamaguchi", title = "The Equivalence Problem for Real-Time {DPDA}s", journal = j-J-ACM, volume = "34", number = "3", pages = "731--760", month = jul, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28881.html", abstract = "The equivalence problem for deterministic real-time pushdown automata is shown to be decidable. This result is obtained by showing that L. G. Valiant's parallel stacking technique using a replacement function introduced in this paper succeeds for deterministic real-time pushdown automata. Equivalence is also decidable for two deterministic pushdown automata, one of which is real-time.", acknowledgement = ack-nhfb, affiliationaddress = "Mie Univ, Tsu, Jpn", ajournal = "J. Assoc. Comput. Mach.", classification = "721", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "automata theory; deterministic pushdown automata; equivalence problem; parallel stacking; real-time DPDAS; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems.", } @Article{Inselberg:1987:CAP, author = "Alfred Inselberg and Tuval Chomut and Mordechai Reif", title = "Convexity Algorithms in Parallel Coordinates", journal = j-J-ACM, volume = "34", number = "4", pages = "765--801", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/32221.html", abstract = "With a system of parallel coordinates, objects in $R^N$ can be represented with planar `graphs' (ie., planar diagrams) for arbitrary $N$. In $R^2$, embedded in the projective plane, parallel coordinates induce a point-line duality. This yields a new duality between bounded and unbounded convex sets and hstars (a generalization of hyperbolas), as well as a duality between convex union (convex merge) and intersection. From these results, algorithms are derived for constructing the intersection and convex merge of convex polygons in $O(n)$ time and the convex hull on the plane in $O(\log n)$ for real-time and $O(n \log n)$ worst-case construction, where $n$ is the total number of points. By virtue of the duality, these algorithms also apply to polygons whose edges are a certain class of convex curves.", acknowledgement = ack-nhfb, affiliationaddress = "IBM Scientific Cent, Los Angeles, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational geometry; computer programming --- Algorithms; convexity algorithms; duality; Graph Theory; image part form; mathematical techniques; parallel coordinates; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Mitra:1987:RPC, author = "Debasis Mitra and Randall A. Cieslak", title = "Randomized Parallel Communications on an Extension of the {Omega} Network", journal = j-J-ACM, volume = "34", number = "4", pages = "802--824", month = oct, year = "1987", CODEN = "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 = "This is an extension of Valiant and Aleliunas' algorithm to eliminate the need for scheduling. This algorithm also works on networks of fixed degree nodes.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42226.html", abstract = "This paper identifies adverse source-destination traffic patterns and proposes a scheme for obtaining relief by means of randomized routing of packets on simple extensions of the well-known $\omega$ networks. L. G. Valiant and R. Aleliunas have demonstrated randomized algorithms, for a certain context which we call nonrenewal, that complete the communication task in time $O(\log N)$ with overwhelming probability, where $N$ is the number of sources and destinations. Our scheme has advantages because it uses switches of fixed degree, requires no scheduling, and, for the nonrenewal context, is as good in proven performance. In the renewal context we explicitly identify the maximum traffic intensities in the internal links of the extended $\omega$ networks over all source-destination traffic specifications that satisfy loose bounds. Second, the benefits of randomization on the stability of the network are identified. Third, exact results, for certain restricted models for sources and transmission, and approximate analytic results, for quite general models, are derived for the mean delays. These results show that, in the stable regime, the maximum mean time from source to destination is asymptotically proportional to $\log N$.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "\omega network; algorithms; computer networks; computer programming --- Algorithms; computer systems, digital; design; Distributed; performance; probabilistic algorithms; randomized parallel communications; theory; verification", subject = "{\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Vitter:1987:DAD, author = "Jeffrey Scott Vitter", title = "Design and Analysis of Dynamic {Huffman} Codes", journal = j-J-ACM, volume = "34", number = "4", pages = "825--845", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42227.html", abstract = "A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-pass algorithm due to N. Faller, R. G. Gallager, and D. E. Knuth. In each algorithm, both the sender and the receiver maintain equivalent dynamically varying Huffman trees, and the coding is done in real time. We show that the number of bits used by the new algorithm to encode a message containing t letters is less than t bits more than that used by the conventional two-pass Huffman scheme, independent of the alphabet size. This is best possible in the worst case, for any one-pass Huffman method. Tight upper and lower bounds are derived. Empirical tests show that the encodings produced by the new algorithm are shorter than those of the other one-pass algorithm and, except for long messages, are shorter than those of the two-pass method. The new algorithm is well suited for online encoding\slash decoding in data networks and for file compression.", acknowledgement = ack-nhfb, affiliationaddress = "Brown Univ, Providence, RI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; codes, symbolic; computer networks; computer programming --- Algorithms; Design; design; dynamic Huffman codes; file compression; one-pass algorithm; performance; theory", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications.", } @Article{Willard:1987:MST, author = "Dan E. Willard", title = "Multidimensional Search Trees That Provide New Types of Memory Reductions", journal = j-J-ACM, volume = "34", number = "4", pages = "846--858", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42228.html", abstract = "An orthogonal query that asks to aggregate the set of records in $k$-dimensional box regions is studied, and it is shown that space $O(N((\log N)/(\log \log N))^{k - 1})$ makes possible a combined time complexity $O(\log^k N)$ for retrievals, insertions, and deletions.", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Albany, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; data processing --- Data Structures; database systems; design; image part pattern; insertions; memory reductions; multidimensional search trees; orthogonal query; performance; retrievals; Theory; theory; verification", subject = "{\bf B.3.3}: Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms. {\bf E.1}: Data, DATA STRUCTURES. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS.", } @Article{Bloch:1987:WVA, author = "Joshua J. Bloch and Dean S. Daniels and Alfred Z. Spector", title = "A Weighted Voting Algorithm for Replicated Directories", journal = j-J-ACM, volume = "34", number = "4", pages = "859--909", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31847.html", abstract = "Weighted voting is used as the basis for a replication technique for directories. This technique affords arbitrarily high data availability as well as high concurrency. Efficient algorithms are presented for all of the standard directory operations. A structural property of the replicated directory that permits the construction of an efficient algorithm for deletion is proven. Simulation results are presented and the system is modeled and analyzed. The analysis agrees well with the simulation, and the space and time performance are shown to be good for all configurations of the system.", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie Mellon Univ, Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; computer simulation; computer systems, digital; database systems --- Distributed; deletion; Distributed; distributed algorithms; performance; reliability; replicated directories; theory; weighted voting algorithm", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf E.1}: Data, DATA STRUCTURES, Tables. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf I.6.3}: Computing Methodologies, SIMULATION AND MODELING, Applications.", } @Article{Bracha:1987:ERR, author = "Gabriel Bracha", title = "An ${O}(\log n)$ Expected Rounds Randomized {Byzantine} Generals Protocol", journal = j-J-ACM, volume = "34", number = "4", pages = "910--920", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42229.html", abstract = "Byzantine Generals protocols enable processes to broadcast messages reliably in the presence of faulty processes. These protocols are run in a system that consists of $n$ processes, $t$ of which are faulty. The protocols are conducted in synchronous rounds of message exchange. It is shown that, in the absence of eavesdropping, without using cryptography, for any $\epsilon > 0$ and $t = n/(3 + \epsilon)$, there is a randomized protocol with $O(\log n)$ expected number of rounds. If cryptographic methods are allowed, then, for $\epsilon > 0$ and $t = n / (2 + \epsilon)$, there is a randomized protocol with $O(\log n)$ expected number of rounds. This is an improvement on the lower bound of $t + 1$ rounds required for deterministic protocols, and on a previous result of $t / \log n$ expected number of rounds for randomized noncryptographic protocols.", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer networks --- Protocols; computer programming --- Algorithms; computer systems, digital; consensus protocols; cryptography; Distributed; distributed algorithms; parallel algorithms; randomized Byzantine generals protocol; reliability; theory; verification", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations.", } @Article{Tiwari:1987:LBC, author = "Prasoon Tiwari", title = "Lower Bounds on Communication Complexity in Distributed Computer Networks", journal = j-J-ACM, volume = "34", number = "4", pages = "921--938", month = oct, year = "1987", CODEN = "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 = "{\bf Reviews: \em Computing Reviews}, Vol. 29, No. 9, September 1988.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/32978.html", abstract = "The main result of this paper is a general technique for determining lower bounds on the communication complexity of problems on various distributed computer networks. This general technique is derived by simulating the general network by a linear array and then using a lower bound on the communication complexity of the problem on the linear array. Applications of this technique yield optimal bounds on the communication complexity of merging, ranking, uniqueness, and triangle-detection problems on a ring of processors. Nontrivial near-optimal lower bounds on the communication complexity of distinctness, merging, and ranking on meshes and complete binary trees are also derived.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; communication complexity; computer networks; computer systems, digital --- Distributed; interprocessor communication; lower bounds; performance; theory", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Tezuka:1987:DGP, author = "Shu Tezuka", title = "On the Discrepancy of {GFSR} Pseudorandom Numbers", journal = j-J-ACM, volume = "34", number = "4", pages = "939--949", month = oct, year = "1987", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/31846.31848", 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; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31848.html", abstract = "A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the $k$-dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The relation between the discrepancy and $k$-distribution of GFSR sequences is also obtained. Finally the definition of optimal GFSR pseudorandom number generators is introduced.", acknowledgement = ack-nhfb, affiliationaddress = "IBM Tokyo Research Lab, Tokyo, Jpn", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; generalized feedback shift register; GFSR algorithm; mathematical statistics; pseudorandom numbers; Random Number Generation; theory; verification; Walsh functions", subject = "{\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Random number generation.", } @Article{Johnson:1987:PAM, author = "Donald B. Johnson", title = "Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks", journal = j-J-ACM, volume = "34", number = "4", pages = "950--967", month = oct, year = "1987", CODEN = "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 = "Preliminary version in Proc. 23rd Annual IEEE Symposium on the Foundations of Computer Science, pages 244--254, 1982", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31849.html", abstract = "Algorithms are given that compute maximum flows in planar directed networks either in $O((\log n)^3)$ parallel time using $O(n^4)$ processors or $O((\log n)^2)$ parallel time using $O(n^6)$ processors. The resource consumption of these algorithms is dominated by the cost of finding the value of a maximum flow. When such a value is given, or when the computation is on an undirected network, the bound is $O((\log n)^2)$ time using $O(n^3)$ processors. No efficient parallel algorithm is known for the maximum flow problem in general networks.", acknowledgement = ack-nhfb, affiliationaddress = "Dartmouth Coll, Hanover, NH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; mathematical techniques --- Graph Theory; maximum flows; minimum cuts; parallel algorithms; planar directed networks; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @Article{Kaminski:1987:LTA, author = "Michael Kaminski", title = "A Linear Time Algorithm for Residue Computation and a Fast Algorithm for Division with a Sparse Divisor", journal = j-J-ACM, volume = "34", number = "4", pages = "968--984", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31850.html", abstract = "An algorithm is presented to compute the residue of a polynomial over a finite field of degree $n$ modulo a polynomial of degree $O(\log n)$ in $O(n)$ algebraic operations. This algorithm can be implemented on a Turing machine. The implementation is based on Turing machine procedure that divides a polynomial of degree $n$ by a sparse polynomial with $k$ nonzero coefficients in $O(k n)$ steps. This algorithm can be adapted to compute the residue of a number of length $n$ modulo a number of length $O(\log n)$ in $O(n)$ bit operations.", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; mathematical techniques; polynomial division; polynomial multiplication; Polynomials; residue computation; sparse polynomials; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations in finite fields. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{McKenna:1987:AES, author = "James McKenna", title = "Asymptotic Expansions of the Sojourn Time Distribution Functions of Jobs in Closed, Product-Form Queuing Networks", journal = j-J-ACM, volume = "34", number = "4", pages = "985--1003", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31851.html", abstract = "Asymptotic techniques for the calculation of the partition function of large, product-form closed queueing networks are applied to the sojourn time problem. Asymptotic expansions are obtained for the sojourn-time distribution function (STDF) of a job at $c$-server, first-come first-served (FCFS) center in closed, product-form queueing networks. Similar expansions are obtained for the joint DF of the sojourn times of a job at a sequence of single server, FCFS centers lying on an `overtake-free' path. In addition, integral expressions are obtained for the STDF of a job at a single server, FCFS center in a closed, product-form queueing network in which all the centers are load independent. These integral expressions also yield useful asymptotic expansions. Finally, integral expressions are also obtained for the joint DF of the sojourn times of a job at the centers of an `overtake-free' path in such a network.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", descriptors = "Queueing network; product form; analysis", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; closed product-form queueing networks; computer systems, digital; first-come first-served; Mathematical Models; performance; probability --- Queueing Theory; sojourn time distribution functions; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Ajtai:1987:MVP, author = "Miklos Ajtai and Yuri Gurevich", title = "Monotone versus Positive", journal = j-J-ACM, volume = "34", number = "4", pages = "1004--1015", month = oct, year = "1987", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31852.html", abstract = "In connection with the least fixed point operator the following question was raised: Suppose that a first-order formula phi (P) is (semantically) monotone in a predicate symbol P on finite structures. Is phi (P) necessarily equivalent on finite structures to a first-order formula with only positive occurrences of P? In this paper, this question is answered negatively. Moreover, the counterexample naturally gives a uniform sequence of constant-depth, polynomial-size, monotone Boolean circuits that is not equivalent to any (however nonuniform) sequence of constant-depth, polynomial-size, positive Boolean circuits.", acknowledgement = ack-nhfb, affiliationaddress = "IBM Research, San Jose, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; languages; least fixed point operator; mathematical techniques --- Operators; monotone first-order formula; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS.", } @Article{Sagiv:1987:CEB, author = "Y. Sagiv and C. Delobel and D. S. {Parker, Jr.} and Ronald Fagin", title = "Correction to ``An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic''", journal = j-J-ACM, volume = "34", number = "4", pages = "1016--1018", month = oct, year = "1987", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Sagiv:1981:EBR}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/31853.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Walther:1988:MSU, author = "Christoph Walther", title = "Many-Sorted Unification", journal = j-J-ACM, volume = "35", number = "1", pages = "1--17", month = jan, year = "1988", CODEN = "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/hybrid.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/45071.html", abstract = "Many-sorted unification is considered; that is, unification in the many-sorted free algebras of terms, where variables, as well as the domains and ranges of functions, are restricted to certain subsets of the universe, given as a potentially infinite hierarchy of sorts. It is shown that complete and minimal sets of unifiers may not always exist for many-sorted unification. Conditions for sort hierarchies that are equivalent for the existence of these sets with one, finitely many, or infinitely many elements are presented. It is also proved that being a forest-structured sort hierarchy is a necessary and sufficient criterion for the Robinson Unification Theorem to hold for many-sorted unification. An algorithm for many-sorted unification is given.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Karlsruhe, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; computer metatheory --- Formal Logic; computer programming --- Algorithms; many-sorted logic; many-sorted unification; mathematical techniques --- Algebra; Robinson unification theorem; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.1.3}: Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems, Substitution mechanisms. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Megiddo:1988:CSG, author = "N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou", title = "The Complexity of Searching a Graph", journal = j-J-ACM, volume = "35", number = "1", pages = "18--44", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42268.html", abstract = "T. Parsons originally proposed and studied the following pursuit-evasion problem on graphs: Members of a team of searchers traverse the edges of a graph $G$ in pursuit of a fugitive, who moves along the edges of the graph with complete knowledge of the locations of the pursuers. What is the smallest number $s(G)$ of searchers that will suffice for guaranteeing capture of the fugitive? It is shown that determining whether $s(G) \leq K$, for a given integer $K$, is NP-complete for general graphs but can be solved in linear time for trees. We also provide a structural characterization of those graphs $G$ with s(G) less than equivalent to $K$ for $K = 1, 2, 3$.", acknowledgement = ack-nhfb, affiliationaddress = "Tel-Aviv Univ, Tel-Aviv, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; complexity; computer programming --- Algorithms; Graph Theory; mathematical techniques; np-completeness; pursuit-evasion problem on graphs; search methods; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Lee:1988:ODU, author = "Yann-Hang Lee and Kang G. Shin", title = "Optimal Design and Use of Retry in Fault-Tolerant Computer Systems", journal = j-J-ACM, volume = "35", number = "1", pages = "45--69", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42269.html", abstract = "A new method is presented for (i) determining an optimal retry policy and (ii) using retry for fault characterization, which is defined as classification of the fault type and determination of fault durations. First, an optimal retry policy is derived for a given fault characteristic, which determines the maximum allowable retry durations so as to minimize the total task completion time. Then, the combined fault characterization and retry decision, in which the characteristic of a fault is estimated simultaneously with the determination of the optimal retry policy, are carried out. Two solution approaches are developed: one is based on point estimation and the other on Bayes sequential decision analysis. Numerical examples are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Bayes decision problem; computer systems, digital; decision theory and analysis; design; fault characterization; Fault Tolerant Capability; optimal retry policy; Optimale Reconfiguration; performance; reliability; task completion time; verification", subject = "{\bf B.2.3}: Hardware, ARITHMETIC AND LOGIC STRUCTURES, Reliability, Testing, and Fault-Tolerance. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Statistical computing.", } @Article{Abiteboul:1988:EOR, author = "Serge Abiteboul and Victor Vianu", title = "Equivalence and Optimization of Relational Transactions", journal = j-J-ACM, volume = "35", number = "1", pages = "70--120", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42271.html", abstract = "A large class of relational database update transaction is investigated with respect to equivalence and optimization. The transactions are straight-line programs with inserts, deletes, and modifications using simple selection conditions. Several basic results are obtained. It is shown that transaction equivalence can be decided in polynomial time. A number of optimality criteria for transactions are then proposed, as well as two normal forms. Polynomial-time algorithms for transaction optimization and normalization are exhibited. Also, an intuitively appealing system of axioms for proving transaction equivalence is introduced. Finally, a simple, natural subclass of transactions, called strongly acyclic, is shown to have particularly desirable properties.", acknowledgement = ack-nhfb, affiliationaddress = "Inst Natl de Recherche en Informatique et en Automatique, Le Chesnay, Fr", ajournal = "J. Assoc. Comput. Mach.", annote = "Equivalence can be decided in polynomial time. Algorithms for transactions and normalization. A strongly acyclic TX have particularly desirable properties.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer programming --- Algorithms; database systems; design; equivalence; languages; optimization; Relational; straight-line programs; transaction equivalence; update transactions", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Data manipulation languages (DML). {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Hadzilacos:1988:TRD, author = "Vassos Hadzilacos", title = "A Theory of Reliability in Database Systems", journal = j-J-ACM, volume = "35", number = "1", pages = "121--145", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42272.html", abstract = "Reliable concurrent processing of transactions in a database systems is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts of commit serializability, recoverability, and resiliency.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", annote = "Concepts of commit serializability, recoverability, and resiliency. Principles of reliable transaction. Specification. Based on PhD Th., `Issues of Fault Tolerance in Concurrent Computations' Harvard, Jun.1984.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; and resiliency; commit serializability; concurrency control; correctness criterion; database systems; recoverability; Reliability; reliability; theory", subject = "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.2.7}: Information Systems, DATABASE MANAGEMENT, Database Administration, Logging and recovery.", } @Article{Klug:1988:CQC, author = "Anthony Klug", title = "On Conjunctive Queries Containing Inequalities", journal = j-J-ACM, volume = "35", number = "1", pages = "146--160", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42273.html", abstract = "Conjunctive queries are generalized so that inequality comparisons can be made between elements of the query. Algorithms for containment and equivalence of such `inequality queries' are given, under the assumption that the data domains are dense and totally ordered. In general, containment does not imply the existence of homomorphisms (containment mappings), but the homomorphism property does exist for subclasses of inequality queries. A minimization algorithm is defined using the equivalence algorithm. It is first shown that the constants appearing in a query can be divided into `essential' and `nonessential' subgroups. The minimum query can be nondeterministically guessed using only the essential constants of the original query.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wisconsin, Madison, WI, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "Constants in a query can be divided into essential and nonessential.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; conjunctive queries; database systems; equivalence algorithm; inequality comparisons; languages; minimization algorithm; Relational; theory", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models.", } @Article{Gonnet:1988:EHL, author = "Gaston H. Gonnet and Per-{\AA}ke Larson", title = "External Hashing with Limited Internal Storage", journal = j-J-ACM, volume = "35", number = "1", pages = "161--184", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42274.html", abstract = "The following problem is studied: How, and to what extent, can the retrieval speed of external hashing be improved by storing a small amount of extra information in internal storage? Several algorithms that guarantee retrieval in one access are developed and analyzed. In the first part of the paper, a restricted class of algorithms is studied, and a lower bound on the amount of extra storage is derived. An algorithm that achieves this bound, up to a constant difference, is also given. In the second part of the paper a number of restrictions are relaxed and several more practical algorithms are developed and analyzed. The last one, in particular, is very simple and efficient.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", annote = "External hashing with signatures. Information-theoretic lower bound on the number of bits per bucket.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; data processing; external hashing; File Organization; limited internal storage; performance; retrieval speed; theory", review = "ACM CR 8902--0062", subject = "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Extensible languages. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @Article{Hickey:1988:APA, author = "Timothy Hickey and Jacques Cohen", title = "Automating Program Analysis", journal = j-J-ACM, volume = "35", number = "1", pages = "185--220", month = jan, year = "1988", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:57:39 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Pfpbib.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42275.html", abstract = "The first part of the paper shows that previous theoretical work on the semantics of probabilistic programs (Kozen) and on the correctness of performance annotated programs (Ramshaw) can be used to automate the average-case analysis of simple programs containing assignments, conditionals, and loops. A performance compiler has been developed using this theoretical foundations. The compiler is described, and it is shown that special cases of symbolic simplifications of formulas play a major role in rendering the system usable. The performance compiler generates a system of recurrence equations derived from a given program whose efficiency one wishes to analyze. This generation is always possible, but the problem of solving the resulting equations may be complex. The second part of the paper presents an original method that generalizes our previous approach and is applicable to functional programs that make use of recursion and complex data structures. Several examples are presented including an analysis of binary tree sort. A key feature of the analysis of such programs is that distributions on complex data structures are represented using attributed probabilistic grammars.", acknowledgement = ack-nhfb, affiliationaddress = "Brandeis Univ, Waltham, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Analysis; automated program analysis; computer metatheory --- Programming Theory; computer programming; computer-aided program analysis; functional; Granularity Analysis; measurement; performance; performance compiler; probabilistic programs; theory", subject = "{\bf D.2.8}: Software, SOFTWARE ENGINEERING, Metrics, Complexity measures. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Tripathi:1988:VAT, author = "Satish K. Tripathi and C. Murray Woodside", title = "A Vertex-Allocation Theorem for Resources in Queuing Networks", journal = j-J-ACM, volume = "35", number = "1", pages = "221--230", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/45068.html", abstract = "A product-form queuing network with multiple open and closed chains is considered. Some of the closed chains, which have a single customer each, require allocation of resources in the network so as to maximize a weighted throughput performance criterion. Chains with more than one customer can be decomposed into many chains of one customer each. It is proved that an optimal allocation of resources lies on a vertex (extreme points) of the set of feasible allocations. This considerably reduces the search space for an optimal allocation. Applications of this result in distributed computing are discussed.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", descriptors = "Performance evaluation; Queueing network; optimization", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems, digital --- Distributed; performance; probability; product-form queuing network; Queueing Theory; resource allocation; theory; verification; vertex-allocation theorem", subject = "{\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Operational analysis. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.", } @Article{Kaltofen:1988:GCD, author = "Erich Kaltofen", title = "Greatest Common Divisors of Polynomials Given by Straight-Line Programs", journal = j-J-ACM, volume = "35", number = "1", pages = "231--264", month = jan, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/45069.html", abstract = "Algorithms on multivariate polynomials represented by straight-line programs are developed. First, it is shown that most algebraic algorithms can be probabilistically applied to data that are given by a straight-line computation. Testing such rational numeric data for zero, for instance, is facilitated by random evaluations modulo random prime numbers. Then, auxiliary algorithms that determine the coefficients of a multivariate polynomial in a single variable are constructed. The first main result is an algorithm that produces the greatest common divisor of the input polynomials, all in straight-line representation. The second result shows how to find a straight-line program for the reduced numerator and denominator from one for the corresponding rational function. Both the algorithm for that construction and the greatest common divisor algorithm are in random polynomial time for the usual coefficient fields and output a straight-line program, which with controllably high probability correctly determines the requested answer.", acknowledgement = ack-nhfb, affiliationaddress = "Rensselaer Polytechnic Inst, Troy, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algebraic algorithms; Algorithms; algorithms; computer programming; design; greatest common divisors of polynomials; mathematical techniques --- Polynomials; multivariate polynomials; straight-line programs; theory; verification", subject = "{\bf I.1.1}: Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (general and polynomial). {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices.", } @Article{Baltsan:1988:SPB, author = "Avikam Baltsan and Micha Sharir", title = "On the shortest paths between two convex polyhedra", journal = j-J-ACM, volume = "35", number = "2", pages = "267--287", month = apr, year = "1988", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/42282.214094", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214094.html", abstract = "The problem of computing the Euclidean shortest path between two points in three-dimensional space bounded by a collection of convex and disjoint polyhedral obstacles having $n$ faces altogether is considered. This problem is known to be NP-hard and in exponential time for arbitrarily many obstacles; it can be solved in $O(n^2 \log n)$ time for a single convex polyhedral obstacle and in polynomial time for any fixed number of convex obstacles. In this paper Mount's technique is extended to the case of two convex polyhedral obstacles and an algorithm that solves this problem in time $O(n^3 \cdot 2^{O(\alpha(n^4))} \log n)$ (where $\alpha(n)$ is the functional inverse of Ackermann's function, and is thus extremely slowly growing) is presented, thus improving significantly Sharir's previous results for this special case. This result is achieved by constructing a new kind of Voronoi diagram, called peeper's Voronoi diagram, which is introduced and analyzed in this paper, and which may be of interest in its own right.", acknowledgement = ack-nhfb, affiliationaddress = "Tel-Aviv Univ, Tel-Aviv, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; analysis of algorithms; complexity of algorithms; computer programming; computers, digital --- Computational Methods; convex; Davenport--Schinzel sequences; Euclidean shortest paths; image part pattern; mathematical techniques --- Algorithms; polyhedra; shortest paths; theory; three-dimensional; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Dwork:1988:CPP, author = "Cynthia Dwork and Nancy Lynch and Larry Stockmeyer", title = "Consensus in the Presence of Partial Synchrony", journal = j-J-ACM, volume = "35", number = "2", pages = "288--323", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42283.html", abstract = "The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound $\Delta$ on the time required for a message to be sent from one processor to another and a known fixed upper bound $\Phi$ on the relative speeds of different processors. In an asynchronous system no fixed upper bounds $\Delta$ and $\Phi$ exist. In one version of partial synchrony, fixed bounds $\Delta$ and $\Phi$ exist, but they are not known a priori. The problem is to design protocols that work correctly in the partially synchronous system regardless of the actual values of the bounds $\Delta$ and $\Phi$. In another version of partial synchrony, the bounds are known, but are only guaranteed to hold starting at some unknown time T, and protocols must be designed to work correctly regardless of when time $T$ occurs. Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models.", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "718; 721; 722; 723; 913", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "agreement problem; algorithms; Byzantine generals problem; computer networks; computer systems, digital --- Distributed; computers, digital --- Data Communication Systems; consensus problem; database systems --- Distributed; Reliability; reliability; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Distributed systems.", } @Article{McNaughton:1988:CRT, author = "Robert McNaughton and Paliath Narendran and Friedrich Otto", title = "{Church--Rosser Thue} Systems and Formal Languages", journal = j-J-ACM, volume = "35", number = "2", pages = "324--344", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42284.html", abstract = "Since about 1971, much research has been done on Thue systems that have properties that ensure viable and efficient computation. The strongest of these is the Church--Rosser property, which states that two equivalent strings can each be brought to a unique canonical form by a sequence of length-reducing rules. In this paper three ways in which formal languages can be defined by Thue systems with this property are studied, and some general results about the three families of languages so determined are studied.", acknowledgement = ack-nhfb, affiliationaddress = "Rensselaer Polytechnic Inst, Troy, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; automata theory; Church--Rosser Thue systems; computer metatheory --- Formal Logic; Formal Languages; languages; mathematical techniques --- Algorithms; theory; verification", subject = "{\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Thue systems.", } @Article{Ullman:1988:ETT, author = "Jeffrey D. Ullman and Allen {Van Gelder}", title = "Efficient Tests for Top-Down Termination of Logical Rules", journal = j-J-ACM, volume = "35", number = "2", pages = "345--373", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42285.html", abstract = "Considered is the question of whether top-down (Prolog-like) evaluation of a set of logical rules can be guaranteed to terminate. The NAIL| system is designed to process programs consisting of logical rules and to select, for each fragment of the program, the best from among many possible strategies for its evaluation. In the context of such a system, it is essential that termination tests be fast. Thus, the ``uniqueness'' property of logical rules is introduced. This property is satisfied by many of the common examples of rules and is easily recognized. For rules with this property, a set of inequalities, whose satisfaction is sufficient for termination of the rules, can be generated in polynomial time. Then a polynomial test for satisfaction of constraints generated by this process is given.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; analysis of algorithms; complexity of algorithms; computer metatheory --- Programming Theory; computer programming --- Algorithms; computer software; languages; logic programs; prolog; Software Engineering; verification", subject = "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Invariants. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog.", } @Article{Galil:1988:MCF, author = "Zvi Galil and {\'E}va Tardos", title = "An ${O}(n^2 (m + n \log n) \log n)$ Min-Cost Flow Algorithm", journal = j-J-ACM, volume = "35", number = "2", pages = "374--386", month = apr, year = "1988", CODEN = "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", note = "Preliminary version in Proc. 27th Annual IEEE Symposium on the Foundations of Computer Science, pages 1--9, 1986", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214090.html", abstract = "The minimum cost flow problem is: Given a network with $n$ vertices and m edges, find a maximum flow of minimum cost. Many network problems are easily reducible to this problem. A polynomial-time algorithm for the problem has been known for some time, but only recently a strongly polynomial algorithm was discovered. In this paper an $O(n^f (m + n \log n) \log n)$ algorithm is designed. The previous best algorithm, due to Fujishige and Orlin, had an $O(m^2 (m + n \log n) \log n)$ time bound. Thus, for dense graphs an improvement of two orders of magnitude is obtained. The algorithm in this paper is based on Fujishige's algorithm (which is based on Tardos's algorithm).", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; analysis of algorithms; complexity algorithms; computer metatheory --- Programming Theory; computer programming; discrete mathematics; mathematical programming, linear; minimum-cost flow problem; optimization; theory; verification", subject = "{\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @Article{Sasaki:1988:TCM, author = "Galen H. Sasaki and Bruce Hajek", title = "The Time Complexity of Maximum Matching by Simulated Annealing", journal = j-J-ACM, volume = "35", number = "2", pages = "387--403", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/46160.html", abstract = "The random, heuristic search algorithm called simulated annealing is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that neither a basic form of the algorithm, nor any other algorithm in a fairly large related class of algorithms, can find maximum cardinality matchings such that the average time required grows as a polynomial in the number of nodes of the graph. In contrast, it is also shown for arbitrary graphs that a degenerate form of the basic annealing algorithm (obtained by letting ``temperature'' be a suitably chosen constant) produces matchings with nearly maximum cardinality in polynomial average time.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 722; 723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; artificial intelligence --- Applications; combinatorial optimization; computer programming; computers, digital --- Computational Methods; heuristic search algorithm; mathematical techniques --- Algorithms; maximum matching; optimization; performance; simulated annealing; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Sandhu:1988:SPM, author = "Ravinderpal Singh Sandhu", title = "The Schematic Protection Model: {Its} Definition and Analysis for Acyclic Attenuation Schemes", journal = j-J-ACM, volume = "35", number = "2", pages = "404--432", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42286.html", abstract = "The protection state of a system is defined by the privileges possessed by subjects at a given moment. Operations that change this state are themselves authorized by the current state. This poses a design problem in constructing the initial state so that all derivable states conform to a particular policy. It also raises an analysis problem of characterizing the protection states derivable from a given initial state. A protection model provides a framework for both design and analysis. Design generality and tractable analysis are inherently conflicting goals. Analysis is particularly difficult if creation of subjects is permitted. The central point of this paper is to demonstrate that the conflicting goals of convenient generality and tractable analysis can be simultaneously achieved. For this purpose the author has developed the Schematic Protection Model (SPM), which is also presented.", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "An access control model that is for discretionary and mandatory access policies; Most existing models suffer from intractability with regard to safety or are of limited generality.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer architecture; computer networks --- Protocols; computer operating systems --- Design; computer software --- Software Engineering; computer systems organization; computer systems, digital; computer-communication networks; database systems --- Protection; Protection; security; theory; verification", subject = "{\bf D.4.6}: Software, OPERATING SYSTEMS, Security and Protection, Access controls. {\bf D.2.0}: Software, SOFTWARE ENGINEERING, General, Protection mechanisms. {\bf K.6.m}: Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Miscellaneous, Security*.", } @Article{Calderbank:1988:ODP, author = "A. R. Calderbank and E. G. {Coffman, Jr.} and Leopold Flatto", title = "Optimal Directory Placement on Disk Storage Devices", journal = j-J-ACM, volume = "35", number = "2", pages = "433--446", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42287.html", abstract = "Two mathematical models dealing with optimal placement of directories on disk devices are analyzed. Storage addresses on the disk are approximated by points in the interval $[0, 1]$. Requests for information on the disk are represented by a sequence of file names. To process a request, a read-write head is first moved to a directory kept on the disk that specifies the address of the file, and then a head is moved to the specified address. The addresses are assumed to be independent and uniform on $[0, 1]$. In the first model we consider a system of two heads separated by a fixed distance d and a directory situated at $0 \leq x \leq 1$. In the second model we consider a system consisting of one head and $n$ greater than equivalent to 2 directories at $0 \leq x_1 < x_2 < \ldots{} < x_n \leq 1$. For both models we study the problem of finding those values of the parameters that minimize the expected head motion to process a request in statistical equilibrium.", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USa", ajournal = "J. Assoc. Comput. Mach.", annote = "locate in the center or replicate and locate in center of l/r. Also two head eval.", classification = "721; 722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "computer systems programming --- Input Output Programs; computer systems, digital --- Performance; data storage, magnetic; design; Disk; optimal directory placement; performance; performance of systems; stochastic modeling; theory", subject = "{\bf B.3.3}: Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Alt:1988:CCC, author = "Helmut Alt", title = "Comparing the Combinational Complexities of Arithmetic Functions", journal = j-J-ACM, volume = "35", number = "2", pages = "447--460", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214084.html", abstract = "Methods are presented for finding reductions between the computations of certain arithmetic functions that preserve asymptotic Boolean complexities (circuit depth or size). They can be used to show, for example, that all nonlinear algebraic functions are as difficult as integer multiplication with respect to circuit size. As a consequence, any lower or upper bound (e.g., $O(n \log n \log \log n)$) for one of them applies to the whole class. It is also shown that, with respect to depth and size simultaneously, multiplication is reducible to any nonlinear and division to any nonpolynomial algebraic function.", acknowledgement = ack-nhfb, affiliationaddress = "Freie Univ Berlin, Berlin, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; analysis of algorithms; complexity of algorithms; computer programming; computers, digital --- Circuits; mathematical techniques --- Numerical Analysis; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic.", } @Article{Wegener:1988:CBP, author = "Ingo Wegener", title = "On the Complexity of Branching Programs and Decision Trees for Clique Functions", journal = j-J-ACM, volume = "35", number = "2", pages = "461--471", month = apr, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/46161.html", abstract = "Exponential lower bounds on the complexity of computing the clique functions in the Boolean decision-tree model are proved. For one-time-only branching programs, large polynomial lower bounds are proved for $k$-clique functions if $k$ is fixed, and exponential lower bounds if $k$ increases with $n$. Finally, the hierarchy of the classes BP$_d$(P) of all sequences of Boolean functions that may be computed by $d$-times only branching programs of polynomial size is introduced. It is shown constructively that BP$_2$(P) is a proper subset of BP$_2$(P).", acknowledgement = ack-nhfb, affiliationaddress = "Johann Wolfgang Goethe-Univ, Frankfurt am Main, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; automata theory --- Computability and Decidability; clique functions; complexity of algorithms; computation by abstract devices; computer programming; decision trees; mathematical techniques --- Graph Theory; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Shankar:1988:MPC, author = "N. Shankar", title = "A Mechanical Proof of the {Church--Rosser} Theorem", journal = j-J-ACM, volume = "35", number = "3", pages = "475--522", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44484.html", abstract = "We describe a formalization and proof of the Church--Rosser theorem that was carried out with the Boyer--Moore theorem prover. The mechanical proof illustrates the effective use of the Boyer--Moore theorem prover in proof checking difficult metamathematical proofs.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "artificial intelligence; Boyer--Moore theorem prover; Church--Rosser theorem; computer metatheory; experimentation; lambda calculus; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Mathematical induction.", } @Article{Furst:1988:FMG, author = "Merrick L. Furst and Jonathan L. Gross and Lyle A. McGeoch", title = "Finding a Maximum-Genus Graph Imbedding", journal = j-J-ACM, volume = "35", number = "3", pages = "523--534", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44485.html", abstract = "The computational complexity of constructing the imbeddings of a given graph into surfaces of different genus is not well understood. In this paper, topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding. This seems to be the first imbedding algorithm for which the running time is not exponential in the genus of the imbedding surface.", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational complexity; computer programming --- Algorithms; Graph Theory; imbedding algorithm; linear matroid parity; mathematical techniques; maximum-genus graph imbedding; polynomial-time algorithm; theory; topological methods; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Hsu:1988:CMI, author = "Wen-Lian Hsu", title = "The Coloring and Maximum Independent Set Problems on Planar Perfect Graphs", journal = j-J-ACM, volume = "35", number = "3", pages = "535--563", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44486.html", abstract = "Efficient decomposition algorithms for the weighted maximum independent set, minimum coloring, and minimum clique cover problems on planar perfect graphs are presented. These planar graphs can also be characterized by the absence of induced odd cycles of length greater than 3 (odd holes). The algorithm in this paper is based on decomposing these graphs into essentially two special classes of inseparable component graphs whose optimization problems are easy to solve, finding the solutions for these components and combining them to form a solution for the original graph. These two classes are (i)planar comparability graphs and (ii) planar line graphs of those planar bipartite graphs whose maximum degrees are no greater than three. The same techniques can be applied to other classes of perfect graphs, provided that efficient algorithms are available for their inseparable component graphs.", acknowledgement = ack-nhfb, affiliationaddress = "Northwestern Univ, Evanston, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer programming --- Algorithms; decomposition algorithms; graph coloring; Graph Theory; mathematical techniques; maximum independent set; minimum clique cover; planar perfect graphs; theory; verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms.", } @Article{Rhee:1988:SDA, author = "Wansoo T. Rhee and Michel Talagrand", title = "Some Distributions That Allow Perfect Packing", journal = j-J-ACM, volume = "35", number = "3", pages = "564--578", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44487.html", abstract = "A probability distribution $\mu$ on $[0, 1]$ allows perfect packing if $n$ items of size $X_1$, \ldots{}, $X_n$ independent and identically distributed according to $\mu$ can be packed in unit size bins in such a way that the expected wasted space is $o(n)$. A large class of distributions that allow perfect packing is exhibited. As a corollary, the intervals $[a, b]$ for which the uniform distribution on $[a, b]$ allows perfect packing are determined.", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Combinatorial Mathematics; computer programming --- Algorithms; mathematical techniques; perfect packing; probability; probability distribution; stochastic bin packing; theory; verification", subject = "{\bf F.2.m}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous.", } @Article{Goodman:1988:SBE, author = "Jonathan Goodman and Albert G. Greenberg and Neal Madras and Peter March", title = "Stability of Binary Exponential Backoff", journal = j-J-ACM, volume = "35", number = "3", pages = "579--602", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44488.html", abstract = "Binary exponential backoff is a randomized protocol for regulating transmissions on a multiple-access broadcast channel. Ethernet, a local-area network, is built upon this protocol. The fundamental theoretical issue is stability: Does the backlog of packets awaiting transmission remain bounded in time, provided the rates of new packet arrivals are small enough? It is assumed $n \geq 2$ stations share the channel, each having an infinite buffer where packets accumulate while the station attempts to transmit the first from the buffer. Here, it is established that binary exponential backoff is stable if the sum of the arrival rates is sufficiently small. Detailed results are obtained on which rates lead to stability when $n = 2$ stations share the channel. In passing, several other results are derived bearing on the efficiency of the conflict resolution process. Simulation results are reported that, in particular, indicate alternative retransmission protocols can significantly improve performance.", acknowledgement = ack-nhfb, affiliationaddress = "Courant Inst of Mathematical Sciences, New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "The article studies the stability of binary exponential backoff. Detailed results are obtained on which rates lead to stability when 2 stations share the channel. Simulation results show alternative retransmission protocols can significantly improve performance.", classification = "723", descriptors = "Network architecture; LAN; access protocol; simulation; performance evaluation; broadcast", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "acknowledgment-based algorithms; algorithms; binary exponential backoff; computer networks; computer simulation; computer systems, digital --- Distributed; multiple-access broadcast channel; packet networks; performance; Protocols; retransmission protocols; theory; verification", subject = "{\bf C.2.5}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Access schemes. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Heath:1988:PMP, author = "Lenwood S. Heath and Arnold L. Rosenberg and Bruce T. Smith", title = "The Physical Mapping Problem for Parallel Architectures", journal = j-J-ACM, volume = "35", number = "3", pages = "603--634", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44489.html", abstract = "The problem of realizing an idealized parallel architecture on a (possibly fault-laden) physical architecture is studied. Our formulation performs the mapping in the light of the algorithm that one wants to implement on the idealized architecture. A version of the mapping algorithm suggested by the DIOGENES methodology for designing fault-tolerant VLSI processor array is settled definitely. Two quality metrics for mappings are considered, the first embodying an idealized notion of average delay, which relates to power consumption, and the second being the length of the longest run of wire. For the average-delay measure, four algorithms that optimally assign the m vertices of the embedded graph to the $n$ fault-free processors that have been fabricated are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Virginia Polytechnic Inst, Blacksburg, VA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer architecture; computer programming --- Algorithms; computer systems, digital; design; fault-tolerant VLSI processor arrays; mapping algorithms; Parallel Processing; physical mapping problem; quality metrics; theory; verification", subject = "{\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Kosaraju:1988:OSB, author = "S. Rao Kosaraju and Mikhail J. Atallah", title = "Optimal Simulations between Mesh-Connected Arrays of Processors", journal = j-J-ACM, volume = "35", number = "3", pages = "635--650", month = jul, year = "1988", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 16 10:57:51 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44494.html", abstract = "Let $G$ and $H$ be two mesh-connected arrays of processors, where $G$ equals $g_1 \times g_2 \times \cdots{} g_t$, $H = h_1 \times h_2 \times \cdots{} \times h_d$, and $g_1 \ldots{} g_t \leq h_1 \ldots{} h_d$. The problem of simulating $G$ by $H$ is considered and the best possible simulation in terms of the $g_i$'s and $h_i$'s is characterized by giving such a simulation and proving its optimality in the worst-case sense. Also the same bound on the average cost of encoding the edges of $G$ as distinct paths in $H$ is established.", acknowledgement = ack-nhfb, affiliationaddress = "Johns Hopkins Univ, Baltimore, MD, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; codes, symbolic --- Encoding; computer simulation; computer systems, digital; graph embedding; graph encoding; information processing; mathematical techniques --- Graph Theory; mesh-connected arrays; Parallel Processing; theory; time; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Fich:1988:PCE, author = "Faith E. Fich and Martin Tompa", title = "The Parallel Complexity of Exponentiating Polynomials over Finite Fields", journal = j-J-ACM, volume = "35", number = "3", pages = "651--667", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44496.html", abstract = "Modular integer exponentiation (given $a$, $e$, and $m$, compute $a^e \bmod m$) is a fundamental problem in algebraic complexity for which no efficient parallel algorithm is known. Two closely related problems are modular polynomial exponentiation (given $a(x)$, $e$, and $t$, compute the coefficient of $x^t$ in $(a(x))^e$). It is shown that these latter two problems are in NC$^2$ when $a(x)$ and $m(x)$ are polynomials over a finite field whose characteristic is polynomial in the input size.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Washington, Seattle, WA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algebra; algorithms; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; mathematical techniques; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations in finite fields. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", } @Article{Daduna:1988:BPS, author = "Hans Daduna", title = "Busy Periods for Subnetworks in Stochastic Networks: Mean Value Analysis", journal = j-J-ACM, volume = "35", number = "3", pages = "668--674", month = jul, year = "1988", CODEN = "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/1988.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44495.html", abstract = "The busy period of order $n$ for a subnetwork, which for large $n$ describes heavy traffic periods of that subnetwork, is described for queuing networks. The mean duration of such busy periods and efficient algorithms for computing these quantities are determined.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Hamburg, Hamburg, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", descriptors = "Queueing system; busy period; MVA", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer networks; computer programming --- Algorithms; performance; probability --- Random Processes; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems.", } @Article{Rohlicek:1988:RPM, author = "Jan Robin Rohlicek and Alan S. Willsky", title = "The Reduction of Perturbed {Markov} Generators: {An} Algorithm Exposing the Role of Transient States", journal = j-J-ACM, volume = "35", number = "3", pages = "675--696", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44497.html", abstract = "A new algorithm for the hierarchical aggregation of singularity perturbed finite-state Markov process is derived. The approach taken bridges the gap between conceptually simple results for a relatively restricted class of processes and the significantly more complex results for the general case. The critical role played by (almost) transient states is exposed, resulting in a straightforward algorithm for the construction of a sequence of aggregate generators associated with various time scales. These generators together provide a uniform asymptotic approximation of the original probability transition function.", acknowledgement = ack-nhfb, affiliationaddress = "Bolt, Beranek \& Newman Lab Inc, Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; asymptotic approximation; computer programming --- Algorithms; hierarchical aggregation; performance; perturbed Markov generators; probability; probability transition function; Random Processes; reliability; theory; transient states", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Conditioning. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Error analysis. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse and very large systems. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Simulation. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance.", } @Article{Chang:1988:POW, author = "Jik H. Chang and Oscar H. Ibarra and Anastasios Vergis", title = "On the Power of One-Way Communication", journal = j-J-ACM, volume = "35", number = "3", pages = "697--726", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44493.html", abstract = "A very model of parallel computation is considered, and the question of how restricting the flow of data to be one way compares with two-way flow is studied. It is shown that the one-way version is surprisingly very powerful in that it can solve problems that seemingly require two-way communication. Whether or not one-way communication is strictly weaker than two-way is an open problem, although the conjecture in this paper is in the positive. It is shown, however, that proving this conjecture is at least as hard as some well-known open problem in complexity theory.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "alternating Turing machine; automata theory --- Turing Machines; complexity theory; computer metatheory; computer systems, digital --- Parallel Processing; information processing; languages; nondeterministic Turing machine; one-way communication; parallel computation; pspace-complete; theory; time; verification", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relations among modes. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity measures.", } @Article{Fellows:1988:NTP, author = "Michael R. Fellows and Michael A. Langston", title = "Nonconstructive Tools for Proving Polynomial-Time Decidability", journal = j-J-ACM, volume = "35", number = "3", pages = "727--739", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44491.html", abstract = "Recent advances in graph theory and graph algorithms dramatically alter the traditional view of concrete complexity theory, in which a decision problem is generally shown to be in P by producing an efficient algorithm to solve an optimization version of the problem. Nonconstructive tools are now available for classifying problems as decidable in polynomial time by guaranteeing only the existence of polynomial-time decision algorithms. In this paper these new methods are employed to prove membership in P for a number of problems whose complexities are not otherwise known. Powerful consequences of these techniques are pointed out and their utility is illustrated. A type of partially ordered set that supports this general approach is defined and explored.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Idaho, Moscow, ID, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; computer programming --- Algorithms; decision algorithms; graph algorithms; mathematical techniques --- Graph Theory; membership; nonconstructive proofs; polynomial-time decidability; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{MeyeraufderHeide:1988:FAD, author = "Friedhelm {Meyer auf der Heide}", title = "Fast Algorithms for ${N}$-Dimensional Restrictions of Hard Problems", journal = j-J-ACM, volume = "35", number = "3", pages = "740--747", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44490.html", abstract = "Let M be a parallel RAM with p processors and arithmetic operations addition and subtraction recognizing $L \in N^n$ in $T$ steps, (Inputs for $M$ are given integer by integer, not bit by bit). Then $L$ can be recognized by a (sequential) linear search algorithm (LSA) in $O(n^4(\log(n) + T + \log(p)))$ steps. Thus many $n$-dimensional restrictions of NP-complete problems (binary programming, traveling salesman problem, etc.) and even that of the uniquely optimum traveling salesman problem, which is $\Delta_2^P$-complete, can be solved in polynomial restriction of the knapsack problem previously shown by the author, and destroys the hope of proving nonpolynomial lower bounds on LSAs for any problem that can be recognized by a PRAM as above with $2^{\poly(n)}$ processors in $\poly(n)$ time.", acknowledgement = ack-nhfb, affiliationaddress = "Johann Wolfgang Goethe Univ Frankfurt, Frankfurt am Main, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computer metatheory; computer programming --- Algorithms; languages; linear search algorithms; np-complete problems; parallel random-access machines; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{Schonhage:1988:NLB, author = "Arnold Sch{\"{o}}nhage", title = "A Nonlinear Lower Bound for Random-Access Machines under Logarithmic Cost", journal = j-J-ACM, volume = "35", number = "3", pages = "748--754", month = jul, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44492.html", abstract = "For on-line random-access machines under logarithmic cost, the simple task of storing arbitrary binary inputs has nonlinear complexity. Even if all kinds of powerful internal operations are admitted and reading of storage locations is free of charge, just successively changing the storage contents for properly storing arbitrary $n$-bit inputs requires an average cost of order $n \log n$.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Tubingen, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "complexity; computer metatheory; logarithmic cost; nonlinear lower bound; random-access machines; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Chvatal:1988:MHE, author = "Va{\v{s}}ek Chv{\'{a}}tal and Endre Szemer{\'e}di", title = "Many Hard Examples for Resolution", journal = j-J-ACM, volume = "35", number = "4", pages = "759--768", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48016.html", abstract = "It is proved that for every choice of positive integers c and $k$ such that $k \geq 3$ and $c^2 \pm k \geq 0.7$, there is a positive number \$epsilon such that, with probability tending to 1 as $n \to \infty$, a randomly chosen family of $c n$ clauses of size $k / n$ variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least $(1 + \epsilon)^n$ clauses. The proof makes use of random hypergraphs.", acknowledgement = ack-nhfb, affiliationaddress = "New Brunswick, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Artificial Intelligence; Mathematical Techniques --- Graph Theory; Probability --- Random Processes; Random Hypergraphs; Resolution; Satisfiability; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures.", } @Article{Grigoriadis:1988:NCH, author = "M. D. Grigoriadis and B. Kalantari", title = "A New Class of Heuristic Algorithms for Weighted Perfect Matching", journal = j-J-ACM, volume = "35", number = "4", pages = "769--776", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48015.html", abstract = "The minimum-weight perfect matching problem for complete graphs of $n$ vertices with edge weights satisfying the triangle inequality is considered. For each nonnegative integer $k \leq \log_3n$, and for any perfect matching algorithm that runs in t(n) time and has an error bound of $f(n)$ times the optimal weight, an $O(\max[n^2, t(3 \pm / n)])$-time heuristic algorithm with an error bound of $(7/3)^k(1 + f(3 \pm k/n)) - 1$ is given. By the selection of $k$ as appropriate functions of $n$, heuristics that have better running times and\slash or error bounds than existing ones are derived.", acknowledgement = ack-nhfb, affiliationaddress = "New Brunswick, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Approximate Algorithms; Combinatorial Optimization; Complexity; Computer Programming --- Algorithms; Error Bounds; Graph Theory; Heuristic Algorithms; Mathematical Techniques; Minimum-Weight Perfect Matching; Optimization; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Cole:1988:OVC, author = "Richard Cole and Alan Siegel", title = "Optimal {VLSI} Circuits for Sorting", journal = j-J-ACM, volume = "35", number = "4", pages = "777--809", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48017.html", abstract = "This work describes a large number of constructions for sorting $N$ integers in the range [0, M - 1], for $N$ $leq$ M $leq$ N$^2$, for the standard VLSI bit model. Among other results we obtain: (1) VLSI sorter constructions that are within a constant factor of optimal size, for all M and almost all running times T; (2) a fundamentally new merging network for sorting numbers in a bit model; and (3) new organizational approaches for optimal tuning of merging networks and the proper management of data flow.", acknowledgement = ack-nhfb, affiliationaddress = "New York, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Area/Time Tradeoffs; Computer Metatheory; Integer Sorting; Integrated Circuits, VLSI; Merging Networks; Optimization; Sorting Circuits; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression.", } @Article{Gonzalez:1988:LTA, author = "Teofilo F. Gonzalez and Sing-Ling Lee", title = "A Linear Time Algorithm for Optimal Routing Around a Rectangle", journal = j-J-ACM, volume = "35", number = "4", pages = "810--831", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48018.html", abstract = "The problem of connecting a set of terminal that lie on the sides of a rectangle to minimize the total area is discussed. An $O(n)$ algorithm is presented to solve this problem when the set of $n$ terminals is initially sorted. The strategy in this paper is to reduce the problem to several problems such that no matter what instance is started with, at least one of these problems can be solved optimally by a greedy method.", acknowledgement = ack-nhfb, affiliationaddress = "Santa Barbara, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Algorithms; Computer Programming; Greedy Methods; Integrated Circuits --- Computer Aided Design; Linear Time Algorithm; Optimal Routing; Optimization; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Placement and routing.", } @Article{Panwar:1988:OSP, author = "Shivendra S. Panwar and Don Towsley and Jack K. Wolf", title = "Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service", journal = j-J-ACM, volume = "35", number = "4", pages = "832--844", month = oct, year = "1988", CODEN = "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/1988.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48019.html", abstract = "Many problems can be modeled as single-server queues with impatient customers. An example is that of the transmission of voice packets over a packet-switched network. If the voice packets do not reach their destination within a certain time interval of their transmission, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their respective deadlines is maximized. For this measure of performance, it is shown that the shortest time to extinction (STE) policy is optimal for a class of continuous and discrete time nonpreemptive M/G/1 queues that do not allow unforced idle times. When unforced idle times are allowed, the best policies belong to the class of shortest time to extinction with inserted idle time (STEI) policies. An STEI policy requires that the customer closest to his or her deadline be scheduled whenever it schedules a customer. It also has the choice of inserting idle times while the queue is nonempty.", acknowledgement = ack-nhfb, affiliationaddress = "Brooklyn, NY, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "Many problems can be modelled as single-server queues with impatient customers. An example is that of the transmission of voice packets over a ps network. If the voice packets do not reach their destination within a certain time, they are useless to the receiver and considered lost. It is therefore desirable to schedule the customers such that the fraction of customers served within their deadlines is maximized.", classification = "718; 723; 913; 921; 922", descriptors = "Queueing system; queueing discipline; limited waiting time; M/G/1; impatient customer", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Computer Networks --- Local Networks; Customer Deadlines; design; Optimal Scheduling Policies; Optimization; Packetized Voice Communications; performance; Probability; Queueing Theory; Scheduling; Stochastic Scheduling; Telecommunication; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design.", } @Article{Attiya:1988:CAR, author = "Hagit Attiya and Marc Snir and Manfred K. Warmuth", title = "Computing on an Anonymous Ring", journal = j-J-ACM, volume = "35", number = "4", pages = "845--875", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48247.html", abstract = "The computational capabilities of a system of $n$ indistinguishable (anonymous) processors arranged on a ring in the synchronous and asynchronous models of distributed computation are analyzed. A precise characterization of the functions that can be computed in this setting is given. It is shown that any of these functions can be computed in$O(n^2)$ messages in the asynchronous model. This is also proved to be a lower bound for such elementary functions as AND, SUM, and Orientation. In the synchronous model any computable function can be computed in $O(n \log n)$ messages. A ring can be oriented and start synchronized within the same bounds. The main contribution of this paper is a new technique for proving lower bounds in the synchronous model.", acknowledgement = ack-nhfb, affiliationaddress = "Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Anonymous Ring; Asynchronous Model; Computational Capabilities; Computer Networks; Computer Systems, Digital --- Distributed; Lower Bounds; Synchronous Model; theory; verification", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity measures. {\bf C.2.5}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings.", } @Article{Karlin:1988:PHE, author = "Anna R. Karlin and Eli Upfal", title = "Parallel Hashing: {An} Efficient Implementation of Shared Memory", journal = j-J-ACM, volume = "35", number = "4", pages = "876--892", month = oct, year = "1988", CODEN = "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", abstract = "A central issue in the theory of parallel computation is the gap between the ideal models that utilize shared memory and the feasible models that consist of a bounded-degree network of processors sharing no common memory. This problem has been widely studied. Here a tight bound for the probabilistic complexity of this problem is established. The solution in this paper is based on a probabilistic scheme for implementing shared memory on a bounded-degree network of processors. This scheme, which we term parallel hashing, enables a processors to store and retrieve an arbitrary set of $n$ data items in $O(\log n)$ parallel steps. The items' locations are specified by a function chosen randomly from a small class of universal hash functions. A hash function in this class has a small description and can therefore be efficiently distributed among the processors. A deterministic lower bound for the point-to-point communication model is also presented.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Computer Programming --- Algorithms; Computer Systems, Digital --- Parallel Processing; Data Processing; Deterministic Lower Bound; File Organization; Parallel Algorithms; Parallel Hashing; Shared Memory", } @Article{Ramshaw:1988:EGT, author = "Lyle Ramshaw", title = "Eliminating go to's while Preserving Program Structure", journal = j-J-ACM, volume = "35", number = "4", pages = "893--920", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/48021.html", abstract = "Suppose we want to eliminate the local go to statements of a Pascal program by replacing them with multilevel loop exit statements. The standard ground rules for eliminating go to's require that we preserve the flow graph of the program, but they allow us to completely rewrite the control structures that glue together the program's atomic tests and actions. The go to's can be eliminated from a program under those ground rules if and only if the flow graph of that program has the graph-theoretic property named reducibility. This paper considers a stricter set of ground rules, which demand that we preserve the program's original control structures, as well as its flow graph, while we eliminate its go to's. In particular, we are allowed to delete the go to statements and the labels that they jump to and to insert various exit statements and labeled repeat-endloop pairs for them to jump out of. But we are forbidden to change the rest of the program text in any way. The critical issue that determines whether go to's can be eliminated under these stricter rules turns out to be the static order of the atomic tests and actions in the program text.", acknowledgement = ack-nhfb, affiliationaddress = "Palo Alto, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Augmented Flow Graphs; Computer Metatheory --- Programming Theory; Computer Programming; Elimination Rules; Flow Graphs; Go to's; Program Transformations; Reducibility; Structured Programming; theory; verification", subject = "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @Article{Goldberg:1988:NAM, author = "Andrew V. Goldberg and Robert E. Tarjan", title = "A New Approach to the Maximum-Flow Problem", journal = j-J-ACM, volume = "35", number = "4", pages = "921--940", month = oct, year = "1988", CODEN = "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", note = "Preliminary version in Proc. 18th Annual ACM Symposium on the Theory of Computing, pages 136--146, 1986", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/61051.html", abstract = "All previously known efficient maximum-flow algorithms work by finding augmenting paths. An alternative method based on the preflow concept is introduced. A preflow is like a flow, except that the total amount flowing into a vertex is allowed to exceed the total amount flowing out. The method maintains a preflow in the original network and pushes local flow excess toward the sink along what are estimated to be shortest paths. The algorithm and its analysis are simple and intuitive, yet the algorithm runs as fast as any other known method on dense graphs, achieving an $O(n^3)$ time bound on an $n$-vertex graph. A version of the algorithm running in $O(n m \log(n^2 / m))$ time on an $n$-vertex, $m$-edge graph is also obtained. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efficient distributed and parallel implementations. A parallel implementation running in $O(n^2 \log n)$ time using $n$ processors and $O(m)$ space is obtained.", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computer Programming --- Algorithms; Computer Systems, Digital --- Parallel Processing; Directed Graphs; Graph Algorithms; Graph Theory; Mathematical Techniques; Maximum-Flow Algorithms; Maximum-Flow Problem; Operations Research; Preflow Concept", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{MixBarrington:1988:FMF, author = "David A. {Mix Barrington} and Denis Th{\'e}rien", title = "Finite monoids and the fine structure of {NC}$^1$", journal = j-J-ACM, volume = "35", number = "4", pages = "941--952", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/63138.html", abstract = "Recently a new connection was discovered between the parallel complexity class NC$^1$ and the theory of finite automata in the work of D. A. M. Barrington on bounded width branching programs. There (nonuniform) NC$^1$ was characterized as those languages recognized by a certain nonuniform version of a DFA. Here we extend this characterization to show that the internal structures of NC$^1$ and the class of automata are closely related. In particular, using D. Therien's classification of finite monoids, we give new characterizations of the classes AC$^0$, depth-$k$ AC$^0$, and ACC, the last being the AC$^0$ closure of the $\bmod q$ functions for all constant $q$. We settle some of the open questions, give a new proof that the dot-depth hierarchy of algebraic automata theory is infinite, and offer a new framework for understanding the internal structure of NC$^1$.", acknowledgement = ack-nhfb, affiliationaddress = "Amherst, MA, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "From the title footnote: ``D. A. Mix Barrington was formerly known as David A. Barrington.''", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algebraic Automata Theory; Automata Theory; Circuit Complexity; Computer Metatheory; Finite Monoids; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf G.2.m}: Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous.", } @Article{Leivant:1988:MRF, author = "Daniel Leivant and Tim Fernando", title = "Meager and Replete Failures of Relative Completeness", journal = j-J-ACM, volume = "35", number = "4", pages = "953--964", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/63139.html", abstract = "The nature of programming languages that fail to have a relatively complete proof formalism is discussed. First, it is shown that such failures may be due to the meagerness of the programming language, rather than to the presence of complex control structures as in the cases studied so far. The failure of relative completeness is then derived for two languages with a rich control structure, using simple simulations of general recursive functions by procedure call mechanisms.", acknowledgement = ack-nhfb, affiliationaddress = "Pittsburgh, PA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Computer Metatheory; Computer Programming Languages; Control Structures; General Recursive Functions; Lambda Calculus; Polymorphism; Procedure Call Mechanisms; Relative Completeness; Theory; theory; verification", subject = "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Coroutines. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Pre- and post-conditions. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @Article{Pitt:1988:CLL, author = "Leonard Pitt and Leslie G. Valiant", title = "Computational Limitations on Learning from Examples", journal = j-J-ACM, volume = "35", number = "4", pages = "965--984", month = oct, year = "1988", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/63140.html", abstract = "The computational complexity of learning Boolean concepts from examples is investigated. It is shown for various classes of concept representations that these cannot be learned feasibly in a distribution-free sense unless R $=$ NP. These classes include (a) disjunctions of two monomials, (b) Boolean threshold functions, and (c) Boolean formulas in which each variable occurs at most once. Relationships between learning of heuristics and finding approximate solutions to NP-hard optimization problems are given.", acknowledgement = ack-nhfb, affiliationaddress = "Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "Was Harvard University TR 6 in 1986.", classification = "723; 921", comment = "It is NP-Complete to learn disjunction of two monomials, Boolean threshold functions, Boolean formulae where each variable occurs at most once.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Artificial Intelligence; Boolean formulas; Boolean Threshold Functions; Computational Complexity; Computer Metatheory; Disjunctions of two monomials; experimentation; Learning from Examples; np-hard Optimization Problems; Optimization; Systems Science and Cybernetics --- Learning Systems; theory; verification", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction.", } @Article{Seiferas:1988:CE, author = "Joel I. Seiferas and Paul M. B. Vit{\'{a}}nyi", title = "Counting Is Easy", journal = j-J-ACM, volume = "35", number = "4", pages = "985--1000", month = oct, year = "1988", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/63141.html", abstract = "It is proved that for any fixed $k$,a remarkably simple single-tape Turning machine can simulate $k$ independent counters in real time.", acknowledgement = ack-nhfb, affiliationaddress = "Rochester, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Automata Theory; Computer Simulation; Counter Machines; design; Multicounter Machines; Simulation between Models; Single-Tape Turning Machine; theory; Turing Machines; verification", subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Contiguous representations. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Collings:1988:AIG, author = "Bruce Jay Collings and G. Barry Hembree", title = "Addendum to ``Initializing Generalized Feedback Shift Register Pseudorandom Number Generators''", journal = j-J-ACM, volume = "35", number = "4", pages = "1001--1001", month = oct, year = "1988", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Oct 21 23:55:47 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Collings:1986:IGF}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Muller:1989:IMD, author = "John H. Muller and Jeremy Spinrad", title = "Incremental Modular Decomposition", journal = j-J-ACM, volume = "36", number = "1", pages = "1--19", month = jan, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59300.html", abstract = "Modular decomposition is a form of graph decomposition that has been discovered independently by researchers in graph theory, game theory, network theory, and other areas. This paper reduces the time needed to find the modular decomposition of a graph from $\Omega(n^3)$ to $O(n + 2)$. Together with a new algorithm for transitive orientation given by J. Spinrad, this leads to fast new algorithms for a number of problems in graph recognition and isomorphism, including recognition of comparability graphs and permutation graphs. The new algorithm works by inserting each vertex successively into the decomposition tree, using $O(n)$ time to insert each vertex.", acknowledgement = ack-nhfb, affiliationaddress = "Atlanta, GA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Combinatorics and Graph Theory; Comparability Graphs; Computer Programming --- Algorithms; Graph Decomposition; Graph Isomorphism; Graph Recognition; Graph Theory; Mathematical Techniques; Modular Decomposition; modular decomposition; Permutation Graphs; substitution decomposition; theory; Verification; X-join", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Brzozowski:1989:UFR, author = "J. A. Brzozowski and C.-J. Seger", title = "A Unified Framework for Race Analysis of Asynchronous Networks", journal = j-J-ACM, volume = "36", number = "1", pages = "20--45", month = jan, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/58562.59301", 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59301.html", abstract = "A unified framework is developed for the study of asynchronous circuits of both gate and MOS type. A basic network model consisting of a directed graph and a set of vertex excitation functions is introduced. A race analysis model, using three values ($0$, $1$, and $\times$), is developed for studying state transitions in the network. It is shown that the results obtained using this model are equivalent to those using ternary simulation. It is also proved that the set of state variables can be reduced to a minimum size set of feedback variables, and the analysis still yields both the correct state transitions and output hazard information. Finally, it is shown how the general results above are applicable to both gate and MOS circuits.", acknowledgement = ack-nhfb, affiliationaddress = "Waterloo, Ont, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; asynchronous circuits; Asynchronous Networks; Computer Simulation; Computer Systems; design; Directed Graphs; Gate Circuits; Hazards and Race Conditions; Logic Design; Logic Devices --- Gates; Mathematical Techniques --- Graph Theory; MOS Circuits; Race Analysis; races; Semiconductor Devices, MOS; switch-level models; Switching Theory; ternary simulation; theory; verification; Vertex Excitation Functions", subject = "{\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids, Simulation. {\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids, Switching theory. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles. {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Simulation.", } @Article{McCune:1989:MSC, author = "William W. McCune and Lawrence J. Henschen", title = "Maintaining State Constraints in Relational Databases: {A} Proof Theoretic Basis", journal = j-J-ACM, volume = "36", number = "1", pages = "46--68", month = jan, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "An early version appears as Argonne National Laboratory Tech. Memo ANL/MCS-TM-94, 1987", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59302.html", abstract = "If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint C and a class of updates, and either proves that an update in the class cannot violate C, or produces a formula C\$PRM (a complete test) that is satisfied before the update if and only if C would continue to be satisfied were the update to occur. C\$PRM is frequently much easier to evaluate than C. In addition, a formula $D$ (a sufficient test) is sometimes produced such that if $D$ is satisfied before the update, then C would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Argonne, IL, USA", ajournal = "J. Assoc. Comput. Mach.", annote = "Concurrency under consistency constraints; examples of implementation; updates from 0.5 seconds to almost 10 minutes; strong theoretical basis for future work; automatic theorem proving.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Automated Theorem Proving; automated theorem proving; Database Systems; Database Theory; Database Updates; dependency statement; First Order Logic; first-order logic; Integrity Constraints; integrity constraints; Relational; relational databases; Reliability; Skolemizing; State Constraints; theory; verification", subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT, General. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Query formulation. {\bf I.1.1}: Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Simplification of expressions. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Answer/reason extraction. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Naughton:1989:MFF, author = "Jeffrey F. Naughton", title = "Minimizing Function-Free Recursive Inference Rules", journal = j-J-ACM, volume = "36", number = "1", pages = "69--91", month = jan, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59303.html", abstract = "Recursive inference rules arise in recursive definitions in logic programming systems and in database systems with recursive query languages. Let D be a recursive definition of a relation $t$. $D$ is considered minimal if for any predicate p in a recursive rule in $D$, $p$ must appear in a recursive rule in any definition of $t$. It is shown that testing for minimality is, in general, undecidable. However, an efficient algorithm for a useful class of recursive rules is presented, and it is used to transform a recursive definition to a minimal recursive definition. Evaluating the minimized definition avoids redundant computation without the overhead of caching intermediate results and run-time checking for duplicate goals.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computer Programming --- Algorithms; Database Systems; Database Theory; deductive database; knowledge-base; languages; Logic Programming; Mathematical Techniques --- Graph Theory; optimization of recursion; Query Languages; Recursive Inference Rules; Recursive Query Languages; theory; Verification", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory.", } @Article{Dill:1989:CES, author = "Jens M. Dill", title = "A Counter-Example for ``{A} Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars''", journal = j-J-ACM, volume = "36", number = "1", pages = "92--96", month = jan, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Jazayeri:1981:SCS}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77393.html", abstract = "M. Jazayeri proposes a simpler construction for use in the proof by M. Jazayeri et al. that the circularity problem for attribute grammars has inherent exponential time complexity. The simplification introduces a flaw that invalidates the proof. The flaw can be corrected, at the cost of eliminating some of the simplification claimed for the new construction.", acknowledgement = ack-nhfb, affiliationaddress = "Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; alternating Turing machines; attribute grammar; Attribute Grammars; Automata Theory; circ; Circularity Problem; circularity problem; Computational Complexity; computational complexity; Computer Metatheory; exponential time; Exponential Time Complexity; Formal Languages; Grammars; languages; performance; theory", note2 = "Titre explicite. La construction de Jazayeri s'ecroule, mais celle de [JOR 75] reste valide et, en outre, plus parlante. (mj)", subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @Article{Helman:1989:CSD, author = "Paul Helman", title = "A Common Schema for Dynamic Programming and Branch and Bound Algorithms", journal = j-J-ACM, volume = "36", number = "1", pages = "97--128", month = jan, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59304.html", abstract = "A new model for dynamic programming and branch and bound algorithms is presented. The model views these algorithms as utilizing computationally feasible dominance relations to infer the orderings of application objects, thereby implicitly enumerating a finite solution space. The formalism is broad enough to apply the computational strategies of dynamic programming and branch and bound to problems with nonassociative objects, and can model both oblivious and nonoblivious algorithms, as well as parallel algorithms. The model is used to classify computations based, in part, on the types of computationally feasible dominances that they employ. It is demonstrated that the model is computationally precise to support the derivation of lower bounds on the number of operations required to solve various types of problems.", acknowledgement = ack-nhfb, affiliationaddress = "Albuquerque, NM, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Branch and Bound Algorithms; branch-and-bound; combinatorial optimization; complexity analysis; Computational Complexity; Computer Programming --- Algorithms; Computer Systems, Digital --- Parallel Processing; Dominance Relations; dynamic programming; formal models of algorithms; Lower Bounds; Mathematical Programming, Dynamic; Operations Research; Parallel Algorithms; parallel algorithms; search strategies; theory; verification", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Boyar:1989:ISP, author = "Joan Boyar", title = "Inferring Sequences Produced by Pseudo-Random Number Generators", journal = j-J-ACM, volume = "36", number = "1", pages = "129--141", month = jan, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/58562.59305", 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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59305.html; http://www.imada.sdu.dk/~joan/", abstract = "In this paper, efficient algorithms are given for inferring sequences produced by pseudo-random number generators of a certain form. Using this general method, specific examples of generators having this form, the linear congruential method, linear congruences with $n$ terms in the recurrence, and quadratic congruences are shown to be cryptographically insecure.", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computer Programming --- Algorithms; Cryptography; cryptography; inductive inference; linear congruential method; Mathematical Statistics; Pseudorandom Number Generators; Random Number Generation; security; Sequence Inferring Algorithms; Theory of Computation", remark = "Early publications, including 1983 Berkeley Ph.D. dissertation, as Joan B. Plumstead.", subject = "{\bf E.3}: Data, DATA ENCRYPTION. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Random number generation.", } @Article{Kaminski:1989:NPV, author = "Michael Kaminski", title = "A Note on Probabilistically Verifying Integer and Polynomial Products", journal = j-J-ACM, volume = "36", number = "1", pages = "142--149", month = jan, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "The author describes probabilistic algorithms for verifying the product of two $n$-bit integers in $O(n)$ bit operations, and for verifying the product of two polynomials of degree $n$ over integral domains in $4n+o(n)$ algebraic operations. The error probability is $o(\frac{1}{n^{1-\epsilon}})$ for any $\epsilon>0$.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214082.html", abstract = "Probabilistic algorithms are presented for testing the result of the product of two $n$-bit integers in $O(n)$ bit operations and for testing the result of the product of two polynomials of degree $n$ over any integral domain in $4 n + o(n)$ algebraic operations with the error probability $o(1 / n + 1 MIN \epsilon)$ for any $\epsilon > 0$. The last algorithm does not depend on the constants of the underlying domain.", acknowledgement = ack-nhfb, affiliationaddress = "Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; Computer Programming; Cyclotomic Polynomials; cyclotomic polynomials; Integer Products; Mathematical Techniques --- Polynomials; polynomial and integer multiplication; Polynomial Products; Probabilistic Algorithms; probabilistic algorithms; Symbolic Algebra; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations.", } @Article{Kaminski:1989:MCP, author = "Michael Kaminski and Nader H. Bshouty", title = "Multiplicative Complexity of Polynomial Multiplication over Finite Fields", journal = j-J-ACM, volume = "36", number = "1", pages = "150--170", month = jan, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/59306.html", abstract = "Let $M_q(n)$ denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree $n$ over a $q$-element field by means of bilinear algorithms. It is shown that $M_q(n) \geq 3n - o(n)$. In particular, if $q / 2 < n \leq q + 1$, we establish a tight bound for $M_q(n)$. The technique we use can be applied to analysis of algorithms for multiplication of polynomials modulo a polynomial as well.", acknowledgement = ack-nhfb, affiliationaddress = "Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; Bilinear Algorithms; bilinear algorithms; Computer Programming; Finite Fields; Hankel matrices; Linear Recurring Sequences; linear recurring sequences; Mathematical Techniques --- Polynomials; Multiplicative Complexity; Polynomial Multiplication; polynomial multiplication; Symbolic Algebra; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations in finite fields. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials.", } @Article{deSouzaeSilva:1989:CAP, author = "Edmundo {de Souza e Silva} and H. Richard Gail", title = "Calculating Availability and Performability Measures of Repairable Computer Systems Using Randomization", journal = j-J-ACM, volume = "36", number = "1", pages = "171--193", month = jan, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Repairable computer systems are considered, the availability behavior of which can be modeled as a homogeneous Markov process. The randomization method is used to calculate various measures over a finite observation period related to availability modeling of these systems. These measures include the distribution of the number of events of a certain type, the distribution of the length of time in a set of states, and the probability of a near-coincident fault. The method is then extended to calculate performability distributions. The method relies on coloring subintervals of the finite observation period based on the particular application, and then calculating the measure of interest using these colored intervals.", acknowledgement = ack-nhfb, affiliationaddress = "Rio de Janeiro, Braz", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; Availability; Computer Systems, Digital; Markov reward models; near coincident faults; performability distribution; Performance; Performance Measures; performance/reliability measures; Probability --- Random Processes; randomization technique; Reliability; Reliability Measures; Repairable Computer Systems; System Modeling and Analysis; transient analysis", } @Article{deSouzaeSilva:1989:CJQ, author = "Edmundo {de Souza e Silva} and S. S. Lavenberg", title = "Calculating Joint Queue-Length Distributions in Product-Form Queuing Networks", journal = j-J-ACM, volume = "36", number = "1", pages = "194--207", month = jan, year = "1989", CODEN = "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", abstract = "A new computational algorithm called distribution analysis by chain (DAC) is developed. This algorithm computes joint queue-length distributions for product-form queuing networks with single-server fixed rate, infinite server, and queue-dependent service centers. Joint distributions are essential in problems such as the calculation of availability measures using queuing network models. The algorithm is efficient since the cost to evaluate joint queue-length probabilities is of the same order as the number of these probabilities. This contrast with the cost of evaluating these probabilities using previous algorithms. The DAC algorithm also computes mean queue lengths and throughputs more efficiently than the recently proposed RECAL and MVAC algorithms. Furthermore, the algorithm is numerically stable and its recursion is surprisingly simple.", acknowledgement = ack-nhfb, affiliationaddress = "Rio de Janeiro, Braz", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", descriptors = "Queueing network; product form; analysis", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; availability modeling; computational algorithm; Computer Programming --- Algorithms; Joint Queue Length Distributions; MVAC Algorithm; Performance; Probability; queueing network; Queueing Networks; Queueing Theory; RECAL Algorithm; Reliability; System Modeling and Analysis; Verification", } @Article{Hobby:1989:RCC, author = "John D. Hobby", title = "Rasterizing Curves of Constant Width", journal = j-J-ACM, volume = "36", number = "2", pages = "209--229", month = apr, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/138027.138040", 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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62045.html", abstract = "This paper gives a fast, linear-time algorithm for generating high-quality pixel representations of curved lines. The results are similar to what is achieved by selecting a circle whose diameter is the desired line width, and turning on all pixels covered by the circle as it moves along the desired curve. However, the circle is replaced by a carefully chosen polygon whose deviations from the circle represent subpixel corrections designed to improve the aesthetic qualities of the rasterized curve. For nonsquare pixels, equally good results are obtained when an ellipse is used in place of the circle. The class of polygons involved is introduced, an algorithm for generating them is given, and how to construct the set of pixels covered when such a polygon moves along a curve is shown. The results are analyzed in terms of a mathematical model for the uniformity and accuracy of line width in the rasterized image.", acknowledgement = ack-nhfb, affiliationaddress = "Murray Hill, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computational Geometry; Computer Graphics; Computer Programming --- Algorithms; Curve Generation; curve generation; Curve Rasterization; image approximation; Mathematical Models; Mathematical Techniques --- Geometry; Scan Conversion; scan conversion; Verification", subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Display algorithms. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representations.", } @Article{Beeri:1989:MCN, author = "Catriel Beeri and Philip A. Bernstein and Nathan Goodman", title = "A Model for Concurrency in Nested Transaction Systems", journal = j-J-ACM, volume = "36", number = "2", pages = "230--269", month = apr, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62046.html", abstract = "A model for database concurrency control permits nested transactions. In this model, transactions may execute subtransactions, giving rise to tree-structured computations. A serializability theory is developed for this model, which can be used to prove the correctness of concurrency control algorithms for nested transactions and for multilevel database systems. The theory is based on an abstract model of computation that allows arbitrary operations and parallel and even nondeterministic programs. Axioms are presented that express the basic properties that programs that manage or access data need to satisfy and are used to derive proof techniques. The proof techniques are illustrated by applying them to several well-known concurrency control problems.", acknowledgement = ack-nhfb, affiliationaddress = "Jerusalem, Isr", ajournal = "J. Assoc. Comput. Mach.", annote = "A serializability theory for nested transactions and for multi-level database systems.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; computational forest; Computer Programming --- Algorithms; Concurrency Control; concurrency control; Concurrency Models; Correctness; Data Management; Database Systems; Database Theory; design; Distributed; Mathematical Techniques --- Graph Theory; nested transactions; Nested Transactions Systems; Serializability; serializability; theory; verification", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Deadlock avoidance.", } @Article{Cunto:1989:ACS, author = "Walter Cunto and J. Ian Munro", title = "Average Case Selection", journal = j-J-ACM, volume = "36", number = "2", pages = "270--279", month = apr, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62047.html", abstract = "It is shown that $n + $k$ - {O}(1)$ comparisons are necessary, on average, to find the $k$th smallest of $n$ numbers ($k\leq n/2$). This lower bound matches the behavior of the technique of Floyd and Rivest to within a lower-order term. $7 n / 4 \pm o(n)$ comparisons, on average, are shown to be necessary and sufficient to find the maximum and median of a set. An upper bound of $9n/4 + o(n)$ and a lower bound of $2n - o(n)$ are shown for the max-min-median problem.", acknowledgement = ack-nhfb, affiliationaddress = "Caracas, Venez", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; average case; Average Case Selection; Computer Programming; Computer Systems Programming --- Sorting; Data Structures and Algorithms; Lower Bounds; lower bounds; median; Probabilistic Algorithms; Sampling; selection; Selection Algorithms; theory; Upper Bounds; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Klein:1989:PLB, author = "Rolf Klein and Derick Wood", title = "On the Path Length of Binary Trees", journal = j-J-ACM, volume = "36", number = "2", pages = "280--289", month = apr, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/62044.62048", 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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62048.html", abstract = "The authors show that the external path length of a binary tree is closely related to the ratios of means of certain integers and establish the upper bound\par $${\rm External Path Length} \leq N(\log_2o N + \Delta - \log_2 \Delta - 0.6623),$$\par \noindent where $N$ denotes the number of external nodes in the tree and $\Delta$ is the difference in length between a longest and a shortest path. Then it is proved that this bound is tight up to an $O(N)$ term if $\Delta \leq \sqrt N$. If $\Delta > \sqrt N$, the authors construct binary trees whose external path length is at least as large as $N(\log_2 N + \phi(N, \Delta) \Delta - \log_2 \Delta - 4)$, where $\phi(N, \Delta) = 1 / (1 + 2 (\Delta / N))$.", acknowledgement = ack-nhfb, affiliationaddress = "Freiburg, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; binary search tree; Binary Trees; comparison cost; Data Processing --- Data Structures; Data Structures and Algorithms; External Path Length; fringe thickness; Mathematical Techniques; node visit cost; path length; performance; ratio of means; theory; Trees; Upper Bounds; upper bounds; Verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.1}: Data, DATA STRUCTURES, Trees.", } @Article{Manacher:1989:OCS, author = "G. K. Manacher and T. D. Bui and T. Mai", title = "Optimum Combinations of Sorting and Merging", journal = j-J-ACM, volume = "36", number = "2", pages = "290--334", month = apr, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62049.html", abstract = "G. K. Manacher showed that the Ford-Johnson sorting algorithm (FJA), acting on t real numbers, can be beaten for an infinite set of values $t$. These values form a partial cover of constant density not close to 1 over an initial sequence of each band. It is shown here that the FJA can be beaten for a set of integers of asymptotic density 1 under greatly weakened assumptions. All the results depend on a new technique for obtaining optimum sort-merge sequences for best-possible sorting given a merging method. The technique turns out to be amenable to precise asymptotic analysis. When the technique is applied using the most powerful known merging algorithm, the density mentioned above is still 1, but islands of refractory points still remain.", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computer Programming --- Algorithms; Computer Systems Programming; Data Structures and Algorithms; design; Ford-Johnson algorithm; Merging Algorithms; optimum combinations; optimum sort and merge; Sorting; Sorting Algorithms; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Rabin:1989:EDI, author = "Michael O. Rabin", title = "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance", journal = j-J-ACM, volume = "36", number = "2", pages = "335--348", month = apr, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62050.html", abstract = "An information dispersal algorithm (IDA) is developed that breaks a file $F$ of length $L = |F|$ into $n$ pieces $F_i$, $1 \leq i \leq n$, each of length |F${}_i$| $=$ L/m, so that all $m$ pieces suffice for reconstructing $F$. Dispersal and reconstruction are computationally efficient. The sum of the lengths $|F_i|$ is $(n / m) \cdot L$. Since $n / m$ can be chosen to be close to $1$, the IDA is space efficient. IDA has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission of information in networks, and to communications between processors in parallel computers. For the latter problem provably time-efficient and highly fault-tolerant routing on the $n$-cube is achieved, using just constant size buffers.", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Codes, Symbolic --- Encoding; Computer Fault Tolerance; Computer Programming --- Algorithms; Computer Security; Computer Systems, Digital; design; Distributed; Distributed Computing; fault tolerance; Information Dispersal Algorithm; Load Balancing; parallel computers; performance; reliability; routing of data; security; storage of data; theory; Verification", subject = "{\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Security and protection. {\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf E.3}: Data, DATA ENCRYPTION. {\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems Management, Distributed file systems. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf D.4.6}: Software, OPERATING SYSTEMS, Security and Protection. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Rosenthal:1989:GAC, author = "Arnon Rosenthal and Jos{\'e} A. Pino", title = "A Generalized Algorithm for Centrality Problems on Trees", journal = j-J-ACM, volume = "36", number = "2", pages = "349--361", month = apr, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62051.html", abstract = "A general framework is presented for rapidly analyzing tree networks to compute a measure of the centrality or eccentricity of all vertices in the tree. Several problems, which have been previously described in the literature, fit this framework. Some of these problems have no published solution better than performing a separate traversal for each vertex whose eccentricity is calculated. The method presented in this paper performs just two traversals and yields the eccentricities of all vertices in the tree. Natural sufficient conditions for the algorithm to work in linear time on any given problem are stated.", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 912; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "$r$-domination problem; algorithms; Algorithms; center; Centrality Problems; centralized network; centroid; Computer Programming; eccentricity; Eccentricity; facility location; generalized algorithm; linear time; Lossy network; Mathematical Techniques --- Trees; Operations Research; Optimization; Tree Networks; tree traversal; uninterpolated function; Verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Bilardi:1989:STC, author = "G. Bilardi and F. P. Preparata", title = "Size-Time Complexity of {Boolean} Networks for Prefix Computations", journal = j-J-ACM, volume = "36", number = "2", pages = "362--382", month = apr, year = "1989", CODEN = "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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62052.html", abstract = "The prefix problem consists of computing all the products x${}_0$x${}_1$\ldots{}x${}_j$(j $=$ 0, \ldots{},N-@1), given a sequence x $=$ (x${}_0$,x${}_1$, \ldots{},x\$-N-@1\$/) of elements in a semigroup. In this paper we completely characterize the size-time complexity of computing prefixes with Boolean networks, which are synchronized interconnections of Boolean gates and one-bit storage devices. This complexity crucially depends upon two properties of the underlying semigroup, which we call cycle-freedom (no cycle of length greater than one in the Cayley graph of the semigroup) and memory-induciveness (arbitrarily long products of semigroup elements are true functions of all their factors). A nontrivial characterization is given of non-memory-inducive semigroups. The results are extended to the VLSI model of computation. Area-time optimal circuits are obtained for both boundary and nonboundary I/O protocols.", acknowledgement = ack-nhfb, affiliationaddress = "Ithaca, NY, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "714; 721; 723", comment = "A complete time --- space characterization is given for the prefix problem using the circuit model.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Boolean networks; Boolean Networks; Computational Complexity; Computer Metatheory; Integrated Circuits, VLSI; Logic Circuits; parallel computation; prefix computation; Prefix Computations; Semigroups; semigroups; size-time trade-offs; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Pitt:1989:PII, author = "L. Pitt", title = "Probabilistic Inductive Inference", journal = j-J-ACM, volume = "36", number = "2", pages = "383--433", month = apr, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Inductive inference machines construct total recursive functions $\phi(x)$ given examples of the input and output of $\phi$. Probabilistic inductive inference machines are permitted coin tosses while constructing $\phi$, and are only required to construct $\phi$ with probability $p$, $0 < p < 1$. This paper shows a discrete hierarchy of inferability parameterized by $p$, for $p \leq 1/2$. Any machine that can be constructed by probabilistic inference with $p > 1/2$ can also be constructed deterministically.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/62053.html", abstract = "Inductive inference machines construct programs for total recursive functions given only example values of the functions. Probabilistic inductive inference machines are defined, and for various criteria of successful inference, it is asked whether a probabilistic inductive inference machine can infer larger classes of functions if the inference criterion is relaxed to allow inference with probability at least $p$, ($0 < p < 1$) as opposed to requiring certainty. For the most basic criteria of success (EX and BC), it is shown that any class of functions that can be inferred from examples with probability exceeding \$HLF can be inferred deterministically, and that for probabilities $p \leq 1/2$ there is a discrete hierarchy of inferability parameterized by $p$. The power of probabilistic inference strategies is characterized by equating the classes of probabilistically inferable functions with those classes that can be inferred by teams of inductive inference machines (a parallel model of inference), or by a third model called frequency inference.", acknowledgement = ack-nhfb, affiliationaddress = "Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Artificial Intelligence; Computer Metatheory; Computer Systems, Digital --- Parallel Processing; Inductive Inference; inductive inference; Probability; Program Synthesis; theory; Theory of Computation", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Mathematical induction. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory. {\bf I.2.2}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction.", } @Article{Gabor:1989:RCG, author = "Csaba P. Gabor and Kenneth J. Supowit and Wen-Lian Hsu", title = "Recognizing Circle Graphs in Polynomial Time", journal = j-J-ACM, volume = "36", number = "3", pages = "435--473", month = jul, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65951.html", abstract = "The main result of this paper is an $O(|V| \times |E|)$ time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. The algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices. Furthermore, as a substep of the algorithm, it is shown how to find in $O(|V| \times |E|)$ time a decomposition of a graph into prime graphs, thereby improving on a result of W. H. Cunningham.", acknowledgement = ack-nhfb, affiliationaddress = "Princeton, NJ, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; circle graph; Circle Graphs; Combinatorics and Graph Theory; Computer Programming --- Algorithms; Graph Decomposition; graph decomposition; Graph Theory; induced subgraph; intersection graph; Mathematical Techniques; Polynomial Time Algorithms; polynomial-time algorithms; theory; verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Lengauer:1989:HPT, author = "Thomas Lengauer", title = "Hierarchical Planarity Testing Algorithms", journal = j-J-ACM, volume = "36", number = "3", pages = "474--509", month = jul, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65952.html", abstract = "Using hierarchical definitions, one can describe very large graphs in small space. The blow-up from the length of the hierarchical description to the size of the graph can be as large as exponential. If the efficiency of graph algorithms is measured in terms of the length of the hierarchical description rather than in terms of the graph size, algorithms that do not exploit the hierarchy become hopelessly inefficient. Whether the hierarchy can be exploited to speed up the solution of graph problems depends on the hierarchical graph model. In this paper, a hierarchical graph model that permits taking advantage of the hierarchy is presented. For this model algorithms are given that test planarity of a hierarchically described graph in linear time in the length of the hierarchical description.", acknowledgement = ack-nhfb, affiliationaddress = "Paderborn, West Ger", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Combinatorics and Graph Theory; Computer Programming --- Algorithms; Graph Theory; Hierarchical Graph Algorithms; hierarchical graph algorithms; Hierarchical Planarity Testing Algorithms; Mathematical Techniques; performance; planarity; Verification", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Peleg:1989:TBS, author = "David Peleg and Eli Upfal", title = "A Trade-Off between Space and Efficiency for Routing Tables", journal = j-J-ACM, volume = "36", number = "3", pages = "510--530", month = jul, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65953.html", abstract = "Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor --- the maximum ratio between the length of a route computed by the scheme and that of a shortest path connecting the same pair of vertices. Most previous work has concentrated on finding good routing schemes (with a small fixed stretch factor) for special classes of network topologies. In this paper the problem for general networks is studied, and the entire range of possible stretch factors is examined. The results exhibit a trade-off between the efficiency of a routing scheme and its space requirements. Almost tight upper and lower bounds for this trade-off are presented.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford, CA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithms; Computer Networks; Computer Systems; design; Hierarchical Routing; hierarchical routing; lower bound; Lower Bounds; Mathematical Techniques --- Graph Theory; performance; Random Graphs; random graphs; routing schemes; Routing Tables; routing tables; stretch factor; theory; Verification", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology.", } @Article{Pippenger:1989:ICM, author = "Nicholas Pippenger", title = "Invariance of Complexity Measures for Networks with Unreliable Gates", journal = j-J-ACM, volume = "36", number = "3", pages = "531--539", month = jul, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77248.html", abstract = "A new probabilistic failure model for networks of gates is formulated. Although this model has not been used previously, it supports the proofs of both the positive and negative results appearing in the literature. Furthermore, with respect to this new model, the complexity measures of both size and depth are affected by at most constant multiplicative factors when the set of functions that can be computed by gates is changed from one finite and complete basis to another, or when the bound on the failure probability of the gates is changed (within the limits allowed by the basis), or when the bound on the error probability of the network is changed (within the limits allowed by the basis and the failure probability of the gates).", acknowledgement = ack-nhfb, affiliationaddress = "Vancouver, BC, Can", ajournal = "J. Assoc. Comput. Mach.", classification = "721; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Complexity Measures; Computer Metatheory --- Boolean Functions; Computer Systems; design; Error Probability; Logic Design; Logic Devices --- Gates; reliability; self-correcting networks; size and depth; theory; Unreliable Gates; verification", subject = "{\bf B.6.2}: Hardware, LOGIC DESIGN, Reliability and Testing, Error-checking. {\bf B.6.2}: Hardware, LOGIC DESIGN, Reliability and Testing, Redundant design. {\bf B.6.1}: Hardware, LOGIC DESIGN, Design Styles, Cellular arrays and automata. {\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity measures.", } @Article{Gabow:1989:EIG, author = "Harold N. Gabow and Zvi Galil and Thomas H. Spencer", title = "Efficient Implementation of Graph Algorithms Using Contraction", journal = j-J-ACM, volume = "36", number = "3", pages = "540--572", month = jul, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65954.html", abstract = "The (component) merging problem is a new graph problem. Versions of this problem appear as bottlenecks in various graph algorithms. A new data structure solves this problem efficiently, and two special cases of the problem have even more efficient solutions based on other data structures. The performance of the data structures is sped up by introducing a new algorithmic tool called packets. The algorithms that use these solutions to the component merging problem also exploit new properties of two existing data structures. Specifically, $B$-trees can be used simultaneously as a priority queue and a concatenable queue. Similarly, $F$-heaps support some kinds of split operations with no loss of efficiency. An immediate application of the solution to the simplest version of the merging problem is an $O(t(m, n))$ algorithm for finding minimum spanning trees in undirected graphs without using $F$-heaps.", acknowledgement = ack-nhfb, affiliationaddress = "Boulder, CO, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; amortization; Component Merging Problem; Computer Programming; Data Processing --- Data Structures; Data Structures and Algorithms; Graph Algorithms; matching in graphs; Mathematical Techniques --- Graph Theory; Minimum Spanning Trees; minimum spanning trees; priority queue; theory; Undirected Graphs; Verification; worst-case bound", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf E.1}: Data, DATA STRUCTURES, Trees.", } @Article{Kapoor:1989:OLB, author = "Sanjiv Kapoor and Edward M. Reingold", title = "Optimum Lopsided Binary Trees", journal = j-J-ACM, volume = "36", number = "3", pages = "573--590", month = jul, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/65950.65955", 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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65955.html", abstract = "Binary search trees with costs $\alpha$ and $\beta$, respectively, on the left and right edges (lopsided search trees) are considered. The exact shape, minimum worst-case cost, and minimum average cost of lopsided trees of $n$ internal nodes are determined for nonnegative $\alpha$ and $\beta$; the costs are both roughly $\log_\rho (n + 1)$ where $\rho$ is the unique real number in the interval $(1, 2]$ satisfying $1 / \rho^\alpha / + 1 / \rho^\beta = 1$. Search procedures are given that come within a small additive constant of the lower bounds. Almost-optimum algorithms for the lopsided case of unbounded searching are also obtained. Some extensions to nonconstant costs are briefly sketched.", acknowledgement = ack-nhfb, affiliationaddress = "Urbana, IL, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "algorithmic analysis; algorithms; binary search; Binary Search Trees; binary search trees; binary trees; coding theory; Data Processing; data structure; Data Structures; Data Structures and Algorithms; Discrete Mathematics; edge-weighted trees; Fibonacci numbers; Fibonacci trees; information theory; Kraft's inequality; Lopsided Binary Trees; Mathematical Techniques --- Trees; minimax recurrence relations; optimal trees; path lengths; prefix-free codes; theory; unbounded search; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Chor:1989:SCT, author = "Benny Chor and Michael Merritt and David B. Shmoys", title = "Simple Constant-Time Consensus Protocols in Realistic Failure Models", journal = j-J-ACM, volume = "36", number = "3", pages = "591--614", month = jul, year = "1989", CODEN = "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/CCR.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "{\bf Review: Computing Reviews}, June 1990.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65956.html", abstract = "Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based on distributively flipping a coin, which is usable by a significant majority of the processors. Finally, a nearly matching lower bound is also given for randomized protocols for consensus.", acknowledgement = ack-nhfb, affiliationaddress = "Haifa, Isr", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "agreement problem; algorithms; Computer Systems, Digital; consensus problem; Consensus Protocols; cryptography; Distributed; Distributed Computing; Distributed Systems; Failure Analysis; Failure Models; fault tolerance; Lower Bounds; performance; Randomized Protocols; reliability; security; theory", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Baccelli:1989:AFJ, author = "Fran{\c{c}}ois Baccelli and William A. Massey and Don Towsley", title = "Acyclic Fork-Join Queueing Networks", journal = j-J-ACM, volume = "36", number = "3", pages = "615--642", month = jul, year = "1989", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/65950.65957", 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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65957.html", abstract = "The class of acyclic fork-join queuing networks that arise in various applications, including parallel processing and flexible manufacturing are studied. In such queuing networks, a fork describes the simultaneous creation of several new customers, which are sent to different queues. The corresponding join occurs when the services of all these new customers are completed. The evolution equations that govern the behavior of such networks are derived. From this, the stability conditions are obtained and upper and lower bounds on the network response times are developed. These bounds are based on various stochastic ordering principles and on the notion of association of random variables.", acknowledgement = ack-nhfb, affiliationaddress = "Valbonne, Fr", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Associated Random Variables; associated random variables; Computer Systems, Digital --- Performance; design; ergodic theory; Industrial Plants --- Flexible Manufacturing Systems; Lower Bounds; multiprogramming and multitasking; Network Response Times; Parallelism; performance; performance evaluation; precedence graph; Probability; Queueing Theory; stability condition; Stochastic Ordering; stochastic ordering; System Modeling and Analysis; theory; Upper Bounds; verification", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory.", } @Article{Beame:1989:OBD, author = "Paul Beame and Johan H{\aa}stad", title = "Optimal Bounds for Decision Problems on the {CRCW} {PRAM}", journal = j-J-ACM, volume = "36", number = "3", pages = "643--670", month = jul, year = "1989", CODEN = "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/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65958.html", abstract = "Optimal $\Omega(\log n/\log \log n)$ lower bounds on the time for CRCW PRAMs with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems are proven. A strict time hierarchy of explicit Boolean functions of $n$ bits on such machines that holds up to $O(\log n/\log \log n)$ time is also exhibited. That is, for every time bound T within this range a function is exhibited that can be easily computed using polynomial resources in time T but requires more than polynomial resources to be computed in time $T - 1$. Finally, it is shown that almost all Boolean functions of $n$ bits require $\log n {\rm MIN} \log \log n + \Omega(1)$ time when the number of processors is at most polynomial in $n$. The bounds do not place restrictions on the uniformity of the algorithms nor on the instruction sets of the machines.", acknowledgement = ack-nhfb, affiliationaddress = "Seattle, WA, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "722; 723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "Computer Metatheory --- Boolean Functions; Computer Systems, Digital; Concurrent Read; Concurrent Write; concurrent-write; CRCW PRAM; Decision Theory and Analysis; Lower Bounds; lower bounds; Parallel Processing; Parallel Random Access Machines; parallel random-access machines; parity; sorting; theory; Theory of Computation; Verification", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices.", } @Article{Li:1989:NLB, author = "Ming Li and Yaacov Yesha", title = "New Lower Bounds for Parallel Computation", journal = j-J-ACM, volume = "36", number = "3", pages = "671--680", month = jul, year = "1989", CODEN = "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/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/65959.html", abstract = "Lower bounds are proved on the parallel-time complexity of several basic functions on the most powerful concurrent-read concurrent-write PRAM with unlimited shared memory and unlimited power of individual processors (denoted by PRIORITY($\infty$)). Some of the bounds remain valid for probabilistic or nondeterministic concurrent-read concurrent-write PRAMs.", acknowledgement = ack-nhfb, affiliationaddress = "Columbus, OH, USA", ajournal = "J. Assoc. Comput. Mach.", classification = "723; 922", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", journalabr = "J Assoc Comput Mach", keywords = "addition; algorithms; Computational Complexity; computational complexity; Computer Systems, Digital; Concurrent Read; Concurrent Write; CRCW PRAM; Lower Bounds; lower bounds; Parallel Processing; parallel random access machine; Parallel Random Access Machines; parity; Probability --- Random Processes; theory; Theory of Computation; verification", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Dean:1989:UTH, author = "Thomas Dean", title = "Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases", journal = j-J-ACM, volume = "36", number = "4", pages = "687--718", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76360.html", abstract = "Many real-world applications involve the management of large amounts of time-dependent information. Temporal database systems maintain this information in order to support various sorts of inference (e.g., answering questions involving propositions that are true over some intervals and false over others). For any given proposition, there are typically many different occasions on which that proposition becomes true and persists for some length of time. In this paper, these occasions are referred to as time tokens. Many routine database operations must search through the database for time tokens satisfying certain temporal constraints. To expedite these operations, this paper describes a set of techniques for organizing temporal information by exploiting the local and global structure inherent in a wide class of temporal reasoning problems. The global structure of time is exemplified in conventions for partitioning time according to the calendar and the clock. This global structure is used to partition the set of time tokens to facilitate retrieval. The local structure of time is exemplified in the causal relationships between events and the dependencies between planned activities. This local structure is used as part of a strategy for reducing the computation required during constraint propagation. The organizational techniques described in this paper are quite general, and have been used to support a variety of powerful inference mechanisms. Integrating these techniques into an existing temporal database system has increased, by an order of magnitude or more in most applications, the number of time tokens that can be efficiently handled.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Artificial Intelligence; design; discrimination trees; Performance; reason maintenance; temporal reasoning", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design.", } @Article{Platzman:1989:SCP, author = "Loren K. Platzman and John J. {Bartholdi, III}", title = "Spacefilling Curves and the Planar Travelling Salesman Problem", journal = j-J-ACM, volume = "36", number = "4", pages = "719--737", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 09 18:40:49 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76361.html", abstract = "To construct a short tour through points in the plane, the points are sequenced as they appear along a spacefilling curve. This heuristic consists essentially of sorting, so it is easily coded and requires only $O(N)$ memory and $O(N\log N)$ operations. Its performance is competitive with that of other fast methods.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Combinatorics and Graph Theory; fractal geometry; performance; spacefilling curves; Verification", subject = "{\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Dowd:1989:PBS, author = "Martin Dowd and Yehoshua Perl and Larry Rudolph and Michael Saks", title = "The Periodic Balanced Sorting Network", journal = j-J-ACM, volume = "36", number = "4", pages = "738--757", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76362.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Batcher's networks; comparators network; Computer Systems; design; parallel sorting; periodic networks; shell sort; shuffle-exchange interconnection; sorting networks; theory; Verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Recurrences and difference equations. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations.", } @Article{Abiteboul:1989:TBA, author = "Serge Abiteboul and Victor Vianu", title = "A Transaction-Based Approach to Relational Database Specification", journal = j-J-ACM, volume = "36", number = "4", pages = "758--789", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 11:14:15 1991", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76363.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "database is updated only by a fixed set of encapsulated transactions defined in the schema; constraints can be automatically maintained; preserve constraints and soundness; preservation and soundness are unsolvable for arbitrary first-order constraints.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Database Theory; design; dynamic and static constraints; languages; Management; methods; object-oriented databases; operational specification; performance; theory; transactional schema; Verification", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.2.0}: Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages.", } @Article{Gyssens:1989:UAT, author = "Marc Gyssens and Jan Paredaens and Dirk {Van Gucht}", title = "A Uniform Approach toward Handling Atomic and Structured Information in the Nested Relational Database Model", journal = j-J-ACM, volume = "36", number = "4", pages = "790--825", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76364.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "specification of operators, basic are: set, project, nest, unnest, copy; also: rename. Toggell unnesting, incomplete projection.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algebra; atomic and nonatomic values; copying; Database Theory; design; expressiveness; languages; nested and flat relations and databases; performance; prime values; relation classes; theory; Verification", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models.", } @Article{vandeSnepscheut:1989:DSS, author = "Jan L. A. van de Snepscheut and Johan B. Swenker", title = "On the Design of Some Systolic Algorithms", journal = j-J-ACM, volume = "36", number = "4", pages = "826--840", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:26:03 1998", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76365.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Computer Systems Organization; concurrent assignment statement; design; Distributed Computing; heuristics; programming methods; Software; systolic algorithms; systolic arrays; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Invariants.", } @Article{Engelfriet:1989:PSV, author = "Joost Engelfriet and Gilberto Fil{\'e}", title = "Passes, Sweeps, and Visits in Attribute Grammars", journal = j-J-ACM, volume = "36", number = "4", pages = "841--869", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76366.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; attribute evaluator; attribute grammar; class; computational complexity; design; Formal Languages; languages; theory; Verification", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @Article{Kortelainen:1989:CFC, author = "Juha Kortelainen", title = "The Conjecture of {Fliess} on Commutative Context-Free Languages", journal = j-J-ACM, volume = "36", number = "4", pages = "870--872", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "commutative languages; context-free languages; Formal Languages; Languages", } @Article{Goldberg:1989:FMC, author = "Andrew V. Goldberg and Robert E. Tarjan", title = "Finding Minimum-Cost Circulations by Canceling Negative Cycles", journal = j-J-ACM, volume = "36", number = "4", pages = "873--886", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Preliminary version in Proc. 20th Annual ACM Symposium on the Theory of Computing, pages 388--397, 1987", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76368.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; cycle canceling; dynamic tree; languages; minimum-cost flow; network optimization; Operations Research; theory; transportation problem; transshipment problem", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Castellani:1989:DB, author = "Ilaria Castellani and Matthew Hennessy", title = "Distributed Bisimulations", journal = j-J-ACM, volume = "36", number = "4", pages = "887--911", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Oct 21 23:26:52 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76369.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algebraic; concurrent processes; languages; noninterleaving; observational equivalence; Programming Languages and Methodology; theory; verification", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory.", } @Article{Allender:1989:UCC, author = "Eric W. Allender", title = "${P}$-Uniform Circuit Complexity", journal = j-J-ACM, volume = "36", number = "4", pages = "912--928", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Dec 10 15:43:47 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76370.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "alternating Turing machine; auxiliary pushdown automata; circuit complexity; exponential time; languages; NC; P; precomposition; PSPACE; sparse sets; tally sets; theory; Theory of Computation; uniformity; verification", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness.", } @Article{Blumer:1989:LVC, author = "Anselm Blumer and Andrzej Ehrenfeucht and David Haussler and Manfred K. Warmuth", title = "Learnability and the {Vapnik--Chervonenkis} Dimension", journal = j-J-ACM, volume = "36", number = "4", pages = "929--965", month = oct, year = "1989", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/76371.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", comment = "An earlier version is available as U. C. Santa Cruz Computer Science Laboratory Tech.\ Report UCSC-CRL-87-20 (Nov.\ 1987). A shorter version appeared in STOC86.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; capacity; design; learnability theory; learning from examples; Occam's razor; PAC learning; performance; sample complexity; theory; Theory of Computation; Vapnik--Chervonenkis classes; Vapnik--Chervonenkis dimension; verification", subject = "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning. {\bf I.5.0}: Computing Methodologies, PATTERN RECOGNITION, General. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Kolaitis:1990:SCA, author = "Phokion G. Kolaitis and Christos H. Papadimitriou", title = "Some Computational Aspects of Circumscription", journal = j-J-ACM, volume = "37", number = "1", pages = "1--14", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78936.html", abstract = "The effects of circumscribing first-order formulas are explored from a computational standpoint. First, extending work of V. Lifschitz, it is Shown that the circumscription of any existential first-order formula is equivalent to a first-order formula. After this, it is established that a set of universal Horn clauses has a first-order circumscription if and only if it is bounded (when considered as a logic program); thus it is undecidable to tell whether such formulas have first-order circumscription. Finally, it is shown that there are first-order formulas whose circumscription has a co-NP-complete model-checking problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Artificial Intelligence; circumscription; design; first-order logic; Horn clauses; model checking; nonmonotonic reasoning; NP-completeness; performance; Theory; undecidability", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming.", } @Article{Cosmadakis:1990:PTI, author = "Stavros S. Cosmadakis and Paris C. Kanellakis and Moshe Y. Vardi", title = "Polynomial-Time Implication Problems for Unary Inclusion Dependencies", journal = j-J-ACM, volume = "37", number = "1", pages = "15--46", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78937.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "subset dependency and constraints interacts with FDs", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; complementary view; complete axiomatizations; Database Theory; decidability; design; embedded implicational dependencies; finite implication; functional dependencies; implication; lossless join; polynomial-time algorithms; theory; unary inclusion dependencies", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf H.2.0}: Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory.", } @Article{Jaffar:1990:MCW, author = "Joxan Jaffar", title = "Minimal and Complete Word Unification", journal = j-J-ACM, volume = "37", number = "1", pages = "47--85", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78938.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Formal Languages; languages; theory; unification; word problems", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf I.1.0}: Computing Methodologies, ALGEBRAIC MANIPULATION, General. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures.", } @Article{Halpern:1990:CRR, author = "Joseph Y. Halpern and John H. Williams and Edward L. Wimmers", title = "Completeness of Rewrite Rules and Rewrite Strategies for {FP}", journal = j-J-ACM, volume = "37", number = "1", pages = "86--143", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78939.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "completeness of rewriting rules; functional semantics; languages; Programming Languages and Methodology; strategies for rewriting; theory", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, FP.", } @Article{Knessl:1990:AEL, author = "Charles Knessl and Charles Tier", title = "Asymptotic Expansions for Large Closed Queueing Networks", journal = j-J-ACM, volume = "37", number = "1", pages = "144--174", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78940.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A new asymptotic method is developed for analyzing closed BCMP queueing networks with a single class (chain) consisting of a large number of customers, a single infinite server queue, and a large number of single server queues with fixed (state independent) service rates.", descriptors = "Closed queueing network; BCMP; analysis; approximation", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; asymptotics; performance; singular perturbations; System Modeling and Analysis; theory", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Mate:1990:NPT, author = "Atilla M{\'a}t{\'e}", title = "Nondeterministic Polynomial-Time Computations and Models of Arithmetic", journal = j-J-ACM, volume = "37", number = "1", pages = "175--193", month = jan, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/78941.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Diophantine sets; nondeterministic Turing machine; nonstandard models of arithmetic; NP-complete; the P =? NP problem; theory; Theory of Computation", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{Davis:1990:CER, author = "Henry W. Davis", title = "Cost-Error Relationships in {A*} Tree-Searching", journal = j-J-ACM, volume = "37", number = "2", pages = "195--199", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77595.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Artificial Intelligence; theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods.", } @Article{Chazelle:1990:LBOa, author = "Bernard Chazelle", title = "Lower Bounds for Orthogonal Range Searching: {I}. The Reporting Case", journal = j-J-ACM, volume = "37", number = "2", pages = "200--212", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77614.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Computational Geometry; measurement; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.1}: Data, DATA STRUCTURES.", } @Article{Ahuja:1990:FAS, author = "Ravindra K. Ahuja and Kurt Mehlhorn and James B. Orlin and Robert E. Tarjan", title = "Faster Algorithms for the Shortest Path Problem", journal = j-J-ACM, volume = "37", number = "2", pages = "213--223", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77615.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Data Structure and Algorithms; design; heap; priority queue; shortest paths; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf E.1}: Data, DATA STRUCTURES. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Bollobas:1990:CDC, author = "B{\'e}la Bollob{\'a}s and Andrei Z. Broder and Istvan Simon", title = "The Cost Distribution of Clustering in Random Probing", journal = j-J-ACM, volume = "37", number = "2", pages = "224--237", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77619.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; clustering; Data Structure and Algorithms; hashing; open addressing; random probing; theory; uniform hashing", subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Clustering. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations.", } @Article{Awerbuch:1990:TBI, author = "Baruch Awerbuch and Oded Goldreich and David Peleg and Ronen Vainish", title = "A Trade-Off between Information and Communication in Broadcast Protocols", journal = j-J-ACM, volume = "37", number = "2", pages = "238--256", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77618.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; broadcast; Distributed Computing; lower bounds; measurement; Multicast; resource trade-offs; theory", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Herlihy:1990:CAD, author = "Maurice Herlihy", title = "Concurrency and Availability as Dual Properties of Replicated Atomic Data", journal = j-J-ACM, volume = "37", number = "2", pages = "257--278", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Oct 21 19:57:33 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Object/Ooos.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77616.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; distributed computing; distributed systems; quorum consensus; reliability; replication", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Distributed memories. {\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems Management, Distributed file systems.", } @Article{Abadi:1990:NDF, author = "Mart{\'\i}n Abadi and Zohar Manna", title = "Nonclausal Deduction in First-Order Temporal Logic", journal = j-J-ACM, volume = "37", number = "2", pages = "279--317", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77617.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "automated deduction; concurrent-program verification; first-order temporal logic; Logic; nonclausal resolution; theorem proving; theory; verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving.", } @Article{Shahrokhi:1990:MCF, author = "Farhad Shahrokhi and D. W. Matula", title = "The Maximum Concurrent Flow Problem", journal = j-J-ACM, volume = "37", number = "2", pages = "318--334", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77620.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; concurrent network flow; cut saturation; duality theorems; experimentation; multicommodity flow; network partitioning; Operations Research; polynomial-time approximation scheme; primal-dual algorithms; routing in networks; theory; throughput", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Bergstra:1990:MA, author = "J. A. Bergstra and J. Heering and P. Klint", title = "Module Algebra", journal = j-J-ACM, volume = "37", number = "2", pages = "335--372", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Oct 21 19:58:50 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77621.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "abstraction; algebraic specification module; Craig interpolation lemma; export; first-order specification module; information hiding; languages; module algebra; module composition; module expression; Programming Languages and Methodology; renaming; signature; signature expression; theory; union of modules; visible signature", subject = "{\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs.", } @Article{Baccelli:1990:EPP, author = "Fran{\c{c}}ois Baccelli and Zhen Liu", title = "On the Execution of Parallel Programs on Multiprocessor Systems --- a Queuing Theory Approach", journal = j-J-ACM, volume = "37", number = "2", pages = "373--414", month = apr, year = "1990", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/77600.77622", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jan 6 09:50:45 2012", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77622.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "The new class of queueing models, called Synchronized Queueing Networks, is proposed for evaluating the performance of multiprogrammed and multitasked multiprocessor systems, where workloads consist of parallel programs of similar structure and where the scheduling discipline is FIFO.", descriptors = "Multiprocessor system; queueing network; scheduling; performance evaluation", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; associated random variables; design; ergodic theory; multiprogramming and multitasking; Parallelism; performance; performance evaluation; response times; stability condition; stochastic ordering; System Modeling and Analysis; task graph; theory; waiting times", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Ko:1990:SCR, author = "Ker-I Ko", title = "Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy", journal = j-J-ACM, volume = "37", number = "2", pages = "415--438", month = apr, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/77623.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Complexity; polynomial-time hierarchy; probabilistic computation; relativization; theory; Theory of Computation", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Machine-independent complexity. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation.", } @Article{Chazelle:1990:LBOb, author = "Bernard Chazelle", title = "Lower Bounds for Orthogonal Range Searching: {II}. The Arithmetic Model", journal = j-J-ACM, volume = "37", number = "3", pages = "439--463", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/siggraph/90.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79149.html", abstract = "Lower bounds on the complexity of orthogonal range searching in the static case are established. Specifically, we consider the following dominance search problem: Given a collection of $n$ weighted points in $d$-space and a query point $q$, compute the cumulative weight of the points dominated (in all coordinates) by $q$. It is assumed that the weights are chosen in a commutative semigroup and that the query time measures only the number of arithmetic operations needed to compute the answer. It is proved that if $m$ units of storage are available, then the query time is at least proportional to $(\log n/\log(2m/n))^{d-1}$ in both the worst and average cases. This lower bound is provably tight for $m = \Omega(n(\log n)^ {d-1+\epsilon})$ and any fixed $\epsilon > 0$. A lower bound of $\Omega(n/\log \log n)^{d}$ on the time required for executing $n$ inserts and queries is also established.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Larmore:1990:FAO, author = "Lawrence L. Larmore and Daniel S. Hirschberg", title = "A Fast Algorithm for Optimal Length-Limited {Huffman} Codes", journal = j-J-ACM, volume = "37", number = "3", pages = "464--473", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79150.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; binary tree; data compaction and compression; Data Structure and Algorithms; design; Huffman coding; performance; Theory", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory. {\bf E.1}: Data, DATA STRUCTURES, Trees.", } @Article{Graham:1990:EES, author = "Marc H. Graham and Ke Wang", title = "On the Equivalence of an {Egd} to a Set of {Fd}'s", journal = j-J-ACM, volume = "37", number = "3", pages = "474--490", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79151.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "algorithm for a given equality-generating dependency equivalent to a set of functional dependencies.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; data dependencies; Database Theory; languages; theory; weak instances", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design. {\bf H.2.0}: Information Systems, DATABASE MANAGEMENT, General. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Data description languages (DDL).", } @Article{Ryu:1990:ADP, author = "In Kyung Ryu and Alexander Thomasian", title = "Analysis of Database Performance with Dynamic Locking", journal = j-J-ACM, volume = "37", number = "3", pages = "491--523", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79152.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "the analysis estimates the probability of lock conflicts based on the mean number of locks held by transactions of various classes; main conclusions: system performance is affected more by transaction blocking than by transaction restarts; high transaction arrival rates result in thrashing; for moderate lock contention levels degradation is proportional to transaction size; lock contention with variable-size transactions is higher than with fixed-size transactions; read-only shared locks reduce conflicts and improve performance.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "concurrency control; data contention; database locking; Database Theory; decomposition; design; performance; queuing network models; Theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Attiya:1990:RAE, author = "Hagit Attiya and Amotz Bar-Noy and Danny Dolev and David Peleg and R{\"u}diger Reishuk", title = "Renaming in an Asynchronous Environment", journal = j-J-ACM, volume = "37", number = "3", pages = "524--548", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79158.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; asynchronous environment; asynchrony; Distributed Computing; distributed systems; lower bounds; processor renaming; Reliability; symmetry breaking; theory; unreliable systems", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Halpern:1990:KCK, author = "Joseph Y. Halpern and Yoram Moses", title = "Knowledge and Common Knowledge in a Distributed Environment", journal = j-J-ACM, volume = "37", number = "3", pages = "549--587", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "A preliminary version appeared in {\em Proc. 3rd ACM Symposium on Principles of Distributed Computing}, 1984", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79161.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; common knowledge; Distributed Computing; distributed knowledge; knowledge; knowledge and action; reliability; theory; variants of common knowledge; verification", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol verification. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Uresin:1990:PAA, author = "Aydin {\"U}resin and Michel Dubois", title = "Parallel Asynchronous Algorithms for Discrete Data", journal = j-J-ACM, volume = "37", number = "3", pages = "588--606", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/79162.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; asynchronous algorithms; consistent labeling; design; fixed point; iterative algorithms; Numerical Computation; synchronization; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors).", } @Article{Orda:1990:SPM, author = "Ariel Orda and Raphael Rom", title = "Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length", journal = j-J-ACM, volume = "37", number = "3", pages = "607--625", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214078.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; functional complexity; network algorithms; Operations Research; performance; shortest paths; time dependency; waiting times", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Han:1990:EFP, author = "Yijie Han and Robert A. Wagner", title = "An Efficient and Fast Parallel-Connected Component Algorithm", journal = j-J-ACM, volume = "37", number = "3", pages = "626--642", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214077.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; connectivity; design; optimal algorithms; Parallel Algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Pattipati:1990:AMV, author = "K. R. Pattipati and M. M. Kostreva and J. L. Teele", title = "Approximate Mean Value Analysis Algorithms for Queueing Networks: {Existence}, Uniqueness, and Convergence Results", journal = j-J-ACM, volume = "37", number = "3", pages = "643--673", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214074.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; closed product-form queuing networks; convex programming; mean value analysis; performance; primal-dual methods; Schweitzer-Bard approximation; System Modeling and Analysis; throughput bounds", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Gurevich:1990:NLT, author = "Yuri Gurevich and Saharon Shelah", title = "Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space", journal = j-J-ACM, volume = "37", number = "3", pages = "674--687", month = jul, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214070.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; clique problem; lower bounds; nondeterminism; nonlinear time; performance; Theory of Computation; time-space trade-off", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity measures. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Counting problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Szpankowski:1990:PTA, author = "Wojciech Szpankowski", title = "{Patricia} Tries Again Revisited", journal = j-J-ACM, volume = "37", number = "4", pages = "691--711", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/214080.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; balanced trees; Data Structure and Algorithms; data structures; digital search trees; Patricia tries; performance; probabilistic analysis of algorithms; random shape of trees; successful search; unsuccessful search", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Generating functions. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Recurrences and difference equations. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process.", } @Article{Briggs:1990:CTC, author = "David A. Briggs", title = "A Correction of the Termination Conditions of the {Henschen-Naqvi} Technique", journal = j-J-ACM, volume = "37", number = "4", pages = "712--719", month = oct, year = "1990", 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96562.html", abstract = "Henschen and Naqvi described a technique for translating queries on recursively defined relations of a Datalog database into iterative programs that invoke a query processor for conventional select-project-join queries of the relational algebra. Although the technique has been cited as one of the most efficient available, it will in some cases fail to produce all answers defined by the usual semantics for such databases. The technique is reviewed, a recursive query is exhibited where it fails, the cause of failure is noted, and a correction is described. A graphical representation of the computation based on a formal representation of rule expansions is employed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Datalog database, it in some cases fails to produce all answers on recursively defined relations; the cause of failure is noted and a correction is described.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; cyclic relations; Database Theory; Languages; logic and databases; logic program compilation; recursively defined relations; Theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming.", } @Article{Dolev:1990:ESB, author = "Danny Dolev and Ruediger Reischuk and H. Raymond Strong", title = "Early Stopping in {Byzantine} Agreement", journal = j-J-ACM, volume = "37", number = "4", pages = "720--741", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96565.html", abstract = "Two different kinds of Byzantine Agreement for distributed systems with processor faults are defined and compared. The first is required when coordinated actions may be performed by each participant at different times. This kind is called Simultaneous Byzantine Agreement (SBA).\par This paper deals with the number of rounds of message exchange required to reach Byzantine Agreement of either kind (BA). If an algorithm allows its participants to reach Byzantine agreement in every execution in which at most $t$ participants are faulty, then the algorithm is said to tolerate $t$ faults. It is well known that any BA algorithm that tolerates $t$ faults (with $t < n - 1$ where $n$ denotes the total number of processors) must run at least $t$ + 1 rounds in some execution. However, it might be supposed that in executions where the number $f$ of actual faults is small compared to $t$, the number of rounds could be correspondingly small. A corollary of our first result states that (when $t < n - 1$) any algorithm for SBA must run $t + 1$ rounds in some execution where there are no faults. For EBA (with $t < n - 1$), a lower bound of $\min(t + 1,f + 2)$ rounds is proved. Finally, an algorithm for EBA is presented that achieves the lower bound, provided that $t$ is on the order of the square root of the total number of processors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "agreement problem; Algorithms; asynchronous system; Byzantine Generals problem; commit problem; consensus problem; Distributed Computing; early stopping; fault tolerance; performance; Reliability; Theory; Verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", } @Article{Nipkow:1990:UPA, author = "Tobias Nipkow", title = "Unification in Primal Algebras, Their Powers and Their Varieties", journal = j-J-ACM, volume = "37", number = "4", pages = "742--776", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96569.html", abstract = "This paper examines the unification problem in the class of {\em primal algebras\/} and the varieties they generate. An algebra is called primal if every function on its carrier can be expressed just in terms of the basic operations of the algebra. The two-element Boolean algebra is the simplest nontrivial example: Every truth-function can be realized in terms of the basic connectives, for example, negation and conjunction.\par It is shown that unification in primal algebras is unitary, that is, if an equation has a solution, it has a single most general one. Two unification algorithms, based on equation-solving techniques for Boolean algebras due to Boole and L{\"o}wenheim, are studied in detail. Applications include certain finite Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic.\par Then unification is extended from primal algebras to their direct powers, which leads to unitary unification algorithms covering finite Post algebras, finite, semisimple Artinian rings, and finite, semisimple nonabelian groups.\par Finally the fact that the variety generated by a primal algebra coincides with the class of its subdirect powers is used. This yields unitary unification algorithms for the equational theories of Post algebras and $p$-rings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Boolean algebra; Boolean rings; equational reasoning; Logic; Post algebra; primal algebras; Theory; unification; Verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf I.1.1}: Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Simplification of expressions.", } @Article{Nadathur:1990:HOH, author = "Gopalan Nadathur and Dale Miller", title = "Higher-Order {Horn} Clauses", journal = j-J-ACM, volume = "37", number = "4", pages = "777--814", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96570.html", abstract = "A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed $\lambda$-terms and by permitting quantification over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theoretic results concerning these extended clauses are presented. One result shows that although the substitutions for predicate variables can be quite complex in general, the substitutions necessary in the context of higher-order Horn clauses are tightly constrained. This observation is used to show that these higher-order formulas can specify computations in a fashion similar to first-order Horn clauses. A complete theorem-proving procedure is also described for the extension. This procedure is obtained by interweaving higher-order unification with backchaining and goal reductions, and constitutes a higher-order generalization of SLD-resolution. These results have a practical realization in the higher-order logic programming language called $\lambda$Prolog.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "higher-order logic; higher-order unification; Horn clauses; languages; Logic Programming; Prolog; SLD-resolution; theory", subject = "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming.", } @Article{Cockett:1990:DTR, author = "J. R. B. Cockett and J. A. Herrera", title = "Decision Tree Reduction", journal = j-J-ACM, volume = "37", number = "4", pages = "815--842", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96576.html", abstract = "The reduction algorithm is a technique for improving a decision tree in the absence of a precise cost criterion. The result of applying the algorithm is an irreducible tree that is no less efficient than the original, and may be more efficient. Irreducible trees arise in discrete decision theory as an algebraic form for decision trees. This form has significant computational properties. In fact, every irreducible is optimal with respect to some expected testing cost criterion and is strictly better than any given distinct tree with respect to some criterion.\par Many irreducibles are decision equivalent to a given tree; only some of these are {\em reductions\/} of the tree. The reduction algorithm is a particular way of finding one of these. It tends to preserve the overall structure of the tree by reducing the subtrees first.\par A bound on the complexity of this algorithm with input tree $t$ is $O(\mbox{hgt}(t)^2) - \mbox{usize}(t)$ is the {\em uniform\/} size of the tree (the number of leaves less one) and hgt($t$) is the height of the tree. This means that decision tree reduction has the same worst-case order of complexity as most heuristic methods for building suboptimal trees. While the purpose of using heuristics is often rather different, such comparisons are an indication of the efficiency of the reduction algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; control decisions; Design; discrete decision theory; essential decisions; expected testing cost; irreducible decision trees; Operations Research; Performance; reasonable cost criteria; rebust optimization of decision trees; redundant decisions; stable optimization of decision trees; syntactic optimization; Theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Hochbaum:1990:CSO, author = "Dorit S. Hochbaum and J. George Shanthikumar", title = "Convex Separable Optimization Is Not Much Harder than Linear Optimization", journal = j-J-ACM, volume = "37", number = "4", pages = "843--862", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96597.html", abstract = "The polynomiality of nonlinear separable convex (concave) optimization problems, on linear constraints with a matrix with ``small'' subdeterminants, and the polynomiality of such integer problems, provided the integer linear version of such problems is polynomial, is proven. This paper presents a general-purpose algorithm for converting procedures that solves linear programming problems. The conversion is polynomial for constraint matrices with polynomially bounded subdeterminants. Among the important corollaries of the algorithm is the extension of the polynomial solvability of integer linear programming problems with totally unimodular constraint matrix, to integer-separable convex programming. An algorithm for finding a $\epsilon$-accurate optimal continuous solution to the nonlinear problem that is polynomial in $\log(1/\epsilon)$ and the input size and the largest subdeterminant of the constraint matrix is also presented. These developments are based on proximity results between the continuous and integral optimal solutions for problems with any nonlinear separable convex objective function. The practical feature of our algorithm is that is does not demand an explicit representation of the nonlinear function, only a polynomial number of function evaluations on a prespecified grid.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Decision; nonlinear optimization; Operations Research; proximity results; scaling algorithms; Theory", subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General.", } @Article{Harrison:1990:RMI, author = "Peter G. Harrison and Naresh M. Patel", title = "The Representation of Multistage Interconnection Networks in Queuing Models of Parallel Systems", journal = j-J-ACM, volume = "37", number = "4", pages = "863--898", month = oct, year = "1990", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1990.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/96599.html", abstract = "A major component of a parallel machine is its interconnection network (IN), which provides concurrent communication between the processing elements. It is common to use a multistage interconnection network (MIN) that is constructed using crossbar switches and introduces contention not only for destination addresses but also for internal links. Both types of contention are increased when nonlocal communication across a MIN becomes concentrated on a certain destination address, the {\em hot-spot}. This paper considers analytical models of asynchronous, circuit-switched INs in which partial paths are held during path building, beginning with a single crossbar and extending recursively to MINs. Since a path must be held between source and destination processors before data can be transmitted, switching networks are passive resources and queuing networks that include them do not therefore have product-form solutions. Using decomposition techniques, the flow-equivalent server (FES) that represents a bank of devices transmitting through a switching network is determined, under mild approximating assumptions. In the case of a full crossbar, the FES can be solved directly and the result can be applied recursively to model the MIN. Two cases are considered: one in which there is uniform routing and the other where there is a hot-spot at one of the output pins. Validation with respect to simulation for MINs with up to six stages (64-way switching) indicated a high degree of accuracy in the models.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "This paper considers analytical models of asynchronous, circuit-switched INs in which partial paths are held during path building, beginning with a single crossbar and extending recursively to MINs. Since a path must be held between source and destination processors before data can be transmitted, switching networks are passive resources and queueing networks that include them do not therefore have product-form solutions. \ldots{}", descriptors = "Closed queueing network; crossbar; delta network; flow equivalent server; decomposition; Markov process; performance evaluation; multistage interconnection network", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "closed queuing network; crossbar switch; delta network; Design; flow-equivalent server; Markov process; multistage interconnection network; Parallelism; Performance; performance evaluation; System Modeling and Analysis; theory", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices.", } @Article{Dyer:1991:RPT, author = "Martin Dyer and Alan Frieze and Ravi Kannan", title = "A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies", journal = j-J-ACM, volume = "38", number = "1", pages = "1--17", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "A constant time oracle is assumed for determining if a point in space is inside or outside a convex body in $n$-dimensional Euclidean space. The algorithm runs in time bounded by a polynomial in $n$, the dimension of the body, and $1/\epsilon$, where $\epsilon$ is the relative error bound. With probability $3/4$, it finds an approximation satisfying the error bound.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102783.html", abstract = "A randomized polynomial-time algorithm for approximating the volume of a convex body $K$ in $n$-dimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within $K$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; approximation; Computational Geometry; convex; convex sets; random walks; sampling; theory; volume", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Mitchell:1991:WRP, author = "Joseph S. B. Mitchell and Christos H. Papadimitriou", title = "The Weighted Region Problem: {Finding} Shortest Paths Through a Weighted Planar Subdivision", journal = j-J-ACM, volume = "38", number = "1", pages = "18--73", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102784.html", abstract = "The problem of determining shortest paths through a weighted planar polygonal subdivision with $n$ vertices is considered. Distances are measured according to a weighted Euclidean metric: The length of a path is defined to be the weighted sum of (Euclidean) lengths of the subpaths within each region. An algorithm that constructs a (restricted) ``shortest path map'' with respect to a given source point is presented. The output is a partitioning of each edge of the subdivision into intervals of $\epsilon$-optimality, allowing an $\epsilon$-optimal path to be traced from the source to any query point along any edge. The algorithm runs in worst-case time $O(ES)$ and requires $O(E)$ space, where $E$ is the number of ``events'' in our algorithm and $S$ is the time it takes to run a numerical search procedure. In the worst case, $E$ is bounded above by $O(n^{4})$ (and we give an $\Omega(n^{4})$ lower bound), but it is likely that $E$ will be much smaller in practice. We also show that $S$ is bounded by $O(n^{4}L)$, where $L$ is the precision of the problem instance (including the number of bits in the user-specified tolerance $\epsilon$). Again, the value of $S$ should be smaller in practice. The algorithm applies the ``continuous Dijkstra'' paradigm and exploits the fact that shortest paths obey Snell's Law of Refraction at region boundaries, a local optimality property of shortest paths that is well known from the analogous optics model. The algorithm generalizes to the multi-source case to compute Voronoi diagrams.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Computational Geometry; continuous Dijkstra; Dijkstra's algorithm; geodesic distance; measurement; path planning; shortest paths; terrain navigation; Theory; Voronoi diagrams; weighted; weighted distance functions", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies.", } @Article{Mulmuley:1991:FPP, author = "Ketan Mulmuley", title = "A Fast Planar Partition Algorithm, {II}", journal = j-J-ACM, volume = "38", number = "1", pages = "74--103", month = jan, year = "1991", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/102782.102785", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 22 07:42:24 2011", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102785.html", abstract = "Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also provides a new technique for clipping, called {\em virtual clipping}, whose overhead per window $W$ depends logarithmically on the number if intersections between the borders of $W$ and the input segments. In contrast, the overhead of the conventional clipping technique depends linearly on this number of intersections. As an application of virtual clipping, a new simple and efficient algorithm for plannar point location is given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; computational complexity; Computational Geometry; hidden surface removal; planar subdivision; randomized geometric algorithms; Theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems.", } @Article{Willard:1991:OSC, author = "Dan E. Willard", title = "Optimal Sample Cost Residues for Differential Database Batch Query Problems", journal = j-J-ACM, volume = "38", number = "1", pages = "104--119", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102786.html", abstract = "In many computing applications, there are several equivalent algorithms capable of performing a particular task, and no one is the most efficient under all statistical distributions of the data. In such contexts, a good heuristic is to take a sample of the database and use it to guess which procedure is likely to be the most efficient. This paper defines the very general notion of a differentiable query problem and shows that the ideal sample size for guessing the optimal choice of algorithm is $O(N^{2/3})$ for all differential problems involving approximately $N$ executing steps.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Data Structure and Algorithms; databases; measurement; Measurements; Performance; sampling; theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.3.2}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Sagiv:1991:EQI, author = "Yehoshua Sagiv", title = "Evaluation of Queries in Independent Database Schemes", journal = j-J-ACM, volume = "38", number = "1", pages = "120--161", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102787.html", abstract = "A simple characterization of independent database schemes is proved. An algorithm is given for translating a tableau $T$, posed as a query on a representative instance, to a union of tableaux that is equivalent to $T$, but can be applied directly to database relations. The algorithm may take exponential time (in the size of $T$ and the database scheme), and it is applicable only to independent database schemes. If $T$ is a just a projection of a representative instance, then the algorithm has a simpler form (which is still exponential in the worst case) and is polynomial in some cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "tableau $T$ is posed as a query on a representative instance as a union of equivalent tableaux", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; chase; Database Theory; Design; expanded cover; extension join; functional dependency; independent database scheme; join dependency; lossless join; null value; query evaluation; relational algebra; relational database; representative instance; restricted projection; tableau; Theory; union of tableaux", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory.", } @Article{Frederickson:1991:PGD, author = "Greg N. Frederickson", title = "Planar Graph Decomposition and All Pairs Shortest Paths", journal = j-J-ACM, volume = "38", number = "1", pages = "162--204", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; all pairs shortest paths; approximation algorithm; compact routing table; graph embedding; Graph Theory; NP-completeness; outerplanar graph; planar graph; succinct encoding; Theory", } @Article{Chandru:1991:EHS, author = "V. Chandru and J. N. Hooker", title = "Extended {Horn} Sets In Propositional Logic", journal = j-J-ACM, volume = "38", number = "1", pages = "205--221", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102789.html", abstract = "The class of Horn clause sets in propositional logic is extended to a larger class for which the satisfiability problem can still be solved by unit resolution in linear time. It is shown that to every arborescence there corresponds a family of extended Horn sets, where ordinary Horn sets correspond to stars with a root at the center. These results derive from a theorem of Chandresekaran that characterizes when an integer solution of a system of inequalities can be found by rounding a real solution in a certain way. A linear-time procedure is provided for identifying ``hidden'' extended Horn sets (extended Horn but for complementation of variables) that correspond to a specified arborescence. Finally, a way to interpret extended Horn sets in applications is suggested.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Horn clauses; Logic Programming; propositional logic; Theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Kissin:1991:ULB, author = "Gloria Kissin", title = "Upper and Lower Bounds on Switching Energy in {VLSI}", journal = j-J-ACM, volume = "38", number = "1", pages = "222--254", month = jan, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/102790.html", abstract = "A technology-independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "1-switchable functions; addition; Algorithms; AND function; average-case analysis; CID VLSI circuit; circuit scheme; compare functions; Design; embedding; energy consumption; energy-efficient; layout; Measurement; multiswitch models; OR function; parity function; Performance; switching energy; Theory; Theory of Computation; uniswitch energy; upper and lower bounds; USM", subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf B.7.3}: Hardware, INTEGRATED CIRCUITS, Reliability and Testing. {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Layout.", } @Article{Arkin:1991:MCP, author = "E. M. Arkin and C. H. Papadimitriou and M. Yannakakis", title = "Modularity of Cycles and Paths in Graphs", journal = j-J-ACM, volume = "38", number = "2", pages = "255--274", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103517.html", abstract = "Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length $P$ mod $Q$ and whether all paths between two specified nodes are of length $P$ mod $Q$, for fixed integers $P$.$Q$. These results are compared to those for directed graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Combinatorics and Graph Theory; cycles and paths; graphs; modularity; Theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @Article{Dobkin:1991:MGE, author = "David Dobkin and Subhash Suri", title = "Maintenance of Geometric Extrema", journal = j-J-ACM, volume = "38", number = "2", pages = "275--298", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103518.html", abstract = "Let $S$ be a set, $f: S \times S \rightarrow R^{+}$ a bivariate function, and $f(x,S)$ the {\em maximum\/} value of $f(x,y)$ over all elements $y \in S$. We say that $f$ is {\em decomposable\/} with respect with the maximum if $f(x,S) = \max \{f(x,S_1),f(x, S_2),\ldots,f(x,S_k)\}$ for any decomposition $S = \cup_{i=1}^{i=k} S_i$. Computing the maximum (minimum) value of a decomposable function is inherent in many problems of computational geometry and robotics. In this paper, a general technique is presented for updating the maximum (minimum) value of a decomposable function as elements are inserted into and deleted from the set $S$. Our result holds for a {\em semi-online\/} model of dynamization: When an element is inserted, we are told how long it will stay. Applications of this technique include efficient algorithms for {\em dynamically\/} computing the diameter or closest pair of a set of points, minimum separation among a set of rectangles, smallest distance between a set of points and a set of hyperplanes, and largest or smallest area (perimeter) rectangles determined by a set of points. These problems are fundamental to application areas such as robotics, VLSI masking, and optimization.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; amortized analysis; Computational Geometry; decomposability; dynamization; geometric algorithms; semi-online model; Theory; Voronoi diagram", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Bryant:1991:MHV, author = "Randal E. Bryant", title = "A Methodology for Hardware Verification Based on Logic Simulation", journal = j-J-ACM, volume = "38", number = "2", pages = "299--328", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103519.html", abstract = "A logic simulator can prove the correctness of a digital circuit if it can be shown that only circuits fulfilling the system specification will produce a particular response to a sequence of simulation commands.This style of verification has advantages over the other proof methods in being readily automated and requiring less attention on the part of the user to the low-level details of the design. It has advantages over other approaches to simulation in providing more reliable results, often at a comparable cost.\par This paper presents the theoretical foundations of several related approaches to circuit verification based on logic simulation. These approaches exploit the three-valued modeling capability found in most logic simulators, where the third-value $X$ indicates a signal with unknown digital value. Although the circuit verification problem is NP-hard as measured in the size of the circuit description, several techniques can reduce the simulation complexity to a manageable level for many practical circuits.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Computer Systems; design; hardware verification; logic simulation; performance; ternary simulation; Theory; Verification", subject = "{\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids, Verification. {\bf B.6.3}: Hardware, LOGIC DESIGN, Design Aids, Simulation.", } @Article{Ioannidis:1991:TAT, author = "Yannis E. Ioannidis and Eugene Wong", title = "Towards an Algebraic Theory of Recursion", journal = j-J-ACM, volume = "38", number = "2", pages = "329--381", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103521.html", abstract = "An algebraic framework for the study of recursion has been developed. For immediate linear recursion, a Horn clause is represented by a relational algebra operator. It is shown that the set of all such operators forms a closed semiring. In this formalism, query answering corresponds to solving a linear equation. For the first time, the query answer is able to be expressed in an explicit algebraic form within an algebraic structure. The manipulative power thus afforded has several implications on the implementation of recursive query processing algorithms. Several possible decompositions of a given operator are presented that improve the performance of the algorithms, as well as several transformations that give the ability to take into account any selections or projections that are present in a given query. In addition, it is shown that mutual linear recursion can also be studied within a closed semiring, by using relation vectors and operator matrices. Regarding nonlinear recursion, it is first shown that Horn clauses always give rise to multilinear recursion, which can always be reduced to bilinear recursion. Bilinear recursion is then shown to form a nonassociative closed semiring. Finally, several sufficient and necessary-and-sufficient conditions for bilinear recursion to be equivalent to a linear one of a specific form are given. One of the sufficient conditions is derived by embedding to bilinear recursion in an algebra.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; closed semirings; Database Theory; deductive databases; Languages; performance; query optimization; recursion; Theory", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf I.1.3}: Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming.", } @Article{Fagin:1991:MTA, author = "Ronald Fagin and Joseph Y. Halpern and Moshe Y. Vardi", title = "A Model-Theoretic Analysis of Knowledge", journal = j-J-ACM, volume = "38", number = "2", pages = "382--428", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "A preliminary version appeared in {\em Proc. 25th IEEE Symposium on Foundations of Computer Science}, 1984", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128680.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "common knowledge; Distributed Computing; distributed systems; epistemology; knowledge; knowledge structures; Kripke structure; modal logic; possible worlds; reasoning about knowledge; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{Bambos:1991:SPP, author = "Nicholas Bambos and Jean Walrand", title = "On Stability and Performance of Parallel Processing Systems", journal = j-J-ACM, volume = "38", number = "2", pages = "429--452", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103520.html", abstract = "The general problem of parallel (concurrent) processing is investigated from a queuing theoretic point of view.\par As a basic simple model, consider infinitely many processors that can work simultaneously, and a stream of arriving jobs, each carrying a processing time requirement. Upon arrival, a job is allocated to a processor and starts being executed, unless it is blocked by another one already in the system. Indeed, any job can be randomly blocked by any preceding one, in the sense that it cannot start being processed before the one that blocks it leaves. After execution, the job leaves the system. The arrival times, the processing times and the blocking structures of the jobs form a stationary and ergodic sequence.\par The random precedence constraints capture the essential operational characteristic of parallel processing and allow a unified treatment of concurrent processing systems from such diverse areas as parallel computation, database concurrency control, queuing networks, flexible manufacturing systems. The above basic model includes the $G/G/1$ and $G/G/\infty$ queuing systems as special extreme cases.\par Although there is an infinite number of processors, the precedence constraints induce a queuing phenomenon, which, depending on the loading conditions, can lead to stability or instability of the system.\par In this paper, the condition for stability of the system is first precisely specified. The asymptotic behavior, at large times, of the quantities associated with the performance of the system is then studied, and the degree of parallelism, expressed as the asymptotic average number of processors that work concurrently, is computed. Finally, various design and simulation aspects concerning parallel processing systems are considered, and the case of finite number of processors is discussed.\par The results proved for the basic model are then extended to cover more complex and realistic parallel processing systems, where each job has a random internal structure of subtasks to be executed according to some internal precedence constraints.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Very general model assumptions, $G/G/1$ and $G/G/\infty$ being marginal cases.", descriptors = "Parallel computing; performance evaluation; queueing network", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "database concurrency control; Design; parallel processing; Performance; queuing networks; queuing theory; stability theory; subadditive ergodic theory; System Modeling and Analysis; Theory", subject = "{\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Mansour:1991:LBI, author = "Yishay Mansour and Baruch Schieber and Prasoon Tiwari", title = "A Lower Bound for Integer Greatest Common Divisor Computations", journal = j-J-ACM, volume = "38", number = "2", pages = "453--471", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103522.html", abstract = "It is proved that no finite computation tree with operations \{ +, -, *, /, mod, $<$ \} can decide whether the greatest common divisor (gcd) of $a$ and $b$ is one, for all pairs of integers $a$ and $b$. This settles a problem posed by Gr{\"o}tschel et al. Moreover, if the constants explicitly involved in any operation performed in the tree are restricted to be ``0'' and ``1'' (and any other constant must be computed), then we prove an $\Omega(\log \log n)$ lower bound on the depth of any computation tree with operations \{ +, -, *, /, mod, $<$ \} that decides whether the gcd of $a$ and $b$ is one, for all pairs of $n$-bit integers $a$ and $b$.\par A novel technique for handling the truncation operation is implicit in the proof of this lower bound. In a companion paper, other lower bounds for a large class of problems are proved using a similar technique.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; floor operation; greatest common divisor; lower bound; mod operation; theory; Theory of Computation; truncation", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations.", } @Article{Condon:1991:SBP, author = "Anne Condon", title = "Space-Bounded Probabilistic Game Automata", journal = j-J-ACM, volume = "38", number = "2", pages = "472--494", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128681.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Arthur--Merlin games; interactive proof systems; probabilistic game automata; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Alon:1991:ESF, author = "Noga Alon and A. K. Dewdney and Teunis J. Ott", title = "Efficient Simulation of Finite Automata by Neural Nets", journal = j-J-ACM, volume = "38", number = "2", pages = "495--514", month = apr, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/103523.html", abstract = "Let $K$($m$) denote the smallest number with the property that every $m$-state finite automaton can be built as a neural net using $K$($m$) or fewer neurons. A counting argument shows that $K(m)$ is at least $\Omega((m \log m)^{1/3})$, and a construction shows that $K( m)$ is at most $O(m^{3/4})$. The counting argument and the construction allow neural nets with arbitrarily complex local structure and thus may require neurons that themselves amount to complicated networks. Mild, and in practical situations almost necessary, constraints on the local structure of the network give, again by a counting argument and a construction, lower and upper bounds for $K(m)$ that are both linear in $m$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Finite Automata; Mealy machines; Neural Nets; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Self-modifying machines.", } @Article{Leighton:1991:LE, author = "Tom Leighton", title = "Letter from the Editor", journal = j-J-ACM, volume = "38", number = "3", pages = "515--515", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "editorial", } @Article{Atallah:1991:OPA, author = "Mikhail J. Atallah and Danny Z. Chen and Hubert Wagener", title = "An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point", journal = j-J-ACM, volume = "38", number = "3", pages = "516--533", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116827.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Computational Geometry; intersections of polygonal chains; parallel computational complexity; simple polygons; theory; visible regions", subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms.", } @Article{Imielinski:1991:AQP, author = "Tomasz Imielinski", title = "Abstraction in Query Processing", journal = j-J-ACM, volume = "38", number = "3", pages = "534--558", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:17:03 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116832.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "chase procedure; data dependencies; Database Theory; incomplete information; languages; Management; theory; verification", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Predicate logic.", } @Article{Hsiang:1991:PRC, author = "Jieh Hsiang and Micha{\"e}l Rusinowitch", title = "Proving Refutational Completeness of Theorem-Proving Strategies: {The} Transfinite Semantic Tree Method", journal = j-J-ACM, volume = "38", number = "3", pages = "559--587", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116833.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "complete simplification orderings; completeness; first-order logic with equality; functional reflexive axioms; Logic; paramodulation; refutational theorem proving strategies; resolution; theory; transfinite ordinals; transfinite semantic trees; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Marek:1991:AL, author = "Wiktor Marek and Miroslaw Truszczynski", title = "Autoepistemic Logic", journal = j-J-ACM, volume = "38", number = "3", pages = "588--619", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116836.html", abstract = "Autoepistemic logic is one of the principal modes of nonmonotonic reasoning. It unifies several other modes of nonmonotonic reasoning and has important application in logic programming. In the paper, a theory of autoepistemic logic is developed. This paper starts with a brief survey of some of the previously known results. Then, the nature of nonmonotonicity is studied by investigating how membership of autoepistemic statements in autoepistemic theories depends on the underlying objective theory. A notion similar to set-theoretic forcing is introduced. Expansions of autoepistemic theories are also investigated. Expansions serve as sets of consequences of an autoepistemic theory and they can also be used to define semantics for logic programs with negation. Theories that have expansions are characterized, and a normal form that allows the description of all expansions of a theory is introduced. Our results imply algorithms to determine whether a theory has a unique expansion. Sufficient conditions (stratification) that imply existence of a unique expansion are discussed. The definition of stratified theories is extended and (under some additional assumptions) efficient algorithms for testing whether a theory is stratified are proposed. The theorem characterizing expansions is applied to two classes of theories, $K_{1}$-theories and ae-programs. In each case, simple hypergraph characterization of expansions of theories from each of these classes is given. Finally, connections with stable model semantics for logic programs with negation is discussed. In particular, it is proven that the problem of existence of stable models is NP-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; autoepistemic logic; expansion; Logic; logic programming; NP-completeness; stratification; Theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming.", } @Article{vanGelder:1991:WFS, author = "Allen {van Gelder} and Kenneth Ross and John S. Schlipf", title = "The Well-Founded Semantics for General Logic Programs", journal = j-J-ACM, volume = "38", number = "3", pages = "620--650", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:25:13 1998", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Preliminary abstract appeared in Seventh {ACM} Symposium on Principles of Database Systems, March 1988, pp. 221--230.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116838.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; fixpoints; Languages; Logic Programming; negation as failure; stable models; theory; three-valued logic; unfounded sets; well-founded models", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models.", } @Article{Crochemore:1991:TWS, author = "Maxime Crochemore and Dominique Perrin", title = "Two-Way String Matching", journal = j-J-ACM, volume = "38", number = "3", pages = "651--675", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:24:43 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116845.html", abstract = "A new string matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand. The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas. It presents the advantage of being remarkably simple which consequently makes its analysis possible. The algorithm relies on a previously-known result in combinatorics on words, called the {\em Critical Factorization Algorithm}, which relates the global period of a word to its local repetitions of blocks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; analysis of algorithms; combinatorial algorithms; critical factorization theorem; Design; pattern matching; String Processing; text processing; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Ross:1991:OLB, author = "Keith W. Ross and David D. Yao", title = "Optimal Load Balancing and Scheduling in a Distributed Computer System", journal = j-J-ACM, volume = "38", number = "3", pages = "676--690", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116847.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; load balancing; Management; performance; queuing theory; scheduling; System Modeling and Analysis; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Goldreich:1991:PYN, author = "Oded Goldreich and Silvio Micali and Avi Wigderson", title = "Proofs that Yield Nothing But Their Validity or All Languages in {NP} Have Zero-Knowledge Proof Systems", journal = j-J-ACM, volume = "38", number = "3", pages = "691--729", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 11:41:42 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "They show that for a language $L$ in {\em NP\/} and a string $w$ in $L$, there exists a probabilistic interactive proof that efficiently demonstrates membership of $x$ in $L$ without conveying additional information. Previously, zero-knowledge proofs were known only for some problems that were in both {\em NP\/} and {\em co-NP}. A preliminary version of this paper appeared in {\em Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science}, 1986, under the title ``Proofs that yield nothing but their validity and a methodology of cryptographic protocol design.''", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116852.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "cryptographic protocols; Design; fault-tolerant distributed computing; graph isomorphism; interactive proofs; languages; methodological design of protocols; NP; one-way functions; proof systems; Security; theory; Theory of Computation; Verification; zero-knowledge", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf E.4}: Data, CODING AND INFORMATION THEORY.", } @Article{Ozveren:1991:SSD, author = "C{\"u}neyt M. {\"O}zveren and Alan S. Willsky and Panos J. Antsaklis", title = "Stability and Stabilizability of Discrete Event Dynamic Systems", journal = j-J-ACM, volume = "38", number = "3", pages = "730--752", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116855.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Design; Languages; Reliability; self-stabilizing systems; stability; stabilizability; state feedback; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", } @Article{Toran:1991:CCD, author = "Jacobo Tor{\'a}n", title = "Complexity Classes Defined by Counting Quantifiers", journal = j-J-ACM, volume = "38", number = "3", pages = "753--774", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116858.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; counting complexity classes; theory; Theory of Computation", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation.", } @Article{Stewart:1991:M, author = "Bradley S. Stewart and Chelsea C. {White, III}", title = "Multiobjective {A*}", journal = j-J-ACM, volume = "38", number = "4", pages = "775--814", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115368.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "A* multiobjective decision making; algorithms; Artificial Intelligence; theory", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Gabow:1991:FSA, author = "Harold N. Gabow and Robert E. Tarjan", title = "Faster Scaling Algorithms for General Graph-Matching Problems", journal = j-J-ACM, volume = "38", number = "4", pages = "815--853", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115366.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; augmenting path; blossom; Combinatorics and Graph Theory; design; matching; network optimization; performance; scaling; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Chan:1991:IRD, author = "Edward P. F. Chan and H{\'e}ctor J. Hern{\'a}ndez", title = "Independence-Reducible Database Schemes", journal = j-J-ACM, volume = "38", number = "4", pages = "854--886", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115362.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; chase; constant-time maintainable schemes; Database Theory; design; functional dependencies; independent database scheme; query evaluation; representative instance; theory", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing.", } @Article{Bloom:1991:FHL, author = "Stephen L. Bloom and Zolt{\'a}n {\'E}sik", title = "{Floyd-Hoare} Logic in Iteration Theories", journal = j-J-ACM, volume = "38", number = "4", pages = "887--934", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115352.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; correction assertions; Hoare logic; Logic; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Assertions. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", } @Article{Halpern:1991:PML, author = "Joseph Y. Halpern and Yoav Shoham", title = "A Propositional Modal Logic of Time Intervals", journal = j-J-ACM, volume = "38", number = "4", pages = "935--962", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115351.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "axiomatizability; Logic; modal logic; temporal logic; temporal reasoning; theory; time intervals", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representation languages. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs.", } @Article{Tiomkin:1991:NDM, author = "Michael Tiomkin and Michael Kaminski", title = "Nonmonotonic Default Modal Logics", journal = j-J-ACM, volume = "38", number = "4", pages = "963--984", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115350.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "deduction theorem for modal logic; Logic; modal logic; theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{Balas:1991:PSA, author = "Egon Balas and Donald Miller and Joseph Pekny and Paolo Toth", title = "A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem", journal = j-J-ACM, volume = "38", number = "4", pages = "985--1004", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1991.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115349.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "A parallel version of the shortest augmenting path algorithm for the assignment problem is described.", descriptors = "Routing; shortest path; parallel computing; speedup", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; assignment; design; experimentation; matching; Operations Research; performance; shortest augmenting paths; traveling salesman problem", subject = "{\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse and very large systems. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Glasserman:1991:SCP, author = "Paul Glasserman", title = "Structural Conditions for Perturbation Analysis of Queuing Systems", journal = j-J-ACM, volume = "38", number = "4", pages = "1005--1025", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115348.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; gradient estimation; networks of queues; performance; Performance Analysis; perturbation analysis; sensitivity analysis; simulation; theory", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf I.6.1}: Computing Methodologies, SIMULATION AND MODELING, Simulation Theory. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS. {\bf I.6.6}: Computing Methodologies, SIMULATION AND MODELING, Simulation Output Analysis.", } @Article{Berger:1991:SWI, author = "Bonnie Berger and John Rompel", title = "Simulating ($\log^{c}n$)-Wise Independence in ${NC}$", journal = j-J-ACM, volume = "38", number = "4", pages = "1026--1046", month = oct, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:29:59 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115347.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; discrepancy; removing randomness; theory; Theory of Computation", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Chazelle:1992:OAI, author = "Bernard Chazelle and Herbert Edelsbrunner", title = "An Optimal Algorithm for Intersecting Line Segments in the Plane", journal = j-J-ACM, volume = "39", number = "1", pages = "1--54", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147511.html", abstract = "The main contribution of this work is an $O(n \log n + k)$-time algorithm for computing all $k$ intersections among $n$ line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of $n$ + $k$ in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Computational Geometry; intersection; segments; Theory; topological sweep", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Upfal:1992:DPR, author = "Eli Upfal", title = "An ${O}(\log{N})$ Deterministic Packet-Routing Scheme", journal = j-J-ACM, volume = "39", number = "1", pages = "55--70", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:31:56 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147517.html", abstract = "A deterministic $O(\log N)$-time algorithm for the problem of routing an arbitrary permutation on an $N$-processor bounded-degree network with bounded buffers is presented.\par Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the sorting network of Ajtai, et al. [1]. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Computer Systems; design; deterministic routing; network routing; parallel computer; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Circuit switching networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures.", } @Article{Demolombe:1992:SCS, author = "Robert Demolombe", title = "Syntactical Characterization of a Subset of Domain-Independent Formulas", journal = j-J-ACM, volume = "39", number = "1", pages = "71--94", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147520.html", abstract = "A domain-independent formula of first-order predicate calculus is a formula whose evaluation in a given interpretation does not change when we add a new constant to the interpretation domain. The formulas used to express queries, integrity constraints or deductive rules in the database field that have an intuitive meaning are domain independent. That is the reason why this class is of great interest in practice. Unfortunately, this class is not decidable, and the problem is to characterize new subclasses, as large as possible, which are decidable. A syntactic characterization of a class of formulas, the Evaluable formulas, which are proved to be domain independent are provided. This class is defined only for function-free formulas. It is also proved that the class of evaluable formulas contains the other classes of syntactically characterized domain-independent formulas usually found in the literature, namely, range-separable formulas and range-restricted formulas. Finally, it is shown that the expressive power of evaluable formulas is the same as that of domain-independent formulas. That is, each domain-independent formula admits an equivalent evaluable one. An important advantage of this characterization is that, to check if a formula is evaluable, it is not necessary to transform it to a normal form, as is the case for range-restricted formulas.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Database Theory; Languages; relational model; Theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Query formulation.", } @Article{Goguen:1992:IAM, author = "Joseph A. Goguen and Rod M. Burstall", title = "Institutions: {Abstract} Model Theory for Specification and Programming", journal = j-J-ACM, volume = "39", number = "1", pages = "95--146", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Draft, as Report ECS-LFCS-90-106, Computer Science Department, University of Edinburgh, January 1990; an ancestor is ``Introducing Institutions,'' in {\em Proceedings, Logics of Programming Workshop}, Edward Clarke and Dexter Kozen, editors, Springer Lecture Notes in Computer Science, Volume 164, pages 221--256, 1984", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147524.html", abstract = "There is a population explosion among the logical systems used in computing science. Examples include first-order logic, equational logic, Horn-clause logic, higher-order logic, infinitary logic, dynamic logic, intuitionistic logic, order-sorted logic, and temporal logic; moreover, there is a tendency for each theorem prover to have its own idiosyncratic logical system. The concept of {\em institution\/} is introduced to formalize the informal notion of ``logical system.'' The major requirement is that there is a satisfaction relation between models and sentences that is consistent under change of notation. Institutions enable abstracting away from syntactic and semantic detail when working on language structure ``in-the-large''; for example, we can define language features for building large logical system. This applies to both specification languages and programming languages. Institutions also have applications to such areas as database theory and the semantics of artificial and natural languages. A first main result of this paper says that any institution such that signatures (which define notation) can be glued together, also allows gluing together theories (which are just collections of sentences over a fixed signature). A second main result considers when theory structuring is preserved by institution morphisms. A third main result gives conditions under which it is sound to use a theorem prover for one institution on theories from another. A fourth main result shows how to extend institutions so that their theories may include, in addition to the original sentences, various kinds of constraint that are useful for defining abstract data types, including both ``data'' and ``hierarchy'' constraints. Further results show how to define institutions that allow sentences and constraints from two or more institutions. All our general results apply to such ``duplex'' and ``multiplex'' institutions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Language; languages; Programming Languages and Methodology; Theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Aceto:1992:TDD, author = "L. Aceto and M. Hennessy", title = "Termination, Deadlock, and Divergence", journal = j-J-ACM, volume = "39", number = "1", pages = "147--187", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147527.html", abstract = "In this paper, a process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory is based upon a suitable adaptation of the notion of bisimulation preorder. The denotational semantics for the language is given in terms of the initial continuous algebra that satisfies a set of equations $E, CI^{E}$. It is shown that $CI^{E}$ is fully abstract with respect to our choice of behavioral preorder. Several results of independent interest are obtained; namely, the finite approximability of the behavioral preorder and a partial completeness result for the set of equations $E$ with respect to the preorder.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", issue = "1", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Languages; Programming Languages and Methodology; Theory", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Deadlocks.", } @Article{Dowdy:1992:SCB, author = "Lawrence W. Dowdy and Brian M. Carlson and Alan T. Krantz and Satish K. Tripathi", title = "Single-Class Bounds of Multi-Class Queuing Networks", journal = j-J-ACM, volume = "39", number = "1", pages = "188--213", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147530.html", abstract = "In a closed, separable, queuing network model of a computer system, the number of customer classes is an input parameter. The number of classes and the class compositions are assumptions regarding the characteristics of the system's workload. Often, the number of customer classes and their associated device demands are unknown or are unmeasurable parameters of the system. However, when the system is viewed as having a single composite customer class, the aggregate single-class parameters are more easily obtainable.\par This paper addresses the error made when constructing a single-class model of a multi-class system. It is shown that the single-class model pessimistically bounds, the performance of the multi-class system. Thus, given a multi-class system, the corresponding single-class model can be constructed with the assurance that the actual system performance is better than that given by the single-class model. In the worst case, it is shown that the throughput given by the single-class model underestimates the actual multi-class throughput by, at most, 50\%. Also, lower bounds are provided for the number of necessary customer classes, given observed device utilizations. This information is useful to clustering analysis techniques as well as to analysts who must obtain class-specific device demands.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", descriptors = "Queueing network; product form", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "bounding analysis; performance; product-form networks; queuing networks; System Modeling and Analysis; theory", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction.", } @Article{Bellare:1992:HSG, author = "Mihir Bellare and Silvio Micali", title = "How to Sign Given Any Trapdoor Permutation", journal = j-J-ACM, volume = "39", number = "1", pages = "214--233", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147537.html", abstract = "A digital signature scheme is presented, which is based on the existence of any trapdoor permutation. The scheme is secure in the strongest possible natural sense: namely, it is secure against existential forgery under adaptive chosen message attack.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; cryptography; digital signatures; randomness; Security; Theory; Theory of Computation; trapdoor functions", subject = "{\bf F.2.m}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Security and protection. {\bf D.4.6}: Software, OPERATING SYSTEMS, Security and Protection, Authentication. {\bf D.4.6}: Software, OPERATING SYSTEMS, Security and Protection, Cryptographic controls. {\bf E.3}: Data, DATA ENCRYPTION.", } @Article{Allender:1992:LBL, author = "Eric Allender and Lane A. Hemachandra", title = "Lower Bounds for the Low Hierarchy", journal = j-J-ACM, volume = "39", number = "1", pages = "234--251", month = jan, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/147546.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "low hierarchy; lower bounds; sparse sets; theory; Theory of Computation", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism.", } @Article{Dillencourt:1992:GAC, author = "Michael B. Dillencourt and Hanan Samet and Markku Tamminen", title = "A General Approach to Connected-Component Labelling for Arbitrary Image Representations", journal = j-J-ACM, volume = "39", number = "2", pages = "253--280", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See also \cite{Dillencourt:1992:CGA}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128750.html", abstract = "An improved and general approach to connected-component labeling of images is presented. The algorithm presented in this paper processes images in {\em predetermined order}, which means that the processing order depends only on the image representation scheme and not on specific properties of the image. The algorithm handles a wide variety of image representation schemes (rasters, run lengths, quadrees, bintrees, etc.). How to adapt the standard UNION-FIND algorithm to permit reuse of temporary labels is shown. This is done using a technique called {\em age balancing}, in which, when two labels are merged, the older label becomes the father of the younger label. This technique can be made to coexist with the more conventional rule of {\em weight balancing}, in which the label with more descendants becomes the father of the label with fewer descendants. Various image scanning orders are examined and classified. It is also shown that when the algorithm is specialized to a pixel array scanned in raster order, the total processing time is linear in the number of pixels. The linear-time processing time follows from a special property of the UNION-FIND algorithm, which may be of independent interest. This property states that under certain restrictions on the input, UNION-FIND runs in time linear in the number of FIND and UNION operations. Under these restrictions, linear-time performance can be achieved without resorting to the more complicated Gabow-Tarjan algorithm for disjoint set union.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Data Structures and Algorithms; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf I.4.10}: Computing Methodologies, IMAGE PROCESSING, Image Representation. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Curve, surface, solid, and object representations. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Katajainen:1992:ALM, author = "Jyrki Katajainen and Timo Raita", title = "An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding", journal = j-J-ACM, volume = "39", number = "2", pages = "281--294", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128751.html", abstract = "Text compression is often done using a fixed, previously formed dictionary (code book) that expresses which substrings of the text can be replaced by code words. There always exists an optimal solution for text-encoding problem. Due to the long processing times of the various optimal algorithms, several heuristics have been proposed in the literature. In this paper, the worst-case compression gains obtained by the longest match and the greedy heuristics for various types of dictionaries is studied. For general dictionaries, the performance of the heuristics can be almost the weakest possible. In practice, however, the dictionaries have usually properties that lead to a space-optimal or near-space-optimal coding result with the heuristics.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Data Structures and Algorithms; optimal and heuristic encoding; performance; shortest paths; textual substitution; Theory", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Ramesh:1992:NPM, author = "R. Ramesh and I. V. Ramakrishnan", title = "Nonlinear Pattern Matching in Trees", journal = j-J-ACM, volume = "39", number = "2", pages = "295--316", month = apr, year = "1992", 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128752.html", abstract = "Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as mechanical theorem proving, term rewriting, symbolic computation, and nonprocedural programming languages. In this paper, we present new sequential algorithms for nonlinear pattern matching in trees. Our algorithm improves upon know tree pattern matching algorithms in important aspects such as time performance, ease of integration with several reduction strategies and ability to avoid unnecessary computation steps on match attempts that fail. The expected time complexity of our algorithm is linear in the sum of the sizes of the two trees.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Data Structures and Algorithms; languages; nonlinear pattern matching; normalization; performance; rewriting; theorem proving; Theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf E.1}: Data, DATA STRUCTURES, Trees.", } @Article{Sprugnoli:1992:GBT, author = "Renzo Sprugnoli", title = "The Generation of Binary Trees as a Numerical Problem", journal = j-J-ACM, volume = "39", number = "2", pages = "317--327", month = apr, year = "1992", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/128749.128753", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 22 07:42:24 2011", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128753.html", abstract = "The problem of generating random, uniformly distributed, binary trees is considered. A closed formula that counts the number of trees having a left subtree with $k-1$ nodes $ (k=1,2, \ldots{},n)$ is found. By inverting the formula, random trees with $n$ nodes are generated according to the appropriate probability distribution, determining the number of nodes in the left and right subtrees that can be generated recursively. The procedure is shown to run in time $O(n)$, occupying an extra space in the order of $O(\sqrt{n})$", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; binary trees; Data Structures and Algorithms; generation of binary trees; performance; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Fagin:1992:WCM, author = "Ronald Fagin and Joseph Y. Halpern and Moshe Y. Vardi", title = "What Can Machines Know? {On} the Properties of Knowledge in Distributed Systems", journal = j-J-ACM, volume = "39", number = "2", pages = "328--376", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/150945.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "axioms; distributed knowledge; Logic; properties of knowledge; reasoning about knowledge; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification. {\bf D.2.10}: Software, SOFTWARE ENGINEERING, Design, Methodologies. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{Gallier:1992:TPU, author = "Jean Gallier and Paliath Narendran and Stan Raatz and Wayne Snyder", title = "Theorem Proving Using Equational Matings and Rigid ${E}$--Unification", journal = j-J-ACM, volume = "39", number = "2", pages = "377--429", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128754.html", abstract = "In this paper, it is shown that the method of matings due to Andrews and Bibel can be extended to (first-order) languages with equality. A decidable version of $E$-unification called rigid $E$-unification is introduced, and it is shown that the method of equational matings remains complete when used in conjunction with rigid $E$-unification. Checking that a family of mated sets is an equational mating is equivalent to the following restricted kind of $E$-unification.\par Problem Given $\vec E = \{E_{i}| 1<=i<=n\}$ a family of $n$ finite sets of equations and $S=\{\langle u_{i},v_{i} \rangle | 1<=i<=n\}$ a set of $n$ pairs of terms, is there a substitution $ \theta$ such that, treating each set $ \theta(E_{i})$ as a set of ground equations (i.e., holding the variables in $ \theta(E_{i})$ ``rigid''), $ \theta(u_{i})$, and $ \theta(v_{i})$ are provably equal from $ \theta(E_{i})$ for $ i=1, \ldots{},n$?\par Equivalently, is there a substitution $ \theta$ such that $ \theta(u_{i})$ and $ \theta(v_{i})$ can be shown congruent from $ \theta(E_{i})$ by the congruence closure method for $ i=1, \ldots{},n$?\par A substitution $ \theta$ solving the above problem is called a rigid $ \vec E$-unifier of $S$, and a pair $\langle \vec E,S \rangle$ such that $S$ has some rigid $ \vec E$-unifier is called an equational premating. It is show that deciding whether a pair $ \vec E,S$ is an equational premating is an NP-complete problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; automated theorem proving; equational reasoning; Knuth--Bendix procedure; Languages; Logic; matings; NP-completeness; performance; Theory; unification", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf I.1.3}: Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems, Special-purpose algebraic systems. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Metatheory. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", } @Article{Myers:1992:FRA, author = "Gene Myers", title = "A Four {Russians} Algorithm for Regular Expression Pattern Matching", journal = j-J-ACM, volume = "39", number = "2", pages = "430--448", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:42:43 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128755.html", abstract = "Given a regular expression $R$ of length $P$ and a word $A$ of length $N$, the membership problem is to determine if $A$ is in the language denoted by $R$. An $O(PN/\lg N)$ time algorithm is presented that is based on a $\lg N$ speedup of the standard $O(PN)$ time simulation of $R$'s nondeterministic finite automaton on $A$ using a combination of the node-listing and ``Four-Russians'' paradigms. This result places a new worst-case upper bound on regular expression pattern matching. Moreover, in practice the method provides an implementation that is faster than existing software for small regular expressions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; finite automaton; Four Russians paradigm; note listing; performance; regular expression; String Processing; Theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms. {\bf I.5.0}: Computing Methodologies, PATTERN RECOGNITION, General. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation.", } @Article{Halpern:1992:LKG, author = "Joseph Y. Halpern and Lenore D. Zuck", title = "A Little Knowledge Goes a Long Way: {Knowledge-Based} Derivations and Correctness Proofs for a Family of Protocols", journal = j-J-ACM, volume = "39", number = "3", pages = "449--478", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146638.html", abstract = "A high-level, knowledge-based approach for deriving a family of protocols for the {\em sequence transmission\/} problem is presented. The protocols of Aho et al. [2, 3], the Alternating Bit protocol [5], and Stenning's protocol [44] are all instances of one knowledge-based protocol that is derived. The derivation in this paper leads to transparent and uniform correctness proofs for all these protocols.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; design; Distributed Computing; reasoning about knowledge; Reliability; Theory; Verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol verification. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and Techniques. {\bf D.2.10}: Software, SOFTWARE ENGINEERING, Design, Methodologies.", } @Article{Heath:1992:PGG, author = "Lenwood S. Heath and Sorin Istrail", title = "The Pagenumber of Genus $g$ Graphs is ${O}(g)$", journal = j-J-ACM, volume = "39", number = "3", pages = "479--501", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146643.html", abstract = "In 1979, Bernhart and Kainen conjectured that graphs of fixed genus $g \geq 1$ have unbounded pagenumber. In this paper, it is proven that genus $g$ graphs can be embedded in $O(g)$ pages, thus disproving the conjecture. An $\Omega( g^{1/2})$ lower bound is also derived. The first algorithm in the literature for embedding an arbitrary graph in a book with a non-trivial upper bound on the number of pages is presented. First, the algorithm computes the genus $g$ of a graph using the algorithm of Filotti, Miller, Reif (1979), which is polynomial-time for fixed genus. Second, it applies an optimal-time algorithm for obtaining an $O(g)$-page book embedding. Separate book embedding algorithms are given for the cases of graphs embedded in orientable and nonorientable surfaces. An important aspect of the construction is a new decomposition theorem, of independent interest, for a graph embedded on a surface. Book embedding has application in several areas, two of which are directly related to the results obtained: fault-tolerant VLSI and complexity theory.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; book embeddings; graph genus; Graph Theory; homotopy classes; planar-nonplanar decomposition; surface embeddings; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } %% Page 160 is title page @Article{Billionnet:1992:EAT, author = "A. Billionnet and M. C. Costa and A. Sutter", title = "An Efficient Algorithm for a Task Allocation Problem", journal = j-J-ACM, volume = "39", number = "3", pages = "502--518", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146646.html", abstract = "This paper presents an efficient algorithm to solve one of the task allocation problems. Task assignment in an heterogeneous multiple processors system is investigated. The cost function is formulated in order to measure the intertask communication and processing costs in an uncapacited network. A formulation of the problem in terms of the minimization of a submodular quadratic pseudo-Boolean function with assignment constraints is then presented. The use of a branch-and-bound algorithm using a Lagrangean relaxation of these constraints is proposed. The lower bound is the value of an approximate solution to the Lagrangean dual problem. A zero-duality gap, that is, a saddle point, is characterized by checking the consistency of a pseudo-Boolean equation. A solution is found for large-scale problems (e.g., 20 processors, 50 tasks, and 200 task communications or 10 processors, 100 tasks, and 300 task communications). Excellent experimental results were obtained which are due to the weak frequency of a duality gap and the efficient characterization of the zero-gap (for practical purposes, this is achieved in linear time). Moreover, from the saddle point, it is possible to derive the optimal task assignment.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; branch-and-bound algorithm; Design; interprocessor communication; Lagrangian relaxation; Measurement; Operations Research; Performance; quadratic $0$--$1$ optimization; task allocation", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Eppstein:1992:SDPa, author = "David Eppstein and Zvi Galil and Raffaele Giancarlo and Giuseppe F. Italiano", title = "Sparse Dynamic Programming {I}: {Linear} Cost Functions", journal = j-J-ACM, volume = "39", number = "3", pages = "519--545", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146650.html", abstract = "Dynamic programming solutions to a number of different recurrence equations for sequence comparison and for RNA secondary structure prediction are considered. These recurrences are defined over a number of points that is quadratic in the input size; however only a sparse set matters for the result. Efficient algorithms for these problems are given, when the weight functions used in the recurrences are taken to be linear. The time complexity of the algorithms depends almost linearly on the number of points that need to be considered; when the problems are sparse this results in a substantial speed-up over known algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; dynamic programming; recurrence; sequence alignment; sparsity; String Processing; theory; time complexity", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Eppstein:1992:SDPb, author = "David Eppstein and Zvi Galil and Raffaele Giancarlo and Giuseppe F. Italiano", title = "Sparse Dynamic Programming {II}: {Convex} and Concave Cost Functions", journal = j-J-ACM, volume = "39", number = "3", pages = "546--567", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146656.html", abstract = "Dynamic programming solutions to two recurrence equations, used to compute a sequence alignment from a set of matching fragments between two strings, and to predict RNA secondary structure, are considered. These recurrences are defined over a number of points that is quadratic in the input size; however, only a sparse set matters for the result. Efficient algorithms are given for solving these problems, when the cost of a gap in the alignment or a loop in the secondary structure is taken as a convex or concave function of the gap or loop length. The time complexity of our algorithms depends almost linearly on the number of points that need to be considered; when the problems are sparse, this results in a substantial speed-up over known algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; dynamic programming; recurrence; sequence alignment; sparsity; String Processing; theory; time complexity", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Greenberg:1992:HFF, author = "Albert G. Greenberg and Neal Madras", title = "How Fair is Fair Queuing?", journal = j-J-ACM, volume = "39", number = "3", pages = "568--598", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1992.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146658.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "In this paper, we consider two variants of the fair queuing discipline, and rigorously establish their fairness via sample path comparisons with the head-of-line processor sharing discipline, a mathematical idealization that provides a fairness paradigm. An efficient implementation of one of the fair queuing disciplines is presented. In passing, a new, fast method for simulating processor sharing is derived. Simulation results are presented.", descriptors = "Queueing theory; design; performance evaluation; verification; network operating system; process management", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Design; Management; Performance; System Modeling and Analysis; theory; Verification", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Beaudry:1992:MPA, author = "M. Beaudry and P. McKenzie and D. Th{\'e}rien", title = "The Membership Problem in Aperiodic Transformation Monoids", journal = j-J-ACM, volume = "39", number = "3", pages = "599--616", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146661.html", abstract = "The problem of testing membership in aperiodic or ``group-free'' transformation monoids is the natural counterpart to the well-studied membership problem in permutation groups. The class {\bf A} of all finite aperiodic monoids and the class {\bf G} of all finite groups are two examples of {\em varieties}, the fundamental complexity units in terms of which finite monoids are classified. The collection of all varieties {\bf V} forms an infinite lattice under the inclusion ordering, with the subfamily of varieties that are contained in {\bf A} forming an infinite sublattice. For each $\mbox{\bf V} \subseteq \mbox{\bf A}$, the associated problem MEMB({\bf V}) of testing membership in transformation monoids that belong to {\bf V}, is considered. Remarkably, the computational complexity of each such problem turns out to look familiar. Moreover, only five possibilities occur as {\bf V} ranges over the whole aperiodic sublattice: With one family of NP-hard exceptions whose exact status is still unresolved, any such MEMB({\bf V}) is either PSPACE-complete, NP-complete, P-complete or in $AC^{0}$. These results thus uncover yet another surprisingly tight link between the theory of monoids and computational complexity theory.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; Theory of Computation", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices.", } @Article{Ben-Amram:1992:PVA, author = "Amir M. Ben-Amram and Zvi Galil", title = "On Pointers versus Addresses", journal = j-J-ACM, volume = "39", number = "3", pages = "617--648", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146666.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; incompressibility; pointer structures; random access memory; theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf E.1}: Data, DATA STRUCTURES.", } @Article{Gasarch:1992:LQ, author = "William I. Gasarch and Carl H. Smith", title = "Learning via Queries", journal = j-J-ACM, volume = "39", number = "3", pages = "649--674", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "A shorter version is in 29th FOCS conference, 1988, pp. 130-137", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146670.html", abstract = "Traditional work in inductive inference has been to model a learner receiving data about a function $f$ and trying to learn the function. The data is usually just the values $f(0), f(1), \ldots$. The scenario is modeled so that the learner is also allowed to ask questions about the data (e.g., $\forall x [x > 17 \Rightarrow f(x) = 0]$?). An important parameter is the language that the learner may use to formulate queries. We show that for most languages a learner can learn more by asking questions than by passively receiving data. Mathematical tools used include the solution to Hilbert's tenth problem, the decidability of Presuburger arithmetic, and $\omega$-automata.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "\omega automata; Inductive Inference; learning by example; learning via a teacher; Machine Learning; theory; Theory of Computation", subject = "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction.", } @Article{German:1992:RAS, author = "Steven M. German and A. Prasad Sistla", title = "Reasoning about Systems with Many Processes", journal = j-J-ACM, volume = "39", number = "3", pages = "675--735", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146681.html", abstract = "Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions. TWo models of systems are considered. Systems in the first model consist of a unique {\em control\/} process and an arbitrary number of {\em user\/} processes with identical definitions. For this model, a decision procedure to check whether all the executions of a process satisfy a given specification is presented. This algorithm runs in time double exponential in the sizes of the control and the user process definitions. It is also proven that it is decidable whether all the fair executions of a process satisfy a given specification. The second model is a special case of the first. In this model, all the processes have identical definitions. For this model, an efficient decision procedure is presented that checks if every execution of a process satisfies a given temporal logic specification. This algorithm runs in time polynomial in the size of the process definition. It is shown how to verify certain global properties such as mutual exclusion and absence of deadlocks. Finally, it is shown how these decision procedures can be used to reason about certain systems with a communication network.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Performance; Theory; Theory of Computation; Verification", subject = "{\bf I.2.2}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program verification. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Raz:1992:MCM, author = "Ran Raz and Avi Wigderson", title = "Monotone Circuits for Matching Require Linear Depth", journal = j-J-ACM, volume = "39", number = "3", pages = "736--744", month = jul, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146684.html", abstract = "It is proven that monotone circuits computing the perfect matching function on $n$-vertex graphs require $\Omega(n)$ depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "circuit depth; monotone computation; perfect matching; Theory; Theory of Computation", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices.", } @Article{Borodin:1992:OLA, author = "Allan Borodin and Nathan Linial and Michael E. Saks", title = "An Optimal On-Line Algorithm for Metrical Task System", journal = j-J-ACM, volume = "39", number = "4", pages = "745--763", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146588.html", abstract = "In practice, almost all dynamic systems require decisions to be made on-line, without full knowledge of their future impact on the system. A general model for the processing of sequences of tasks is introduced, and a general on-line decision algorithm is developed. It is shown that, for an important class of special cases, this algorithm is optimal among all on-line algorithms.\par Specifically, a task system $(S,d)$ for processing sequences of tasks consists of a set $S$ of states and a cost matrix $d$ where $d(i, j)$ is the cost of changing from state $i$ to state $j$ (we assume that $d$ satisfies the triangle inequality and all diagonal entries are 0). The cost of processing a given task depends on the state of the system. A schedule for a sequence $T^{1}, T^{2}, \ldots{}, T^{k}$ of tasks is a sequence $s_{1}, s_{2}, \ldots{}, s_{k}$ of states where $s_{i}$ is the state in which $T^{i}$ is processed; the cost of a schedule is the sum of all task processing costs and the state transition costs incurred.\par An on-line scheduling algorithm is one that chooses $s_{i}$ only knowing $T^{1}, T^{2}, \ldots{}, T^{i}$. Such an algorithm is $w$-competitive if, on any input task sequence, its cost is within an additive constant of $w$ times the optimal offline schedule cost. The competitive ratio $w(S, d)$ is the infimum $w$ for which there is a $w$-competitive on-line scheduling algorithm for $(S,d)$. It is shown that $w(S, d) = 2|S|-1$ {\em for every task system\/} in which $d$ is symmetric, and $w(S, d) = O(|S|^{2})$ for every task system. Finally, randomized on-line scheduling algorithms are introduced. It is shown that for the uniform task system (in which $d(i,j) = 1$ for all $i,j$), the expected competitive ratio $\bar{w}(S,d) = O(\log|S|)$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Analysis of Algorithms; competitive analysis; on-line algorithms; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Fiat:1992:NH, author = "Amos Fiat and Moni Naor and Jeanette P. Schmidt and Alan Siegel", title = "Nonoblivious Hashing", journal = j-J-ACM, volume = "39", number = "4", pages = "764--782", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146591.html", abstract = "Nonoblivious hashing, where information gathered from unsuccessful probes is used to modify subsequent probe strategy, is introduced and used to obtain the following results for static lookup on full tables: \begin{enumerate} \item An $O(1)$-time worst-case scheme that uses only logarithmic additional memory, (and no memory when the domain size is linear in the table size), which improves upon previously linear space requirements. \item An almost sure $O(1)$-time probabilistic worst-case scheme, which uses no additional memory and which improves upon previously logarithmic time requirements. \item Enhancements to hashing: (1) and (2) are solved for multikey records, where search can be performed under any key in time $O(1)$; these schemes also permit properties, such as nearest neighbor and rank, to be determined in logarithmic time. \end{enumerate}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "$O(1)$ probe search; Algorithms; Analysis of Algorithms; dictionary problem; model of computation; oblivious and nonoblivious search; perfect hashing; Theory; upper and lower bounds", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf E.1}: Data, DATA STRUCTURES, Tables. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Hash-table representations. {\bf E.4}: Data, CODING AND INFORMATION THEORY, Nonsecret encoding schemes. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process.", } @Article{Mansour:1992:IBP, author = "Yishay Mansour and Baruch Schieber", title = "The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-{FIFO} Channels", journal = j-J-ACM, volume = "39", number = "4", pages = "783--799", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146596.html", abstract = "The efficiency of data-link protocols for reliable transmission of a sequence of messages over non-FIFO physical channels is discussed. The transmission has to be on-line; i.e., a message cannot be accessed by the transmitting station before the preceding message has been received. Three resources are considered: The number of packets that have to be sent, the number of headers, and the amount of space required by the protocol. Three lower bounds are proved. First, the space required by any protocol for delivering $n$ messages that uses less than $n$ headers cannot be bounded by any function of $n$. Second, the number of packets that have to be sent by any protocol that uses a fixed number of headers in order to deliver a message is linear in the number of packets that are delayed on the channel at the time the message is sent. Finally, the notion of a probabilistic physical channel, in which a packet can be delayed on the channel with probability $q$, is introduced. An exponential lower bound, with overwhelming probability, is proved on the number of packets that have to be sent by any data-link protocol using a fixed number of headers when it is implemented over a probabilistic physical channel.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; Channels; Communication Protocols; data link; design; lower bound; non-FIFO channels; performance; Protocols; sequence transmission; theory", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Channels and controllers. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Worst-case analysis. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", } @Article{Dwork:1992:FSVa, author = "Cynthia Dwork and Larry Stockmeyer", title = "Finite State Verifiers {I}: {The} Power of Interaction", journal = j-J-ACM, volume = "39", number = "4", pages = "800--828", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146599.html", abstract = "An investigation of interactive proof systems (IPSs) where the verifier is a 2-way probabilistic finite state automaton (2pfa) is initiated. In this model, it is shown:\par \begin{enumerate} \item IPSs in which the verifier uses private randomization are strictly more powerful than IPSs in which the random choices of the verifier are made public to the prover. \item IPSs in which the verifier uses public randomization are strictly more powerful than 2pfa's alone, that is, without a prover. \item Every language which can be accepted by some deterministic Turing machine in exponential time can be accepted by some IPS. \end{enumerate} Additional results concern two other classes of verifiers: 2pfa's that halt in polynomial expected time, and 2-way probabilistic pushdown automata that halt in polynomial time. In particular, IPSs with verifiers in the latter class are as powerful as IPSs where verifiers are polynomial-time probabilistic Turing machines. In a companion paper [7], zero knowledge IPSs with 2pfa verifiers are investigated.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Arthur--Merlin games; Complexity Theory; finite state automata; interactive proof systems; probabilistic automata; theory; verification; zero knowledge", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata.", } @Article{Dwork:1992:FSVb, author = "Cynthia Dwork and Larry Stockmeyer", title = "Finite State Verifiers {II}: {Zero} Knowledge", journal = j-J-ACM, volume = "39", number = "4", pages = "829--858", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146601.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Arthur--Merlin games; Complexity Theory; finite state automata; interactive proof systems; probabilistic automata; theory; verification; zero knowledge", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata.", } @Article{Lund:1992:AMI, author = "Carsten Lund and Lance Fortnow and Howard Karloff and Noam Nisan", title = "Algebraic Methods for Interactive Proof Systems", journal = j-J-ACM, volume = "39", number = "4", pages = "859--868", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146605.html", abstract = "A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP = PSPACE [28] and that MIP = NEXP [4].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Complexity Theory; interactive proof systems; Theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relations among modes. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{Shamir:1992:IP, author = "Adi Shamir", title = "{IP} = {PSPACE}", journal = j-J-ACM, volume = "39", number = "4", pages = "869--877", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "This paper shows that the set of problems for which interactive protocols exist is precisely the set of problems which are solvable within polynomial space on a Turing machine.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146609.html", abstract = "In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Complexity Theory; interactive proofs; IP; PSPACE; Theorem; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes.", } @Article{Shen:1992:IPS, author = "A. Shen", title = "{IP} = {PSPACE}: {Simplified} Proof", journal = j-J-ACM, volume = "39", number = "4", pages = "878--880", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146613.html", abstract = "Lund et al. [1] have proved that PH is contained in IP. Shamir [2] improved this technique and proved that PSPACE = IP. In this note, a slightly simplified version of Shamir's proof is presented, using degree reductions instead of simple QBFs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Complexity Theory; interactive proofs; PSPACE; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory.", } @Article{Herlihy:1992:COM, author = "Maurice Herlihy and Nancy Lynch and Michael Merritt and William Weihl", title = "On the Correctness of Orphan Management Algorithms", journal = j-J-ACM, volume = "39", number = "4", pages = "881--930", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146616.html", abstract = "In a distributed system, node failures, network delays, and other unpredictable occurrences can result in {\em orphan\/} computations---subcomputations that continue to run but whose results are no longer needed. Several algorithms have been proposed to prevent such computations from seeing inconsistent states of the shared data. In this paper, two such orphan management algorithms are analyzed. The first is an algorithm implemented in the Argus distributed-computing system at MIT, and the second is an algorithm proposed at Carnegie-Mellon. The algorithms are described formally, and complete proofs of their correctness are given.\par The proofs show that the fundamental concepts underlying the two algorithms are very similar in that each can be regarded as an implementation of the same high-level algorithm. By exploiting properties of information flow within transaction management systems, the algorithms ensure that orphans only see states of the shared data that they could also see if they were not orphans. When the algorithms are used in combination with any correct concurrency control algorithm, they guarantee that all computations, orphan as well as nonorphan, see consistent states of the shared data.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; argus; atomic actions; avalon; camelot; Distributed Computing; input-output automata; Languages; recovery; Reliability; serializability; Theory; Verification", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Assertions. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Invariants. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Database (persistent) programming languages. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Collins:1992:VDD, author = "Oliver Collins and Sam Dolinar and Robert McEliece and Fabrizio Pollara", title = "A {VLSI} Decomposition of the {deBruijn} Graph", journal = j-J-ACM, volume = "39", number = "4", pages = "931--948", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146620.html", abstract = "The deBruijn graph $B^{n}$ is the state diagram for an $n$-stage binary shift register. It has $2^n$ vertices and $2^{n + 1}$ edges. In this papers, it is shown that $B_{n}$ can be built by appropriately ``wiring together'' (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph, which is called a {\em building block\/} for $B_n$. The efficiency of such a building block is refined as the fraction of the edges of $B^n$ which are present in the copies of the building block. It is then shown, among other things, that for any $\alpha < 1$, there exists a graph $G$ which is a building block for $B^n$ of efficiency $> \alpha$ for all sufficiently large $n$. These results are illustrated by describing how a special hierarchical family of building blocks has been used to construct a very large Viterbi decoder (whose floor plan is the graph $B^{13}$) which will be used on NASA's {\em Galileo\/} mission.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; deBruijn graphs; Design; graph decomposition; Interconnection Networks; Theory", subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf B.6.1}: Hardware, LOGIC DESIGN, Design Styles, Sequential circuits. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Algorithms implemented in hardware. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Debray:1992:EDA, author = "Saumya K. Debray", title = "Efficient Dataflow Analysis of Logic Programs", journal = j-J-ACM, volume = "39", number = "4", pages = "949--984", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/146624.html", abstract = "A framework for efficient dataflow analyses of logic programs is investigated. A number of problems arise in this context: aliasing effects can make analysis computationally expensive for sequential logic programming languages; synchronization issues can complicate the analysis of parallel logic programming languages; and finiteness restrictions to guarantee termination can limit the expressive power of such analyses. Our main result is to give a simple characterization of a family of flow analyses where these issues can be ignored without compromising soundness. This results in algorithms that are simple to verify and implement, and efficient in execution. Based on this approach, we describe an efficient algorithm for flow analysis of sequential logic programs, extend this approach to handle parallel executions, and finally describe how infinite chains in the analysis domain can be accommodated without compromising termination.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Languages; Performance; program analysis; Programming Languages; PROLOG", subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.1.6}: Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Dillencourt:1992:CGA, author = "Michael B. Dillencourt and Hanan Samet and Markku Tamminen", title = "Corrigenda: ``{A} General Approach to Connected-Component Labelling for Arbitrary Image Representations''", journal = j-J-ACM, volume = "39", number = "4", pages = "985--986", month = oct, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:51:38 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Dillencourt:1992:GAC}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gallier:1993:AFC, author = "Jean Gallier and Paliath Narendran and David Plaisted and Stan Raatz and Wayne Snyder", title = "An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time", journal = j-J-ACM, volume = "40", number = "1", pages = "1--16", month = jan, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138032.html", abstract = "In this paper, it is shown that there is an algorithm that, given by finite set $E$ of ground equations, produces a reduced canonical rewriting system $R$ equivalent to $E$ in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time $O(n^{3})$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; completion procedures; congruence closure; Deductive Systems and Equational Reasoning; design; equational logic; languages; term rewriting; theory", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } %% NB: From Volume 40, JACM has 5 issues per year, in January, April, %% July, September, and November. @Article{Dolev:1993:PSM, author = "Danny Dolev and Cynthia Dwork and Orli Waarts and Moti Yung", title = "Perfectly Secure Message Transmission", journal = j-J-ACM, volume = "40", number = "1", pages = "17--47", month = jan, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138036.html", abstract = "This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Distributed Communication; distributed computing; fault-tolerance; perfectly secure communication; Reliability; Security", subject = "{\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Security and protection. {\bf K.6.5}: Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Security and Protection.", } @Article{Hobby:1993:GAT, author = "John D. Hobby", title = "Generating Automatically Tuned Bitmaps from Outlines", journal = j-J-ACM, volume = "40", number = "1", pages = "48--94", month = jan, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138040.html", abstract = "Consider the problem of generating bitmaps from character shapes given as outlines. The obvious scan-conversion process does not produce acceptable results unless important features such as stem widths are carefully controlled during the scan-conversion process. This paper describes a method for automatically extracting the necessary feature information and generating high-quality bitmaps without resorting to hand editing. Almost all of the work is done in a preprocessing step, the result of which is an intermediate form that can be quickly converted into bitmaps once the font size and device resolution are known.\par A heuristically defined system of linear equations describes how the ideal outlines should be distorted in order to produce the best possible results when scan converted in a straightforward manner. The Lov{\'a}sz basis reduction algorithm then reduces the system of equations to a form that makes it easy to find an approximate solution subject to the constraint that some variables must be integers.\par The heuristic information is of such a general nature that it applies equally well to Roman fonts and Japanese Kanji.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; feature recognition; fonts; Graphics; Lovasz basis reduction; performance; scan-conversion", subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Bitmap and framebuffer operations. {\bf I.3.3}: Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Digitizing and scanning. {\bf I.5.4}: Computing Methodologies, PATTERN RECOGNITION, Applications, Text processing.", } @Article{Pitt:1993:MCD, author = "Leonard Pitt and Manfred K. Warmuth", title = "The Minimum Consistent {DFA} Problem Cannot be Approximated within any Polynomial", journal = j-J-ACM, volume = "40", number = "1", pages = "95--142", month = jan, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 9 07:57:29 1997", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138042.html", abstract = "The minimum consistent DFA problem is that of finding a DFA with as few states as possible that is consistent with a given sample (a finite collection of words, each labeled as to whether the DFA found should accept or reject). Assuming that P $\ne$ NP, it is shown that for any constant $k$, no polynomial-time algorithm can be guaranteed to find a consistent DFA with fewer than $\mbox{\em opt\/}^{k}$ states, where $\mbox{\em opt\/}$ is the number of states in the minimum state DFA consistent with the sample. This result holds even if the alphabet is of constant size two, and if the algorithm is allowed to produce an NFA, a regular expression, or a regular grammar that is consistent with the sample. A similar nonapproximability result is presented for the problem of finding small consistent linear grammars. For the case of finding minimum consistent DFAs when the alphabet is not of constant size but instead is allowed to vary with the problem specification, the slightly stronger lower bound on approximability of $\mbox{\em opt\/}{(1-\epsilon)\log \log\mbox{\em opt\/}}$ is shown for any $\epsilon > 0$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Earlier version in STOC89 and Univ of Ill TR 1499 in 1989", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; approximation algorithms; Languages; Learning Theory; minimization of finite state machines; nonapproximability; Theory", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems.", } @Article{Harper:1993:FDL, author = "Robert Harper and Furio Honsell and Gordon Plotkin", title = "A Framework for Defining Logics", journal = j-J-ACM, volume = "40", number = "1", pages = "143--184", month = jan, year = "1993", 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", note = "Preliminary version appeared in Proc. 2nd IEEE Symposium on Logic in Computer Science, 1987, 194--204.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138060.html", abstract = "The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed $\lambda$-calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-L{\"o}f's system of arities. The treatment of rules and proofs focuses on his notion of a {\em judgment}. Logics are represented in LF via a new principle, the {\em judgments as types\/} principle, whereby each judgment is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgments and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools, such as proof editors and proof checkers, can be constructed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; formal systems; interactive theorem proving; Logic in Computer Science; proof checking; Theory; typed lambda calculus; Verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Angluin:1993:LRO, author = "Dana Angluin and Lisa Hellerstein and Marek Karpinski", title = "Learning Read-Once Formulas with Queries", journal = j-J-ACM, volume = "40", number = "1", pages = "185--210", month = jan, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:58:39 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/138061.html", abstract = "A read-once formula is a Boolean formula in which each variable occurs, at most, once. Such formulas are also called $\mu$-formulas or Boolean trees. This paper treats the problem of exactly identifying an unknown read-once formula using specific kinds of queries.\par The main results are a polynomial-time algorithm for exact identification of monotone read-once formulas using only membership queries, and a polynomial-time algorithm for exact identification of general read-once formulas using equivalence and membership queries (a protocol based on the notion of a {\em minimally adequate teacher\/} [1]). The results of the authors improve on Valiant's previous results for read-once formulas [26]. It is also shown, that no polynomial-time algorithm using only membership queries or only equivalence queries can exactly identify all read-once formulas.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "Was International Computer Science Institute TR-89-05099, and University of California at Berkeley TR 89-528", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "$u$-formulas; algorithms; design; equivalence queries; exact identification; interpolation; Machine Learning; membership queries; mu-formulas; polynomial-time learning; read-once formulas; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction.", } @Article{Bshouty:1993:CFR, author = "Nader H. Bshouty", title = "On the Complexity of Functions for Random Access Machines", journal = j-J-ACM, volume = "40", number = "2", pages = "211--223", month = apr, year = "1993", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/151261.151262", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 22 07:42:24 2011", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151262.html", abstract = "Tight bounds are proved for Sort, Merge, Insert, Gcd of integers, Gcd of polynomials, and Rational functions over a {\em finite\/} inputs domain, in a random access machine with arithmetic operations, direct and indirect addressing, unlimited power for answering YES/NO questions, branching, and tables with bounded size. These bounds are also true even if additions, subtractions, multiplications, and divisions of elements by elements of the field are not counted.\par In a random access machine with finitely many constants and a bounded number of types of instructions, it is proved that the complexity of a function over a countable infinite domain is equal to the complexity of the function in a sufficiently large {\em finite\/} subdomain.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Analysis of Algorithms; greatest common divisor; indirect addressing; random access machine; sorting; Theory; Verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{LaPaugh:1993:RDH, author = "Andrea S. LaPaugh", title = "Recontamination Does Not Help to Search a Graph", journal = j-J-ACM, volume = "40", number = "2", pages = "224--245", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151263.html", abstract = "This paper is concerned with a game on graphs called {\em graph searching}. The object of this game is to clear all edges of a contaminated graph. Clearing is achieved by moving searchers, a kind of token, along the edges of the graph according to clearing rules. Certain search strategies cause edges that have been cleared to become contaminated again. Megiddo et al. [9] conjectured that every graph can be searched using a minimum number of searchers without this recontamination occurring, that is, without clearing any edge twice. In this paper, this conjecture is proved. This places the graph-searching problem in NP, completing the proof by Megiddo et al. that the graph-searching problem is NP-complete. Furthermore, by eliminating the need to consider recontamination, this result simplifies the analysis of searcher requirements with respect to other properties of graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Analysis of Algorithms; graph searching; NP-completeness; pursuit and evasion; Theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{McAllester:1993:TSF, author = "David McAllester and Robert Givan", title = "Taxonomic Syntax for First Order Inference", journal = j-J-ACM, volume = "40", number = "2", pages = "246--283", month = apr, year = "1993", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/151261.151264", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151264.html", abstract = "A new polynomial time decidable fragment of first order logic is identified, and a general method for using polynomial time inference procedures in knowledge representation systems is presented. The results shown in this paper indicate that a nonstandard ``taxonomic'' syntax is essential in constructing natural and powerful polynomial time inference procedures. The central role of taxonomic syntax in the polynomial time inference procedures provides technical support for the often-expressed intuition that knowledge is better represented in terms of taxonomic relationships than classical first order formulas. To use the procedures in a knowledge representation system, a ``Socratic proof system'' is defined, which is complete for first order inference and which can be used as a semi-automated interface to a first order knowledge base.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; automated reasoning; Computational Logic; Deduction; inference rules; machine inference; mechanical verification; polynomial time algorithms; proof systems; proof theory; theorem proving; verification", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General.", } @Article{McAllester:1993:ART, author = "David A. McAllester", title = "Automatic Recognition of Tractability in Inference Relations", journal = j-J-ACM, volume = "40", number = "2", pages = "284--303", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151265.html", abstract = "A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is nontrivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; automated reasoning; Computational Logic; Deduction; inference rules; machine inference; mechanical verification; polynomial-time alg orithm; proof systems; proof theory; theorem proving; verification", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic.", } @Article{Nicol:1993:CCS, author = "David M. Nicol", title = "The Cost of Conservative Synchronization in Parallel Discrete Event Simulations", journal = j-J-ACM, volume = "40", number = "2", pages = "304--333", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151266.html", abstract = "This paper analytically studies the performance of a synchronous conservative parallel discrete-event simulation protocol. The class of models considered simulates activity in a physical domain, and possesses a limited ability to predict future behavior. Using a stochastic model, it is shown that as the volume of simulation activity in the model increases relative to a fixed architecture, the complexity of the average per-event overhead due to synchronization, event list manipulation, lookahead calculations, and processor idle time approaches the complexity of the average per-event overhead of a serial simulation, sometimes rapidly. The method is therefore within a constant factor of optimal. The result holds for the worst case ``fully-connected'' communication topology, where an event in any other portion of the domain can cause an event in any other protion of the domain. Our analysis demonstrates that on large problems---those for which parallel processing is ideally suited--- there is often enough parallel workload so that processors are not usually idle. It also demonstrated the viability of the method empirically, showing how good performance is achieved on large problems using a thirty-two node Intel iPSC/2 distributed memory multiprocessor.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "This paper analytically studies the performance of a synchronous conservative parallel discrete-event simulation protocol. The class of models considered simulates activity in a physical domain, and possesses a limited ability to predict future behaviour.", descriptors = "distributed simulation; performance evaluation; algorithm", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Computer System Modeling and Analysis; conservative synchronization; measurement; Performance", subject = "{\bf I.6.8}: Computing Methodologies, SIMULATION AND MODELING, Types of Simulation, Parallel. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes.", } @Article{Neiger:1993:SSC, author = "Gil Neiger and Sam Toueg", title = "Simulating Synchronized Clocks and Common Knowledge in Distributed Systems", journal = j-J-ACM, volume = "40", number = "2", pages = "334--367", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151267.html", abstract = "Time and knowledge are studied in synchronous and asynchronous distributed systems. A large class of problems that can be solved using logical clocks as if they were perfectly synchronized clocks is formally characterized. For the same class of problems, a broadcast primitive that can be used as if it achieves common knowledge is also proposed. Thus, logical clocks and the broadcast primitive simplify the task of designing and verifying distributed algorithms: The designer can assume that processors have access to perfectly synchronized clocks and the ability to achieve common knowledge.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; clock synchronization; common knowledge; Distributed Computing; knowledge-based protocols; logical clocks; synchronized clocks; Theory; timestamped common knowledge; Verification", subject = "{\bf B.4.3}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems), Asynchronous/synchronous operation. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Formal models. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Verification. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol verification. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications.", } @Article{Lengauer:1993:EDP, author = "Thomas Lengauer and Egon Wanke", title = "Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages", journal = j-J-ACM, volume = "40", number = "2", pages = "368--393", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151268.html", abstract = "Efficient ways of analyzing families of graphs that are generated by a certain type of context-free graph grammars are considered. These graph grammars are called {\em cellular graph grammars}. They generate the same graph families as hyperedge replacement systems, but are defined in a way that supports complexity analysis. A characteristic called ``finiteness'' of graph properties are defined, and combinatorial algorithms are presented for deciding whether a graph language generated by a given cellular graph grammar contains a graph with a given finite graph property. Structural parameters are introduced that bound the complexity of the decision procedure and special cases for which the decision can be made in polynomial time are discussed. Extensions to graph grammars that are not context-free are also given. Our results provide explicit and efficient combinatorial algorithms where, so far, only the existence of algorithms has been shown, or the best known algorithms are highly inefficient.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Graph Theory; hyperedge replacement systems; languages; Theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types.", } @Article{Leung:1993:ESS, author = "Kin K. Leung", title = "An Execution\slash Sleep Scheduling Policy for Serving an Additional Job in Priority Queueing Systems", journal = j-J-ACM, volume = "40", number = "2", pages = "394--417", month = apr, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/151269.html", abstract = "In a priority-based computer system, besides the regular jobs, an additional job (refereed to as {\em job A\/}) is invoked infrequently but requires a significant amount of CPU time. To avoid CPU hogging, job A receives (up to) a fixed amount of CPU time whenever it is served. When the time expires, job A immediately relinquishes the CPU and puts itself to sleep for a period of time. By doing so, jobs with low priority may be processed in a timely manner. When the sleep time is over, job A is awakened and waits to resume service according to its priority. Then, the whole process is repeated until job A service is completed. In this paper, such an {\em execution/sleep\/} (ES) scheduling policy is analyzed for serving job A in a {\em nonpreemptive priority queuing\/} system. The Laplace Transforms are derived for: (i) the conditional response time of job A and (ii) the response time for jobs with priorities higher and lower than job A.\par This work is motivated by the ES policy in a switching system in which job A is invoked in response to the failure of signaling links. The proposed model is applicable to other real-time computer systems, and the modeling techniques can be applied or generalized to analyzing other scheduling policies in which timers are involved.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; performance evaluation; priority queues; Queueing Systems; response times; server vacation models; theory; time-limited service; waiting times", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf I.6.4}: Computing Methodologies, SIMULATION AND MODELING, Model Validation and Analysis. {\bf C.3}: Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", } @Article{Coppersmith:1993:RWW, author = "Don Coppersmith and Peter Doyle and Prabhakar Raghavan and Marc Snir", title = "Random Walks on Weighted Graphs and Applications to On-line Algorithms", journal = j-J-ACM, volume = "40", number = "3", pages = "421--453", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:04:06 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174131.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Karloff:1993:RAP, author = "Howard J. Karloff and Prabhakar Raghavan", title = "Randomized Algorithms and Pseudorandom Numbers", journal = j-J-ACM, volume = "40", number = "3", pages = "454--476", month = jul, year = "1993", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/174130.174132", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:05:40 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174132.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Random number generation. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Baader:1993:UCT, author = "Franz Baader", title = "Unification in Commutative Theories, {Hilbert}'s Basis Theorem, and {Gr{\"o}bner} Bases", journal = j-J-ACM, volume = "40", number = "3", pages = "477--503", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:08:38 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174133.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Murray:1993:DMP, author = "Neil V. Murray and Erik Rosenthal", title = "Dissolution: {Making} Paths Vanish", journal = j-J-ACM, volume = "40", number = "3", pages = "504--535", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 27 00:43:31 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174135.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Metatheory. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Johnson:1993:FCC, author = "C. A. Johnson", title = "Factorization and Circuit in the Connection Method", journal = j-J-ACM, volume = "40", number = "3", pages = "536--557", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:08:20 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/journals.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174136.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations.", } @Article{Wang:1993:MRE, author = "Tie-Cheng Wang", title = "${Z}$-Module Reasoning: {An} Equality-Oriented Proving Method with Built-in Ring Axioms", journal = j-J-ACM, volume = "40", number = "3", pages = "558--606", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Dec 10 15:43:53 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174137.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Linial:1993:CDC, author = "Nathan Linial and Yishay Mansour and Noam Nisan", title = "Constant Depth Circuits, {Fourier} Transform, and Learnability", journal = j-J-ACM, volume = "40", number = "3", pages = "607--620", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:10:52 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174138.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning.", } @Article{Mehlhorn:1993:DIS, author = "Kurt Mehlhorn and Athanasios Tsakalidis", title = "Dynamic Interpolation Search", journal = j-J-ACM, volume = "40", number = "3", pages = "621--634", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:11:53 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174139.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General.", } @Article{vanKreveld:1993:UCS, author = "Marc J. {van Kreveld} and Mark H. Overmars", title = "Union-Copy Structures and Dynamic Segment Trees", journal = j-J-ACM, volume = "40", number = "3", pages = "635--652", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:24:59 1998", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174140.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Baeten:1993:DBE, author = "J. C. M. Baeten and J. A. Bergstra and J. W. Klop", title = "Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages", journal = j-J-ACM, volume = "40", number = "3", pages = "653--682", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:14:14 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174141.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems.", } @Article{Gaifman:1993:UOP, author = "Haim Gaifman and Harry Mairson and Yehoshua Sagiv and Moshe Y. Vardi", title = "Undecidable Optimization Problems for Database Logic Programs", journal = j-J-ACM, volume = "40", number = "3", pages = "683--713", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:15:22 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174142.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages.", } @Article{Nelson:1993:PES, author = "Randolph Nelson and Donald Towsley", title = "A Performance Evaluation of Several Priority Policies for Parallel Processing Systems", journal = j-J-ACM, volume = "40", number = "3", pages = "714--740", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1993.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174143.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", annote = "In this paper, analytic models for a multiprocessor executing a stream consisting of $K$ classes of fork-join jobs are developed. \ldots{} Several priority policies are analyzed.", descriptors = "Queueing theory; HOL priority; preemptive priority", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Bhatt:1993:TRW, author = "Sandeep Bhatt and Jin-Yi Cai", title = "Taking Random Walks to Grow Trees in Hypercubes", journal = j-J-ACM, volume = "40", number = "3", pages = "741--764", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:17:10 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174144.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Karp:1993:RPA, author = "Richard M. Karp and Yanjun Zhang", title = "Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation", journal = j-J-ACM, volume = "40", number = "3", pages = "765--789", month = jul, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:18:17 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174145.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies.", } @Article{Cohen:1993:SPT, author = "Edith Cohen and Nimrod Megiddo", title = "Strongly Polynomial-Time and {NC} Algorithms for Detecting Cycles in Periodic Graphs", journal = j-J-ACM, volume = "40", number = "4", pages = "791--830", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:46:38 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153727.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming.", } @Article{Yu:1993:AMD, author = "Philip S. Yu and Daniel M. Dias and Stephen S. Lavenberg", title = "On the Analytical Modeling of Database Concurrency Control", journal = j-J-ACM, volume = "40", number = "4", pages = "831--872", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Dec 05 20:18:33 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153733.html", abstract = "The Concurrency Control (CC) scheme employed can profoundly affect the performance of transaction-processing systems. In this paper, a simple unified approximate analysis methodology to model the effect on system performance of data contention under different CC schemes and for different system structures is developed. This paper concentrates on modeling data contention and then, as others have done in other papers, the solutions of the data contention model are coupled with a standard hardware resource contention model through an iteration. The methodology goes beyond previously published methods for analyzing CC schemes in terms of the generality of CC schemes and system structures that are handled. The methodology is applied to analyze the performance of centralized transaction processing systems using various optimistic- and pessimistic-type CC schemes and for both fixed-length and variable-length transactions. The accuracy of the analysis is demonstrated by comparison with simulations. It is also shown how the methodology can be applied to analyze the performance of distributed transaction-processing systems with replicated data.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems.", } @Article{Afek:1993:ASS, author = "Yehuda Afek and Hagit Attiya and Danny Dolev and Eli Gafni and Michael Merritt and Nir Shavit", title = "Atomic Snapshots of Shared Memory", journal = j-J-ACM, volume = "40", number = "4", pages = "873--890", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:34:23 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153741.html", abstract = "This paper introduces a general formulation of atomic snapshot memory, a shared memory partitioned into words written (updated) by individual processes, or instantaneously read (scanned) in its entirety. This paper presents three wait-free implementations of atomic snapshot memory. The first implementation in this paper uses unbounded (integer) fields in these registers, and is particularly easy to understand. The second implementation uses bounded registers. Its correctness proof follows the ideas of the unbounded implementation. Both constructions implement a single-writer snapshot memory, in which each word may be updated by only one process, from single-writer, $n$-reader registers. The third algorithm implements a multi-writer snapshot memory from atomic $n$-writer, $n$-reader registers, again echoing key ideas from the earlier constructions. All operations require $\Theta(n^{2})$ reads and writes to the component shared registers in the worst case.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Multiple-instruction-stream, multiple-data-stream processors (MIMD).", } @Article{Afrati:1993:PCS, author = "Foto Afrati and Christos H. Papadimitriou", title = "The Parallel Complexity of Simple Logic Programs", journal = j-J-ACM, volume = "40", number = "4", pages = "891--916", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 07:59:12 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153752.html", abstract = "We consider logic programs with a single recursive rules, whose right-hand side consists of binary relations forming a chain. We give a complete characterization of all programs of this form that are computable in NC (assuming that $P \ne$). Our proof uses ideas from automata and language theory, and the combinatorics of strings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Halpern:1993:KPA, author = "Joseph Y. Halpern and Mark R. Tuttle", title = "Knowledge, Probability, and Adversaries", journal = j-J-ACM, volume = "40", number = "4", pages = "917--962", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:49:19 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153770.html", abstract = "What should it mean for an agent to know or believe an assertion is true with probability 9.99? Different papers [2, 6, 15] give different answers, choosing to use quite different probability spaces when computing the probability that an agent assigns to an event. We show that each choice can be understood in terms of a betting game. This betting game itself can be understood in terms of three types of adversaries influencing three different aspects of the game. The first selects the outcome of all nondeterministic choices in the system; the second represents the knowledge of the agent's opponent in the betting game (this is the key place the papers mentioned above differ); and the third is needed in asynchronous systems to choose the time the bet is placed. We illustrate the need for considering all three types of adversaries with a number of examples. Given a class of adversaries, we show how to assign probability spaces to agents in a way most appropriate for that class, where ``most appropriate'' is made precise in terms of this betting game. We conclude by showing how different assignments of probability spaces (corresponding to different opponents) yield different levels of guarantees in probabilistic coordinated attack.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Formal models. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Verification. {\bf B.4.5}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Reliability, Testing, and Fault-Tolerance. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Marek:1993:MNL, author = "V. Wiktor Marek and Grigori F. Shvarts and Miros{\l}aw Truszczy{\'n}ski", title = "Modal Nonmonotonic Logics: {Ranges}, Characterization, Computation", journal = j-J-ACM, volume = "40", number = "4", pages = "963--990", month = sep, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:51:56 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/153773.html", abstract = "Many nonmonotonic formalism, including default logic, logic programming with stable models, and autoepistemic logic, can be represented faithfully by means of modal nonmonotonic logics in the family proposed by McDermott and Doyle. In this paper properties of logics in this family are thoroughly investigated. We present several results on characterization of expansions. These results are applicable to a wide class of nonmonotonic modal logics. Using these characterization results, algorithms for computing expansions for finite theories are developed. Perhaps the most important finding of this paper is that the structure of the family of modal nonmonotonic logics is much simpler than that of the family of underlying modal (monotonic) logics. Namely, it is often the case that different monotonic modal logics collapse to the same nonmonotonic system. We exhibit four families of logics whose nonmonotonic variants coincide: {\bf 5-KD45, TW5-SW5, N-WK}, and {\bf W5-D4WB}. These nonmonotonic logics naturally represent logics related to common-sense reasoning and knowledge representation such as autoepistemic logic, reflexive autoepistemic logic, default logic, and truth maintenance with negation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representations (procedural and rule-based).", } @Article{Coffman:1993:PCP, author = "E. G. {Coffman, Jr.} and M. R. Garey", title = "Proof of the $4/3$ Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling", journal = j-J-ACM, volume = "40", number = "5", pages = "991--1018", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:54:24 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174148.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Luo:1993:CCD, author = "Zhi-Quan Luo and John N. Tsitsiklis", title = "On the Communication Complexity of Distributed Algebraic Computation", journal = j-J-ACM, volume = "40", number = "5", pages = "1019--1047", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:55:15 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174149.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems.", } @Article{Donald:1993:KMP, author = "Bruce Donald and Patrick Xavier and John Canny and John Reif", title = "Kinodynamic Motion Planning", journal = j-J-ACM, volume = "40", number = "5", pages = "1048--1066", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:57:18 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174150.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; reliability", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS, Approximation. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf I.2.9}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics. {\bf I.3.5}: Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling.", } @Article{Tay:1993:OSM, author = "Y. C. Tay", title = "On the Optimality of Strategies for Multiple Joins", journal = j-J-ACM, volume = "40", number = "5", pages = "1067--1086", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:56:00 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174151.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", } @Article{Fekete:1993:IIR, author = "Alan Fekete and Nancy Lynch and Yishay Mansour and John Spinelli", title = "The Impossibility of Implementing Reliable Communication in the Face of Crashes", journal = j-J-ACM, volume = "40", number = "5", pages = "1087--1107", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:58:20 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169676.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Golumbic:1993:CAR, author = "Martin Charles Golumbic and Ron Shamir", title = "Complexity and Algorithms for Reasoning about Time: {A} Graph-Theoretic Approach", journal = j-J-ACM, volume = "40", number = "5", pages = "1108--1133", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 22:59:26 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169675.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Arnborg:1993:ATG, author = "Stefan Arnborg and Bruno Courcelle and Andrzej Proskurowski and Detlef Seese", title = "An Algebraic Theory of Graph Reduction", journal = j-J-ACM, volume = "40", number = "5", pages = "1134--1164", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:00:17 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169807.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; performance; theory", subject = "{\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Fonlupt:1993:DPG, author = "Jean Fonlupt and Armand Nachef", title = "Dynamic Programming and the Graphical Traveling Salesman Problem", journal = j-J-ACM, volume = "40", number = "5", pages = "1165--1187", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:01:06 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169803.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming.", } @Article{Jean-Marie:1993:PQR, author = "Alain Jean-Marie and Levent G{\"{u}}n", title = "Parallel Queues with Resequencing", journal = j-J-ACM, volume = "40", number = "5", pages = "1188--1208", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 01 10:10:09 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169748.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; performance; theory", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory.", } @Article{Baccelli:1993:ESP, author = "Fran{\c{c}}ois Baccelli and Zhen Liu and Don Towsley", title = "Extremal Scheduling of Parallel Processing with and without Real-Time Constraints", journal = j-J-ACM, volume = "40", number = "5", pages = "1209--1237", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:03:05 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169745.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; management; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Batch processing systems. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design, Real-time and embedded systems. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Knessl:1993:STD, author = "Charles Knessl", title = "On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue", journal = j-J-ACM, volume = "40", number = "5", pages = "1238--1301", month = nov, year = "1993", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:03:18 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/169736.html", abstract = "We consider a processor shared M/M/1 queue that can accommodate at most a finite number $K$ of customers. Using singular perturbation techniques, we construct asymptotic approximations to the distribution of a customer's sojourn time. We assume that $ K$ is large and treat several different cases of the model parameters and also treat different time scales. Extensive numerical comparisons are used to back up our asymptotic formulas.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Fischer:1994:FPQ, author = "Michael J. Fischer and Michael S. Paterson", title = "{Fishspear}: a Priority Queue Algorithm", journal = j-J-ACM, volume = "41", number = "1", pages = "3--30", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:06:40 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174645.html", abstract = "The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its worst-case running time, and its relative performance is much better in many common situations. Fishspear also differs from the heap method in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it potentially attractive for implementation of very large queues on paged memory systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Lists. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS, Contiguous representations. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Rockmore:1994:ECF, author = "Daniel N. Rockmore", title = "Efficient Computation of {Fourier} Inversion for Finite Groups", journal = j-J-ACM, volume = "41", number = "1", pages = "31--66", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 09 18:41:14 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174646.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Numerical algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations. {\bf G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf J.2}: Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Mathematics and statistics.", } @Article{Kearns:1994:CLL, author = "Michael Kearns and Leslie Valiant", title = "Cryptographic Limitations on Learning {Boolean} Formulae and Finite Automata", journal = j-J-ACM, volume = "41", number = "1", pages = "67--95", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:08:35 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174647.html", abstract = "In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are {\em representation independent}, in that they hold regardless of the syntactic form in which the learner chooses to represent its hypotheses.\par Our methods reduce the problems of cracking a number of well-known public-key cryptosystems to the learning problems. We prove that a polynomial-time learning algorithm for Boolean formulae, deterministic finite automata or constant-depth threshold circuits would have dramatic consequences for cryptography and number theory. In particular, such an algorithm could be used to break the RSA cryptosystem, factor Blum integers (composite numbers equivalent to 3 modulo 4), and detect quadratic residues. The results hold even if the learning algorithm is only required to obtain a slight advantage in prediction over random guessing. The techniques used demonstrate an interesting duality between learning and cryptography.\par We also apply our results to obtain strong intractability results for approximating a generalization of graph coloring.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf E.3}: Data, DATA ENCRYPTION, Public key cryptosystems. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Connectionism and neural nets. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata.", } @Article{Orponen:1994:IC, author = "Pekka Orponen and Ker-I Ko and Uwe Sch{\"{o}}ning and Osamu Watanabe", title = "Instance Complexity", journal = j-J-ACM, volume = "41", number = "1", pages = "96--121", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:09:34 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174648.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Attiya:1994:BTR, author = "Hagit Attiya and Cynthia Dwork and Nancy Lynch and Larry Stockmeyer", title = "Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty", journal = j-J-ACM, volume = "41", number = "1", pages = "122--152", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:10:22 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174649.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; reliability; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Baker:1994:AAN, author = "Brenda S. Baker", title = "Approximation Algorithms for {NP}-Complete Problems on Planar Graphs", journal = j-J-ACM, volume = "41", number = "1", pages = "153--180", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:10:51 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174650.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Alur:1994:RTL, author = "Rajeev Alur and Thomas A. Henzinger", title = "A Really Temporal Logic", journal = j-J-ACM, volume = "41", number = "1", pages = "181--204", month = jan, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:11:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174651.html", abstract = "We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the {\em freeze quantifier\/} binds a variable to the time of the local temporal context.\par TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf C.3}: Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems. {\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Dubiner:1994:FTP, author = "Moshe Dubiner and Zvi Galil and Edith Magen", title = "Faster Tree Pattern Matching", journal = j-J-ACM, volume = "41", number = "2", pages = "205--213", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:12:49 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174653.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Khuller:1994:BAG, author = "Samir Khuller and Uzi Vishkin", title = "Biconnectivity Approximations and Graph Carvings", journal = j-J-ACM, volume = "41", number = "2", pages = "214--235", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:13:25 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174654.html", abstract = "A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2-connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified)? Unfortunately, the problem is known to be NP-hard.\par We consider the problem of finding a better approximation to the smallest 2-connected subgraph, by an efficient algorithm. For 2-edge connectivity, our algorithm guarantees a solution that is no more than 3/2 times the optimal. For 2-vertex connectivity, our algorithm guarantees a solution that is no more than 5/3 times the optimal. The previous best approximation factor is 2 for each of these problems. The new algorithms (and their analyses) depend upon a structure called a {\em carving\/} of a graph, which is of independent interest. We show that approximating the optimal solution to within an additive constant is NP-hard as well.\par We also consider the case where the graph has edge weights. For this case, we show that an approximation factor of 2 is possible in polynomial time for finding a $k$-edge connected spanning subgraph. This improves an approximation factor of 3 for $k$ = 2, due to Frederickson and J{\'a}J{\'a} [1981], and extends it for any $k$ (with an increased running time though).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Bachmair:1994:EIC, author = "Leo Bachmair and Nachum Dershowitz", title = "Equational Inference, Canonical Proofs, and Proof Orderings", journal = j-J-ACM, volume = "41", number = "2", pages = "236--276", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:14:08 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174655.html", abstract = "We describe the application of proof orderings---a technique for reasoning about inference systems-to various rewrite-based theorem-proving methods, including refinements of the standard Knuth--Bendix completion procedure based on critical pair criteria; Huet's procedure for rewriting modulo a congruence; ordered completion (a refutationally complete extension of standard completion); and a proof by consistency procedure for proving inductive theorems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Mathematical induction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Metatheory.", } @Article{Abrahamson:1994:TLB, author = "Karl Abrahamson and Andrew Adler and Lisa Higham and David Kirkpatrick", title = "Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings", journal = j-J-ACM, volume = "41", number = "2", pages = "277--310", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:05:16 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174656.html", abstract = "A model that captures communication on asynchronous unidirectional rings is formalized. Our model incorporates both probabilistic and nondeterministic features and is strictly more powerful than a purely probabilistic model. Using this model, a collection of tools are developed that facilitate studying lower bounds on the expected communication complexity of Monte Carlo algorithms for language recognition problems on anonymous asynchronous unidirectional rings. The tools are used to establish tight lower bounds on the expected bit complexity of the Solitude Verification problem that asymptotically match upper bounds for this problem. The bounds demonstrate that, for this problem, the expected bit complexity depends subtly on the processors' knowledge of the size of the ring and on whether or not processor-detectable termination is required.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Singh:1994:EAR, author = "Ambuj K. Singh and James H. Anderson and Mohamed G. Gouda", title = "The Elusive Atomic Register", journal = j-J-ACM, volume = "41", number = "2", pages = "311--339", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:15:10 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174657.html", abstract = "We present a construction of a single-writer, multiple-reader atomic register from single-writer, single-reader atomic registers. The complexity of our construction is asymptotically optimal; $O(M^{2} + MN)$ shared single-writer, single-reader safe bits are required to construct a single-writer, $M$-reader, $N$-bit atomic register.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Mutual exclusion. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Fagin:1994:RAK, author = "Ronald Fagin and Joseph Y. Halpern", title = "Reasoning About Knowledge and Probability", journal = j-J-ACM, volume = "41", number = "2", pages = "340--367", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:58:31 1998", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See corrigendum \cite{Fagin:1998:CRA}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174658.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory; verification", subject = "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Uncertainty, ``fuzzy,'' and probabilistic reasoning. {\bf I.2.5}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Programming Languages and Software. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS.", } @Article{Kfoury:1994:AMT, author = "A. J. Kfoury and J. Tiuryn and P. Urzyczyn", title = "An Analysis of {ML} Typability", journal = j-J-ACM, volume = "41", number = "2", pages = "368--398", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:16:35 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174659.html", abstract = "We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME we mean DTIME($2^n0(1)$). This, together with the known exponential-time algorithm that solves the problem, yields the DEXPTIME-completeness result. This settles an open problem of P. Kanellakis and J. C. Mitchell.\par Part of our analysis is an algebraic characterization of ML typability in terms of a restricted form of semi-unification, which we identify as {\em acyclic semi-unification}. We prove that ML typability and acyclic semi-unification can be reduced to each other in polynomial time. We believe this result is of independent interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems.", } @Article{Cosnard:1994:OAP, author = "Michel Cosnard and El Mostafa Daoudi", title = "Optimal Algorithms for Parallel {Givens} Factorization on a Coarse-Grained {PRAM}", journal = j-J-ACM, volume = "41", number = "2", pages = "399--421", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:17:20 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174660.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms.", } @Article{Alon:1994:PLP, author = "Noga Alon and Nimrod Megiddo", title = "Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time", journal = j-J-ACM, volume = "41", number = "2", pages = "422--434", month = mar, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:17:48 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/174661.html", abstract = "For any fixed dimension $d$, the linear programming problem with $n$ inequality constraints can be solved on a probabilistic CRCW PRAM with $O(n)$ processors almost surely in constant time. The algorithm always finds the correct solution. With $nd/\log^{2}d$ processors, the probability that the algorithm will not finish within $O(d^{2}\log^{2}d)$ time tends to zero exponentially with $n$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Ladkin:1994:BCP, author = "Peter B. Ladkin and Roger D. Maddux", title = "On Binary Constraint Problems", journal = j-J-ACM, volume = "41", number = "3", pages = "435--469", month = may, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:20:38 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176585.html", abstract = "The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of path-consistency plays a central role. Algorithms for path-consistency can be implemented on matrices of relations and on matrices of elements from a relation algebra. We give an example of a 4-by-4 matrix of infinite relations on which on iterative local path-consistency algorithm terminates. We give a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time. Specific relation algebras arising from interval constraint problems are also studied: the Interval Algebra, the Point Algebra, and the Containment Algebra.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Relation systems.", } @Article{Blum:1994:NAA, author = "Avrim Blum", title = "New Approximation Algorithms for Graph Coloring", journal = j-J-ACM, volume = "41", number = "3", pages = "470--516", month = may, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:20:56 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176586.html", abstract = "The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to $k$-colorable graphs for constant $k \geq 3$. This paper explores the approximation problem of coloring $k$-colorable graphs with as few additional colors as possible in polynomial time, with special focus on the case of $k = 3$.\par The previous best upper bound on the number of colors needed for coloring 3-colorable $n$-vertex graphs in polynomial time was $o(n/\log n)$ colors by Berger and Rompel, improving a bound of $o(n)$ colors by Wigderson. This paper presents an algorithm to color any 3-colorable graph with $o(n^{3/8}\mbox{polylog}(n))$ colors, thus breaking an ``$O(n^{1/2})-o(1)$ barrier''. The algorithm given here is based on examining second-order neighborhoods of vertices, rather than just immediate neighborhoods of vertices as in previous approaches. We extend our results to improve the worst-case bounds for coloring $k$-colorable graphs for constant $k > 3$ as well.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Drusinsky:1994:PBC, author = "Doron Drusinsky and David Harel", title = "On the Power of Bounded Concurrency {I}: {Finite} Automata", journal = j-J-ACM, volume = "41", number = "3", pages = "517--539", month = may, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:21:21 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176587.html", abstract = "We investigate the descriptive succinctness of three fundamental notions for modeling concurrency: nondeterminism and pure parallelism, the two facets of alternation, and {\em bounded cooperative concurrency}, whereby a system configuration consists of a bounded number of cooperating states. Our results are couched in the general framework of finite-state automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finite-state versions of concurrent programming languages. We exhibit exhaustive sets of upper and lower bounds on the relative succinctness of these features over $\Sigma^*$ and $\Sigma^\omega$, establishing that:\par \begin{itemize} \item Each of the three features represents an exponential saving in succinctness of the representation, in a manner that is independent of the other two and additive with respect to them. \item Of the three, bounded concurrency is the strongest, representing a similar exponential saving even when substituted for each of the others. \end{itemize} \par For example, we prove exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs, and triple-exponential bounds on the simulation of alternating concurrent automata by DFAs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism.", } @Article{Hirst:1994:PBC, author = "Tirza Hirst and David Harel", title = "On the Power of Bounded Concurrency {II}: {Pushdown} Automata", journal = j-J-ACM, volume = "41", number = "3", pages = "540--554", month = may, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:21:42 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176588.html", abstract = "This is the second in a series of papers on the inherent power of bounded cooperative concurrency, whereby an automaton can be in some bounded number of states that cooperate in accepting the input. In this paper, we consider pushdown automata. We are interested in differences in power of expression and in exponential (or higher) discrepancies in succinctness between variants of pda's that incorporate nondeterminism ($E$), pure parallelism ($A$), and bounded cooperative concurrency (C). Technically, the results are proved for cooperating push-down automata with cooperating states, but they hold for appropriate versions of most concurrent models of computation. We exhibit exhaustive sets of upper and lower bounds on the relative succinctness of these features for three classes of languages: deterministic context-free, regular, and finite. For example, we show that C represents exponential savings in succinctness in all cases except when both $E$ and $A$ are present (i.e., except for alternating automata), and that $E$ and $A$ represent {\em unlimited\/} savings in succinctness in all cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism.", } @Article{Rivest:1994:DBI, author = "Ronald L. Rivest and Robert E. Schapire", title = "Diversity-Based Inference of Finite Automata", journal = j-J-ACM, volume = "41", number = "3", pages = "555--589", month = may, year = "1994", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/176584.176589", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 22 23:22:07 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", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/176589.html", abstract = "We present new procedures for inferring the structure of a finite-state automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments.\par Our procedures use a new representation for finite automata, based on the notion of equivalence between {\em tests}. We call the number of such equivalence classes the {\em diversity\/} of the automaton; the diversity may be as small as the logarithm of the number of states of the automaton. For the special class of {\em permutation automata}, we describe an inference procedure that runs in time polynomial in the diversity and $\log(1/\delta)$, where $\delta$ is a given upper bound on the probability that our procedure returns an incorrect result. (Since our procedure uses randomization to perform experiments, there is a certain controllable chance that it will return an erroneous result.) We also discuss techniques for handling more general automata.\par We present evidence for the practical efficiency of our approach. For example, our procedure is able to infer the structure of an automaton based on Rubik's Cube (which has approximately $10^{19}$ states) in about 2 minutes on a DEC MicroVax. This automaton is many orders of magnitude larger than possible with previous techniques, which would require time proportional at least to the number of global states. (Note that in this example, only a small fraction ($10^{-14}$) of the global states were even visited.)\par Finally, we present a new procedure for inferring automata of a special type in which the global state is composed of a vector of binary local state variables, all of which are observable (or {\em visible\/}) to the experimenter. Our inference procedure runs provably in time polynomial in the size of this vector (which happens to be the diversity of the automaton), even though the global state space may be exponentially larger. The procedure plans and executes experiments on the unknown automaton; we show that the number of input symbols given to the automaton during this process is (to within a constant factor) the best possible.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; experimentation; theory", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction. {\bf I.2.9}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics.", } @Article{Buntine:1994:SED, author = "Wray L. Buntine and Hans-J{\"{u}}rgen B{\"{u}}rckert", title = "On Solving Equations and Disequations", journal = j-J-ACM, volume = "41", number = "4", pages = "591--629", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 07:59:25 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179813.html", abstract = "We are interested in the problem of solving a system $$ of equations and disequations, also known as disunification. Solutions to disunification problems are substitutions for the variables of the problem that make the two terms of each equation equal, but leave those of the disequations different. We investigate this in both algebraic and logical contexts where equality is defined by an equational theory and more generally by a definitive clause equality theory $E$. We show how $E$-disunification can be reduced to $E$-unification, that is, solving equations only, and give a disunification algorithm for theories given a unification algorithm. In fact, this result shows that for theories in which the solutions of all unification problems can also be represented finitely. We sketch how disunification can be applied to handle negation in logic programming with equality in a similar style to Colmerauer's logic programming with rational trees, and to represent many solutions to AC-unification problems by a few solutions to ACI-disunification problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "definite clause; E-disunification; E-unification; equational theory; inequations; languages; logic programming; solving equations and disequations; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic.", } @Article{Blum:1994:LAS, author = "Avrim Blum and Ming Li and John Tromp and Mihalis Yannakakis", title = "Linear Approximation of Shortest Superstrings", journal = j-J-ACM, volume = "41", number = "4", pages = "630--647", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179818.html", abstract = "We consider the following problem: given a collection of strings $s_1, \ldots{}, s_m$, find the shortest string $s$ such that each $s_i$ appears as a substring (a consecutive block) of $s$. Although this problem is known to be NP-hard, a simple greedy procedure appears to do quite well and is routinely used in DNA sequencing and data compression practice, namely: repeatedly merge the pair of (distinct) strings with maximum overlap until only one string remains. Let $n$ denote the length of the optimal superstring. A common conjecture states that the above greedy procedure produces a superstring of length $O(n)$ (in fact, $2n$), yet the only previous nontrivial bound known for any polynomial-time algorithm is a recent $O(n \log n)$ result.\par We show that the greedy algorithm does in fact achieve a constant factor approximation, proving an upper bound of $4n$. Furthermore, we present a simple modified version of the greedy algorithm that we show produces a superstring of length at most $3n$. We also show the superstring problem to be MAXSNP-hard, which implies that a polynomial-time approximation scheme for this problem is unlikely.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; approximation algorithms; shortest common superstrings", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Conway:1994:EDM, author = "Adrian E. Conway and Eugene Pinsky and Srinivasan Tridandapani", title = "Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models", journal = j-J-ACM, volume = "41", number = "4", pages = "648--675", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179838.html", abstract = "Three new decomposition methods are developed for the exact analysis of stochastic multi-facility blocking models of the product-form type. The first is a basic decomposition algorithm that reduces the analysis of blocking probabilities to that of two separate subsystems. The second is a generalized $M$-subsystem decomposition method. The third is a more elaborate and efficient incremental decomposition technique. All of the algorithms exploit the sparsity of locality that can be found in the demand matrix of a system. By reducing the analysis to that of a set of subsystems, the overall dimensionality of the problem is diminished and the computational requirements are reduced significantly. This enables the efficient computation of blocking probabilities in large systems. Several numerical examples are provided to illustrate the computational savings that can be realized.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; blocking models; circuit-switched networks; decomposition methods; exact analysis; locality; performance; product-form; recursion; sparsity; theory; verification", subject = "{\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Network communication. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory.", } @Article{Lui:1994:CBS, author = "John C. S. Lui and Richard R. Muntz", title = "Computing Bounds on Steady State Availability of Repairable Computer Systems", journal = j-J-ACM, volume = "41", number = "4", pages = "676--707", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179848.html", abstract = "One of the most important performance measures for computer system designers is system availability. Most often, Markov models are used in representing systems for dependability/availability analysis. Due to complex interactions between components and complex repair policies, the Markov model often has an irregular structure, and closed-form solutions are extremely difficult to obtain. Also, a realistic system model often has an unmanageably large state space and it quickly becomes impractical to even generate the entire transition rate matrix. In this paper, we present a methodology that can (i) bound the system steady state availability and at the same time, (ii) drastically reduce the state space of the model that must be solved. The bounding algorithm is iterative and generates a part of the transition matrix at each step. At each step, tighter bounds on system availability are obtained. The algorithm also allows the size of the submodel, to be solved at each step, to be chosen so as to accommodate memory limitations. This general bounding methodology provides an efficient way to evaluate dependability models with very large state spaces without ever generating the entire transition rate matrix.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; availability; bounds; Markov models; reliability; stationary probabilities; theory", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis.", } @Article{Bell:1994:RBG, author = "Timothy C. Bell and Ian H. Witten", title = "The Relationship between Greedy Parsing and Symbolwise Text Compression", journal = j-J-ACM, volume = "41", number = "4", pages = "708--724", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179892.html", abstract = "Text compression methods can be divided into two classes: {\em symbolwise\/} and {\em parsing}. Symbolwise methods assign codes to individual symbols, while parsing methods assign codes to groups of consecutive symbols (phrases). The set of phrases available to a parsing method is referred to as a {\em dictionary}. The vast majority of parsing methods in the literature use {\em greedy\/} parsing (including nearly all variations of the popular Ziv--Lempel methods). When greedy parsing is used, the coder processes a string from left to right, at each step encoding as many symbols as possible with a phrase from the dictionary. This parsing strategy is not optimal, but an optimal method cannot guarantee a bounded coding delay.\par An important problem in compression research has been to establish the relationship between symbolwise methods and parsing methods. This paper extends prior work that shows that there are symbolwise methods that simulate a subset of greedy parsing methods. We provide a more general algorithm that takes any {\em nonadaptive\/} greedy parsing method and constructs a symbolwise method that achieves exactly the same compression. Combined with the existence of symbolwise equivalents for two of the most significant {\em adaptive\/} parsing methods, this result gives added weight to the idea that research aimed at increasing compression should concentrate on symbolwise methods, while parsing methods should be chosen for speed or temporary storage considerations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "adaptive modelling; algorithms; context modeling; theory; Ziv--Lempel compression", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf H.1.1}: Information Systems, MODELS AND PRINCIPLES, Systems and Information Theory, Information theory.", } @Article{Attiya:1994:WFA, author = "Hagit Attiya and Nancy Lynch and Nir Shavit", title = "Are Wait-Free Algorithms Fast?", journal = j-J-ACM, volume = "41", number = "4", pages = "725--763", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179902.html", abstract = "The time complexity of wait-free algorithms in ``normal'' executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of $\log n$ on the time complexity of any wait-free algorithm that achieves {\em approximate agreement\/} among $n$ processes is proved. In contrast, there exists a non-wait-free algorithm that solves this problem in constant time. This implies an $\Omega(\log n)$ time separation between the wait-free and non-wait-free computation models. On the positive side, we present an $O(\log n)$ time wait-free approximate agreement algorithm; the complexity of this algorithm is within a small constant of the lower bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; approximate agreement; fault-tolerance; performance; reliability; theory; wait-free", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization.", } @Article{Reif:1994:MPP, author = "John Reif and Micha Sharir", title = "Motion Planning in the Presence of Moving Obstacles", journal = j-J-ACM, volume = "41", number = "4", pages = "764--790", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179911.html", abstract = "This paper investigates the computational complexity of planning the motion of a body B in 2-D or 3-D space, so as to avoid collision with moving obstacles of known, easily computed, trajectories. Dynamic movement problems are of fundamental importance to robotics, but their computational complexity has not previously been investigated.\par We provide evidence that the 3-D dynamic movement problem is intractable even if B has only a constant number of degrees of freedom of movement. In particular, we prove the problem is PSPACE-hard if B is given a velocity modulus bound on its movements and is NP-hard even if B has no velocity modulus bound, where, in both cases, B has 6 degrees of freedom. To prove these results, we use a unique method of simulation of a Turing machine that uses time to encode configurations (whereas previous lower bound proofs in robotic motion planning used the system position to encode configurations and so required unbounded number of degrees of freedom).\par We also investigate a natural class of dynamic problems that we call {\em asteroid avoidance problems\/}: B, the object we wish to move, is a convex polyhedron that is free to move by translation with bounded velocity modulus, and the polyhedral obstacles have known translational trajectories but cannot rotate. This problem has many applications to robot, automobile, and aircraft collision avoidance. Our main positive results are polynomial time algorithms for the 2-D asteroid avoidance problem, where B is a moving polygon and we assume a constant number of obstacles, as well as single exponential time or polynomial space algorithms for the 3-D asteroid avoidance problem, where B is a convex polyhedron and there are arbitrarily many obstacles. Our techniques for solving these asteroid avoidance problems use ``normal path'' arguments, which are an interesting generalization of techniques previously used to solve static shortest path problems.\par We also give some additional positive results for various other dynamic movers problems, and in particular give polynomial time algorithms for the case in which B has no velocity bounds and the movements of obstacles are algebraic in space-time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; computational geometry; cylindrical algebraic decomposition; decision procedures; motion planning; moving obstacles; theory; theory of reals; Turing machines", subject = "{\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Plan execution, formation, generation. {\bf I.2.9}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Gao:1994:CRM, author = "Shaodi Gao and Michael Kaufmann", title = "Channel Routing of Multiterminal Nets", journal = j-J-ACM, volume = "41", number = "4", pages = "791--818", month = jul, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 23:22:32 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179927.html", abstract = "This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density $d$ into a so-called extended simple channel routing problem (ESCRP) of density $3d/2+O(d \log d)$. We then describe routing algorithms for solving ESCRPs in three different models. The channel width $w$ is $ <=3d/2+O(d\log d) $ in the knock-knee and unit-vertical-overlap models, and $ w<=3d/2+O(d\log d) + O(f) $ in the Manhattan model, where $f$ is the flux of the problem. In all three cases, we improve the best-known upper bounds.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; channel routing; design; theory; VLSI layout", subject = "{\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Placement and routing. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Rathmann:1994:CHS, author = "Peter K. Rathmann and Marianne Winslett and Mark Manasse", title = "Circumscription with Homomorphisms: {Solving} the Equality and Counterexample Problems", journal = j-J-ACM, volume = "41", number = "5", pages = "819--873", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 07:56:14 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185678.html", abstract = "One important facet of common-sense reasoning is the ability to draw default conclusions about the state of the world, so that one can, for example, assume that a given bird flies in the absence of information to the contrary. A deficiency in the circumscriptive approach to common-sense reasoning has been its difficulties in producing default that Tweety $\ne$ Blutto using ordinary circumscription, or conclude by default that a particular bird flies, if some birds are known not to fly. In this paper, we introduce a new form of circumscription, based on homomorphisms between models, that remedies these two problems and still retains the major desirable properties of traditional forms of circumscription.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Predicate logic. {\bf I.2.0}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, General, Philosophical foundations.", } @Article{Glass:1994:TMA, author = "Christopher J. Glass and Lionel M. Ni", title = "The Turn Model for Adaptive Routing", journal = j-J-ACM, volume = "41", number = "5", pages = "874--902", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185682.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; performance", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks.", } @Article{Dallery:1994:ERS, author = "Yves Dallery and Zhen Liu and Don Townsley", title = "Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queueing Networks with Blocking", journal = j-J-ACM, volume = "41", number = "5", pages = "903--942", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185776.html", abstract = "In this paper, we study quantitative as well as qualitative properties of Fork-Join Queuing Networks with Blocking (FJQN/Bs). Specifically, we prove results regarding the equivalence of the behavior of a FJQN/B and that of its duals and a strongly connected marked graph. In addition, we obtain general conditions that must be satisfied by the service times to guarantee the existence of a long-term throughput and its independence on the initial configuration. We also establish conditions under which the reverse of a FJQN/B has the same throughput as the original network. By combining the equivalence result for duals and the reversibility result, we establish a symmetry property for the throughput of a FJQN/B. Last, we establish that the throughput is a concave function of the buffer sizes and the initial marking, provided that the service times are mutually independent random variables belonging to the class of PERT distributions that includes the Erlang distributions. This last result coupled with the symmetry property can be used to identify the initial configuration that maximizes the long-term throughput in closed series-parallel networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Driscoll:1994:FPL, author = "James R. Driscoll and Daniel D. K. Sleator and Robert E. Tarjan", title = "Fully Persistent Lists with Catenation", journal = j-J-ACM, volume = "41", number = "5", pages = "943--959", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185791.html", abstract = "This paper considers the problem of representing stacks with catenation so that any stack, old or new, is available for access or update operations. This problem arises in the implementation of list-based and functional programming languages. A solution is proposed requiring constant time and space for each stack operation except catenation, which requires $O(\log \log k)$ time and space. Here $k$ is the number of stack operations done before the catenation. All the resource bounds are amortized over the sequence of operations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Lists. {\bf D.1.1}: Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Lund:1994:HAM, author = "Carsten Lund and Mihalis Yannakakis", title = "On the Hardness of Approximating Minimization Problems", journal = j-J-ACM, volume = "41", number = "5", pages = "960--981", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47: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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Storer:1994:SPP, author = "James A. Storer and John H. Reif", title = "Shortest Paths in the Plane with Polygonal Obstacles", journal = j-J-ACM, volume = "41", number = "5", pages = "982--1012", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185795.html", abstract = "We present a practical algorithm for finding minimum-length paths between points in the Euclidean plane with (not necessarily convex) polygonal obstacles. Prior to this work, the best known algorithm for finding the shortest path between two points in the plane required $\Omega(n^{2} \log n)$ time and $O(n^{2})$ space, where $n$ denotes the number of obstacle edges. Assuming that a triangulation or a Voronoi diagram for the obstacle space is provided with the input (if is not, either one can be precomputed in $O(n \log n)$ time), we present an $O(kn)$ time algorithm, where $k$ denotes the number of ``islands'' (connected components) in the obstacle space. The algorithm uses only $O(n)$ space and, given a source point $s$, produces an $O(n)$ size data structure such that the distance between $s$ and any other point $x$ in the plane $(x)$ is not necessarily an obstacle vertex or a point on an obstacle edge can be computed in $O(1)$ time. The algorithm can also be used to compute shortest paths for the movement of a disk (so that optimal movement for arbitrary objects can be computed to the accuracy of enclosing them with the smallest possible disk).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Reif:1994:SEU, author = "John H. Reif and James A. Storer", title = "A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions", journal = j-J-ACM, volume = "41", number = "5", pages = "1013--1019", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185811.html", abstract = "We derive a single-exponential time upper bound for finding the shortest path between two points in 3-dimensional Euclidean space with (nonnecessarily convex) polyhedral obstacles. Prior to this work, the best known algorithm required double-exponential time. Given that the problem is known to be PSPACE-hard, the bound we present is essentially the best (in the worst-case sense) that can reasonably be expected.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Aspnes:1994:CN, author = "James Aspnes and Maurice Herlihy and Nir Shavit", title = "Counting Networks", journal = j-J-ACM, volume = "41", number = "5", pages = "1020--1048", month = sep, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 06 08:47:03 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/185815.html", abstract = "Many fundamental multi-processor coordination problems can be expressed as {\em counting problems\/}: Processes must cooperate to assign successive values from a given range, such as addresses in memory or destinations on an interconnection network. Conventional solutions to these problems perform poorly because of synchronization bottlenecks and high memory contention.\par Motivated by observations on the behavior of sorting networks, we offer a new approach to solving such problems, by introducing {\em counting networks}, a new class of networks that can be used to count. We give two counting network constructions, one of depth $\log n(1 + \log n)/2$ using $n \log (1 + \log n)/4$ ``gates,'' and a second of depth $\log^2 n$ using $n \log^{2n}/2$ gates. These networks avoid the sequential bottlenecks inherent to earlier solutions and substantially lower the memory contention.\par Finally, to show that counting networks are not merely mathematical creatures, we provide experimental evidence that they outperform conventional synchronization techniques under a variety of circumstances.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications.", } @Article{Atallah:1994:PAE, author = "Mikhail J. Atallah", title = "Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations", journal = j-J-ACM, volume = "41", number = "6", pages = "1049--1088", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195617.html", abstract = "Given an off-line sequence $S$ of $n$ set-manipulation operations, we investigate the parallel complexity of evaluating $S$ (i.e., finding the response to every operation in $S$ and returning the resulting set). We show that the problem of evaluating $S$ is in {\em NC\/} for various combinations of common set-manipulation operations. Once we establish membership in {\em NC\/} (or, if membership in {\em NC\/} is obvious), we develop techniques for improving the time and/or processor complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Rabin:1994:RSS, author = "Tal Rabin", title = "Robust Sharing of Secrets when the Dealer is Honest or Cheating", journal = j-J-ACM, volume = "41", number = "6", pages = "1089--1109", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195621.html", abstract = "The problem of Verifiable Secret Sharing (VSS) is the following: A dealer, who may be honest or cheating, can share a secret $s$, among $n \geq 2t + 1$ players, where $t$ players at most are cheaters. The sharing process will cause the dealer to commit himself to a secret $s$. If the dealer is honest, then, during the sharing process, the set of dishonest players will have no information about $s$. When the secret is reconstructed, at a later time, all honest players will reconstruct $s$. The solution that is given is a constant round protocol, with polynomial time local computations and polynomial message size. The protocol assumes private communication lines between every two participants, and a broadcast channel. The protocol achieves the desired properties with an exponentially small probability of error.\par A new tool, called {\em Information Checking}, which provides authentication and is not based on any unproven assumptions, is introduced, and may have wide application elsewhere.\par For the case in which it is known that the dealer is honest, a simple constant round protocol is proposed, without assuming broadcast.\par A weak version of secret sharing is defined: Weak Secret Sharing (WSS). WSS has the same properties as VSS for the sharing process. But, during reconstruction, if the dealer is dishonest, then he might obstruct the reconstruction of $s$. A protocol for WSS is also introduced. This protocol has an exponentially small probability of error. WSS is an essential building block for VSS. For certain applications, the much simpler WSS protocol suffice.\par All protocols introduced in this paper are secure in the Information Theoretic sense.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; security; theory; verification", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol verification. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems.", } @Article{Ross:1994:MCS, author = "Keith W. Ross and Danny H. K. Tsang and Jie Wang", title = "{Monte Carlo} Summation and Integration Applied to Multiclass Queuing Networks", journal = j-J-ACM, volume = "41", number = "6", pages = "1110--1135", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195630.html", abstract = "Although many closed multiclass queuing networks have a product-form solution, evaluating their performance measures remains nontrivial due to the presence of a normalization constant. We propose the application of Monte Carlo summation in order to determine the normalization constant, throughputs, and gradients of throughputs. A class of importance-sampling functions leads to a decomposition approach, where separate single-class problems are first solved in a setup module, and then the original problem is solved by aggregating the single-class solutions in an execution model. We also consider Monte Carlo methods for evaluating performance measures based on integral representations of the normalization constant; a theory for optimal importance sampling is developed. Computational examples are given that illustrate that the Monte Carlo methods are robust over a wide range of networks and can rapidly solve networks that cannot be handled by the techniques in the existing literature.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Karp:1994:PRR, author = "Richard M. Karp", title = "Probabilistic Recurrence Relations", journal = j-J-ACM, volume = "41", number = "6", pages = "1136--1150", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195632.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Naughton:1994:HFP, author = "Jeffrey F. Naughton and Raghu Ramakrishnan", title = "How to Forget the Past without Repeating It", journal = j-J-ACM, volume = "41", number = "6", pages = "1151--1177", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195634.html", abstract = "Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computations by storing all intermediate results and replacing recomputation by table lookup. However, in general, storing all intermediate results for the duration of a computation wastes space. In this paper, we propose an evaluation scheme that avoids recomputation, yet for a fairly general class of programs at any given time stores only a small subset of the facts generated. The results constitute a significant first step in compile-time garbage collection for bottom-up evaluation of deductive database programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representations (procedural and rule-based). {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems.", } @Article{Bell:1994:MIP, author = "Colin Bell and Anil Nerode and Raymond T. Ng and V. S. Subrahmanian", title = "Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases", journal = j-J-ACM, volume = "41", number = "6", pages = "1178--1215", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "A preliminary version is available as a University of Maryland TR Nr. CS-TR-2801, Dec 1991.", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195637.html", abstract = "Though the declarative semantics of both explicit and nonmonotonic negation in logic programs has been studied extensively, relatively little work has been done on computation and implementation of these semantics. In this paper, we study three different approaches to computing stable models of logic programs based on mixed integer linear programming methods for automated deduction introduced by R. Jeroslow. We subsequently discuss the relative efficiency of these algorithms. The results of experiments with a prototype compiler implemented by us tend to confirm our theoretical discussion. In contrast to resolution, the mixed integer programming methodology is both fully declarative and handles reuse of old computations gracefully.\par We also introduce, compare, implement, and experiment with linear constraints corresponding to four semantics for ``explicit'' negation in logic programs: the four-valued annotated semantics [Blair and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1989], the Gelfond-Lifschitz semantics [1990], the over-determined models [Grant and Subrahmanian 1990], and the classical logic semantics. Gelfond and Lifschitz[1990] argue for simultaneous use of two modes of negation in logic programs, ``classical'' and ``nonmonotonic,'' so we give algorithms for computing ``answer sets'' for such logic programs too.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models.", } @Article{Ross:1994:MSM, author = "Kenneth A. Ross", title = "Modular Stratification and Magic Sets for Datalog Programs with Negation", journal = j-J-ACM, volume = "41", number = "6", pages = "1216--1266", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195646.html", abstract = "A class of ``modularly stratified'' logic programs is defined. Modular stratification generalizes stratification and local stratification, while allowing programs that are not expressible as stratified programs. For modularly stratified programs, the well-founded semantics coincides with the stable model semantics and makes every ground literal true or false. Modularly stratified programs are weakly stratified, but the converse is false. Unlike some weakly stratified programs, modularly stratified programs can be evaluated in a subgoal-at-a time fashion. An extension of top-down methods with memoing that handles this broader class of programs is presented. A technique for rewriting a modularly stratified program for bottom-up evaluation is demonstrated and extended to include magic-set techniques. The rewritten program, when evaluated bottom-up, gives correct answers according to the well-founded semantics, but much more efficiently than computing the complete well-founded model. A one-to-one correspondence between steps of the extended top-down method and steps during the bottom-up evaluation of the magic-rewritten program is exhibited, demonstrating that the complexity of the two methods is the same. Extensions of modular stratification to other operators such as set-grouping and aggregation, which have traditionally been stratified to prevent semantic difficulties, are discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Datalog. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision.", } @Article{Afek:1994:RCU, author = "Yehuda Afek and Hagit Attiya and Alan Fekete and Michael Fischer and Nancy Lynch and Yishay Mansour and Dai-Wei Wang and Lenore Zuck", title = "Reliable Communication over Unreliable Channels", journal = j-J-ACM, volume = "41", number = "6", pages = "1267--1297", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195651.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; reliability; theory; verification", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol architecture. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Verification. {\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols, Protocol verification. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability.", } @Article{Kearns:1994:LBF, author = "Michael Kearns and Ming Li and Leslie Valiant", title = "Learning {Boolean} Formulas", journal = j-J-ACM, volume = "41", number = "6", pages = "1298--1328", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:30:26 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195656.html", abstract = "Efficient distribution-free learning of Boolean formulas from positive and negative examples is considered. It is shown that classes of formulas that are efficiently learnable from only positive examples or only negative examples have certain closure properties. A new substitution technique is used to show that in the distribution-free case learning DNF (disjunctive normal form formulas) is no harder than learning monotone DNF. We prove that monomials cannot be efficiently learned from negative examples alone, even if the negative examples are uniformly distributed. It is also shown that, if the examples are drawn from uniform distributions, then the class of DNF in which each variable occurs at most once is efficiently {\em weakly learnable\/} (i.e., individual examples are correctly classified with a probability larger than 1/2 + 1/$p$, where $p$ is a polynomial in the relevant parameters of the learning problem). We then show an equivalence between the notion of weak learning and the notion of {\em group learning}, where a group of examples of polynomial size, either all positive or all negative, must be correctly classified with high probability.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Motwani:1994:ACA, author = "Rajeev Motwani", title = "Average-Case Analysis of Algorithms for Matching and Related Problems", journal = j-J-ACM, volume = "41", number = "6", pages = "1329--1356", month = nov, year = "1994", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 21:42:13 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/195663.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Eiter:1995:CLB, author = "Thomas Eiter and Georg Gottlob", title = "The Complexity of Logic-Based Abduction", journal = j-J-ACM, volume = "42", number = "1", pages = "3--42", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200838.html", abstract = "Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a logical theory, we speak about {\em logic-based abduction}. Candidates for abductive explanations are usually subjected to minimality criteria such as subset-minimality, minimal cardinality, minimal weight, or minimality under prioritization of individual hypotheses. This paper presents a comprehensive complexity analysis of relevant decision and search problems related to abduction on propositional theories. Our results indicate that abduction is harder than deduction. In particular, we show that with the most basic forms of abduction the relevant decision problems are complete for complexity classes at the second level of the polynomial hierarchy, while the use of prioritization raises the complexity to the third level in certain cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Nebel:1995:RAT, author = "Bernhard Nebel and Hans-J{\"{u}}rgen B{\"{u}}rckert", title = "Reasoning About Temporal Relations: a Maximal Tractable Subclass of {Allen}'s Interval Algebra", journal = j-J-ACM, volume = "42", number = "1", pages = "43--66", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 07:55:40 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200848.html", abstract = "We introduce a new subclass of Allen's interval algebra we call ``ORD-Horn subclass,'' which is a strict superset of the ``pointisable subclass.'' We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P $\ne$ NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Relation systems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representations (procedural and rule-based). {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Callahan:1995:DMP, author = "Paul B. Callahan and S. Rao Kosaraju", title = "A Decomposition of Multidimensional Point Sets with Applications to $k$-Nearest-Neighbors and $n$-Body Potential Fields", journal = j-J-ACM, volume = "42", number = "1", pages = "67--90", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200853.html", abstract = "We define the notion of a {\em well-separated pair decomposition\/} of points in $d$-dimensional space. We then develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of $k$-nearest neighbors and $n$-body potential fields.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms.", } @Article{Chien:1995:PAR, author = "Andrew A. Chien and Jae H. Kim", title = "Planar-Adaptive Routing: {Low-Cost} Adaptive Networks for Multiprocessors", journal = j-J-ACM, volume = "42", number = "1", pages = "91--123", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200856.html", abstract = "Network throughput can be increased by allowing multipath, adaptive routing. Adaptive routing allows more freedom in the paths taken by messages, spreading load over physical channels more evenly. The flexibility of adaptive routing introduces new possibilities of deadlock. Previous deadlock avoidance schemes in $k$-ary $n$-cubes require an exponential number of virtual channels. We describe a family of deadlock-free routing algorithms, called {\em planar-adaptive routing\/} algorithms, that require only a constant number of virtual channels, independent of networks size and dimension. Planar-adaptive routing algorithms reduce the complexity of deadlock prevention by reducing the number of choices at each routing step. In the fault-free case, planar-adaptive networks are guaranteed to be deadlock-free. In the presence of network faults, the planar-adaptive router can be extended with misrouting to produce a working network which remains provably deadlock free and is provably livelock free. In addition, planar-adaptive networks can simultaneously support both in-order and adaptive, out-of-order packet delivery.\par Planar-adaptive routing is of practical significance. It provides the simplest known support for deadlock-free adaptive routing in $k$-ary $n$-cubes of more than two dimensions (with $k>2$). Restricting adaptivity reduces the hardware complexity, improving router speed or allowing additional performance-enhancing network features. The structure of planar-adaptive routers is amenable to efficient implementation.\par Simulation studies show that planar-adaptive routers can increase the robustness of network throughput for nonuniform communication patterns. Planar-adaptive routers outperform deterministic routers with equal hardware resources. Further, adding virtual lanes to planar-adaptive routers increases this advantage. Comparisons with fully adaptive routers show that planar-adaptive routers, limited adaptive routers, can give superior performance. These results indicate the best way to allocate router resources to combine adaptivity and virtual lanes.\par Planar-adaptive routers are a special case of limited adaptivity routers. We define a class of adaptive routers with $f$ degrees of routing freedom. This class, termed {\em $f$-flat adaptive routers}, allows a direct cost-performance tradeoff between implementation cost (speed and silicon area) and routing freedom (channel utilization). For a network of a particular dimension, the cost of adaptivity grows linearly with the routing freedom. However, the rate of growth is a much larger constant for high-dimensional networks. All of the properties proven for planar-adaptive routers, such as deadlock and livelock freedom, also apply to $f$-flat adaptive routers.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; reliability", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf B.4.3}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks. {\bf B.4.5}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Reliability, Testing, and Fault-Tolerance, Hardware reliability.", } @Article{Attiya:1995:SMR, author = "Hagit Attiya and Amotz Bar-Noy and Danny Dolev", title = "Sharing Memory Robustly in Message-Passing Systems", journal = j-J-ACM, volume = "42", number = "1", pages = "124--142", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200869.html", abstract = "Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, single-writer multi-reader register in unreliable, asynchronous networks. The two message-passing models considered are a complete network with processor failures and an arbitrary network with dynamic link failures.\par These results make it possible to view the shared-memory model as a higher-level language for designing algorithms in asynchronous distributed systems. Any wait-free algorithm based on atomic, single-writer multi-reader registers can be automatically emulated in message-passing systems, provided that at least a majority of the processors are not faulty and remain connected. The overhead introduced by these emulations is polynomial in the number of processors in the system.\par Immediate new results are obtained by applying the emulators to known shared-memory algorithms. These include, among others, protocols to solve the following problems in the message-passing model in the presence of processor or link failures: multi-writer multi-reader registers, concurrent time-stamp systems, $l$-exclusion, atomic snapshots, randomized consensus, and implementation of data structures.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Message sending. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models.", } @Article{Dolev:1995:DFT, author = "Danny Dolev and Joseph Y. Halpern and Barbara Simons and Ray Strong", title = "Dynamic Fault-Tolerant Clock Synchronization", journal = j-J-ACM, volume = "42", number = "1", pages = "143--185", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200870.html", abstract = "This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. Assuming a fault-tolerant authentication protocol, the algorithms tolerate both link and processor failures of any type. The algorithm for maintaining synchronization works for arbitrary networks (rather than just completely connected networks) and tolerates any number of processor or communication link faults as long as the correct processors remain connected by fault-free paths. It thus represents an improvement over other clock synchronization algorithms such as those of Lamport and Melliar Smith and Welch and Lynch, although, unlike them, it does require an authentication protocol to handle Byzantine faults. Our algorithm for allowing new processors to join requires that more than half the processors be correct, a requirement that is provably necessary.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; reliability; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance.", } @Article{Haldar:1995:CWM, author = "S. Haldar and K. Vidyasankar", title = "Constructing $1$-Writer Multiread Multivalued Atomic Variables from Regular Variables", journal = j-J-ACM, volume = "42", number = "1", pages = "186--203", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:22:18 2001", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200871.html", abstract = "A simple wait-free construction of 1-writer multireader multivalued atomic variable from multireader regular variables is presented in this paper. A key point of the construction is the use of an elegant forwarding technique to overcome the new-old inversion property inherent in regular variables.\par Another construction, using a different forwarding technique, is also given. This technique is a refinement of one proposed in the literature.\par Formal correctness proofs for both the constructions are short and easy to follow.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf B.4.3}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems), Asynchronous/synchronous operation. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Buffering.", } @Article{Chang:1995:BSE, author = "C. S. Chang and R. Nelson", title = "Bounds on the Speedup and Efficiency of Partial Synchronization in Parallel Processing Systems", journal = j-J-ACM, volume = "42", number = "1", pages = "204--231", month = jan, year = "1995", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/200836.200872", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200872.html", abstract = "In this paper, we derive bounds on the speedup and efficiency of applications that schedule tasks on a set of parallel processors. We assume that the application runs an algorithm that consists of $N$ iterations and before starting its $i$+1st iteration, a processor must wait for data (i.e., synchronize) calculated in the $i$th iteration by a subset of the other processors of the system. Processing times and interconnections between iterations are modeled by random variables with possibly deterministic distributions. Scientific applications consisting of iterations of recursive equations are examples of such applications that can be modeled within this formulation. We consider the efficiency of applications and show that, although efficiency decreases with an increase in the number of processors, it has a nonzero limit when the number of processors increases to infinity. We obtain a lower bound for the efficiency by solving an equation that depends on the distribution of task service times and the expected number of tasks needed to be synchronized. We also show that the lower bound is approached if the topology of the processor graph is ``spread-out,'' a notion we define in the paper.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors.", } @Article{Bloom:1995:BCT, author = "Bard Bloom and Sorin Istrail and Albert R. Meyer", title = "Bisimulation Can't Be Traced", journal = j-J-ACM, volume = "42", number = "1", pages = "232--268", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200876.html", abstract = "In the concurrent language CCS, two programs are considered the same if they are {\em bisimilar}. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs. We consider the problem of adding operations to CCS to make bisimulation fully abstract. We define the class of GSOS operations, generalizing the style and technical advantages of CCS operations. We characterize GSOS congruence in as a bisimulation-like relation called {\em ready-simulation}. Bisimulation is strictly finer than ready simulation, and hence not a congruence for any GSOS language.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications, CCS.", } @Article{Blum:1995:DPC, author = "Manuel Blum and Sampath Kannan", title = "Designing Programs that Check Their Work", journal = j-J-ACM, volume = "42", number = "1", pages = "269--291", month = jan, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 15 21:04:34 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/200880.html", abstract = "A {\em program correctness checker\/} is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output of the program on that instance is correct. This paper defines the concept of a program checker. It designs program checkers for a few specific and carefully chosen problems in the class FP of functions computable in polynomial time. Problems in FP for which checkers are presented in this paper include Sorting, Matrix Rank and GCD. It also applies methods of modern cryptography, especially the idea of a probabilistic interactive proof, to the design of program checkers for group theoretic computations.\par Two structural theorems are proven here. One is a characterization of problems that can be checked. The other theorem establishes equivalence classes of problems such that whenever one problem in a class is checkable, all problems in the class are checkable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; reliability; theory; verification", subject = "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification, Reliability. {\bf F.2.0}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Lin:1995:PCT, author = "Fangzhen Lin and Yoav Shoham", title = "Provably Correct Theories of Action", journal = j-J-ACM, volume = "42", number = "2", pages = "293--320", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201021.html", abstract = "We investigate logical formalization of the effects of actions in the situation calculus. We propose a formal criterion against which to evaluate theories of deterministic actions. We show how the criterion provides us a formal foundation upon which to tackle the frame problem, as well as its variant in the context of concurrent actions. Our main technical contributions are in formulating a wide class of monotonic causal theories that satisfy the criterion, and showing that each such theory can be reformulated succinctly in circumscription.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "humanfactors; theory", subject = "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Karger:1995:RLT, author = "David R. Karger and Philip N. Klein and Robert E. Tarjan", title = "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees", journal = j-J-ACM, volume = "42", number = "2", pages = "321--328", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201022.html", abstract = "We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf I.5.3}: Computing Methodologies, PATTERN RECOGNITION, Clustering. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Wang:1995:DMR, author = "Ke Wang and Weining Zhang and Siu-Cheung Chau", title = "Decomposition of Magic Rewriting", journal = j-J-ACM, volume = "42", number = "2", pages = "329--381", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201027.html", abstract = "The magic rewriting focuses on relevant data but suffers from additional rules, predicates, and tuples that are generated in search for the relevant data. Reducing the arity of predicates can cut down the number of such rules, predicates, and tuples by an exponential factor. In this paper, we consider a subclass of linear single-IDB programs and show that the magic rewriting can be decomposed in such a way that it is applied to only programs having smaller arities and fewer recursive rules, without losing the binding capacity. The decomposed rewriting is shown to be much more efficient than the standard one and amenable to distributed and parallel environments. The considered subclass significantly generalizes recursions previously proposed for efficient implementation. The decomposed rewriting and the standard generalized magic rewriting are extended to multi-binding queries in such a way that data relevant to one binding is not necessarily considered as relevant to other bindings. The work in this paper shows the use of tuple ID as an important technique in optimizing logic programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory.", } @Article{Tsitsiklis:1995:ACC, author = "John N. Tsitsiklis and George D. Stamoulis", title = "On the Average Communication Complexity of Asynchronous Distributed Algorithms", journal = j-J-ACM, volume = "42", number = "2", pages = "382--400", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201029.html", abstract = "We study the communication complexity of asynchronous distributed algorithms. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that, under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors under a very general model of distributed computation. Furthermore, for constant-degree processor graphs, the expected number of generated messages is only $O(nT)$, where $n$ is the number of processors and $T$ is the running time. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance", subject = "{\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Kurtz:1995:ICF, author = "Stuart A. Kurtz and Stephen R. Mahaney and James S. Royer", title = "The Isomorphism Conjecture Fails Relative to a Random Oracle", journal = j-J-ACM, volume = "42", number = "2", pages = "401--420", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201030.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Gottlob:1995:NTC, author = "Georg Gottlob", title = "{NP} Trees and {Carnap}'s Modal Logic", journal = j-J-ACM, volume = "42", number = "2", pages = "421--457", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201031.html", abstract = "In this paper we consider problems and complexity classes definable by interdependent queries to an oracle in NP. How the queries depend on each other is specified by a directed graph $G$. We first study the class of problems where $G$ is a general dag and show that this class coincides with $D^{p}_{2}$.\par We then consider the class where $G$ is a tree. Our main result states that this class is identical to $P^{\mbox{NP}}[O(\log n)]$, the class of problems solvable in polynomial time with a logarithmic number of queries to an oracle in NP. This result has interesting applications in the fields of modal logic and artificial intelligence. In particular, we show that the following problems are all $P^{\mbox{NP}}[O(\log n)]$ complete: validity-checking of formulas in Carnap's modal logic, checking whether a formula is almost surely valid over finite structures in modal logics $K$, $T$, and $S4$ (a problem recently considered by Halpern and Kapron [1992]), and checking whether a formula belongs to the stable set of beliefs generated by a propositional theory.\par We generalize the case of dags to the case where $G$ is a general (possibly cyclic) directed graph of NP-oracle queries and show that this class corresponds to $ P^{p}_{2}$. We show that such graphs are easily expressible in autoepistemic logic. Finally, we generalize our complexity results to higher classes of the polynomial-time hierarchy.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{DeNicola:1995:TLB, author = "Rocco {De Nicola} and Frits Vaandrager", title = "Three logics for branching bisimulation", journal = j-J-ACM, volume = "42", number = "2", pages = "458--487", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201032.html", abstract = "Three temporal logics are introduced that induce on labeled transition systems the same identifications as branching bisimulation, a behavioral equivalence that aims at ignoring invisible transitions while preserving the branching structure of systems. The first logic is an extension of Hennessy--Milner Logic with an ``until'' operator. The second one is another extension of Hennessy--Milner Logic, which exploits the power of backward modalities. The third logic is CTL* without the next-time operator. A relevant side-effect of the last characterization is that it sets a bridge between the state- and action-based approaches to the semantics of concurrent systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory; verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @Article{Clarkson:1995:VAL, author = "Kenneth L. Clarkson", title = "{Las Vegas} Algorithms for Linear and Integer Programming When the Dimension is Small", journal = j-J-ACM, volume = "42", number = "2", pages = "488--499", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 09:19:33 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201036.html", abstract = "This paper gives an algorithm for solving linear programming problems. For a problem with $n$ constraints and $d$ variables, the algorithm requires an expected $O(d^{2}n)+(\log n)O(d)^{d/2+O(1)}+O(d^{4}\sqrt{n}\log n)$ arithmetic operations, as $n \rightarrow \infty$. The constant factors do not depend on $d$. Also, an algorithm is given for integer linear programming. Let $4$ bound the number of bits required to specify the rational numbers defining an input constraint or the objective function vector. Let $n$ and $d$ be as before. Then, the algorithm requires expected $O(2^{d}dn+8^{d}d \sqrt{n\log n} \log n) + d^{O(d)}\phi \ln n$ operations on numbers with $d^{O(1)}\phi$ bits, as $n \rightarrow \infty$, where the constant factors do not depend on $d$ or $4$ to other convex programming problems. For example, an algorithm for finding the smallest sphere enclosing a set of $n$ points in $E^{d}$ has the same time bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming.", } @Article{Berger:1995:NOA, author = "Bonnie Berger and Martin Brady and Donna Brown and Tom Leighton", title = "Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing", journal = j-J-ACM, volume = "42", number = "2", pages = "500--542", month = mar, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 30 20:17:10 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/201037.html", abstract = "This paper presents algorithms for routing channels with $L \geq 2$ layers. For the unit vertical overlap model, we describe a two-layer channel routing algorithm that uses at most $d + O(d)$ tracks to route two-terminal net problems and $2d + o(d)$ tracks to route multiterminal nets. We also show that $d + W(\log d)$ tracks are required to route two-terminal net problems in the worst case even if arbitrary vertical overlap is allowed. We generalize the algorithm to unrestricted multilayer routing and use only $d/(L - 1) + O(d / L + 1) $tracks for two-terminal net problems (within $O(d/L+ 1)$ tracks of optimal) and $d/(L - 2) + O(d / L + 1)$ tracks for multiterminal net problems (within a factor of $(L - 1) / (L - 2)$ times optimal). We demonstrate the generality of our routing strategy by showing that it can be used to duplicate some of the best previous upper bounds for other models (two-layer Manhattan routing and two and three-layer knock-knee routing of two-terminal, two-sided nets), and gives a new upper bound for routing with 45-degree diagonal wires.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf B.7.2}: Hardware, INTEGRATED CIRCUITS, Design Aids, Placement and routing. {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Channels and controllers.", } @Article{vanBeek:1995:MGC, author = "Peter {van Beek} and Rina Dechter", title = "On the minimality and global consistency of row-convex constraint networks", journal = j-J-ACM, volume = "42", number = "3", pages = "543--561", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:25:04 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210347.html", abstract = "Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) find a solution that satisfies the constraints and (ii) find the corresponding minimal network where the constraints are as explicit as possible. Both tasks are known to be NP-complete in the general case. Task (1) is usually solved using a backtracking algorithm, and task (ii) is often solved only approximately by enforcing various levels of local consistency. In this paper, we identify a property of binary constraint called {\em row convexity\/} and show its usefulness in deciding when a form of local consistency called path consistency is sufficient to guarantee that a network is both minimal and globally consistent. Globally consistent networks have the property that a solution can be found without backtracking. We show that one can test for the row convexity property efficiently and we show, by examining applications of constraint networks discussed in the literature, that our results are useful in practice. Thus, we identify a class of binary constraint networks for which we can solve both tasks (i) and (ii) efficiently. Finally, we generalize the results for binary constraint networks to networks with nonbinary constraints.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Relation systems.", } @Article{Compton:1995:EDT, author = "Kevin J. Compton and Chinya Ravishankar", title = "Expected Deadlock Time in a Multiprocessing System", journal = j-J-ACM, volume = "42", number = "3", pages = "562--583", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 05 20:48:59 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210412.html", abstract = "We consider multiprocessing systems where processes make independent, Poisson distributed resource requests with mean arrival time 1. We assume that resources are not released. It is shown that the expected deadlock time is never less than 1, no matter how many processes and resources are in the system. Also, the expected number of processes blocked by deadlock time is one-half more than half the number of initially active processes. We obtain expressions for system statistics such as expected deadlock time, expected total processing time, and system efficiency, in terms of Abel sums. We derive asymptotic expressions for these statistics in the case of systems with many processes and the case of systems with a fixed number of processes. In the latter, generalizations of the Ramanujan $Q$-function arise. we use singularity analysis to obtain asymptotics of coefficients of generalized $Q$-functions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Deadlocks. {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Generating functions. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Korilis:1995:EEN, author = "Yannis A. Korilis and Aurel A. Lazar", title = "On the Existence of Equilibria in Noncooperative Optimal Flow Control", journal = j-J-ACM, volume = "42", number = "3", pages = "584--613", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 05 20:48:59 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210415.html", abstract = "The existence of Nash equilibria in noncooperative flow control in a general product-form network shared by $K$ users is investigated. The performance objective of each user is to maximize its average throughput subject to an upper bound on its average time-delay. Previous attempts to study existence of equilibria for this flow control model were not successful, partly because the time-delay constraints couple the strategy spaces of the individual users in a way that does not allow the application of standard equilibrium existence theorems from the game theory literature. To overcome this difficulty, a more general approach to study the existence of Nash equilibria for decentralized control schemes is introduced. This approach is based on directly proving the existence of a fixed point of the best reply correspondence of the underlying game. For the investigated flow control model, the best reply correspondence is shown to be a function, implicitly defined by means of $K$ interdependent linear programs. Employing an appropriate definition for continuity of the set of optimal solutions of parameterized linear programs, it is shown that, under appropriate conditions, the best reply function is continuous. Brouwer's theorem implies, then, that the best reply function has a fixed point.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Constrained optimization. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Bay:1995:DLR, author = "Paul Bay and Gianfranco Bilardi", title = "Deterministic On-Line Routing on Area-Universal Networks", journal = j-J-ACM, volume = "42", number = "3", pages = "614--640", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 05 20:48:59 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210417.html", abstract = "Two deterministic routing networks are presented: the {\em pruned butterfly\/} and the {\em sorting fat-tree}. Both networks are area-universal, that is, they can simulate any other routing network fitting in similar area with polylogarithmic slowdown. Previous area-universal networks were either for the off-line problem, where the message set to be routed is known in advance and substantial precomputation is permitted, or involved randomization, yielding results that hold only with high probability. The two networks introduced here are the first that are simultaneously deterministic and on-line, and they use two substantially different routing techniques. The performance of their routing algorithms depends on the difficulty of the problem instance, which is measured by a quantity $\lambda$ known as the load factor. The pruned butterfly runs in time $O(\lambda \log^{2}N)$, is the number of possible sources and destinations for messages and $\lambda$ is assumed to be polynomial in $N$. The sorting fat-tree algorithm runs in $O(\lambda \log N + \log^{2 N})$ time for a restricted class of message sets including partial permutations. Other results of this work include a ``flexible'' circuit that is area-time optimal across a range of different input sizes and an area-time lower bound for routers based on wire-length arguments.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures.", } @Article{Birman:1995:OSP, author = "Alexander Birman and H. Richard Gail and Sidney L. Hantler and Zvi Rosberg and Moshe Sidi", title = "An Optimal Service Policy for Buffer Systems", journal = j-J-ACM, volume = "42", number = "3", pages = "641--657", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:08:17 1997", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210422.html", abstract = "Consider a switching component in a packet-switching network, where messages from several incoming channels arrive and are routed to appropriate outgoing ports according to a service policy. One requirement in the design of such a system is to determine the buffer storage necessary at the input of each channel and the policy for serving these buffers that will prevent buffer overflow and the corresponding loss of messages. In this paper, a class of buffer service policies, called Least Time to Reach Bound (LTRB), is introduced that guarantees no overflow, and for which the buffer size required at each input channel is independent of the number of channels and their relative speeds. Further, the storage requirement is only twice the maximal length of a message in all cases, and as a consequence the class is shown to be {\em optimal\/} in the sense that any nonoverflowing policy requires at least as much storage as LTRB.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; performance", subject = "{\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Buffering. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory.", } @Article{OHearn:1995:PLV, author = "P. W. O'Hearn and R. D. Tennent", title = "Parametricity and Local Variables", journal = j-J-ACM, volume = "42", number = "3", pages = "658--709", month = may, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 05 20:48:59 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210425.html", abstract = "We propose that the phenomenon of local state may be understood in terms of Strachey's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our proposal is the following analogy: a non-local procedure is independent of locally-declared variables in the same way that a parametrically polymorphic function is independent of types to which it is instantiated.\par A connection between parametricity and representational abstraction was first suggested by J. C. Reynolds. Reynolds used logical relations to formalize this connection in languages with type variables and user-defined types. We use relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria. Reasoning about local variables essentially involved proving properties of polymorphic functions. The new model supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics, and encompasses standard methods of reasoning about data representations. It is not known whether our techniques yield fully abstract semantics. A model based on partial equivalence relations on the natural numbers is also briefly examined.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @Article{Gottlob:1995:TDL, author = "Georg Gottlob", title = "Translating Default Logic into Standard Autoepistemic Logic", journal = j-J-ACM, volume = "42", number = "4", pages = "711--740", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210334.html", abstract = "Since Konolige's translation of default logic into strongly grounded autoepistemic logic, several other variants of Moore's original autoepistemic logic that embody default logic have been studied. All these logics differ significantly from Moore's autoepistemic logic (standard AEL) in that expansions are subject to additional groundedness-conditions. Hence, the question naturally arises whether default logic can be translated into standard AEL at all. We show that a modular translation is not possible. However, we are able to construct a faithful polynomial-time translation from default logic into standard AEL, which is nonmodular. Our translation exploits the self-referentiality of AEL. It uses as an important intermediate step an embedding of Marek's and Truszczy{\'n}ski's nonmonotonic logic {\bf N} into standard AEL. It follows from our results that the expressive power of standard AEL is strictly greater than that of default logic.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf I.2.0}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, General, Philosophical foundations. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Representation languages.", } @Article{Kifer:1995:LFO, author = "Michael Kifer and Georg Lausen and James Wu", title = "Logical Foundations of Object-Oriented and Frame-Based Languages", journal = j-J-ACM, volume = "42", number = "4", pages = "741--843", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210335.html", abstract = "We propose a novel formalism, called {\em Frame Logic\/} (abbr., $F$-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, encapsulation, and others. In a sense, $F$-logic stands in the same relationship to the object-oriented paradigm as classical predicate calculus stands to relational programming. $F$-logic has a model-theoretic semantics and a sound and complete resolution-based proof theory. A small number of fundamental concepts that come from object-oriented programming have direct representation in $F$-logic; other, secondary aspects of this paradigm are easily modeled as well. The paper also discusses semantic issues pertaining to programming with a deductive object-oriented language based on a subset of $F$-logic.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages.", } @Article{Alon:1995:CC, author = "Noga Alon and Raphael Yuster and Uri Zwick", title = "Color-Coding", journal = j-J-ACM, volume = "42", number = "4", pages = "844--856", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210337.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Courcoubetis:1995:CPV, author = "Costas Courcoubetis and Mihalis Yannakakis", title = "The Complexity of Probabilistic Verification", journal = j-J-ACM, volume = "42", number = "4", pages = "857--907", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210339.html", abstract = "We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly exponential in the specification, and prove that it is complete for double exponential time. We also address these questions for specifications described by $\omega$-automata or formulas in extended temporal logic.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes.", } @Article{Galil:1995:CTO, author = "Zvi Galil", title = "A Constant-Time Optimal Parallel String-Matching Algorithm", journal = j-J-ACM, volume = "42", number = "4", pages = "908--918", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210341.html", abstract = "Given a pattern string, we describe a way to preprocess it. We design a CRCW-PRAM constant time optimal parallel algorithm for finding all occurrences of the (preprocessed) pattern in any given text.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices.", } @Article{Nodine:1995:GSO, author = "Mark H. Nodine and Jeffrey Scott Vitter", title = "Greed Sort: {Optimal} Deterministic Sorting on Parallel Disks", journal = j-J-ACM, volume = "42", number = "4", pages = "919--933", month = jul, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 28 07:53:44 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210343.html", abstract = "We present an algorithm for sorting efficiently with parallel two-level memories. Our main result is an elegant, easy-to-implement, optimal, {\em deterministic\/} algorithm for external sorting with $D$ disk drives. This result answers in the affirmative the open problem posed by Vitter and Shriver of whether an optimal algorithm exists that is deterministic. Our measure of performance is the number of parallel input/output (I/O) operations, in which each of the $D$ disks can simultaneously transfer a block of $B$ contiguous records. We assume that internal memory can hold $M$ records. Our algorithm sorts $N$ records in the optimal bound of $\Theta((N/BD) \log(N/B)/ \log(M/B))$ deterministically, and thus improves upon Vitter and Shriver's optimal randomized algorithm as well as the well-known deterministic but nonoptimal technique of disk striping. It is also practical to implement.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Worst-case analysis. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf E.5}: Data, FILES, Sorting/searching.", } @Article{Choudhury:1995:CNC, author = "Gagan H. Choudhury and Kin K. Leung and Ward Whitt", title = "Calculating Normalization Constants of Closed Queuing Networks by Numerically Inverting Their Generating Functions", journal = j-J-ACM, volume = "42", number = "5", pages = "935--970", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210122.html", abstract = "A new algorithm is developed for calculating normalization constants (partition functions) and moments of product-form steady-state distributions of closed queuing networks and related models. The essential idea is to numerically invert the generating function of the normalization constant and related generating functions appearing in expressions for the moments. It is known that the generating function of the normalization constant often has a remarkably simple form, but numerical inversion evidently has not been considered before. For $p$-dimensional transforms, as occur with queuing networks having $p$ closed chains, the algorithm recursively performs $p$ one-dimensional inversions. The required computation grows exponentially in the dimension, but the dimension can often be reduced by exploiting conditional decomposition based on special structure. For large populations, the inversion algorithm is made more efficient by computing large sums using Euler summation. The inversion algorithm also has a very low storage requirement. A key ingredient in the inversion algorithm is scaling. An effective static scaling is developed for multichain closed queuing networks with only single-server and (optionally) infinite-server queues. An important feature of the inversion algorithm is a self-contained accuracy check, which allows the results to be verified in the absence of alternative algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms. {\bf G.1.4}: Mathematics of Computing, NUMERICAL ANALYSIS, Quadrature and Numerical Differentiation, Multiple quadrature.", } @Article{Koutsoupias:1995:SC, author = "Elias Koutsoupias and Christos H. Papadimitriou", title = "On the $k$-server Conjecture", journal = j-J-ACM, volume = "42", number = "5", pages = "971--983", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210128.html", abstract = "We prove that the {\em work function algorithm\/} for the $k$-server problem has a competitive ratio at most 2$k$-1. Manasse et al. [1988] conjectured that the competitive ratio for the $k$-server problem is exactly $k$ (it is trivially at least $k$); previously the best-known upper bound was exponential in $k$. Our proof involves three crucial ingredients: A {\em quasiconvexity property\/} of work functions, a {\em duality lemma\/} that uses quasiconvexity to characterize the configuration that achieve maximum increase of the work function, and a {\em potential function\/} that exploits the duality lemma.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms.", } @Article{Verma:1995:TUH, author = "Rakesh M. Verma", title = "A Theory of Using History for Equational Systems with Applications", journal = j-J-ACM, volume = "42", number = "5", pages = "984--1020", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210130.html", abstract = "Implementation of programming language interpreters, proving theorem of the form A=B, implementation of abstract data types, and program optimization are all problems that can be reduced to the problem of finding a normal form for an expression with respect to a finite set of equations. In 1980, Chew proposed an elegant congruence closure based simplifier (CCNS) for computing with regular systems, which stores the history of it computations in a compact data structure. In 1990, Verma and Ramakrishnan showed that it can also be used for noetherian systems with no overlaps.\par In this paper, we develop a general theory of using CCNS for computing normal forms and present several applications. Our results are more powerful and widely applicable than earlier work. We present an independent set of postulates and prove that CCNS can be used for any system that satisfies them. (This proof is based on the notion of {\em strong closure\/}). We then show that CCNS can be used for consistent convergent systems and for various kinds of priority rewrite systems. This is the first time that the applicability of CCNS has been shown for priority systems. Finally, we present a new and simpler translation scheme for converting convergent systems into effectively nonoverlapping convergent priority systems. Such a translation scheme has been proposed earlier, but we show that it is incorrect.\par Because CCNS requires some strong properties of the given system, our demonstration of its wide applicability is both difficult and surprising. The tension between demands imposed by CCNS and our efforts to satisfy them gives our work much general significance. Our results are partly achieved through the idea of effectively simulating ``bad'' systems by almost-equivalent ``good'' ones, partly through our theory that substantially weakens the demands, and partly through the design of a powerful and unifying reduction proof method.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @Article{Awerbuch:1995:OTM, author = "Baruch Awerbuch and David Peleg", title = "Online Tracking of Mobile Users", journal = j-J-ACM, volume = "42", number = "5", pages = "1021--1058", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210132.html", abstract = "This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in a distributed network. The paper introduces the graph-theoretic concept of {\em regional matching}, and demonstrates how finding a regional matching with certain parameters enables efficient tracking. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; reliability; theory; verification", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Formal models. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Verification. {\bf B.4.4}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Performance Analysis and Design Aids, Worst-case analysis. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management, Network communication. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications.", } @Article{Tempero:1995:RST, author = "Ewan D. Tempero and Richard E. Ladner", title = "Recoverable Sequence Transmission Protocols", journal = j-J-ACM, volume = "42", number = "5", pages = "1059--1090", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210133.html", abstract = "We consider the sequence transmission problem, that is, the problem of transmitting an infinite sequence of messages $x_{1}x_{2}x_{3}\ldots{}$ over a channel that can both lose and reorder packets. We define performance measures, ideal transmission cost and recovery cost, for protocols that solve the sequence transmission problem. Ideal transmission cost measures the number of packets needed to deliver $x_{n}$ when the channel is behaving ideally and recovery cost measures how long it takes, in terms of number of messages delivered, for the ideal transmission cost to take hold once the channel begins behaving ideally. We also define lookahead, which measures the number of messages the sender can be ahead of the receiver in the protocol. We show that any protocol with constant recovery cost and lookahead requires linear ideal transmission cost. We describe a protocol, $P>_{\mbox{lin}}$, that has ideal transmission cost $2n$, recovery cost 1, and lookahead 0.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf C.2.2}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management.", } @Article{Kahale:1995:EER, author = "Nabil Kahale", title = "Eigenvalues and Expansion of Regular Graphs", journal = j-J-ACM, volume = "42", number = "5", pages = "1091--1106", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210136.html", abstract = "The spectral method is the best currently known technique to prove lower bounds on expansion. Ramanujan graphs, which have asymptotically optimal second eigenvalue, are the best-known explicit expanders. The spectral method yielded a lower bound of $k$/4 on the expansion of linear-sized subsets of $k$-regular Ramanujan graphs. We improve the lower bound on the expansion of Ramanujan graphs to approximately $k$/2. Moreover, we construct a family of $k$-regular graphs with asymptotically optimal second eigenvalue and linear expansion equal to $k$/2. This shows that $k/2$ is the best bound one can obtain using the second eigenvalue method. We also show an upper bound of roughly $1+k-1$ on the average degree of linear-sized induced subgraphs of Ramanujan graphs. This compares positively with the classical bound $2k-1$. As a byproduct, we obtain improved results on random walks on expanders and construct selection networks (respectively, extrovert graphs) of smaller size (respectively, degree) than was previously known.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Eigenvalues.", } @Article{Conforti:1995:CLP, author = "Michele Conforti and G{\'e}rard Cornu{\'e}jols", title = "A Class of Logic Problems Solvable by Linear Programming", journal = j-J-ACM, volume = "42", number = "5", pages = "1107--1113", month = sep, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Nov 27 18:20:58 1995", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/210137.html", abstract = "In propositional logic, several problems, such as satisfiability, MAX SAT and logical inference, can be formulated as integer programs. In this paper, we consider sets of clauses for which the corresponding integer programs can be solved as linear programs. We prove that balanced sets of clauses have this property.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems.", } @Article{Goemans:1995:IAA, author = "Michel X. Goemans and David P. Williamson", title = "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming", journal = j-J-ACM, volume = "42", number = "6", pages = "1115--1145", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227684.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms.", } @Article{Freivalds:1995:IFL, author = "R{\={u}}si{\c{n}}{\v{s}} Freivalds and Efim Kinber and Carl H. Smith", title = "On the Impact of Forgetting on Learning Machines", journal = j-J-ACM, volume = "42", number = "6", pages = "1146--1168", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227685.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning.", } @Article{Boyar:1995:SZK, author = "Joan Boyar and Gilles Brassard and Ren{\'e} Peralta", title = "Subquadratic zero-knowledge", journal = j-J-ACM, volume = "42", number = "6", pages = "1169--1193", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227686.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; security; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf E.3}: Data, DATA ENCRYPTION. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", } @Article{Bergstra:1995:ESC, author = "J. A. Bergstra and J. V. Tucker", title = "Equational specifications, complete term rewriting systems, and computable and semicomputable algebras", journal = j-J-ACM, volume = "42", number = "6", pages = "1194--1230", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227687.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @Article{Afek:1995:CFS, author = "Yehuda Afek and David S. Greenberg and Michael Merritt and Gadi Taubenfeld", title = "Computing with faulty shared objects", journal = j-J-ACM, volume = "42", number = "6", pages = "1231--1274", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227688.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; performance; reliability", subject = "{\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf B.5.1}: Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Memory design. {\bf B.3.4}: Hardware, MEMORY STRUCTURES, Reliability, Testing, and Fault-Tolerance. {\bf B.5.3}: Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Reliability and Testing.", } @Article{Toyama:1995:TDS, author = "Y. Toyama and J. W. Klop and H. P. Barendregt", title = "Termination for direct sums of left-linear complete term rewriting systems", journal = j-J-ACM, volume = "42", number = "6", pages = "1275--1304", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Aug 31 18:04:33 MDT 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/227689.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @Article{Anonymous:1995:AI, author = "Anonymous", title = "Author Index", journal = j-J-ACM, volume = "42", number = "6", pages = "1305--1306", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 09 09:49:13 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Anonymous:1995:SI, author = "Anonymous", title = "Subject Index", journal = j-J-ACM, volume = "42", number = "6", pages = "1307--1308", month = nov, year = "1995", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 09 09:49:13 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Afek:1996:LMG, author = "Yehuda Afek and Baruch Awerbuch and Serge Plotkin and Michael Saks", title = "Local management of a global resource in a communication network", journal = j-J-ACM, volume = "43", number = "1", pages = "1--19", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68M10 (68Q25 90Bxx)", MRnumber = "1 407 395", bibdate = "Thu Dec 05 11:46:30 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227596.html", abstract = "This paper introduces a new distributed data object called {\em Resource Controller\/} that provides an abstraction for managing the consumption of a global resource in a distributed system. Examples of resources that may be managed by such an object include; number of messages sent, number of nodes participating in the protocol, and total CPU time consumed.\par The Resource Controller object is accessed through a procedure that can be invoked at any node in the network. Before consuming a unit of resource at some node, the controlled algorithm should invoke the procedure at this node, requesting a {\em permit\/} or a {\em rejection}.\par The key characteristics of the Resource Controller object are the constraints that it imposes on the global resource consumption. An ($M, W$)-Controller guarantees that the total number of permits granted is at most $M$; it also ensures that, if a request is rejected, then at least $M - W$ permits are eventually granted, even if no more requests are made after the rejected one.\par In this paper, we describe several message and space0efficient implementations of the Resource Controller object. In particular, we present an ($M, W$)-Controller whose message complexity is $O(n \log^{2}n \log(M/(W + 1)))$ where $n$ is the total number of nodes. This is in contrast to the $O(nM)$ message complexity of a fully centralized controller which maintains a global counter of the number of granted permits at some distinguished node and relays all the requests to the node.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf C.2.3}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Operations. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Chen:1996:TED, author = "Weidong Chen and David S. Warren", title = "Tabled evaluation with delaying for general logic programs", journal = j-J-ACM, volume = "43", number = "1", pages = "20--74", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68N17 (68P15)", MRnumber = "1 407 396", bibdate = "Thu Dec 05 11:46:53 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227597.html", abstract = "SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stack-based memory management, SLDNF is often not appropriate for query evaluation for three reasons: (a) it may not terminate due to infinite positive recursion; (b) it may be terminate due to infinite recursion through negation; and (c) it may repeatedly evaluate the same literal in a rule body, leading to unacceptable performance.\par We address all three problems for goal-oriented query evaluation of general logic programs by presenting tabled evaluation with delaying, called {\em SLG resolution}. It has three distinctive features:\par (i) SLG resolution is a partial deduction procedure, consisting of seven fundamental transformations. A query is transformed step by step into a set of answers. The use of transformations separates logical issues of query evaluation from procedural ones. SLG allows an arbitrary computation rule for selecting a literal from a rule body and an arbitrary control strategy for selecting transformations to apply.\par (ii) SLG resolution is sound and search space complete with respect to the well-founded partial model for all non-floundering queries, and preserves all three-valued stable models. To evaluate a query under different three-valued stable models, SLG resolution can be enhanced by further processing of the answers of subgoals relevant to a query.\par (iii) SLG resolution avoids both positive and negative loops and always terminates for programs with the bounded-term-size property. It has a polynomial time data complexity for well-founded negation of function-free programs. Through a delaying mechanism for handling ground negative literals involved in loops, SLG resolution avoids the repetition of any of its derivation steps.\par Restricted forms of $S$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "management; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Joung:1996:CSC, author = "Yuh-Jzer Joung and Scott A. Smolka", title = "A comprehensive study of the complexity of multiparty interaction", journal = j-J-ACM, volume = "43", number = "1", pages = "75--115", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q10 (68M20 68N25 68Q25)", MRnumber = "1 407 397", bibdate = "Thu Dec 05 11:47:01 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227601.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "management; theory", subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management. {\bf D.4.7}: Software, OPERATING SYSTEMS, Organization and Design. {\bf F.2.3}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures.", } @Article{Alur:1996:BRP, author = "Rajeev Alur and Tom{\'a}s Feder and Thomas A. Henzinger", title = "The benefits of relaxing punctuality", journal = j-J-ACM, volume = "43", number = "1", pages = "116--146", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q60 (68Q10 68Q25 68Q55)", MRnumber = "1 407 398", bibdate = "Thu Dec 05 11:47:02 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227602.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory; verification", subject = "{\bf C.3}: Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems. {\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages.", } @Article{Miltersen:1996:ACM, author = "Peter Bro Miltersen and Mike Paterson and Jun Tarui", title = "The asymptotic complexity of merging networks", journal = j-J-ACM, volume = "43", number = "1", pages = "147--165", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q25 (68P10)", MRnumber = "1 407 399", bibdate = "Thu Dec 05 11:47:02 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227693.html", abstract = "Let M(m,n) be the minimum number of comparators needed in a comparator network that merges $m$ elements $x_{1}\le x_{2}\le \ldots{}\le x_{m}$ and $n$ elements $y_{1}\le y_{2}\le \ldots{}\le y_{n}$, where $n\ge m$. Batcher's odd-even merge yields the following upper bound: \par $$M(m,n)\le (1/2)(m+n)\log_2m+o(n)$$ in particular, $$M(n,n)\le n\log_2n+O(n)$$\par We prove the following lower bound that matches the upper bound above asymptotically as $n\ge m\rightarrow\infty$:\par $$M(m,n)\ge (1/2)(m+n)\log_2m-O(m);$$ \noindent in particular,\par $$M(n,n)\ge n\log_2n-O(n).$$\par Our proof technique extends to give similarly tight lower bounds for the size of monotone Boolean circuits for merging, and for the size of switching networks capable of realizing the set of permutations that arise from merging.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.", } @Article{Boyer:1996:APO, author = "Robert S. Boyer and Yuan Yu", title = "Automated proofs of object code for a widely used microprocessor", journal = j-J-ACM, volume = "43", number = "1", pages = "166--192", month = jan, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q60 (68T15)", MRnumber = "1 407 400", bibdate = "Thu Dec 05 11:47:02 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/227603.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf D.2.1}: Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program Verification. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Selman:1996:KCT, author = "Bart Selman and Henry Kautz", title = "Knowledge compilation and theory approximation", journal = j-J-ACM, volume = "43", number = "2", pages = "193--224", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68T30", MRnumber = "1 408 321", bibdate = "Thu Dec 05 11:47:03 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226644.html", abstract = "Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems, it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often too restrictive for practical applications, whereas the latter leads to uncertainty about exactly what can and cannot be inferred from the knowledge base. We present a third alternative, in which knowledge given in a general representation language is translated (compiled) into a tractable form---allowing for efficient subsequent query answering.\par We show how propositional logical theories can be compiled into Horn theories that approximate the original information. The approximations bound the original theory from below and above in terms of logical strength. The procedures are extended to other tractable languages (for example, binary clauses) and to the first-order case. Finally, we demonstrate the generality of our approach by compiling concept descriptions in a general frame-based language into a tractable form.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; experimentation; theory", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{Chandra:1996:UFD, author = "Tushar Deepak Chandra and Sam Toueg", title = "Unreliable failure detectors for reliable distributed systems", journal = j-J-ACM, volume = "43", number = "2", pages = "225--267", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68M10 (68M15 68P15 68Q10)", MRnumber = "1 408 322", bibdate = "Thu Dec 05 11:47:03 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226647.html", abstract = "We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties---completeness and accuracy. We show that Consensus can be solved even with unreliable failure detectors that make an infinite number of mistakes, and determine which ones can be used to solve Consensus despite any number of crashes, and which ones require a majority of correct processes. We prove that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast. A companion paper shows that one of the failure detectors introduced here is the weakest failure detector for solving Consensus [Chandra et al. 1992].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Feige:1996:IPH, author = "Uriel Feige and Shafi Goldwasser and Laszlo Lov{\'a}sz and Shmuel Safra and Mario Szegedy", title = "Interactive proofs and the hardness of approximating cliques", journal = j-J-ACM, volume = "43", number = "2", pages = "268--292", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q15 (68Q25)", MRnumber = "1 408 323", bibdate = "Thu Dec 05 11:47:04 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226652.html", abstract = "The contribution of this paper is two-fold. First, a connection is established between approximating the size of the largest clique in a graph and multi-prover interactive proofs. Second, an efficient multi-prover interactive proof for NP languages is constructed, where the verifier uses very few random bits and communication bits. Last, the connection between cliques and efficient multi-prover interaction proofs, is shown to yield hardness results on the complexity of approximating the size of the largest clique in a graph.\par Of independent interest is our proof of correctness for the multilinearity test of functions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Bhatt:1996:OEB, author = "Sandeep N. Bhatt and Fan R. K. Chung and Jia-Wei Hong and F. Thomson Leighton and Bojana Obreni{\'c} and Arnold L. Rosenberg and Eric J. Schwabe", title = "Optimal emulations by butterfly-like networks", journal = j-J-ACM, volume = "43", number = "2", pages = "293--330", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68M10 (68R10)", MRnumber = "1 408 324", bibdate = "Thu Dec 05 11:47:07 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226658.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf C.1.2}: Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Goodrich:1996:SPP, author = "Michael T. Goodrich and S. Rao Kosaraju", title = "Sorting on a parallel pointer machine with applications to set expression evaluation", journal = j-J-ACM, volume = "43", number = "2", pages = "331--361", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68P10 (68P05 68Q22 68Q25)", MRnumber = "1 408 325", bibdate = "Thu Dec 05 11:47:07 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226670.html", abstract = "We present optimal algorithms for sorting on parallel CREW and EREW versions of the pointer machine model. Intuitively, one can view our methods as being based on a parallel mergesort using linked lists rather than arrays (the usual parallel data structure). We also show how to exploit the ``locality'' of our approach to solve the set expression evaluation problem, a problem with applications to database querying and logic-programming in $O(\log n)$ time using $O(n)$ processors. Interestingly, this is an asymptotic improvement over what seems possible using previous techniques.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.1}: Data, DATA STRUCTURES, Arrays. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Curien:1996:CPW, author = "Pierre-Louis Curien and Th{\'e}r{\`e}se Hardin and Jean-Jacques L{\'e}vy", title = "Confluence properties of weak and strong calculi of explicit substitutions", journal = j-J-ACM, volume = "43", number = "2", pages = "362--397", month = mar, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q55 (03Bxx 68Q42)", MRnumber = "1 408 326", bibdate = "Thu Dec 05 11:47:07 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/226675.html", abstract = "Categorical combinators [Curien 1986/1993; Hardin 1989; Yokouchi 1989] and more recently [lambda][sigma]-calculus [Abadi 1991; Hardin and L{\'e}vy 1989], have been introduced to provide an explicit treatment of substitutions in the [lambda]-calculus. We reintroduce here the ingredients of these calculi in a self-contained and stepwise way, with a special emphasis on confluence properties. The main new results of the paper with respect to Curien [1986/1993], Hardin [1989], Abadi [1991], and Hardin and L{\'e}vy [1989] are the following:\par (1) We present a confluent weak calculus of substitutions, where no variable clashes can be feared; (2) We solve a conjecture raised in Abadi [1991]: [lambda][sigma]-calculus is not confluent (it is confluent on ground terms only).\par This unfortunate result is ``repaired'' by presenting a confluent version of [lambda][sigma]-calculus, named the $\lambda${\em Env\/}-calculus in Hardin and L{\'e}vy [1989], called here the confluent $\lambda \sigma$-calculus.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @Article{Santos:1996:LPF, author = "Eugene {Santos, Jr.}", title = "On Linear Potential Functions for Approximating {Bayesian} Computations", journal = j-J-ACM, volume = "43", number = "3", pages = "399--430", month = may, year = "1996", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/233551.233552", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Txx", MRnumber = "1 408 561", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/233552.html", abstract = "Probabilistic reasoning suffers from NP-hard implementations. In particular, the amount of probabilistic information necessary to the computations is often overwhelming. For example, the size of conditional probability tables in Bayesian networks has long been a limiting factor in the general use of these networks.\par We present a new approach for manipulating the probabilistic information given. This approach avoids being overwhelmed by essentially compressing the information using approximation functions called linear potential functions. We can potentially reduce the information from a combinatorial amount to roughly linear in the number of random variable assigments. Furthermore, we can compute these functions through closed form equations. As it turns out, our approximation method is quite general and may be applied to other data compression problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; experimentation; theory", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS, Approximation. {\bf G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf I.5}: Computing Methodologies, PATTERN RECOGNITION.", } @Article{Goldreich:1996:SPS, author = "Oded Goldreich and Rafail Ostrovsky", title = "Software protection and simulation on oblivious {RAMs}", journal = j-J-ACM, volume = "43", number = "3", pages = "431--473", month = may, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q05 (68M10 68P25)", MRnumber = "1 408 562", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/233553.html", abstract = "Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper, we provide theoretical treatment of software protection. We reduce the problem of software protection to the problem of efficient simulation on {\em oblivious\/} RAM.\par A machine is {\em oblivious\/} if the sequence in which it accesses memory locations is equivalent for any two inputs with the same running time. For example, an oblivious Turing Machine is one for which the movement of the heads on the tapes is identical for each computation. (Thus, the movement is independent of the actual input.) {\em What is the slowdown in the running time of a machine, if it is required to be oblivious?\/} In 1979, Pippenger and Fischer showed how a two-tape {\em oblivious\/} Turing Machine can simulate, on-line, a one-tape Turing Machine, with a logarithmic slowdown in the running time. We show an analogous result for the random-access machine (RAM) model of computation. In particular, we show how to do an on-line simulation of an arbitrary RAM by a probabilistic {\em oblivious\/} RAM with a polylogarithmic slowdown in the running time. On the other hand, we show that a logarithmic slowdown is a lower bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "security; theory", subject = "{\bf C.2.0}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Security and protection. {\bf E.3}: Data, DATA ENCRYPTION. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices.", } @Article{Marcus:1996:FMD, author = "Sherry Marcus and V. S. Subrahmanian", title = "Foundations of multimedia database systems", journal = j-J-ACM, volume = "43", number = "3", pages = "463--523", month = may, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68P15", MRnumber = "1 408 563", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/233554.html", abstract = "Though numerous multimedia systems exist in the commercial market today, relatively little work has been done on developing the mathematical foundation of multimedia technology. We attempt to take some initial steps towards the development of a theoretical basis for a multimedia information system. To do so, we develop the motion of a structured multimedia database system. We begin by defining a mathematical model of a media-instance. A media-instance may be thought of as ``glue'' residing on top of a specific physical media-representation (such as video, audio, documents, etc). Using this ``glue'', it is possible to define a general purpose logical query language to query multimedia data. This glue consists of a set of ``states'' (e.g., video frames, audio tracks, etc.) and ``features'', together with relationships between states and/or features. A structured multimedia database system imposes a certain mathematical structures on the set of features/states. Using this notion of a structure, we are able to define indexing structures for processing queries, methods to relax queries when answers do not exist to those queries, as well as sound, complete and terminating procedures to answer such queries (and their relaxations, when appropriate). We show how a media-presentation can be generated by processing a sequence of queries, and furthermore we show that when these queries are extended to include {\em constraints}, then these queries can not only generate presentations, but also generate temporal synchronization properties and spatial layout properties for such presentations. We describe the architecture of a prototype multimedia database system based on the principles described in this paper.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages. {\bf H.2.5}: Information Systems, DATABASE MANAGEMENT, Heterogeneous Databases.", } @Article{Nederhof:1996:LTS, author = "Mark-Jan Nederhof and Eberhard Bertsch", title = "Linear-Time Suffix Parsing for Deterministic Languages", journal = j-J-ACM, volume = "43", number = "3", pages = "524--554", month = may, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q52 (68Q45 68Q50 68Q68)", MRnumber = "1 408 564", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/233555.html", abstract = "We present a linear-time algorithm to decide for any fixed deterministic context-free language $L$ and input string $w$ whether $w$is a suffix of some string in $L$. In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses) without an increase in time complexity. We also show how this algorithm may be applied to process incorrect input in linear time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory; verification", subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Parsing. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing.", } @Article{vanGlabbeek:1996:BTA, author = "Rob J. {van Glabbeek} and W. Peter Weijland", title = "Branching Time and Abstraction in Bisimulation Semantics", journal = j-J-ACM, volume = "43", number = "3", pages = "555--600", month = may, year = "1996", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/233551.233556", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q10 (68Q55 68Q60)", MRnumber = "1 408 565", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/233556.html", abstract = "In comparative concurrency semantics, one usually distinguishes between {\em linear time\/} and {\em branching time\/} semantic equivalences. Milner's notion of {\em observation equivalence\/} is often mentioned as the standard example of a branching time equivalence. In this paper we investigate whether observation equivalence really does respect the branching structure of processes, and find that in the presence of the unobservable action $^*$ of CCS this is not the case.\par Therefore, the notion of {\em branching bisimulation equivalence\/} is introduced which strongly preserves the branching structure of processes, in the sense that it preserves computations together with the potentials in all intermediate states that are passed through, even if silent moves are involved. On closed CCS-terms branching bisimulation congruence can be completely axiomatized by the single axiom scheme:\par $$a . (\tau . (y + z) + y) = a . (y + z)$$\par \noindent (where $a$ ranges over all actions) and the usual laws for strong congruence.\par We also establish that for sequential processes observation equivalence is not preserved under refinement of actions, whereas branching bisimulation is.\par For a large class of processes, it turns out that branching bisimulation and observation equivalence are the same. As far as we know, all protocols that have been verified in the setting of observation equivalence happen to fit in this class, and hence are also valid in the stronger setting of branching bisimulation equivalence.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages.", } @Article{Karger:1996:NAM, author = "David R. Karger and Clifford Stein", title = "A new approach to the minimum cut problem", journal = j-J-ACM, volume = "43", number = "4", pages = "601--640", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68R10 (68Q25)", MRnumber = "1 409 212", bibdate = "Tue Sep 09 07:55:44 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234534.html", abstract = "This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in a graph's minimum cut form an extremely small fraction of the graph's edges. Using this idea, we give a randomized, strongly polynomial algorithm that finds the minimum cut in an arbitrarily weighted undirected graph with high probability. The algorithm runs in $O(n^{2}\log^{3}n)$ time, a significant improvement over the previous $\tilde{O}(mn)$ time bounds based on maximum flows. It is simple and intuitive and uses no complex data structures. Our algorithm can be parallelized to run in {\em RNL\/} with $n^{2}$ processors; this gives the first proof that the minimum cut problem can be solved in {\em RNL}. The algorithm does more than find a single minimum cut; it finds all of them.\par With minor modifications, our algorithm solves two other problems of interest. Our algorithm finds all cuts with value within a multiplicative factor of [alpha] of the minimum cut's in expected $\tilde{O}(n^{2[alpha]})$ time, or in {\em RNL\/} with $n^{2[alpha]}$ processors. The problem of finding a minimum multiway cut of graph into $r$ pieces is solved in expected $\tilde{O}(n^{2(r-1)})$ time, or in {\em RNL\/} with $n^{2(r-1)}$ processors. The ``trace'' of the algorithm's execution on these two problems forms a new compact data structure for representing all small cuts and all multiway cuts in a graph. This data structure can be efficiently transformed into the more standard cactus representing for minimum cuts.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms.", } @Article{Cheng:1996:BEI, author = "William C. Cheng and Richard R. Muntz", title = "Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queuing Networks", journal = j-J-ACM, volume = "43", number = "4", pages = "641--669", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234539.html", abstract = "Product-form queuing network models have been widely used to model systems with shared resources such as computer systems (both centralized and distributed), communication networks, and flexible manufacturing systems. Closed multichain product-form networks are inherently more difficult to analyze than open networks, due to the effect of normalization. Results in workload characterization for closed networks in the literature are often for networks having special structures and only specific performance measures have been considered.\par In this article, we drive certain properties (insensitivity of conditional state probability distributions and fractional-linearity of Markov reward functions) for a broad class of closed multichain product-form networks. These properties are derived using the most basic flow balance conditions of product-form networks. Then we show how these basic properties can be applied in obtaining error bounds when similar customers are clustered together to speed up computation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Queueing theory. {\bf G.m}: Mathematics of Computing, MISCELLANEOUS, Queueing theory.", } @Article{Koscielski:1996:CMA, author = "Antoni Ko{\'s}cielski and Leszek Pacholski", title = "Complexity of {Makanin}'s algorithm", journal = j-J-ACM, volume = "43", number = "4", pages = "670--684", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q25 (68R15)", MRnumber = "1 409 214", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234543.html", abstract = "The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a word equation is of order $2^{1.07d}$, where $d$ is the length of the equation. We also give a lower bound $2^{0.29d}$ so our upper bound is almost optimal and exponentially better than the original bound {\em $(6d)^{22d4}+ 2$}. Consequently, our result implies an exponential improvement of known upper bounds on complexity of word-unification algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", } @Article{Chandra:1996:WFD, author = "Tushar Deepak Chandra and Vassos Hadzilacos and Sam Toueg", title = "The Weakest Failure Detector for Solving Consensus", journal = j-J-ACM, volume = "43", number = "4", pages = "685--722", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68M15 (68M10 68Q10)", MRnumber = "1 409 215", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234549.html", abstract = "We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [1996], it is shown that $W$, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper, we prove that to solve Consensus, any failure detector has to provide at least as much information as W. Thus, W is indeed the weakest failure detector for solving Consensus in asynchronous systems with a majority of correct processes.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf C.4}: Computer Systems Organization, PERFORMANCE OF SYSTEMS, Reliability, availability, and serviceability. {\bf D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Concurrency. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing.", } @Article{Li:1996:HSC, author = "Ming Li and John Tromp and Paul M. B. Vit{\'a}nyi", title = "How to Share Concurrent Wait-Free Variables", journal = j-J-ACM, volume = "43", number = "4", pages = "723--746", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q10 (68N25)", MRnumber = "1 409 216", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234556.html", abstract = "Sharing data between multiple asynchronous users---each of which can atomically read and write the data---is a feature that may help to increase the amount of parallelism in distributed systems. An algorithm implementing this feature is presented. The main construction of an $n$-user atomic variable directly from single-writer, single-reader atomic variables uses $O(n)$ control bits and $O(n)$ accesses per Read/Write running in $O(1)$ parallel time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "management", subject = "{\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design Styles. {\bf B.4.3}: Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems). {\bf D.4.1}: Software, OPERATING SYSTEMS, Process Management. {\bf D.4.4}: Software, OPERATING SYSTEMS, Communications Management.", } @Article{Bshouty:1996:FSM, author = "Nader H. Bshouty and Christino Tamon", title = "On the {Fourier} Spectrum of Monotone Functions", journal = j-J-ACM, volume = "43", number = "4", pages = "747--770", month = jul, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", MRclass = "68Q25 (68Q15 68T05)", MRnumber = "1 409 217", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234564.html", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms. {\bf F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf G.3}: Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo). {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning.", } @Article{Vitter:1996:OPD, author = "Jeffrey Scott Vitter and P. Krishnan", title = "Optimal prefetching via data compression", journal = j-J-ACM, volume = "43", number = "5", pages = "771--793", month = sep, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234753.html", abstract = "Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in competitive online algorithms has uncovered several promising new algorithms for caching. In this paper, we apply a form of the competitive philosophy for the first time to the problem of prefetching to develop an optimal universal prefetcher in terms of fault rate, with particular applications to large-scale databases and hypertext systems. Our prediction algorithms with particular applications to large-scale databases and hypertext systems. Our prediction algorithms for prefetching are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, you have to be able to predict future data well, and thus good data compressors should be able to predict well for purposes of prefetching. We show for powerful models such as Markov sources and $m$th order Markov sources that the page fault rate incurred by our prefetching algorithms are optimal in the limit for almost all sequences of page requests.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; performance; theory", subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Swapping. {\bf D.4.2}: Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf D.4.8}: Software, OPERATING SYSTEMS, Performance, Stochastic analysis. {\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning.", } @Article{Busch:1996:CTB, author = "Costas Busch and Marios Mavronicolas", title = "A combinatorial treatment of balancing networks", journal = j-J-ACM, volume = "43", number = "5", pages = "794--839", month = sep, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234754.html", abstract = "Balancing networks, originally introduced by Aspnes et al. ({\em Proceedings of the 23rd Annual ACM Symposium on Theory of Computing}, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures suitable for solving many fundamental multi-processor coordination problems that can be expressed as {\em balancing problems}. In this work, we present a mathematical study of the combinatorial structure of balancing networks, and a variety of its applications.\par Our study identifies important combinatorial {\em transfer parameters\/} of balancing networks. In turn, necessary and sufficient combinatorial conditions are established, expressed in terms of transfer parameters, which precisely characterize many important and well studied classes of balancing networks such as {\em counting networks\/} and {\em smoothing networks}. We propose these combinatorial conditions to be ``balancing analogs'' of the well known {\em Zero-One principle\/} holding for {\em sorting networks\/}\par Within the combinatorial framework we develop, our first application is in deriving combinatorial conditions, involving the transfer parameters, which precisely delimit the boundary between counting networks and sorting networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf C.2.1}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology. {\bf C.2.4}: Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed applications. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Counting problems. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @Article{Hellerstein:1996:HMQ, author = "Lisa Hellerstein and Krishnan Pillaipakkamnatt and Vijay Raghavan and Dawn Wilkins", title = "How many queries are needed to learn?", journal = j-J-ACM, volume = "43", number = "5", pages = "840--862", month = sep, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234755.html", abstract = "We investigate the query complexity of exact learning in the membership and (proper) equivalence query model. We give a complete characterization of concept classes that are learnable with a polynomial number of polynomial sized queries in this model. We give applications of this characterization, including results on learning a natural subclass of DNF formulas, and on learning with membership queries alone. Query complexity has previously been used to prove lower bounds on the time complexity of exact learning. We show a new relationship between query complexity and time complexity in exact learning: If any ``honest'' class is exactly and properly learnable with polynomial query complexity, but not learnable in polynomial time, then P = NP. In particular, we show that an honest class is exactly polynomial-query learnable if and only if it is learnable using an oracle for $[Gamma]^{p}_{4}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; theory", subject = "{\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Interactive computation. {\bf F.1.3}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning. {\bf I.2.6}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction.", } @Article{Bol:1996:MNP, author = "Roland Bol and Jan Friso Groote", title = "The meaning of negative premises in transition system specifications", journal = j-J-ACM, volume = "43", number = "5", pages = "863--914", month = sep, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 5 11:52:29 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234756.html", abstract = "We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile constructing this transition relation. Both the criterion and the techniques originate from logic programming [van Gelder et al. 1988; Gelfond and Lifschitz 1988] to which TSSs are close. In an appendix we provide an extensive comparison between them.\par As in Groote [1993], we show that the bisimulation relation induced by a TSS is a congruence, provided that it is in {\em ntyft/ntyxt\/}-format and can be proved meaningful using our techniques. We also considerably extend the conservativity theorems of Groote[1993] and Groote and Vaandrager [1992]. As a running example, we study the combined addition of priorities and abstraction to Basic Process Algebra (BPA). Under some reasonable conditions we show that this TSS is indeed meaningful, which could not be shown by other methods [Bloom et al. 1995; Groote 1993]. Finally, we provide a sound and complete axiomatization for this example.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.", } @Article{Baeza-Yates:1996:FTS, author = "Richardo A. Baeza-Yates and Gaston H. Gonnet", title = "Fast text searching for regular expressions or automaton searching on tries", journal = j-J-ACM, volume = "43", number = "6", pages = "915--936", month = nov, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 27 15:34:59 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/235810.html", abstract = "We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as a logical model for the index. We obtain searching algorithms that run in logarithmic expected time in the size of the text for a wide subclass of regular expressions, and in sublinear expected time for any regular expression. This is the first such algorithm to be found with this complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Omlin:1996:CDF, author = "Christian W. Omlin and C. Lee Giles", title = "Constructing deterministic finite-state automata in recurrent neural networks", journal = j-J-ACM, volume = "43", number = "6", pages = "937--972", month = nov, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 27 15:34:59 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/235811.html", abstract = "Recurrent neural networks that are {\em trained\/} to behave like deterministic finite-state automata (DFAs) can show deteriorating performance when tested on long strings. This deteriorating performance can be attributed to the instability of the internal representation of the learned DFA states. The use of a sigmoidal discriminant function together with the recurrent structure contribute to this instability. We prove that a simple algorithm can {\em construct\/} second-order recurrent neural networks with a sparse interconnection topology and sigmoidal discriminant function such that the internal DFA state representations are stable, that is, the constructed network correctly classifies strings of {\em arbitrary length}. The algorithm is based on encoding strengths of weights directly into the neural network. We derive a relationship between the weight strength and the number of DFA states for robust string classification. For a DFA with $n$ state and $m$ input alphabet symbols, the constructive algorithm generates a ``programmed'' neural network with $O(n)$ neurons and $O(m n)$ weights. We compare our algorithm to other methods proposed in the literature.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf B.2.2}: Hardware, ARITHMETIC AND LOGIC STRUCTURES, Performance Analysis and Design Aids, Simulation. {\bf B.2.2}: Hardware, ARITHMETIC AND LOGIC STRUCTURES, Performance Analysis and Design Aids, Verification. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Self-modifying machines. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Stability (and instability). {\bf G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Nonlinear approximation.", } @Article{Aggarwal:1996:ERO, author = "Alok Aggarwal and Amotz Bar-Noy and Don Coppersmith and Rajiv Ramaswami and Baruch Schieber and Madhu Sudan", title = "Efficient routing in optical networks", journal = j-J-ACM, volume = "43", number = "6", pages = "973--1001", month = nov, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 27 15:34:59 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/235812.html", abstract = "This paper studies the problem of dedicating routes to connections in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper considers optical networks with and without switches, and different types of routing in these networks. It presents optimal or near-optimal constructions of optical networks in these cases and algorithms for routing connections, specifically permutation routing for the networks constructed here.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.1}: Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Basu:1996:CAC, author = "Saugata Basu and Marie-Fran{\c{c}}oise Roy", title = "On the combinatorial and algebraic complexity of quantifier elimination", journal = j-J-ACM, volume = "43", number = "6", pages = "1002--1045", month = nov, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 27 15:34:59 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/235813.html", abstract = "In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the dependence on the number of polynomials) are separated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.4.3}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems.", } @Article{Sippu:1996:AMS, author = "Seppo Sippu and Eljas Soisalon-Soininen", title = "An analysis of magic sets and related optimization strategies for logic queries", journal = j-J-ACM, volume = "43", number = "6", pages = "1046--1088", month = nov, year = "1996", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 27 15:34:59 MST 1996", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/235814.html", abstract = "We analyze the optimization effect of the ``magic sets'' rewriting technique for datalog queries and present some supplementary or alternative techniques that avoid many shortcomings of the basic technique. Given a magic sets rewritten query, the set of facts generated for the original, nonmagic predicates by the seminaive bottom-up evaluation is characterized precisely. It is shown that---because of the additional magic facts---magic sets processing may result in generating an order of magnitude more facts than the straightforward naive evaluation. A refinement of magic sets in {\em factorized magic sets\/} is defined. These magic sets retain most of the efficiency of original magic sets in regards to the number of nonmagic facts generated and have the property that a linear-time bound with respect to seminaive evaluation is guaranteed in all cases. An alternative technique for magic sets, called {\em envelopes}, which has several desirable properties over magic sets, is introduced. Envelope predicates are never recursive with the original predicates; thus, envelopes can be computed as a preprocessing task. Envelopes also allow the utilization of multiple sideways information passing strategies (sips) for a rule. An envelope-transformed program may be ``readorned'' according to another choice of sips and reoptimized by magic sets (or envelopes), thus making possible an optimization effect that cannot be achieved by magic sets based on a particular choice of sips.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming.", } @Article{Miller:1997:SSP, author = "Gary L. Miller and Shang-Hua Teng and William Thurston and Stephen A. Vavasis", title = "Separators for Sphere-Packings and Nearest Neighbor Graphs", journal = j-J-ACM, volume = "44", number = "1", pages = "1--29", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abiteboul:1997:FLR, author = "Serge Abiteboul and Moshe Y. Vardi and Victor Vianu", title = "Fixpoint Logics, Relational Machines, and Computational Complexity", journal = j-J-ACM, volume = "44", number = "1", pages = "30--56", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Morishita:1997:ACP, author = "Shinichi Morishita", title = "Avoiding {Cartesian} Products for Multiple Joins", journal = j-J-ACM, volume = "44", number = "1", pages = "57--85", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Awerbuch:1997:MCD, author = "Baruch Awerbuch and Leonard J. Schulman", title = "The Maintenance of Common Data in a Distributed System", journal = j-J-ACM, volume = "44", number = "1", pages = "86--103", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Koch:1997:WPE, author = "Richard R. Koch and F. T. Leighton and Bruce M. Maggs and Satish B. Rao and Arnold L. Rosenberg and Eric J. Schwabe", title = "Work-Preserving Emulations of Fixed-Connection Networks", journal = j-J-ACM, volume = "44", number = "1", pages = "104--147", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ishii:1997:OTP, author = "Alexander T. Ishii and Charles E. Leiserson and Marios C. Papaefthymiou", title = "Optimizing Two-Phase, Level-Clocked Circuitry", journal = j-J-ACM, volume = "44", number = "1", pages = "148--199", month = jan, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:02:36 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bistarelli:1997:SBC, author = "Stefano Bistarelli and Ugo Montanari and Francesca Rossi", title = "Semiring-Based Constraint Satisfaction and Optimization", journal = j-J-ACM, volume = "44", number = "2", pages = "201--236", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:14:06 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jiang:1997:THB, author = "Tao Jiang and Joel I. Seiferas and Paul M. B. Vit{\'a}nyi", title = "Two Heads Are Better than Two Tapes", journal = j-J-ACM, volume = "44", number = "2", pages = "237--256", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:14:06 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Frandsen:1997:DWP, author = "Gudmund Skovbjerg Frandsen and Peter Bro Miltersen and Sven Skyum", title = "Dynamic Word Problems", journal = j-J-ACM, volume = "44", number = "2", pages = "257--271", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:14:06 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{VandenBussche:1997:COC, author = "Jan {Van den Bussche} and Dirk {Van Gucht} and Marc Andries and Marc Gyssens", title = "On the Completeness of Object-Creating Database Transformation Languages", journal = j-J-ACM, volume = "44", number = "2", pages = "272--319", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:14:06 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bibel:1997:DTR, author = "W. Bibel and E. Eder", title = "Decomposition of Tautogies into Regular Formulas and Strong Completeness of Connection-Graph Resolution", journal = j-J-ACM, volume = "44", number = "2", pages = "320--344", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 28 11:23:54 2001", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Dedicated to J. A. Robinson. See erratum \cite{Siekmann:2001:ECW}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wagner:1997:EUE, author = "Robert A. Wagner", title = "Evaluating Uniform Expressions Within Two Steps of Minimum Parallel Time", journal = j-J-ACM, volume = "44", number = "2", pages = "345--361", month = mar, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 26 19:14:06 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:1997:BEC, author = "Joseph Halpern", title = "On Becoming {Editor-in-Chief} of {JACM}", journal = j-J-ACM, volume = "44", number = "3", pages = "363--365", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 07:50:52 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Liu:1997:EBA, author = "Zhen Liu and Philippe Nain and Don Towsley", title = "Exponential bounds with applications to call admission", journal = j-J-ACM, volume = "44", number = "3", pages = "366--394", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 08:00:21 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1997-44-3/p366-liu/", abstract = "In this paper, we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Specifically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queuing theory and numerical comparisons with other bounds and exact results are presented. The paper concludes with two applications to admission control in multimedia systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "performance; theory", subject = "{\bf C.2.0} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf I.6.5} Computing Methodologies, SIMULATION AND MODELING, Model Development", } @Article{Mohring:1997:MRB, author = "Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann and Karsten Weihe", title = "Mesh refinement via bidirected flows: modeling, complexity, and computational results", journal = j-J-ACM, volume = "44", number = "3", pages = "395--426", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 08:00:30 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1997-44-3/p395-hohring/", abstract = "We investigate a problem arising in the computer-aided design of cars, planes, ships, trains, and other motor vehicles and machines: refine a mesh of curved polygons, which approximates the surface of a workpiece, into quadrilaterals so that the resulting mesh is suitable for a numerical analysis. This mesh refinement problem turns out to be strongly {\em NP\/}-hard In commercial CAD systems, this problem is usually solved using a gree dy approach. However, these algorithms leave the user a lot of patchwork to do afterwards. We introduce a new global approach, which is based on network flow techniques. Abstracting from all geometric and numerical aspects, we obtain an undirected graph with upper and lower capacities on the edges and some additional node constraints. We reduce this problem to a sequence of bidirected flwo problems (or, equivalently, to $b$-matching problems). For the first time, network flow techniques are applied to a mesh refinement problem. This approach avoids the local traps of greedy approaches and yields solutions that require significantly less additional patchwork.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; experimentation", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf J.6} Computer Applications, COMPUTER-AIDED ENGINEERING, Computer-aided design (CAD). {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", } @Article{Cesa-Bianchi:1997:HUE, author = "Nicol{\`o} Cesa-Bianchi and Yoav Freund and David Haussler and David P. Helmbold and Robert E. Schapire and Manfred K. Warmuth", title = "How to use expert advice", journal = j-J-ACM, volume = "44", number = "3", pages = "427--485", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 08:00:35 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1997-44-3/p427-cesa-bianchi/", abstract = "We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called {\em experts}. Our analysis is for worst-case situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the algorithm by the difference between the expected number of mistakes it makes on the bit sequence and the expected number of mistakes made by the best expert on this sequence, where the expectation is taken with respect to the randomization in the predictions. We show that the minimum achievable difference is on the order of the square root of the number of mistakes of the best expert, and we give efficient algorithms that achieve this. Our upper and lower bounds have matching leading constants in most cases. We then show how this leads to certain kinds of pattern recognition/learning algorithms with performance bounds that improve on the best results currently know in this context. We also compare our analysis to the case in which log loss is used instead of the expected number of mistakes", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Automatic analysis of algorithms. {\bf I.2.1} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems. {\bf I.2.6} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Knowledge acquisition", } @Article{Aspnes:1997:LRV, author = "James Aspnes and Yossi Azar and Amos Fiat and Serge Plotkin and Orli Waarts", title = "On-line routing of virtual circuits with applications to load balancing and machine scheduling", journal = j-J-ACM, volume = "44", number = "3", pages = "486--504", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 08:00:39 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1997-44-3/p486-aspnes/", abstract = "In this paper we study the problem of on-line allocation of routes to virtual circuits (both {\em point-to-point\/} and {\em multicast\/}) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of {\em Permanent\/} virtual circuits (i.e., once a circuit is established it exists forever), and describe an algorithm that achieves on $O(\log n)$ competitive ratio with respect to maximum congestion, where $n$ is the number of nodes in the network. Informally, our results show that instead of knowing all of the future requests, it is sufficient to increase the bandwidth of the communication links by an $O(\log n)$ factor. We also show that this result is tight, that is, for any on-line algorithm there exists a scenario in which $O(\log n)$ increase in bandwidth is necessary in directed networks. We view virtual circuit routing as a generalization of an on-line load balancing problem, defined as follows: jobs arrive on line and each job must be assigned to one of the machines immediately upon arrival. Assigning a job to a machine increases the machine's load by an amount that depends both on the job and on the machine. The goal is to minimize the maximum load. For the {\em related machines\/} case, we describe the first algorithm that achieves constant competitive ratio. for the {\em unrelated\/} case (with $n$ machines), we describe a new method that yields $O(\log n)$-competitive algorithm. This stands in contrast to the natural greed approach, whose competitive ratio is exactly $n$. show that this result is tight, that is, for any on-line algorithm there exists a scenario in which $(\log n)$ increase in bandwidth is necessary in directed networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design", } @Article{Sekar:1997:PLS, author = "R. Sekar and I. V. Ramakrishnan and P. Mishra", title = "On the power and limitations of strictness analysis", journal = j-J-ACM, volume = "44", number = "3", pages = "505--525", month = may, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 09 08:00:47 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1997-44-3/p505-sekar/", abstract = "Strictness analysis is an important technique for optimization of lazy functional languages. It is well known that all strictness analysis methods are {\em incomplete}, i.e., fail to report some strictness properties. In this paper, we provide a precise and formal characterization of the loss of information that leads to this incompleteness. Specifically, we establish the following characterization theorem for Mycroft's strictness analysis method and a generalization of this method, called {\em ee-analysis}, that reasons about exhaustive evaluation in nonflat domains: {\em Mycroft's method will deduce a strictness property for program $P$ iff the property is independent of any constant appearing in any evaluation of $P$.\/} To prove this, we specify a small set of equations, called {\em E-axioms}, that capture the information loss in Mycroft's method and develop a new proof technique called {\em E-rewriting}. $E$-rewriting extends the standard notion of rewriting to permit the use of reductions using $E$-axioms interspersed with standard reduction steps. $E$-axioms are a syntactic characterization of information loss and $E$-rewriting provides and {\em algorithm-independent\/} proof technique for characterizing the power of analysis methods. It can be used to answer questions on completeness and incompleteness of Mycroft's method on certain natural classes of programs. Finally, the techniques developed in this paper provide a general principle for establishing similar results for other analysis methods such as those based on abstract interpretation. As a demonstration of the generality of our technique, we give a characterization theorem for another variation of Mycroft's method called {\em dd\/}-analysis.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; measurement; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers", } @Article{Jeavons:1997:CPC, author = "Peter Jeavons and David Cohen and Marc Gyssens", title = "Closure properties of constraints", journal = j-J-ACM, volume = "44", number = "4", pages = "527--548", month = jul, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 26 06:43:32 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p527-jeavons/", abstract = "Many combinatorial search problems can be expressed as ``constraint satisfaction problems'' and this class of problems is known to be NP-complete in general. In this paper, we investigate the subclasses that arise from restricting the possible constraint types. We first show that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition. We then investigate all the different possible forms of this algebraic closure property, and establish which of these are sufficient to ensure tractability. As examples, we show that all known classes of tractable constraints over finite domains can be characterized by such an algebraic closure property. Finally, we describe a simple computational procedure that can be used to determine the closure properties of a given set of constraints. This procedure involves solving a particular constraint satisfaction problem, which we call an ``indicator problem.''", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory; verification", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{vanBeek:1997:CTL, author = "Peter {van Beek} and Rina Dechter", title = "Constraint tightness and looseness versus local and global consistency", journal = j-J-ACM, volume = "44", number = "4", pages = "549--566", month = jul, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:07:56 2003", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See erratum \cite{Zhang:2003:EPV}.", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p549-van_beek/", abstract = "Constraint networks are a simple representation and reasoning framework with diverse applications. In this paper, we identify two new complementary properties on the restrictiveness of the constraints in a network---{\em constraint tightness\/} and {\em constraint looseness\/}---and we show their usefulness for estimating the level of local consistency needed to ensure global consistency, and for estimating the level of local consistency present in a network. In particular, we present a sufficient condition, based on constraint tightness and the level of local consistency, that guarantees that a solution can be found in a backtrack-free manner. The condition can be useful in applications where a knowledge base will be queried over and over and the preprocessing costs can be amortized over many queries. We also present a sufficient condition for local consistency, based on constraint looseness, that is straightforward and inexpensive to determine. The condition can be used to estimate the level of local consistency of a network. This in turn can be used in deciding whether it would be useful to preprocess the network before a backtracking search, and in deciding which local consistency conditions, if any, still need to be enforced if we want to ensure that a solution can be found in a backtrack-free manner. Two definitions of local consistency are employed in characterizing the conditions: the traditional variable-based notion and a recently introduced definition of local consistency called {\em relational consistency}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations. {\bf I.2.4} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Relation systems.", } @Article{Agarwal:1997:ASP, author = "Pankaj K. Agarwal and Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan", title = "Approximating shortest paths on a convex polytope in three dimensions", journal = j-J-ACM, volume = "44", number = "4", pages = "567--584", month = jul, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 26 06:43:32 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p567-agarwal/", abstract = "Given a convex polytope $P$ with $n$ faces in $R^3$, points $s,t \in \partial P$, and a parameter $0<\epsilon\le1$, we present an algorithm that constructs a path on $\partial P$ from $s$ to $t$ whose length is at most $(1+\epsilon)d_P(s,t)$, where $d_P(s,t)$ is the length of the shortest path between $s$ and $t$ on $\partial P$. The algorithm runs in $O(n\log1/\epsilon + 1/\epsilon^3)$ time, and is relatively simple. The running time is $O(n+1/\epsilon^3)$ if we only want the approximate shortest path distance and not the path itself. We also present an extension of the algorithm that computes approximate shortest path distances from a given source point on $\partial P$ to all vertices of $P$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations.", } @Article{Stoer:1997:SMC, author = "Mechthild Stoer and Frank Wagner", title = "A simple min-cut algorithm", journal = j-J-ACM, volume = "44", number = "4", pages = "585--591", month = jul, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 26 06:43:32 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p585-stoer/", abstract = "We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about $|V|$ nearly identical phases each of which is a {\em maximum adjacency search}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Jayanti:1997:RWF, author = "Prasad Jayanti", title = "Robust wait-free hierarchies", journal = j-J-ACM, volume = "44", number = "4", pages = "592--614", month = jul, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 26 06:43:32 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p592-jayanti/", abstract = "The problem of implementing a shared object of one type from shared objects of other types has been extensively researched. Recent focus has mostly been on {\em wait-free implementations}, which permit every process to complete its operations on implemented objects, regardless of the speeds of other processes. It is known that shared objects of different types have differing abilities to support wait-free implementations. It is therefore natural to want to arrange types in a hierarchy that reflects their relative abilities to support wait-free implementations. In this paper, we formally define robustness and other desirable properties of hierarchies. Roughly speaking, a hierarchy is robust if each type is ``stronger'' than any combination of lower level types. We study two specific hierarchies: one, that we call {\em hrm\/} in which the level of a type is based on the ability of an {\em unbounded\/} number of objects of that type, and another hierarchy, that we call {\em hr1}, in which a type's level is based on the ability of a {\em fixed\/} number of objects of that type. We prove that resource bounded hierarchies, such as {\em hr1\/} and its variants, are not robust. We also establish the unique importance of {\em hrm\/}: every nontrivial robust hierarchy, if one exists, is necessarily a ``coarsening'' of {\em hrm}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Virtual memory. {\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (Subsystems), Asynchronous/synchronous operation. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Multiple-instruction-stream, multiple-data-stream processors (MIMD). {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Concurrency. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming/multitasking. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization.", } @Article{Alon:1997:SSD, author = "Noga Alon and Shai Ben-David and Nicol{\`o} Cesa-Bianchi and David Haussler", title = "Scale-sensitive dimensions, uniform convergence, and learnability", journal = j-J-ACM, volume = "44", number = "4", pages = "615--631", month = jul, year = "1997", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/263867.263927", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 26 06:43:32 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-4/p615-alon/", abstract = "Learnability in Valiant's PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free convergence property of means to expectations uniformly over classes of random variables. Classes of real-valued functions enjoying such a property are also known as uniform Glivenko--Cantelli classes. In this paper, we prove, through a generalization of Sauer's lemma that may be interesting in its own right, a new characterization of uniform Glivenko-Cantelli classes. Our characterization yields Dudley, Gin{\'e}, and Zinn's previous characterization as a corollary. Furthermore, it is the first based on a Gin{\'e}, and Zinn's previous characterization as a corollary. Furthermore, it is the first based on a simple combinatorial quantity generalizing the Vapnik--Chervonenkis dimension. We apply this result to obtain the weakest combinatorial condition known to imply PAC learnability in the statistical regression (or ``agnostic'') framework. Furthermore, we find a characterization of learnability in the probabilistic concept model, solving an open problem posed by Kearns and Schapire. These results show that the accuracy parameter plays a crucial role in determining the effective complexity of the learner's hypothesis class.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf I.2.6} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning.", } @Article{Brafman:1997:ALK, author = "Ronen I. Brafman and Jean-Claude Latombe and Yoram Moses and Yoav Shoham", title = "Applications of a logic of knowledge to motion planning under uncertainty", journal = j-J-ACM, volume = "44", number = "5", pages = "633--668", month = sep, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 30 06:06:57 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-5/p633-brafman/", abstract = "Inspired by the success of the distributed computing community in apply logics of knowledge and time to reasoning about distributed protocols, we aim for a similarly powerful and high-level abstraction when reasoning about control problems involving uncertainty. This paper concentrates on robot motion planning with uncertainty in both control and sensing, a problem that has already been well studied within the robotics community. First, a new and natural problem in this domain is defined: does there exists a sound and complete termination condition for a motion, given initial and goal locations? If yes, how to construct it? Then we define a high-level language, a logic of time and knowledge, which we use to reason about termination conditions and to state general conditions for the existence of sound and complete termination conditions in a broad domain. Finally, we show that sound termination conditions that are optimal in a precise sense provide a natural example of knowledge-based programs with multiple implementations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; theory", subject = "{\bf I.2.9} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics. {\bf I.2.4} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Estein:1997:STS, author = "David Estein and Zvi Galil and Giusee F. Italiano and Amnon Nissenzweig", title = "Sparsification --- a technique for speeding up dynamic graph algorithms", journal = j-J-ACM, volume = "44", number = "5", pages = "669--696", month = sep, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 30 06:06:57 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-5/p669-eppstein/", abstract = "We provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time $O(n^{1/2})$ per change; 3-edge connectivity, in time $O(n^{2/3})$ per change; 4-edge connectivity, in time $O(n\alpha(n))$ per change; $k$-edge connectivity for constant $k$, in time $O(n\log n)$ per change;2-vertex connectivity, and 3-vertex connectivity, in the $O(n)$ per change; and 4-vertex connectivity, in time $O(n\alpha(n))$ per change. Further results speed up the insertion times to match the bounds of known partially dynamic algorithms.\par All our algorithms are based on a new technique that transforms an algorithm for sparse graphs into one that will work on any graph, which we call {\em sparsification}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Khardon:1997:LR, author = "Roni Khardon and Dan Roth", title = "Learning to reason", journal = j-J-ACM, volume = "44", number = "5", pages = "697--725", month = sep, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 30 06:06:57 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-5/p697-khardon/", abstract = "We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and suggests that learning and reasoning should be studied together.\par The Learning to Reason framework combines the interfaces to the world used by known learning models with the reasoning task and a performance criterion suitable for it. In this framework, the intelligent agent is given access to its favorite learning interface, and is also given a grace period in with it can interact with this interface and construct a representation KB of the world $W$. The reasoning performance is measured only after this period, when the agent is presented with queries [alpha] from some query language, relevant to the world, and has to answer whether $W$ implies $\alpha$.\par The approach is meant to overcome the main computational difficulties in the traditional treatment of reasoning which stem from its separation from the ``world''. Since the agent interacts with the world when construction its knowledge representation it can choose a representation that is useful for the task at hand. Moreover, we can now make explicit the dependence of the reasoning performance on the environment the agent interacts with.\par We show how previous results from learning theory and reasoning fit into this framework and illustrate the usefulness of the Learning to Reason approach by exhibiting new results that are not possible in the traditional setting. First, we give Learning to Reason algorithms for classes of propositional languages for which there are no efficient reasoning algorithms, when represented as a traditional (formula-based) knowledge base. Second, we exhibit a Learning to Reason algorithm for a class of propositional languages that is not know to be learnable in the traditional sense.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.4} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods. {\bf I.2.6} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Knowledge acquisition.", } @Article{Borodini:1997:HMC, author = "Allan Borodini and Prabhakar Raghavan and Baruch Schieber and Eli Upfal", title = "How much can hardware help routing?", journal = j-J-ACM, volume = "44", number = "5", pages = "726--741", month = sep, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 30 06:06:57 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-5/p726-borodini/", abstract = "We study the extent to which complex hardware can speed up routing. Specifically, we consider the following questions. How much does adaptive routing improve over oblivious routing? How much does randomness help? How does it help if each node can have a large number of neighbors? What benefit is available if a node can send packets to several neighbors within a single time step? Some of these features require complex networking hardware, and it is thus important to investigate whether the performance justifies the investment. By varying these hardware parameters, we obtain a hierarchy of time bounds for worst-case permutation routing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS.", } @Article{Spencer:1997:TWT, author = "Thomas H. Spencer", title = "Time-work tradeoffs for parallel algorithms", journal = j-J-ACM, volume = "44", number = "5", pages = "742--778", month = sep, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 30 06:06:57 MST 1997", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-5/p742-spencer/", abstract = "Some parallel algorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes several algorithms with this property. These algorithms solve important problems on directed graphs, including breadth-first search, topological sort, strong connectivity, and the single source shortest path problem. All of the algorithms run on the EREW PRAM model of parallel computer, except the algorithm for strong connectivity, which runs on the probabilistic EREW PRAM.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Dwork:1997:CSM, author = "Cynthia Dwork and Maurice Herlihy and Orli Waarts", title = "Contention in shared memory algorithms", journal = j-J-ACM, volume = "44", number = "6", pages = "779--805", month = nov, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Feb 13 15:58:32 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-6/p779-dwork/", abstract = "Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of multiprocessor algorithms is heavily influenced by {\em contention}, the extent to which processes access the same location at the same time. Nevertheless, even though contention is one of the principal considerations affecting the performance of real algorithms on real multiprocessors, there are no formal tools for analyzing the contention of asynchronous shared-memory algorithms. This paper introduces the first formal complexity model for contention in shared-memory multiprocessors. We focus on the standard multiprocessor architecture in which $n$ asynchronous processes communicate by applying {\em read, write,\/} and {\em read-modify-write\/} operations to a shared memory. To illustrate the utility of our model, we use it to derive two kinds of results: (1) lower bounds on contention for well-known basic problems such as agreement and mutual exclusion, and (2) trade-offs between the length of the critical path (maximal number of accesses to shared variables performed by a single process in executing the algorithm) and contention for these algorithms. Furthermore, we give the first formal contention analysis of a variety of counting networks, a class of concurrent data structures implementing shared counters. Experiments indicate that certain counting networks outperform conventional single-variable counters at high levels of contention. Our analysis provides the first formal model explaining this phenomenon.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Relations among complexity measures. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Hemaspaandra:1997:EAD, author = "Edith Hemaspaandra and Lane A. Hemaspaandra and J{\"o}rg Rothe", title = "Exact analysis of {Dodgson} elections: {Lewis Carroll}'s 1876 voting system is complete for parallel access to {NP}", journal = j-J-ACM, volume = "44", number = "6", pages = "806--825", month = nov, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Feb 13 15:58:32 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-6/p806-hemaspaandra/", abstract = "In 1876, Lewis Carroll proposed a voting system in which the winner is the candidate who with the fewest changes in voters' preferences becomes a Condorcet winner---a candidate who beats all other candidates in pairwise majority-rule electrons. Bartholdi, Tovey, and Trick provided a lower bound---NP-hardness---on the computational complexity of determining the election winner in Carroll's system. We provide a stronger lower bound and an upper bound that matches our lower bound. In particular, determining the winner in Carroll's system is complete for parallel access to NP, that is, it is complete for [Theta];2$p$ for which it becomes the most natural complete problem known. It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf J.4} Computer Applications, SOCIAL AND BEHAVIORAL SCIENCES.", } @Article{Wasserman:1997:SRR, author = "Hal Wasserman and Manuel Blum", title = "Software reliability via run-time result-checking", journal = j-J-ACM, volume = "44", number = "6", pages = "826--849", month = nov, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Feb 13 15:58:32 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-6/p826-wasserman/", abstract = "We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that checkers should be allowed to use stored randomness: that is, that they should be allowed to generate, preprocess, and store random bits prior to run-time, and then to use this information repeatedly in a series of run-time checks. In a case study of checking a general real-number linear transformation (e.g., a Fourier Transform), we present a simple checker which uses stored randomness, and a self-corrector which is particularly efficient if stored randomness is employed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; verification", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Broy:1997:CRI, author = "Manfred Broy", title = "Compositional refinement of interactive systems", journal = j-J-ACM, volume = "44", number = "6", pages = "850--891", month = nov, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Feb 13 15:58:32 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-6/p850-broy/", abstract = "We introduce a method to describe systems and their components by functional specification techniques. We define notions of interface and interaction refinement for interactive systems and their components. These notions of refinement allow us to change both the syntactic (the number of channels and sorts of messages at the channels) and the semantic interface (causality flow between messages and interaction granularity) of an interactive system component. We prove that these notions of refinement are compositional with respect to sequential and parallel composition of system components, communication feedback and recursive declarations of system components. According to these proofs, refinements of networks can be accomplished in a modular way by refining their components. We generalize the notions of refinement to refining contexts. Finally, full abstraction for specifications is defined, and compositionality with respect to this abstraction is shown, too.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; verification", subject = "{\bf C.1.4} Computer Systems Organization, PROCESSOR ARCHITECTURES, Parallel Architectures, Distributed architectures. {\bf D.1.4} Software, PROGRAMMING TECHNIQUES, Sequential Programming. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Methodologies (e.g., object-oriented, structured). {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design^, Methodologies^. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques.", } @Article{Anonymous:1997:AI, author = "Anonymous", title = "Author Index", journal = j-J-ACM, volume = "44", number = "6", pages = "892--892", month = nov, year = "1997", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Feb 13 15:58:32 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1997-44-6/p892-author_index/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Benedikt:1998:REP, author = "Michael Benedikt and Guozhu Dong and Leonid Libkin and Limsoon Wong", title = "Relational expressive power of constraint query languages", journal = j-J-ACM, volume = "45", number = "1", pages = "1--34", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p1-benedikt/", abstract = "The expressive power of first-order query languages with several classes of equality and inequality constraints is studied in this paper. We settle the conjecture that recursive queries such as parity test and transitive closure cannot be expressed in the relational calculus augmented with polynomial inequality constraints over the reals. Furthermore, noting that relational queries exhibit several forms of genericity, we establish a number of collapse results of the following form: The class of generic Boolean queries expressible in the relational calculus augmented with a given class of constraints coincides with the class of queries expressible in the relational calculus (with or without an order relation). We prove such results for both the natural and active-domain semantics. As a consequence, the relational calculus augmented with polynomial inequalities expresses the same classes of generic Boolean queries under both the natural and active-domain semantics. In the course of proving these results for the active-domain semantics, we establish Ramsey-type theorems saying that any query involving certain kinds of constraints coincides with a constraint-free query on databases whose elements come from a certain infinite subset of the domain. To prove the collapse results for the natural semantics, we make use of techniques from nonstandard analysis and from the model theory of ordered structures.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf H.2.3} Information Systems, DATABASE MANAGEMENT, Languages, Query languages.", } @Article{Fekete:1998:ISC, author = "Alan Fekete and M. Frans Kaashoek and Nancy Lynch", title = "Implementing sequentially consistent shared objects using broadcast and point-to-point communication", journal = j-J-ACM, volume = "45", number = "1", pages = "35--69", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p35-fekete/", abstract = "This paper presents and proves correct a distributed algorithm that implements a sequentially consistent collection of shared read/update objects. This algorithm is a generalization of one used in the Orca shared object system. The algorithm caches objects in the local memory of processors according to application needs; each read operation accesses a single copy of the objects, while each update accesses all copies. The algorithm uses broadcast communication when it sends messages to replicated copies of an object, and it uses point-to-point communication when a message is sent to a single copy, and when a reply is returned. Copies of all objects are kept consistent using a strategy based on sequence numbers for broadcasts. The algorithm is presented in two layers. The lower layer uses the given broadcast and point-to-point communication services, plus sequence numbers, to provide a new communication service called a {\em context multicast channel}. The higher layer uses a context multicast channel to manage the object replication in a consistent fashion. Both layers and their combination are described and verified formally, using the I/O automation model for asynchronous concurrent systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; verification", subject = "{\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf C.2.4} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @Article{Arora:1998:PCP, author = "Sanjeev Arora and Shmuel Safra", title = "Probabilistic checking of proofs: a new characterization of {NP}", journal = j-J-ACM, volume = "45", number = "1", pages = "70--122", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p70-arora/", abstract = "We give a new characterization of NP; the class NP contains exactly those languages $L$ for which membership proofs (a proof that an input $x$ is in $L$) can be verified probabilistically in polynomial time using {\em logarithmic\/} number of random bits and by reading {\em sublogarithmic\/} number of bits from the proof. We discuss implications of this characterization; specifically, we show that approximating Clique and independent Set, even in a very weak sense, is NP-hard.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory; verification", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Saks:1998:EDP, author = "Michael Saks and Aravind Srinivasan and Shiyu Zhou", title = "Explicit {OR-dispersers} with polylogarithmic degree", journal = j-J-ACM, volume = "45", number = "1", pages = "123--154", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p123-saks/", abstract = "An $(N, M, T)$-OR-disperser is a bipartite multigraph $G = (V, W, E)$ with $|V| = N$, and $|W| = M$, having the following expansion property: any subset of $V$ having at least $T$ vertices has a neighbor set of size at least $M/2$. For any pair of constants $\chi$, $\lambda$, $1 \geq \lambda \geq 0$, any sufficiently large $N$, and for any $T \geq 2(\log N) \chi$, we give an explicit elementary construction of an $(N, M, T)$-OR-disperser such that the out-degree of any vertex in $V$ is at most polylogarithmic in $N$. Using this with known applications of OR-dispersers yields several result. First, our construction implies that the complexity class Strong-RP defined by Sipser, equals RP. Second, for any fixed $n > 0$, we give the first polynomial-time simulation of RP algorithms using the output of any ``$n$-minimally random'' source. For any integral $R > 0$, such a source accepts a single request for an $R$-bit string and generates the string according to a distribution that assigns probability at most $2 - R_n$ to any string. It is minimally random in the sense that any weaker source is insufficient to do a black-box polynomial-time simulation of RP algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Relations among complexity classes. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Sima:1998:TN, author = "Ji{\v{r}}{\'\i} {\v{S}}{\'\i}ma and Ji{\v{r}}{\'\i} Wiedermann", title = "Theory of neuromata", journal = j-J-ACM, volume = "45", number = "1", pages = "155--178", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p155-scaronima/", abstract = "A finite automaton-the so-called neuromation, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered. Both the size of neuromata (i.e., the number of neurons) and their descriptional complexity (i.e., the number of bits in the neuromaton representation) are studied. It is proved that a constraint time delay of the neuromaton output does not play a role within a polynomial descriptional complexity. It is shown that any regular language given by a regular expression of length $n$ is recognized by a neuromaton with ($n$) neurons. Further, it is proved that this network size is, in the worst case, optimal. On the other hand, generally there is not an equivalent polynomial length regular expression for a given neuromaton. Then, two specialized constructions of neural acceptors of the optimal descriptional complexity ($n$) for a single $n$-bit string recognition are described. They both require $O(n^{1/2})$ neurons and either $O(n)$ connections with constant weights or $O(n^{1/2})$ edges with weights of the $O(2)$ size. Furthermore, the concept of Hopfield languages is introduced by means of so-called Hopfield neuromata (i.e., of neural networks with symmetric weights). It is proved that the class of Hopfield languages is strictly contained in the class of regular languages. The necessary and sufficient so-called Hopfield condition stating when a regular language is a Hopfield language, is formulated. A construction of a Hopfield neuromaton is presented for a regular language satisfying the Hopfield condition. The class of Hopfield languages is shown to be closed under union, intersection, concatenation and complement, and it is not closed under iteration. Finally, the problem whether a regular language given by a neuromaton (or by a Hopfield acceptor) is nonempty, is proved to be PSPACE-complete. As a consequence, the same result for a neuromaton equivalence problem is achieved.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations between models. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Self-modifying machines. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by resource-bounded automata^. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages.", } @Article{Andreev:1998:NGD, author = "Alexander E. Andreev and Andrea E. F. Clementi and Jos{\'e} D. P. Rolim", title = "A new general derandomization method", journal = j-J-ACM, volume = "45", number = "1", pages = "179--213", month = jan, year = "1998", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/273865.273933", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-1/p179-andreev/", abstract = "We show that {\em quick hitting set generators\/} can replace {\em quick pseudorandom generators\/} to derandomize any probabilistic {\em two-sided error\/} algorithms. Up to now {\em quick hitting set generators\/} have been known as the general and uniform derandomization method for probabilistic {\em one-sided error\/} algorithms, while {\em quick pseudorandom generators\/} as the generators as the general and uniform method to derandomize probabilistic {\em two-sided error\/} algorithms. Our method is based on a deterministic algorithm that, given a Boolean circuit $C$ and given access to a hitting set generator, constructs a {\em discrepancy\/} set for $C$. The main novelty is that the discrepancy set depends on $C$, so the new derandomization method is not uniform (i.e., not oblivious). The algorithm works in time exponential in $k(p(n))$ where $k(*)$ is the {\em price\/} of the hitting set generator and {\em p(*)\/} is a polynomial function in the size of $C$. We thus prove that if a logarithmic price quick hitting set generator exists then BPP = P.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo).", } @Article{Fagin:1998:CRA, author = "Ronald Fagin and Joseph Y. Halpern", title = "Corrigendum: {``Reasoning about Knowledge and Probability''}", journal = j-J-ACM, volume = "45", number = "1", pages = "214--214", month = jan, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 10 17:54:32 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Fagin:1994:RAK}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Die:1998:HLU, author = "Xiaotie Die and Tiko Kameda and Christos Papadimitriou", title = "How to learn an unknown environment. {I}: the rectilinear case", journal = j-J-ACM, volume = "45", number = "2", pages = "215--245", month = mar, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat May 16 06:54:28 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-2/p215-die/", abstract = "We consider the problem faced by a robot that must explore and learn an unknown room with obstacles in it. We seek algorithms that achieve a bounded ratio of the worst-case distance traversed in order to see all visible points of the environment (thus creating a map), divided by the optimum distance needed to verify the map, if we had it in the beginning. The situation is complicated by the fact that the latter off-line problem (the problem of optimally verifying a map) is NP-hard. Although we show that there is no such ``competitive'' algorithm for general obstacle courses, we give a competitive algorithm for the case of a polygonal room with a bounded number of obstacles in it. We restrict ourselves to the rectilinear case, where each side of the obstacles and the room is parallel to one of the coordinates, and the robot must also move either parallel or perpendicular to the sides. (In a subsequent paper, we will discuss the extension to polygons of general shapes.) We also discuss the off-line problem for simple rectilinear polygons and find an optimal solution (in the L1 metric) in polynomial time, in the case where the entry and the exit are different points.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf I.2.9} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics. {\bf I.2.6} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning. {\bf I.2.10} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Vision and Scene Understanding, Perceptual reasoning.", } @Article{Karger:1998:AGC, author = "David Karger and Rajeev Motwani and Madhu Sudan", title = "Approximate graph coloring by semidefinite programming", journal = j-J-ACM, volume = "45", number = "2", pages = "246--265", month = mar, year = "1998", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/274787.274791", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat May 16 06:54:28 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-2/p246-karger/", abstract = "We consider the problem of coloring $k$-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on $n$ vertices with $\min\{O(\Delta^{1/3} \log {1/2} \Delta \log n), O(n^{1/4} \log^{1/2} n)\}$ colors where $\Delta$ is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of $n$, this marks the first nontrivial approximation result as a function of the maximum degree $\Delta$. This result can be generalized to $k$-colorable graphs to obtain a coloring using $\min\{O(\Delta^{1 - 2 / k} \log^{1/2} \Delta \log n), O(n^{1 - 3 / (k + 1)} \log^{1/2} n)\}$ colors. Our results are inspired by the recent work of Goemans and Williamson who used an algorithm for {\em semidefinite optimization problems}, which generalize linear programs, to obtain improved approximations for the MAX CUT and MAX 2-SAT problems. An intriguing outcome of our work is a duality relationship established between the value of the optimum solution to our semidefinite program and the Lov{\'a}sz [theta]-function. We show lower bounds on the gap between the optimum solution of our semidefinite program and the actual chromatic number; by duality this also demonstrates interesting new facts about the [theta]-function.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics.", } @Article{Dey:1998:CHG, author = "Tamal K. Dey and Sumanta Guha", title = "Computing homology groups of simplicial complexes in {{\boldmath $R^3$}}", journal = j-J-ACM, volume = "45", number = "2", pages = "266--287", month = mar, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Mar 07 19:40:31 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-2/p266-dey/", abstract = "Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in {\bf R}3. This paper develops basic techniques required to manipulate and analyze structures of complexes in {\bf R}3. A new approach to analyze simplicial complexes in Euclidean 3-space {\bf R}3 is described. First, methods from topology are used to analyze triangulated 3-manifolds in {\bf R}3. Then, it is shown that these methods can, in fact, be applied to arbitrary simplicial complexes in {\bf R}3 after (simulating) the process of thickening a complex to a 3-manifold homotopic to it. As a consequence considerable structural information about the complex can be determined and certain discrete problems solved as well. For example, it is shown how to determine homology groups, as well as concrete representations of their generators, for a given complex in {\bf R}3", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems.", } @Article{Martinez:1998:RBS, author = "Conrado Mart{\'\i}nez and Salvador Roura", title = "Randomized binary search trees", journal = j-J-ACM, volume = "45", number = "2", pages = "288--323", month = mar, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat May 16 06:54:28 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-2/p288-martinez/", abstract = "In this paper, we present randomized algorithms over binary search trees such that: (a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; (b) the deletion of any key from a random binary search tree results in a random binary search tree; (c) the random choices made by the algorithms are based upon the sizes of the subtrees of the tree; this implies that we can support accesses by rank without additional storage requirements or modification of the data structures; and (d) the cost of any elementary operation, measured as the number of visited nodes, is the same as the expected cost of its standard deterministic counterpart; hence, all search and update operations have guaranteed expected cost $O(\log n)$, but now irrespective of any assumption on the input distribution.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf E.1} Data, DATA STRUCTURES, Trees. {\bf F.2.0} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, General.", } @Article{MacKenzie:1998:CRP, author = "P. D. MacKenzie and C. G. Plaxton and R. Rajaraman", title = "On contention resolution protocols and associated probabilistic phenomena", journal = j-J-ACM, volume = "45", number = "2", pages = "324--378", month = mar, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat May 16 06:54:28 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-2/p324-mackenzie/", abstract = "Consider an on-line scheduling problem in which a set of abstract processes are competing for the use of a number of resources. Further assume that it is either prohibitively expensive or impossible for any two of the processes to directly communicate with one another. If several processes simultaneously attempt to allocate a particular resource (as may be expected to occur, since the processes cannot easily coordinate their allocations), then none succeed. In such a framework, it is a challenge to design efficient contention resolution protocols. Two recently-proposed approaches to the problem of PRAM emulation give rise to scheduling problems of the above kind. In one approach, the resources (in this case, the shared memory cells) are duplicated and distributed randomly. We analyze a simple and efficient deterministic algorithm for accessing some subset of the duplicated resources. In the other approach, we analyze how quickly we can access the given (nonduplicated) resource using a simple randomized strategy. We obtain precise bounds on the performance of both strategies. We anticipate that our results with find other applications.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Halpern:1998:TPP, author = "Joseph Y. Halpern", title = "Time to publication: a progress report", journal = j-J-ACM, volume = "45", number = "3", pages = "379--380", month = may, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 11 08:06:49 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-3/p379-halpern/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fernandes:1998:EDV, author = "Paulo Fernandes and Brigitte Plateau and William J. Stewart", title = "Efficient descriptor-vector multiplications in stochastic automata networks", journal = j-J-ACM, volume = "45", number = "3", pages = "381--414", month = may, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 11 08:06:49 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-3/p381-fernandes/", abstract = "This paper examines numerical issues in computing solutions to networks of stochastic automata. It is well-known that when the matrices that represent the automata contain only constant values, the cost of performing the operation basic to all iterative solution methods, that of matrix-vector multiply, is given by \begin{displaymath} \rho_N = \prod_{i=1}^N n_i \times \sum_{i=1}^N n_im \end{displaymath} where $n_i$ is the number of states in the $i$th automaton and $N$ is the number of automata in the network. We introduce the concept of a generalized tensor product and prove a number of lemmas concerning this product. The result of these lemmas allows us to show that this relatively small number of operations is sufficient in many practical cases of interest in which the automata contain functional and not simply constant transitions. Furthermore, we show how the automata should be ordered to achieve this.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf G.1.3} Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS. {\bf I.6.5} Computing Methodologies, SIMULATION AND MODELING, Model Development.", } @Article{Aspnes:1998:LBD, author = "James Aspnes", title = "Lower bounds for distributed coin-flipping and randomized consensus", journal = j-J-ACM, volume = "45", number = "3", pages = "415--450", month = may, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 11 08:06:49 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-3/p415-aspnes/", abstract = "We examine a class of {\em collective coin-flipping games\/} that arises from randomized distributed algorithms with halting failures. In these games, a sequence of {\em local coin flips\/} is generated, which must be combined to form a single {\em global coin flip}. An adversary monitors the game and may attempt to bias its outcome by hiding the result of up to $t$ local coin flips. We show that to guarantee at most constant bias, $\omega(t^2)$ local coins are needed, even if (a) the local coins can have arbitrary distributions and ranges, (b) the adversary is required to decide immediately wheter to hide or reveal each local coin, and (c) the game can detect which local coins have been hidden. If the adversary is permitted to control the outcome of the coin except for cases whose probability is polynomial in $t$, $\omega(t^2/\log^2t)$ local coins are needed. Combining this fact with an extended version of the well-known Fischer-Lynch-Paterson impossibility proof of deterministic consensus, we show that given an adaptive adversary, any $t$-resilient asynchronous consensus protocol requires $\omega(t^2/\log^2t)$ local coin flips in any model that can be simulated deterministically using atomic registers. This gives the first nontrivial lower bound on the total work required by wait-free consensus and is tight to within logarithmic factors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; reliability; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf B.4.3} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (Subsystems), Asynchronous/synchronous operation. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf F.2.m} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Multiple-instruction-stream, multiple-data-stream processors (MIMD). {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Concurrency.", } @Article{Jayanti:1998:FTW, author = "Prasad Jayanti and Tushar Deepak Chandra and Sam Toueg", title = "Fault-tolerant wait-free shared objects", journal = j-J-ACM, volume = "45", number = "3", pages = "451--500", month = may, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 11 08:06:49 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-3/p451-jayanti/", abstract = "Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of implementing shared objects that tolerate the failure of both processes and base objects.\par We identify two classes of object failures: {\em responsive\/} and {\em nonresponsive}. With responsive failures, a faulty object responds to every operation, but its responses may be incorrect. With nonresponsive failures, a faulty object may also ``hang'' without responding. In each class, we define {\em crash}, {\em omission}, and {\em arbitrary\/} modes of failure.\par We show that all responsive failure modes can be tolerated. More precisely, for all responsive failure modes $\cal F$, object types $T$, and $t \ge 0$, we show how to implement a shared object of type $T$ which is $t$-tolerant for $\cal F$. Such an object remains correct and wait-free even if up to $t$ base objects fail according to $\cal F$. In contrast to responsive failures, we show that even the most benign non-responsive failure mode cannot be tolerated. We also show that randomization can be used to circumvent this impossibility result.\par {\em Graceful degradation\/} is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure modes, we show wheter this property can be achieved, and, if so, how.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arora:1998:PVH, author = "Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy", title = "Proof verification and the hardness of approximation problems", journal = j-J-ACM, volume = "45", number = "3", pages = "501--555", month = may, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 11 08:06:49 MDT 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-3/p501-arora/", abstract = "We show that every language in NP has a probabilistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a {\em constant\/} number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random string). For strings not in the language, the verifier rejects every provided ``proof'' with probability at least 1/2. Our result builds upon and improves a recent result of Arora and Safra [1998] whose verifiers examine a nonconstant number of bits in the proof (though this number is a very slowly growing function of the input length).\par As a consequence, we prove that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P. The class MAX SNP was defined by Papadimitriou and Yannakakis [1991] and hard problems for this class include vertex cover, maximum satisfiability, maximum cut, metric TSP, Steiner trees and shortest superstring. We also improve upon the clique hardness results of Feige et al. [1996] and Arora and Safra [1998] and show that there exists a positive $\epsilon$ such that approximating the maximum clique size in an $N$-vertex graph to within a factor of $N^\epsilon$ is NP-hard.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @Article{Pong:1998:FVC, author = "Fong Pong and Michel Dubois", title = "Formal verification of complex coherence protocols using symbolic state models", journal = j-J-ACM, volume = "45", number = "4", pages = "557--587", month = jul, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:11:23 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-4/p557-pong/", abstract = "Directory-based coherence protocols in shared-memory multiprocessors are so complex that verification techniques based on automated procedures are required to establish their correctness. State enumeration approaches are well-suited to the verification of cache protocols but they face the problem of state space explosion, leading to unacceptable verification time and memory consumption even for small system configurations. One way to manage this complexity and make the verification feasible is to map the system model to verify onto a symbolic state model (SSM). Since the number of symbolic states is considerably less than the number of system states, an exhaustive state search becomes possible, even for large-scale sytems and complex protocols. In this paper, we develop the concepts and notations to verify some properties of a directory-based protocol designed for non-FIFO interconnection networks. We compare the verification of the protocol with SSM and with the Stanford Mur{\em 4}, a verification tool enumerating system states. We show that SSM is much more efficient in terms of verification time and memory consumption and therefore holds that promise of verifying much more complex protocols. A unique feature of SSM is that it verifies protocols for any system size and therefore provides reliable verification results in one run of the tool.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design; verification", subject = "{\bf B.8.2} Hardware, PERFORMANCE AND RELIABILITY, Performance Analysis and Design Aids. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Multiple-instruction-stream, multiple-data-stream processors (MIMD).", } @Article{Kifer:1998:DAQ, author = "Michael Kifer", title = "On the decidability and axiomatization of query finiteness in deductive databases", journal = j-J-ACM, volume = "45", number = "4", pages = "588--633", month = jul, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:11:23 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-4/p588-kifer/", abstract = "A database query is {\em finite\/} if its result consists of a finite sets tuples. For queries formulated as sets of pure Horn rules, the problem of determining finiteness is, in general, undecidable. In this paper, we consider {\em superfiniteness\/}---a stronger kind of finiteness, which applies to Horn queries whose function symbols are replaced by the abstraction of {\em infinite relations\/} with {\em finiteness constraints\/} (abbr., FC's). We show that superfiniteness is not only decidable but also {\em axiomatizable}, and the axiomatization yields an effective decision procedure. Although there are finite queries that are not superfinite, we demonstrate that superfinite queries represent an interesting and nontrivial subclass within the class of all finite queries. The we turn to the issue of inference of finiteness constraints---an important practical problem that is instrumental in deciding if a query is evaluable by a bottom-up algorithm. Although it is not known whether FC-entailment is decidable for sets of function-free Horn rules, we show that {\em super-entailment}, a stronger form of entailment, is decidable. We also show how a decision procedure for super-entailment can be used to enhance tests for query finiteness.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; theory", subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf H.2.1} Information Systems, DATABASE MANAGEMENT, Logical Design, QIKSYS.", } @Article{Feige:1998:TAS, author = "Uriel Feige", title = "A threshold of $\ln n$ for approximating set cover", journal = j-J-ACM, volume = "45", number = "4", pages = "634--652", month = jul, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:15:26 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-4/p634-feige/", abstract = "Given a collection $F$ of subsets of $S = {1, \ldots{},n}$, set cover is the problem of selecting as few as possible subsets from $F$ such that their union covers $S$, and max $k$-cover is the problem of selecting $k$ subsets from $F$ such that their union has maximum cardinality. Both these problems are NP-hard. We prove that $(1 - o(1)) \ln n$ is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low-order terms) between the ratio of approximation achievable by the greedy algorithm (which is $(1 - o(1)) \ln n$), and previous results of Lund and Yanakakis, that showed hardness of approximation within a ratio of $\log_2 n/2 \simeq 0.72 \ln n$. For max $k$-cover, we show an approximation threshold of $(1 - 1/e)$ (up to low-order terms), under assumption that ${\rm P} \neq {\rm NP}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; performance; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes.", } @Article{Goldreich:1998:PTC, author = "Oded Goldreich and Shari Goldwasser and Dana Ron", title = "Property testing and its connection to learning and approximation", journal = j-J-ACM, volume = "45", number = "4", pages = "653--750", month = jul, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Dec 16 07:11:23 MST 1998", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-4/p653-goldreich/", abstract = "In this paper, we consider the question of determining whether a function $f$ has property P or is $\epsilon$-far from any function with property P. A {\em property testing\/} algorithm is given a sample of the value of $f$ on instances drawn according to some distribution. In some cases, it is also allowed to query $f$ on instances of its choice. We study this question for different properties and establish some connections to problems in learning theory and approximation. In particular, we focus our attention on testing graph properties. Given access to a graph $G$ in the form of being able to query whether an edge exists or not between a pair of vertices, we devise algorithms to test whether the underlying graph has properties such as being bipartite, $k$-Colorable, or having a $p$-Clique (clique of density $p$ with respect to the vertex set). Our graph property testing algorithms are probabilistic and make assertions that are correct with high probability, while making a number of queries that is {\em independent\/} of the size of the graph. Moreover, the property testing algorithms can be used to efficiently (i.e., in time linear in the number of vertices) construct partitions of the graph that correspond to the property being tested, if it holds for the input graph.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation.", } @Article{Anonymous:1998:MPC, author = "Anonymous", title = "In Memoriam: {Paris C. Kanellakis}", journal = j-J-ACM, volume = "45", number = "5", pages = "751--751", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 23 08:47:21 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arora:1998:PTA, author = "Sanjeev Arora", title = "Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems", journal = j-J-ACM, volume = "45", number = "5", pages = "753--782", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 23 08:47:21 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-5/p1-arora/", abstract = "We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed $c > 1$ and given any $n$ nodes in $R^2$, a randomized version of the scheme finds a $(1 +1/ c)$-approximation to the optimum traveling salesman tour in $O(n \log n O(c))$ time. When the nodes are in $R^d$, the running time increases to $O(n(\log n)(O(dc))d-1)$. For every fixed $c, d$ the running time is $n \cdot \mbox{poly}(\log n)$, that is {\em nearly linear\/} in $n$. The algorithm can be derandomized, but this increases the running time by a factor $O(nd)$. The previous best approximation algorithm for the problem (due to Christofides) achieves a $3/2$-approximation in polynomial time. We also give similar approximation schemes for some other NP-hard Euclidean problems: Minimum Steiner Tree, $k$-TSP, and $k$-MST. (The running times of the algorithm for $k$-TSP and $k-MST involve an additional multiplicative factor $k.) The previous best approximation algorithms for all these problems achieved a constant-factor approximation. We also give efficient approximation schemes for Euclidean Min-Cost Matching, a problem that can be solved exactly in polynomial time. All our algorithms also work, with almost no modification, when distance is measured using any geometric norm (such as $l^p$ for $p > = 1$ or other Minkowski norms). They also have simple parallel (i.e., NC) implementations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Goldberg:1998:BFD, author = "Andrew V. Goldberg and Satish Rao", title = "Beyond the flow decomposition barrier", journal = j-J-ACM, volume = "45", number = "5", pages = "783--797", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:15:46 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-5/p1-goldberg/", abstract = "We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our approach leads to an $O(\min(n^{2/3}, m^{1/2}m\log(n^2/m)\log(U)))$ time bound for a network with $n$ vertices, $m$ arcs, and integral arc capacities in the range $[1, \ldots{}, U]$. This is a fundamental improvement over the previous time bounds. We also improve bounds for the Gomory--Hu tree problem, the parametric flow problem, and the approximate $s-t$ cut problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Abiteboul:1998:OIQ, author = "Serge Abiteboul and Paris C. Kanellakis", title = "Object identity as a query language primitive", journal = j-J-ACM, volume = "45", number = "5", pages = "798--842", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 23 08:47:21 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-5/p1-abiteboul/", abstract = "We demonstrate the power of object identities (oids) as a database query language primitive. We develop an object-based data model, whose structural part generalizes most of the known complex-object data models: cyclicity is allowed in both its schemas and instances. Our main contribution is the operational part of the data model, the query language IQL, which uses oids for three critical purposes: (1) to represent data-structures with sharing and cycles, (2) to manipulate sets, and (3) to express any computable database query. IQL can be type checked, can be evaluated bottom-up, and naturally generalizes most popular rule-based languages. The model can also be extended to incorporate type inheritance, without changes to IQL. Finally, we investigate an analogous value-based data model, whose structural part is founded on regular infinite trees and whose operational part is IQL.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Object-oriented databases. {\bf H.2.1} Information Systems, DATABASE MANAGEMENT, Logical Design.", } @Article{Fich:1998:SCR, author = "Faith Fich and Maurice Herlihy and Nir Shavit", title = "On the space complexity of randomized synchronization", journal = j-J-ACM, volume = "45", number = "5", pages = "843--862", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 23 08:47:21 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-5/p1-fich/", abstract = "The ``wait-free hierarchy'' provides a classification of multiprocessor synchronization primitives based on the values of $n$ for which there are deterministic wait-free implementations of $n$-process consensus using instances of these objects and {\em read-write\/} registers. In a randomized wait-free setting, this classification is degenerate, since $n$-process consensus can be solved using only {\em $O(n)$ read-write\/} registers. In this paper, we propose a classification of synchronization primitives based on the {\em space complexity\/} of randomized solutions to $n$-process consensus. A {\em historyless object,\/} such as a {\em read-write\/} register, a {\em swap\/} register, or a {\em test\&set\/} register, is an object whose state depends only on the lost nontrivial operation that was applied to it. We show that, using {\em historyless\/} objects, $\Omega(n)$ object instances are necessary to solve $n$-process consensus. This lower bound holds even if the objects have unbounded size and the termination requirement is {\em nondeterministic solo termination}, a property strictly weaker than randomized wait-freedom. We then use this result to related the randomized space complexity of basic multiprocessor synchronization primitives such as {\em shared counters, fetch\&add\/} registers, and {\em compare\&swap\/} registers. Viewed collectively, our results imply that there is a separation based on space complexity for synchronization primitives in randomized computation, and that this separation differs from that implied by the deterministic ``wait-free hierarchy.''", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Complexity hierarchies. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Bshouty:1998:NTD, author = "Nader H. Bshouty and Sally A. Goldman and H. David Mathias and Subhash Suri and Hisao Tamaki", title = "Noise-tolerant distribution-free learning of general geometric concepts", journal = j-J-ACM, volume = "45", number = "5", pages = "863--890", month = sep, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:16:07 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-5/p1-bshouty/", abstract = "We present an efficient algorithm for PAC-learning a very general class of geometric concepts over ${\cal R}^d$ for fixed $d$. More specifically, let {${\cal T}$} be any set of $s$ halfspaces. Let $x =(x_1, \ldots{}, x_d)$ be an arbitrary point in {${\cal R}^d$}. With each $t$ in {${\cal T}$} we associate a Boolean indicator function {$I_t(x)$} which is 1 if and only if $x$ is in the halfspace $t$. The concept class, {\em Cds }, that we study consists of all concepts formed by any Boolean function over {$I_{t_1}, \ldots{}, I_{t_s}$} for {$t_i \in {\cal T}$}. This class is much more general than any geometric concept class known to be PAC-learnable. Our results can be extended easily to learn efficiently any Boolean combination of a polynomial number of concepts selected from any concept class {${\cal C}$} over {${\cal R}$} given that the VC-dimension of {${\cal C}$} has dependence only on $d$ and there is a polynomial time algorithm to determine if there is a concept from {${\cal C}$} consistent with a given set of labeled examples. We also present a statistical query version of our algorithm that can tolerate random classification noise. Finally we present a generalization of the standard $\epsilon$-net result of Haussler and Welzl [1987] and apply it to give an alternative noise-tolerant algorithm for $d = 2$ based on geometric subdivisions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf I.2.6} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Concept learning.", } @Article{Arya:1998:OAA, author = "Sunil Arya and David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu", title = "An optimal algorithm for approximate nearest neighbor searching fixed dimensions", journal = j-J-ACM, volume = "45", number = "6", pages = "891--923", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:58:36 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p891-arya/", abstract = "Consider a set of $S$ of $n$ data points in real $d$-dimensional space, $R^d$, where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess $S$ into a data structure, so that given any query point {$q \in R^d$}, is the closest point of $S$ to $q$ can be reported quickly. Given any positive real $\epsilon$, data point $p$ is a $(1 +\epsilon)$-{\em approximate nearest neighbor\/} of $q$ if its distance from $q$ is within a factor of $(1 + \epsilon)$ of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of $n$ points in $R^d$ in $O(dn \log n)$ time and $O(dn)$ space, so that given a query point $q \in R^d$, and $\epsilon > 0$, a $(1 + \epsilon)$-approximate nearest neighbor of $q$ can be computed in $O(c_{d, \epsilon} \log n)$ time, where $c_{d,\epsilon} \leq d \lceil 1 + 6d / \epsilon \rceil^d$ is a factor depending only on dimension and $\epsilon$. In general, we show that given an integer $k \geq 1$, $(1 + \epsilon)$-approximations to the $k$ nearest neighbors of $q$ can be computed in additional {$O(kd \log n)$} time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf E.1} Data, DATA STRUCTURES. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf H.3.3} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval.", } @Article{Pellegrini:1998:EFS, author = "Marco Pellegrini", title = "Electrostatic fields without singularities: theory, algorithms and error analysis", journal = j-J-ACM, volume = "45", number = "6", pages = "924--964", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 29 14:44:34 MST 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "The author compares his methods against fast multipole methods for point-to-volume integrals.", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p924-pellegrini/", abstract = "The following problems that arise in the computation of electrostatic forces and in the Boundary Element Method are considered. Given two convex interior-disjoint polyhedra in 3-space endowed with a volume charge density which is a polynomial in the Cartesian coordinates of $R^3$, compute the Coulomb force acting on them. Given two interior-disjoint polygons in 3-space endowed with a surface charge density which is polynomial in the Cartesian coordinates of $R^3$, compute the normal component of the Coulomb force acting on them. For both problems adaptive Gaussian approximation algorithms are given, which, for $n$ Gaussian points, in time {$O(n)$}, achieve absolute error {$O(c^{\sqrt{n}})$} for a constant $c > 1$. Such a result improves upon previously known best asymptotic bounds. This result is achieved by blending techniques from integral geometry, computational geometry and numerical analysis. In particular, integral geometry is used in order to represent the forces as integrals whose kernel is free from singularities.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations. {\bf G.1.4} Mathematics of Computing, NUMERICAL ANALYSIS, Quadrature and Numerical Differentiation, Error analysis.", } @Article{Chor:1998:PIR, author = "Benny Chor and Eyal Kushilevitz and Oded Goldreich and Madhu Sudan", title = "Private information retrieval", journal = j-J-ACM, volume = "45", number = "6", pages = "965--981", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 29 14:44:34 MST 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p965-chor/", abstract = "Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be down-loaded; namely $n$ bits should be communicated (where $n$ is the number of bits in the database). In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be obtained. We describe schemes that enable a user to access $k$ replicated copies of a database ($k \geq 2$) and {\em privately\/} retrieve information stored in the database. This means that each individual server (holding a replicated copy of the database) gets no information on the identity of the item retrieved by the user. Our schemes use the replication to gain substantial saving. In particular, we present a two-server scheme with communication complexity $O(n^{1/3})$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "security", subject = "{\bf C.2.4} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases. {\bf D.4.6} Software, OPERATING SYSTEMS, Security and Protection, Information flow controls. {\bf H.3.3} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Retrieval models. {\bf K.4.1} Computing Milieux, COMPUTERS AND SOCIETY, Public Policy Issues, Privacy.", } @Article{Kearns:1998:ENT, author = "Michael Kearns", title = "Efficient noise-tolerant learning from statistical queries", journal = j-J-ACM, volume = "45", number = "6", pages = "983--1006", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 29 14:44:34 MST 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p983-kearns/", abstract = "In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the class of ``robust'' learning algorithms in the most general way, we formalize a new but related model of learning from {\em statistical queries}. Intuitively, in this model a learning algorithm is forbidden to examine individual examples of the unknown target function, but is given access to an oracle providing estimates of probabilities over the sample space of random examples. One of our main results shows that any class of functions learnable from statistical queries is in fact learnable with classification noise in Valiant's model, with a noise rate approaching the information-theoretic barrier of 1/2. We then demonstrate the generality of the statistical query model, showing that practically every class learnable in Valiant's model and its variants can also be learned in the new model (and thus can be learned in the presence of noise). A notable exception to this statement is the class of parity functions, which we prove is not learnable from statistical queries, and for which no noise-tolerant algorithm is known.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS. {\bf I.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE. {\bf I.5} Computing Methodologies, PATTERN RECOGNITION.", } @Article{Bachmair:1998:OCC, author = "Leo Bachmair and Harald Ganzinger", title = "Ordered chaining calculi for first-order theories of transitive relations", journal = j-J-ACM, volume = "45", number = "6", pages = "1007--1049", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 29 14:44:34 MST 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p1007-bachmair/", abstract = "We propose inference systems for binary relations that satisfy composition laws such as transitivity. Our inference mechanisms are based on standard techniques from term rewriting and represent a refinement of chaining methods as they are used in the context of resolution-type theorem proving. We establish the refutational completeness of these calculi and prove that our methods are compatible with the usual simplification techniques employed in refutational theorem provers, such as subsumption or tautology deletion. Various optimizations of the basic chaining calculus will be discussed for theories with equality and for total orderings. A key to the practicality of chaining methods is the extent to which so-called variable chaining can be avoided. We demonstrate that rewrite techniques considerably restrict variable chaining and that further restrictions are possible if the transitive relation under consideration satisfies additional properties, such as symmetry. But we also show that variable chaining cannot be completely avoided in general.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Inference engines. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Karp:1998:PEG, author = "Richard M. Karp and Yangun Zhang", title = "On parallel evaluation of game trees", journal = j-J-ACM, volume = "45", number = "6", pages = "1050--1075", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 29 14:44:34 MST 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1998-45/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1998-45-6/p1050-karp/", abstract = "A class of parallel algorithms for evaluating game trees is presented. These algorithms parallelize a standard sequential algorithm for evaluating AND\slash OR trees and the $\alpha$-$\beta$ pruning procedure for evaluating MIN\slash MAX trees. It is shown that, uniformly on all instances of uniform AND\slash OR trees, the parallel AND\slash OR tree algorithm achieves an asymptotic linear speedup using a polynomial number of processors in the height of the tree. The analysis of linear speedup using more than a linear number of processors is due to J. Harting. A numerical lower bound rigorously establishes a good speedup for the uniform AND\slash OR trees with parameters that are typical in practice. The performance of the parallel $\alpha$-$\beta$ algorithm on best-ordered MIN\slash MAX trees is analyzed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf I.2.8} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search.", } @Article{Anonymous:1998:SI, author = "Anonymous", title = "Subject Index", journal = j-J-ACM, volume = "45", number = "6", pages = "1076--1077", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 06 10:59:57 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Anonymous:1998:AI, author = "Anonymous", title = "Author Index", journal = j-J-ACM, volume = "45", number = "6", pages = "1078--1079", month = nov, year = "1998", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 06 10:59:57 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hannenhalli:1999:TCT, author = "Sridhar Hannenhalli and Pavel A. Pevzner", title = "Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals", journal = j-J-ACM, volume = "46", number = "1", pages = "1--27", month = jan, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-1/p1-hannenhalli/", abstract = "Genomes frequently evolve by reversals $\rho(i,j)$ that transform a gene order $\pi+1 \cdots \pi_i\pi_{i+1} \cdots \pi_{j-1}\pi_j \cdots \pi_n$ into $\pi_1 \cdots \pi_i\pi_{j-1} \cdots \pi_{i+1}\pi_j \cdots \pi_n$. Reversal distance between permutations $\pi$ and $\sigma$ is the minimum number of reversals to transform $\pi$ into $\sigma$. Analysis of genome rearrangements in molecular biology started in the late 1930's, when Dobzhansky and Sturtevant published a milestone paper presenting a rearrangement scenario with 17 inversions between the species of {\em Drosophilia}. Analysis of genomes evolving by inversions leads to a combinatorial problem of {\em sorting by reversals\/} studied in detail recently. We study sorting of {\em signed\/} permutations by reversals, a problem that adequately models rearrangements in a small genomes like chloroplast or mitochondrial DNA. The previously suggested approximation algorithms for sorting signed permutations by reversals compute the {\em reversal distance\/} between permutations with an astonishing accuracy for both simulated and biological data. We prove a duality theorem explaining this intriguing performance and show that there exists a ``hidden'' parameter that allows one to compute the reversal distance between signed permutations in polynomial time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf J.3} Computer Applications, LIFE AND MEDICAL SCIENCES, Biology and genetics. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes.", } @Article{Galil:1999:FDP, author = "Zvi Galil and Giuseppe F. Italiano and Neil Sarnak", title = "Fully dynamic planarity testing with applications", journal = j-J-ACM, volume = "46", number = "1", pages = "28--91", month = jan, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-1/p28-galil/", abstract = "This paper introduces compressed certificates for planarity, biconnectivity and triconnectivity in planar graphs, and proves many structural properties of certificates in planar graphs. As an application of our compressed certificates, we develop efficient dynamic planar algorithms. In particular, we consider the following three operations on a planar graph $G$: (i) insert an edge if the resultant graph remains planar; (ii) delete an edge; and (iii) test whether an edge could be added to the graph without violating planarity. We show how to support each of the above operations in $O(n^{2/3})$ time, where $n$ is the number of vertices in the graph. The bound for tests and deletions is worst-case, while the bound for insertions is amortized. This is the first algorithm for this problem with sub-linear running time, and it affirmatively answers a question posed in Epstein et al. [1992]. We use our compressed certificates for biconnectivity and triconnectivity to maintain the biconnected and triconnected components of a dynamic planar graph. The time bounds are the same: $O(n^{2/3})$ worst-case time per edge deletion, $O(n^{2/3})$ amortized time per edge insertion, and $O(n^{2/3})$ worst-case time to check whether two vertices are either biconnected or triconnected.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{ONeil:1999:OPL, author = "Elizabeth J. O'Neil and Patrick E. O'Neil and Gerhard Weikum", title = "An optimality proof of the {LRU-$K$} page replacement algorithm", journal = j-J-ACM, volume = "46", number = "1", pages = "92--112", month = jan, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-1/p92-o_neil/", abstract = "This paper analyzes a recently published algorithm for page replacement in hierarchical paged memory systems [O'Neil et al. 1993]. The algorithm is called the LRU-$K$ method, and reduces to the well-known LRU (Least Recently Used) method for $K = 1$. Previous work [O'Neil et al. 1993; Weikum et al. 1994; Johnson and Shasha 1994] has shown the effectiveness for $K>1$ by simulation, especially in the most common case of $K=2$. The basic idea in LRU-$K$ is to keep track of the times of the last $K$ references to memory pages, and to use this statistical information to rank-order the pages as to their expected future behavior. Based on this the page replacement policy decision is made: which memory-resident page to replace when a newly accessed page must be read into memory. In the current paper, we prove, under the assumptions of the independent reference model, that LRU-$K$ is optimal. Specifically we show: given the times of the (up to) $K$ most recent references to each disk page, no other algorithm $A$ making decisions to keep pages in a memory buffer holding $n-1$ pages based on this information can improve on the expected number of I/Os to access pages over the LRU-$K$ algorithm using a memory buffer holding $n$ pages. The proof uses the Bayesian formula to relate the space of actual page probabilities of the model to the space of observable page numbers on which the replacement decision is actually made.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design; performance; theory", subject = "{\bf H.2.2} Information Systems, DATABASE MANAGEMENT, Physical Design.", } @Article{Cucker:1999:CED, author = "Felipe Cucker and Steve Smale", title = "Complexity estimates depending on condition and round-off error", journal = j-J-ACM, volume = "46", number = "1", pages = "113--184", month = jan, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-1/p113-cucker/", abstract = "This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf G.1.5} Mathematics of Computing, NUMERICAL ANALYSIS, Roots of Nonlinear Equations.", } @Article{Hass:1999:CCK, author = "Joel Hass and Jeffrey C. Lagarias and Nicholas Pippenger", title = "The computational complexity of knot and link problems", journal = j-J-ACM, volume = "46", number = "2", pages = "185--211", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-2/p185-hass/", abstract = "We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, ie., capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, UNKNOTTING PROBLEM is in NP. We also consider the problem, SPLITTING PROBLEM of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in PSPACE. We also give exponential worst-case running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Berger:1999:RTD, author = "Bonnie Berger and Jon Kleinberg and Tom Leighton", title = "Reconstructing a three-dimensional model with arbitrary errors", journal = j-J-ACM, volume = "46", number = "2", pages = "212--235", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-2/p212-berger/", abstract = "A number of current technologies allow for the determination of interatomic distance information in structures such as proteins and RNA. Thus, the reconstruction of a three-dimensional set of points using information about its interpoint distances has become a task of basic importance in determining molecular structure. The distance measurements one obtains from techniques such as NMR are typically sparse and error-prone, greatly complicating the reconstruction task. Many of these errors result in distance measurements that can be safely assumed to lie within certain fixed tolerances. But a number of sources of systematic error in these experiments lead to inaccuracies in the data that are very hard to quantify; in effect, one must treat certain entries of the measured distance matrix as being arbitrarily ``corrupted''. The existence of arbitrary errors leads to an interesting sort of error-correction problem --- how many corrupted entries in a distance matrix can be efficiently corrected to produce a consistent three-dimensional structure? For the case of an $n \times n$ matrix in which every entry is specified, we provide a randomized algorithm running in time $O(n\log n)$ that enumerates all structures consistent with at most $(1/2-e)n$ errors per row, with high probability. In the case of randomly located errors, we can correct errors of the same density in a sparse matrix-one in which only a $B$ fraction of the entries in each row are given, for any constant $B>0$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics. {\bf J.2} Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Chemistry. {\bf J.3} Computer Applications, LIFE AND MEDICAL SCIENCES, Biology and genetics.", } @Article{Ferragina:1999:SBT, author = "Paolo Ferragina and Roberto Grossi", title = "The string {B}-tree: a new data structure for string search in external memory and its applications", journal = j-J-ACM, volume = "46", number = "2", pages = "236--280", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-2/p236-ferragina/", abstract = "We introduce a new text-indexing data structure, the {\em String B-Tree}, that can be seen as a link between some traditional external-memory and string-matching data structures. In a short phrase, it is a combination of B-trees and Patricia tries for internal-node indices that is made more effective by adding extra pointers to speed up search and update operations. Consequently, the String B-Tree overcomes the theoretical limitations of inverted files, B-trees, prefix B-trees, suffix arrays, compacted tries and suffix trees. String B-trees have the same worst-case performance as B-trees but they manage unbounded-length strings and perform much more powerful search operations such as the ones supported by suffix trees. String B-trees are also effective in main memory (RAM model) because they improve the online suffix tree search on a dynamic set of strings. They also can be successfully applied to database indexing and software duplication.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; design", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Mass storage. {\bf B.4.2} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Secondary storage. {\bf E.1} Data, DATA STRUCTURES. {\bf E.5} Data, FILES, Sorting/searching. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Textual databases. {\bf H.3.1} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Dictionaries. {\bf H.3.1} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Indexing methods. {\bf H.3.3} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval. {\bf H.3.7} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Digital Libraries.", } @Article{Blelloch:1999:PES, author = "Guy E. Blelloch and Phillip B. Gibbons and Yossi Matias", title = "Provably efficient scheduling for languages with fine-grained parallelism", journal = j-J-ACM, volume = "46", number = "2", pages = "281--321", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 25 18:51:21 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/1999-46/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-2/p281-blelloch/", abstract = "Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. A common concern in executing such programs is to schedule tasks to processors dynamically so as to minimize not only the execution time, but also the amount of space (memory) needed. Without careful scheduling, the parallel execution on $p$ processors can use a factor of $p$ or larger more space than a sequential implementation of the same program. This paper first identifies a class of parallel schedules that are provably efficient in both time and space. For any computation with $w$ units of work and critical path length $d$, and for any sequential schedule that takes space $s_1$, we provide a parallel schedule that takes fewer than $w/p + d$ steps on $p$ processors and requires less than $s_1 + p^d$ space. This matches the lower bound that we show, and significantly improves upon the best previous bound of $s_1^p$ spaces for the common case where $d>1$. The paper then describes a scheduler for implementing high-level languages with nested parallelism, that generates schedules in this case. During program execution, as the structure of the computation is revealed, the scheduler keeps track of the active tasks, allocates the tasks to the processors, and performs the necessary task synchronization. The scheduler is itself a parallel algorithm, and incurs at most a constant factor overhead in time and space, even when the scheduling granularity is individual units of work. The algorithm is the first efficient solution to the scheduling problem discussed here, even if space considerations are ignored.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; languages; performance", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Parallel C. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Multiprocessing/multiprogramming/multitasking. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Threads. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management.", xxnote = "Check math in abstract.", } @Article{Halpern:1999:ETS, author = "J. Halpern", title = "Editorial: Taking Stock", journal = j-J-ACM, volume = "46", number = "3", pages = "323--324", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 18:25:27 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See corrigendum \cite{Halpern:1999:CET}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Pirri:1999:SCM, author = "Fiora Pirri and Ray Reiter", title = "Some contributions to the metatheory of the situation calculus", journal = j-J-ACM, volume = "46", number = "3", pages = "325--361", month = may, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 7 12:04:29 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-3/p325-pirri/", abstract = "We focus on a rich axiomatization for actions in the situation calculus that includes, among other features, a solution to the frame problem for deterministic actions. Our work is foundational in nature, directed at simplifying the entailment problem for these axioms. Specifically, we make four contributions to the metatheory of situation calculus axiomatizations of dynamical systems: (1) We prove that the above-mentioned axiomatization for actions has a relative satisfiability property; the full axiomatization is satisfiable iff the axioms for the initial state are. (2) We define the concept of regression relative to these axioms, and prove a soundness and completeness theorem for a regression-based approach to the entailment problem for a wide class of queries. (3) Our formalization of the situation calculus requires certain foundational axioms specifying the domain of situations. These include an induction axiom, whose presence complicates human and automated reasoning in the situation calculus. We characterize various classes of sentences whose proofs do not require induction, and in some cases, some of the other foundational axioms. (4) We prove that the logic programming language GOLOG never requires any of the foundational axioms for the evaluation of programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "{\bf F.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.2.4} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods.", } @Article{Thorup:1999:USS, author = "Mikkel Thorup", title = "Undirected single-source shortest paths with positive integer weights in linear time", journal = j-J-ACM, volume = "46", number = "3", pages = "362--394", month = may, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 7 12:04:29 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-3/p362-thorup/", abstract = "The single-source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a positively weighted graph {$G$} with a source vertex {$s$}, find the shortest path from $s$ to all other vertices in the graph. Since 1959, all theoretical developments in SSSP for general directed and undirected graphs have been based on Dijkstra's algorithm, visiting the vertices in order of increasing distance from $s$. Thus, any implementation of Dijkstra's algorithm sorts the vertices according to their distances from $s$. However, we do not know how to sort in linear time. Here, a deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with positive integer weights. The algorithm avoids the sorting bottleneck by building a hierarchical bucketing structure, identifying vertex pairs that may be visited in any order.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms", subject = "{\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Myers:1999:FBV, author = "Gene Myers", title = "A fast bit-vector algorithm for approximate string matching based on dynamic programming", journal = j-J-ACM, volume = "46", number = "3", pages = "395--415", month = may, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 7 12:04:29 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-3/p395-myers/", abstract = "The approximate string matching problem is to find all locations at which a query of length $m$ matches a substring of a text of length $n$ with $k$-or-fewer differences. Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in {\em agrep}. These algorithms compute a bit representation of the current state-set of the $k$-difference automaton for the query, and asymptotically run in either {$O(nm/w)$} or {$O(nm \log \sigma/w)$} time where $w$ is the word size of the machine (e.g., 32 or 64 in practice), and [sigma] is the size of the pattern alphabet. Here we present an algorithm of comparable simplicity that requires only {$O(nm/w)$} time by virtue of computing a bit representation of the {\em relocatable\/} dynamic programming matrix for the problem. Thus, the algorithm's performance is independent of $k$, and it is found to be more efficient than the previous results for many choices of $k$ and small $m$. Moreover, because the algorithm is not dependent on $k$, it can be used to rapidly compute blocks of the dynamic programming matrix as in the 4-Russians algorithm of Wu et al. (1996). This gives rise to an {$O(kn/w)$} expected-time algorithm for the case where $m$ may be arbitrarily large. In practice this new algorithm, that computes a region of the dynamic programming (d.p.) matrix $w$ entries at a time using the basic algorithm as a subroutine is significantly faster than our previous 4-Russians algorithm, that computes the same region 4 or 5 entries at a time using table lookup. This performance improvement yields a code that is either superior or competitive with {\em all\/} existing algorithms except for some filtration algorithms that are superior when $k/m$ is sufficiently small.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design", subject = "{\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE. {\bf H.3.3} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval.", } @Article{Young:1999:GUS, author = "F. Y. Young and Chris C. N. Chu and D. F. Wong", title = "Generation of universal series-parallel {Boolean} functions", journal = j-J-ACM, volume = "46", number = "3", pages = "416--435", month = may, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:16:54 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org:80/pubs/citations/journals/jacm/1999-46-3/p416-young/", abstract = "The structural tree-based mapping algorithm is an efficient and popular technique for technology mapping. In order to make good use of this mapping technique in FTGA design, it is desirable to design FPGA logic modules based on Boolean functions which can be represented by a tree of gates (i.e., series-parallel or SP functions). Thakur and Wong [1996a; 1996b] studied this issue and they demonstrated the advantages of designing logic modules as universal SP functions, that is, SP functions which can implement all SP functions with a certain number of inputs. The number of variables in the universal function corresponds to the number of inputs to the FPGA module, so it is desirable to have as few variables as possible in the constructed functions. The universal SP functions presented in Thakur and Wong [1996a; 1966b] were designed manually. Recently, there is an algorithm that can generate these functions automatically [Young and Wong 1997], but the number of variables in the generated functions grows exponentially. In this paper, we present an algorithm to generate, for each $n > 0$, a universal SP function $f_n$ for implementing all SP functions with $n$ inputs or less. The number of variables in $f_n$ is less than $n^{2.376}$ and the constructions are the smallest possible when $n$ is small $(n\le 7)$. We also derived a nontrivial lower bound on the sizes of the optimal universal SP functions {($\Omega(n \log n)$)}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "design", subject = "{\bf B.7.1} Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration).", } @Article{Farach:1999:EAI, author = "Martin Farach and Sampath Kannan", title = "Efficient algorithms for inverting evolution", journal = j-J-ACM, volume = "46", number = "4", pages = "437--449", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p437-farach/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldwasser:1999:PTU, author = "Shafi Goldwasser and Joe Kilian", title = "Primality testing using elliptic curves", journal = j-J-ACM, volume = "46", number = "4", pages = "450--472", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-4/p450-goldwasser/p450-goldwasser.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p450-goldwasser/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fredman:1999:EPH, author = "Michael L. Fredman", title = "On the efficiency of pairing heaps and related data structures", journal = j-J-ACM, volume = "46", number = "4", pages = "473--501", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-4/p473-fredman/p473-fredman.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p473-fredman/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Henzinger:1999:RFD, author = "Monika R. Henzinger and Valerie King", title = "Randomized fully dynamic graph algorithms with polylogarithmic time per operation", journal = j-J-ACM, volume = "46", number = "4", pages = "502--516", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p502-henzinger/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Buhrman:1999:MS, author = "Harry Buhrman and Matthew Franklin and Juan A. Garay and Jaap-Henk Hoepman and John Tromp and Paul Vit{\'a}nyi", title = "Mutual search", journal = j-J-ACM, volume = "46", number = "4", pages = "517--536", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-4/p517-buhrman/p517-buhrman.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p517-buhrman/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Basu:1999:NRQ, author = "Saugata Basu", title = "New results on quantifier elimination over real closed fields and applications to constraint databases", journal = j-J-ACM, volume = "46", number = "4", pages = "537--555", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-4/p537-basu/p537-basu.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p537-basu/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rodeh:1999:FCA, author = "Michael Rodeh and Mooly Sagiv", title = "Finding circular attributes in attribute grammars", journal = j-J-ACM, volume = "46", number = "4", pages = "556--575", month = jul, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Jan 23 12:19:49 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-4/p556-rodeh/p556-rodeh.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-4/p556-rodeh/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:1999:CET, author = "J. Halpern", title = "Corrigendum: Editorial: Taking Stock", journal = j-J-ACM, volume = "46", number = "4", pages = "576--576", month = mar, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 06 18:25:27 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Halpern:1999:ETS}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kaplan:1999:PFR, author = "Haim Kaplan and Robert E. Tarjan", title = "Purely functional, real-time deques with catenation", journal = j-J-ACM, volume = "46", number = "5", pages = "577--603", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kleinberg:1999:ASH, author = "Jon M. Kleinberg", title = "Authoritative sources in a hyperlinked environment", journal = j-J-ACM, volume = "46", number = "5", pages = "604--632", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-5/p604-kleinberg/p604-kleinberg.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-5/p604-kleinberg/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dwork:1999:SEB, author = "Cynthia Dwork and Orli Waarts", title = "Simple and efficient bounded concurrent timestamping and the traceable use abstraction", journal = j-J-ACM, volume = "46", number = "5", pages = "633--666", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alon:1999:LHF, author = "Noga Alon and Martin Dietzfelbinger and Peter Bro Miltersen and Erez Petrank and G{\'a}bor Tardos", title = "Linear hash functions", journal = j-J-ACM, volume = "46", number = "5", pages = "667--683", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-5/p667-alon/p667-alon.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-5/p667-alon/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cesa-Bianchi:1999:SES, author = "Nicol{\`o} Cesa-Bianchi and Eli Dichterman and Paul Fischer and Eli Shamir and Hans Ulrich Simon", title = "Sample-efficient strategies for learning in the presence of noise", journal = j-J-ACM, volume = "46", number = "5", pages = "684--719", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-5/p684-cesa-bianchi/p684-cesa-bianchi.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-5/p684-cesa-bianchi/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blumofe:1999:SMC, author = "Robert D. Blumofe and Charles E. Leiserson", title = "Scheduling multithreaded computations by work stealing", journal = j-J-ACM, volume = "46", number = "5", pages = "720--748", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-5/p720-blumofe/p720-blumofe.pdf; http://www.acm.org/pubs/citations/journals/jacm/1999-46-5/p720-blumofe/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abadi:1999:STS, author = "Mart{\'\i}n Abadi", title = "Secrecy by typing in security protocols", journal = j-J-ACM, volume = "46", number = "5", pages = "749--786", month = sep, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 6 18:19:41 MST 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Leighton:1999:MMF, author = "Tom Leighton and Satish Rao", title = "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms", journal = j-J-ACM, volume = "46", number = "6", pages = "787--832", month = nov, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 18:17:55 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-6/p787-leighton/p787-leighton.pdf", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation algorithms; divide and conquer; graph bisection; graph partitioning; maximum flow; minimum cut; multicommodity flow; routing; VLSI layout", subject = "Theory of Computation ---- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); General Terms: Algorithms", } @Article{Zhou:1999:ABB, author = "Yunhong Zhou and Subhash Suri", title = "Analysis of a bounding box heuristic for object intersection", journal = j-J-ACM, volume = "46", number = "6", pages = "833--857", month = nov, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 18:17:55 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-6/p833-zhou/p833-zhou.pdf", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "aspect ratio; bounding box; collision detection; scale factor", subject = "Theory of Computation ---- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing ---- Discrete Mathematics --- Combinatorics (G.2.1); Computing Methodologies ---- Computer Graphics --- Computational Geometry and Object Modeling (I.3.5); General Terms: Performance, Theory", } @Article{Herlihy:1999:TSA, author = "Maurice Herlihy and Nir Shavit", title = "The topological structure of asynchronous computability", journal = j-J-ACM, volume = "46", number = "6", pages = "858--923", month = nov, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 18:17:55 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-6/p858-herlihy/p858-herlihy.pdf", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algebraic topology; asynchronous distributed computation; decision tasks; distributed computing; homology; simplicial complex; wait-tree algorithms", subject = "Theory of Computation ---- Computation by Abstract Devices --- Models of Computation (F.1.1): Computability theory; Theory of Computation ---- Computation by Abstract Devices --- Modes of Computation (F.1.2): Parallelism and concurrency", } @Article{Mohring:1999:ASS, author = "Rolf H. M{\"o}hring and Andreas S. Schulz and Marc Uetz", title = "Approximation in stochastic scheduling: the power of {LP}-based priority policies", journal = j-J-ACM, volume = "46", number = "6", pages = "924--942", month = nov, year = "1999", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 18:17:55 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/1999-46-6/p924-mohring/p924-mohring.pdf", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation; asymptotic optimality; LP-relaxation; priority policy; stochastic scheduling; worst-case performance; WSEPT rule", subject = "Theory of Computation ---- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): Sequencing and scheduling; Mathematics of Computing ---- Discrete Mathematics --- Combinatorics (G.2.1): Combinatorial algorithms; Mathematics of Computing ---- Numerical Analysis --- Optimization (G.1.6): Linear programming; Theory of Computation ---- Computation by Abstract Devices --- Modes of Computation (F.1.2): Online computation", } @Article{Bartal:2000:HSA, author = "Yair Bartal and Eddie Grove", title = "The harmonic $k$-server algorithm is competitive", journal = j-J-ACM, volume = "47", number = "1", pages = "1--15", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 25 10:44:32 MDT 2000", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p1-bartal/", abstract = "The $k$-server problem is a generalization of the paging problems, and is the most studied problem in the area of competitive online problems. The Harmonic algorithm is a very natural and simple randomized algorithm for the $k$-server problem. We give a simple proof that the Harmonic $k$-server algorithm is competitive. The competitive ratio we prove is the best currently known fo the algorithm. The Harmonic algorithm is memoryless and time-efficient. This is the only such algorithm known to be competitive for the $k$-server problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Algorithms; Performance; Theory; Verification", subject = "Software --- Operating Systems --- Storage Management (D.4.2); Mathematics of Computing --- Probability and Statistics (G.3): {\bf Probabilistic algorithms (including Monte Carlo)}", } @Article{Dymond:2000:PRO, author = "Patrick W. Dymond and Walter L. Ruzzo", title = "Parallel {RAMs} with owned global memory and deterministic context-free language recognition", journal = j-J-ACM, volume = "47", number = "1", pages = "16--45", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 17:49:18 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p16-dymond/", abstract = "We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Write, or CROW-PRAMS, these are machines in which each global memory location is assigned a unique ``owner and rdquo processor, which is the only processor allowed to write into it. Considering the difficulties that would be involved in physically realizing a full CREW-PRAM model and demonstrate its stability under several definitional changes. Second, we precisely characterize the power of the CROW-PRAM by showing that the class of languages recognizable by it in time $ O(\log n) $ (and implicitly with a polynomial number of processors) is exactly the class LOGDCFL of languages log space reducible to deterministic context-free languages. Third, using the same basic machinery, we show that the recognition problem for deterministic context-free languages can be solved quickly on a deterministic auxilliary pushdown automation having random access to its input tape, a $ \log n $ space work tape, and pushdown store of small maximum height. For example, time $ O(n^{1 + \epsilon }) $ is achievable with pushdown height $ O(\log^2 n) $. These result extend and unify work of von Braunm{\"o}hl, Cook, Mehlhorn, and Verbeek; Klein and Reif; Rytter.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "CROW-PRAM; DCFL recognition; owner write; parallel algorithms", subject = "Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1): Automata; Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1): Unbounded-action devices; Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2): Parallelism and concurrency; Theory of Computation --- Computation by Abstract Devices --- Complexity Measures and Classes (F.1.3): Relations among complexity classes; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): Computations on discrete structures; Theory of Computation --- Mathematical Logic and Formal Languages --- Grammars and Other Rewriting Systems (F.4.2): Parsing; General Terms: Algorithms, Theory", } @Article{Karger:2000:MCN, author = "David R. Karger", title = "Minimum cuts in near-linear time", journal = j-J-ACM, volume = "47", number = "1", pages = "46--76", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 17:49:18 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p46-karger/", abstract = "We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a ``semiduality'' between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carlo) algorithm that finds a minimum cut in an $m$-edge, $n$-vertex graph with high probability in $ O(m \log^3 n)$ time. We also give a simpler randomized algorithm that finds all minimum cuts with high probability in $ O(m \log^3 n)$ time. This variant has an optimal RNC parallelization. Both variants improve on the previous best time bound of $ O(n^2 \log^3 n)$. Other applications of the tree-packing approach are new, nearly tight bounds on the number of near-minimum cuts a graph may have and a new data structure for representing them in a space-efficient manner.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "connectivity; min-cut; Monte Carlo algorithm; optimization; tree packing", subject = "Data --- Data Structures (E.1); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing --- Discrete Mathematics --- Combinatorics (G.2.1); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); Mathematics of Computing --- Probability and Statistics (G.3); General Terms: Algorithms, Theory", } @Article{Eiter:2000:ESO, author = "Thomas Eiter and Yuri Gurevich and Georg Gottlob", title = "Existential second-order logic over strings", journal = j-J-ACM, volume = "47", number = "1", pages = "77--131", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 17:49:18 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p77-eiter/", abstract = "Existential second-order logic (ESO) and monadic second-order logic(MSO) have attracted much interest in logic and computer science. ESO is a much expressive logic over successor structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ESO over strings, (i.e., finite successor structures). Moreover, we determine the complexity of model checking over strings, for all ESO-prefix classes. Let ESO(\sc Q) denote the prefix class containing all sentences of the shape $ \exists {\bf R}Q \phi $, where $ {\bf R} $ is a list of predicate variables, $Q$ is a first-order quantifier prefix from the prefix set ($ \sc Q$), and ($ \phi $) is quantifier-free. We show that ESO($ \exists * \forall \exists *$) and ESO($ \exists * \forall \forall $) are the maximal standard ESO-prefix classes contained in MSO, thus expressing only regular languages. We also give a precise characterization of those ESO-prefix classes that are {\em equivalent\/} to MSO over strings, and of the ESO-prefix classes which are closed under complementation on strings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "decision problem; descriptive complexity; existential fragment; finite model theory; finite satisfiability; finite words; model checking; NP; prefix classes; regular languages; S1S; second-order logic; SIS; strings", subject = "Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1): Automata; Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1): Relations between models; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): Computations on discrete structures; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): Computational logic; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): Model theory; Theory of Computation --- Mathematical Logic and Formal Languages --- Formal Languages (F.4.3): Classes defined by grammars or automata; General Terms: Theory", } @Article{Cohen:2000:PTN, author = "Edith Cohen", title = "Polylog-time and near-linear work approximation scheme for undirected shortest paths", journal = j-J-ACM, volume = "47", number = "1", pages = "132--166", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 15:17:10 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p132-cohen/", abstract = "Shortest paths computations constitute one of the most fundamental network problems. Nonetheless, known parallel shortest-paths algorithms are generally inefficient: they perform significantly more work (product of time and processors) than their sequential counterparts. This gap, known in the literature as the ``transitive closure bottleneck,'' poses a long-standing open problem. Our main result is an $ O(m n^{\epsilon_0} + s(m + n^{1 + \epsilon_0})) $ work polylog-time randomized algorithm \ldots{}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Categories and Subject Descriptors: Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); General Terms: Algorithms, Theory", } @Article{OHearn:2000:APL, author = "Peter W. O'Hearn and John C. Reynolds", title = "From {Algol} to polymorphic linear Lambda-calculus", journal = j-J-ACM, volume = "47", number = "1", pages = "167--223", month = jan, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 28 17:49:18 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-1/p167-o_hearn/", abstract = "In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their results. This is reminiscent of state transformations in imperative languages, where execution of an assignment statement alters the contents of the store. We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types. On the one hand, the translations lead to a semantic analysis of Algol-like programs, in terms of a model of the linear language. On the other hand, they demonstrate that a linearly-typed functional language can be at least as expressive as Algol.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "linear logic; local state; logical relations; parametric polymorphism", subject = "Software --- Programming Languages --- Formal Definitions and Theory (D.3.1): Semantics; Theory of Computation --- Logics and Meanings of Programs --- Semantics of Programming Languages (F.3.2): Denotational semantics; General Terms: Languages, Theory", } @Article{Franklin:2000:EGG, author = "Matthew Franklin and Zvi Galil and Moti Yung", title = "Eavesdropping games: a graph-theoretic approach to privacy in distributed systems", journal = j-J-ACM, volume = "47", number = "2", pages = "225--243", month = mar, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-2/p225-franklin/", abstract = "We initiate a graph-theoretic study of privacy in distributed environments with mobile eavesdroppers (``bugs''). For two privacy tasks --- distributed database maintenance and message transmission --- a computationally unbounded adversary ``plays an eavesdropping game,'' coordinating the moment of the bugs among the sites to learn the current memory contents. Many different adversaries are considered, motivated by differences in eavesdropping technologies. We characterize the feasibility of the two privacy tasks combinatorially, construct protocols for the feasible cases, and analyze their computational complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; security; theory", subject = "Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Graph algorithms}", } @Article{Varghese:2000:FSC, author = "George Varghese and Mahesh Jayaram", title = "The fault span of crash failures", journal = j-J-ACM, volume = "47", number = "2", pages = "244--293", month = mar, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-2/p244-varghese/", abstract = "A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each link has an arbitrary mixture of packets sent in (possibly different) executions. Our theorem considerably generalizes an earlier result, due to Fekete et al., which states that there is no correct crashing Data Link Protocol. For example, we prove that there is no correct crashing protocol for token passing and for many other resource allocation protocols such as $k$-exclusion, and the drinking and dining philosophers problems. We further characterize the reachable states caused by crash failures using reliable non-FIFO and reliable FIFO links. We show that with reliable non-FIFO links any acyclic subset of nodes and links can be driven to arbitrary states. We show that with reliable FIFO links, only nodes can be driven to arbitrary states. Overall, we show a strict hierarchy in terms of the set of states reachable by crash failures in the three link models.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "theory", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Graph algorithms}", } @Article{Armoni:2000:SAC, author = "Roy Armoni and Amnon Ta-Shma and Avi Widgerson and Shiyu Zhou", title = "An $ {O(\log (n)^{4 / 3})} $ space algorithm for $ (s, t) $ connectivity in undirected graphs", journal = j-J-ACM, volume = "47", number = "2", pages = "294--311", month = mar, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-2/p294-armoni/", abstract = "We present a deterministic algorithm that computes $ s t$-connectivity in undirected graphs using $ O(\log^{4 / 3}n)$ space. This improves the previous $ O(\log^{3 / 2}n)$ bound of Nisan et al. [1992].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computational complexity; derandomization; short pseudorandom walks on graphs; space bounded computations; undirected graph connectivity", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); Mathematics of Computing --- Probability and Statistics (G.3)", } @Article{Kupferman:2000:ATA, author = "Orna Kupferman and Moshe Y. Vardi and Pierre Wolper", title = "An automata-theoretic approach to branching-time model checking", journal = j-J-ACM, volume = "47", number = "2", pages = "312--360", month = mar, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-2/p312-kupferman/", abstract = "Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for model-checking. Recently, Bernholtz and Grumberg [1993] have shown that this exponential penalty can be avoided, though they did not match the linear complexity of non-automata-theoretic algorithms. In this paper, we show that {\em alternating tree automata\/} are the key to a comprehensive automata-theoretic framework for branching temporal logics. Not only can they be used to obtain optimal decision procedures, as was shown by Muller et al., but, as we show here, they also make it possible to derive optimal model-checking algorithms. Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking and has enabled us to derive improved space complexity bounds for this long-standing problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; verification", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Graph algorithms}", } @Article{Giacobazzi:2000:MAI, author = "Roberto Giacobazzi and Francesco Ranzato and Francesca Scozzari", title = "Making abstract interpretations complete", journal = j-J-ACM, volume = "47", number = "2", pages = "361--416", month = mar, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-2/p361-giacobazzi/", abstract = "Completeness is an ideal, although uncommon, feature of abstract interpretations, formalizing the intuition that, relatively to the properties encoded by the underlying abstract domains, there is no loss of information accumulated in abstract computations. Thus, complete abstract interpretations can be rightly understood as optimal. We deal with both pointwise completeness, involving generic semantic operations, and (least) fixpoint completeness. Completeness and fixpoint completeness are shown to be properties that depend on the underlying abstract domains only. Our primary goal is then to solve the problem of making abstract interpretations complete by minimally extending or restricting the underlying abstract domains. Under the weak and reasonable hypothesis of dealing with continuous semantic operations, we provide constructive characterizations for the least complete extensions and the greatest complete restrictions of abstract domains. As far as fixpoint completeness is concerned, for merely monotone semantic operators, the greatest restrictions of abstract domains are constructively characterized, while it is shown that the existence of least extensions of abstract domains cannot be, in general, guaranteed, even under strong hypotheses. These methodologies, which in finite settings give rise to effective algorithms, provide advanced formal tools for manipulating and comparing abstract interpretations, useful both in static program analysis and in semantics design. A number of examples illustrating these techniques are given.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "languages; theory", subject = "Software --- Programming Languages --- Formal Definitions and Theory (D.3.1): {\bf Semantics}; Theory of Computation --- Logics and Meanings of Programs --- Semantics of Programming Languages (F.3.2): {\bf Program analysis}", } @Article{Canny:2000:SBA, author = "John F. Canny and Ioannis Z. Emiris", title = "A subdivision-based algorithm for the sparse resultant", journal = j-J-ACM, volume = "47", number = "3", pages = "417--451", month = may, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-3/p417-canny/", abstract = "Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all common roots to a problem in linear algebra. We propose a determinantal formula for the sparse resultant of an arbitrary system of $ n + 1 $ polynomials in $n$ variables. This resultant generalizes the classical one and has significantly lower degree for polynomials that are sparse in the sense that their mixed volume is lower than their B{\'e}zout number. Our algorithm uses a mixed polyhedral subdivision of the Minkowski sum of the Newton polytopes in order to construct a Newton matrix. Its determinant is a nonzero multiple of the sparse resultant and the latter equals the GCD of at most $ n + 1$ such determinants. This construction implies a restricted version of an effective sparse Nullstellensatz. For an arbitrary specialization of the coefficients, there are two methods that use one extra variable and yield the sparse resultant. This is the first algorithm to handle the general case with complexity polynomial in the resultant degree and simply exponential in $n$. We conjecture its extension to producing an exact rational expression for the sparse resultant.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "asymptotic complexity; effective Nullstellensatz; mixed volume; multivariate resultant; Newton polytope; polyhedral subdivision; sparse elimination theory", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Numerical Algorithms and Problems (F.2.1): {\bf Computations on matrices}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Numerical Algorithms and Problems (F.2.1): {\bf Computations on polynomials}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Geometrical problems and computations}; Computing Methodologies --- Symbolic and Algebraic Manipulation --- Algorithms (I.1.2): {\bf Algebraic algorithms}; Computing Methodologies --- Symbolic and Algebraic Manipulation --- Algorithms (I.1.2): {\bf Analysis of algorithms}", } @Article{Brafman:2000:ATT, author = "Ronen I. Brafman and Moshe Tennenholtz", title = "An axiomatic treatment of three qualitative decision criteria", journal = j-J-ACM, volume = "47", number = "3", pages = "452--482", month = may, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 25 10:44:32 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p452-brafman/", abstract = "The need for computationally efficient decision-making techniques together with the desire to simplify the processes of knowledge acquisition and agent specification have led various researchers in artificial intelligence to examine qualitative decision tools. However, the adequacy of such tools is not clear. This paper investigates the foundations of {\em maximin}, {\em minmax regret}, and {\em competitive ratio}, three central qualitative decision criteria, by characterizing those behaviors that could result from their use. This characterization provides two important insights: (1) under what conditions can we employ an agent model based on these basic qualitative decision criteria, and (2) how ``rational'' are these decision procedures. For the {\em competitive ratio\/} criterion in particular, this latter issue is of central importance to our understanding of current work on on-line algorithms. Our main result is a constructive representation theorem that uses two choice axioms to characterize {\em maximin}, {\em minmax regret}, and {\em competitive ratio}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "agent models; choice theory; foundations of online algorithms; qualitative decision theory", subject = "Computing Methodologies --- Artificial Intelligence (I.2)", } @Article{Karhumaki:2000:ELR, author = "Juhani Karhum{\"a}ki and Filippo Mignosi and Wojciech Plandowski", title = "The expressibility of languages and relations by word equations", journal = j-J-ACM, volume = "47", number = "3", pages = "483--505", month = may, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 25 10:44:32 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p483-karhumaki/", abstract = "Classically, several properties and relations of words, such as ``being a power of the same word'' can be expressed by using word equations. This paper is devoted to a general study of the expressive power of word equations. As main results we prove theorems which allow us to show that certain properties of words are not expressible as components of solutions of word equations. In particular, ``the primitiveness'' and ``the equal length'' are such properties, as well as being ``any word over a proper subalphabet''.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "word equations", subject = "Theory of Computation --- Mathematical Logic and Formal Languages --- Miscellaneous (F.4.m)", } @Article{Beimel:2000:LFR, author = "Amos Beimel and Francesco Bergadano and Nader H. Bshouty and Eyal Kushilevitz and Stefano Varricchio", title = "Learning functions represented as multiplicity automata", journal = j-J-ACM, volume = "47", number = "3", pages = "506--530", month = may, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 25 10:44:32 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p506-beimel/", abstract = "We study the learnability of multiplicity automata in Angluin's {\em exact learning model}, and we investigate its applications. Our starting point is a known theorem from automata theory relating the number of states in a minimal multiplicity automaton for a function to the rank of its Hankel matrix. With this theorem in hand, we present a new simple algorithm for learning multiplicity automata with improved time and query complexity, and we prove the learnability of various concept classes. These include (among others):\par \begin{itemize} \item The class of disjoint DNF, and more generally satisfy-$ O(1) $ DNF. \item The class of polynomials over finite fields. \item The class of bounded-degree polynomials over infinite fields. \item The class of XOR of terms. \item Certain classes of boxes in high dimensions. \end{itemize}\par In addition, we obtain the best query complexity for several classes known to be learnable by other methods such as decision trees and polynomials over $ {\rm GF}(2) $.\par While multiplicity automata are shown to be useful to prove the learnability of some subclasses of DNF formulae and various other classes, we study the limitations of this method. We prove that this method cannot be used to resolve the learnability of some other open problems such as the learnability of general DNF formulas or even $k$-term DNF for $ k = \omega (\log n)$ or satisfy-$s$ DNF formulas for $ s = \omega (1)$. These results are proven by exhibiting functions in the above classes that require multiplicity automata with super-polynomial number of states.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computational learning; DNF; learning disjoint; learning polynomials; multiplicity automata", subject = "Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1); Theory of Computation --- Analysis of Algorithms and Problem Complexity (F.2); Computing Methodologies --- Artificial Intelligence --- Learning (I.2.6)", } @Article{Pierce:2000:BEP, author = "Benjamin C. Pierce and Davide Sangiorgi", title = "Behavioral equivalence in the polymorphic pi-calculus", journal = j-J-ACM, volume = "47", number = "3", pages = "531--584", month = may, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 25 10:44:32 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p531-pierce/", abstract = "We investigate {\em parametric polymorphism\/} in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds.\par Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes.\par We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "abstract data types; pi-calculus", subject = "Software --- Programming Languages --- Language Constructs and Features (D.3.3): {\bf Concurrent programming structures}; Software --- Programming Languages --- Language Constructs and Features (D.3.3): {\bf Polymorphism}; Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2): {\bf Parallelism and concurrency}; Theory of Computation --- Logics and Meanings of Programs --- Semantics of Programming Languages (F.3.2): {\bf Operational semantics}; Theory of Computation --- Logics and Meanings of Programs --- Studies of Program Constructs (F.3.3): {\bf Type structure}", } @Article{Even:2000:DCA, author = "Guy Even and Joseph (Seffi) Naor and Satish Rao and Baruch Schieber", title = "Divide-and-conquer approximation algorithms via spreading metrics", journal = j-J-ACM, volume = "47", number = "4", pages = "585--616", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p585-even/", abstract = "We present a novel divide-and-conquer paradigm for approximating NP-hard graph optimization problems. The paradigm models graph optimization problems that satisfy two properties: First, a divide-and-conquer approach is applicable. Second, a fractional spreading metric is computable in polynomial time. The spreading metric assigns lengths to either edges or vertices of the input graph, such that all subgraphs for which the optimization problem is nontrivial have large diameters. In addition, the spreading metric provides a lower bound, $ \tau $, on the cost of solving the optimization problem.\par We present a polynomial time approximation algorithm for problems modeled by our paradigm whose approximation factor is $ O(\min (\log \tau, \log \log \tau, \log k \log \log k)) $ where $k$ denotes the number of ``interesting'' vertices in the problem instance, and is at most the number of vertices. We present seven problems that can be formulated to fit the paradigm. For all these problems our algorithm improves previous results. The problems are: (1) linear arrangement; (2) embedding a graph in a $d$-dimensional mesh; (3) interval graph completion; (4) minimizing storage-time product; (5) subset feedback sets in directed graphs and multicuts in circular networks; (6) symmetric multicuts in directed networks; (7) balanced partitions and $p$-separators (for small values of $ \rho $) in directed graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation algorithms; divide and conquer; feedback set; linear arrangement; multicut; spreading metrics", subject = "Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Graph algorithms}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Network problems}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}", } @Article{Kalyanasundaram:2000:SPC, author = "Bala Kalyanasundaram and Kirk Prauhs", title = "Speed is as powerful as clairvoyance", journal = j-J-ACM, volume = "47", number = "4", pages = "617--643", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p617-kalyanasundaram/", abstract = "We introduce resource augmentation as a method for analyzing online scheduling problems. In resource augmentation analysis the on-line scheduler is given more resources, say faster processors or more processors, than the adversary. We apply this analysis to two well-known on-line scheduling problems, the classic uniprocessor CPU scheduling problem $ 1 |r_i, {\rm pmtn}| \sum F_i $, and the best-effort firm real-time scheduling problem $ 1 |r_i, {\rm pmtn}| \sum w_i(1 - U_i) $. It is known that there are no constant competitive nonclairvoyant on-line algorithms for these problems. We show that there are simple on-line scheduling algorithms for these problems that are constant competitive if the online scheduler is equipped with a slightly faster processor than the adversary. Thus, a moderate increase in processor speed effectively gives the on-line scheduler the power of clairvoyance. Furthermore, the on-line scheduler can be constant competitive on all inputs that are not closely correlated with processor speed. We also show that the performance of an on-line scheduler is best-effort real time scheduling can be significantly improved if the system is designed in such a way that the laxity of every job is proportional to its length.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "multi-level feedback scheduling; resource augmentation; scheduling", subject = "Software --- Operating Systems --- Process Management (D.4.1): {\bf Scheduling}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sequencing and scheduling}", } @Article{Benedikt:2000:RQI, author = "Michael Benedikt and Leonid Libkin", title = "Relational queries over interpreted structures", journal = j-J-ACM, volume = "47", number = "4", pages = "644--680", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p644-benedikt/", abstract = "We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the classical theory that go through 'as before' when interpreted structure is present, parts that go through only for classes of nicely behaved structures, and parts that only arise in the interpreted case. The first category include a number of results on language equivalence and expressive power characterizations for the active-domain semantics for a variety of logics. Under this semantics, quantifiers range over elements of a relational database. The main kind of results we prove here are {\em generic collapse\/} results: for generic queries, adding operations beyond order, does not give us extra power.\par The second category includes results on the natural semantics, under which quantifiers range over the entire interpreted structure. We prove, for a variety of structures, {\em natural-active collapse\/} results, showing that using unrestricted quantification does not give us any extra power. Moreover, for a variety of structures, including the real field, we give a set of algorithms for eliminating unbounded quantifications in favor of bounded ones. Furthermore, we extend these collapse results to a new class of higher-order logics that mix unbounded and bounded quantification. We give a set of normal forms for these logics, under special conditions on the interpreted structures. As a by-product, we obtain an elementary proof of the fact that parity test is not definable in the relational calculus with polynomial inequality constraints. We also give examples of structures with nice model-theoretic properties over which the natural-active collapse fails.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "0-minimality; collapse results; constraints; quantifier elimination; relational calculus", subject = "Information Systems --- Database Management --- Languages (H.2.3): {\bf Query languages}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Logic and constraint programming}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Model theory}", } @Article{Mundhenk:2000:CFH, author = "Martin Mundhenk and Judy Goldsmith and Christopher Lusena and Eric Allender", title = "Complexity of finite-horizon {Markov} decision process problems", journal = j-J-ACM, volume = "47", number = "4", pages = "681--720", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p681-mundhenk/", abstract = "Controlled stochastic systems occur in science engineering, manufacturing, social sciences, and many other contexts. If the systems is modeled as a Markov decision process (MDP) and will run {\/ad infinitum}, the optimal control policy can be computed in polynomial time using linear programming. The problems considered here assume that the time that the process will run is finite, and based on the size of the input. There are many factors that compound the complexity of computing the optimal policy. For instance, there are many factors that compound the complexity of this computation. For instance, if the controller does not have complete information about the state of the system, or if the system is represented in some very succinct manner, the optimal policy is provably not computable in time polynomial in the size of the input. We analyze the computational complexity of evaluating policies and of determining whether a sufficiently good policy exists for a MDP, based on a number of confounding factors, including the observability of the system state; the succinctness of the representation; the type of policy; even the number of actions relative to the number of states. In almost every case, we show that the decision problem is complete for some known complexity class. Some of these results are familiar from work by Papadimitriou and Tsitsiklis and others, but some, such as our PL-completeness proofs, are surprising. We include proofs of completeness for natural problems in the as yet little-studied classes $ {\rm NP}^{PP} $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computational complexity; Markov decision processes; NP; NP PP; partially observable Markov decision processes; PL; PSPACE; succinct representations", subject = "Mathematics of Computing --- Probability and Statistics (G.3): {\bf Markov processes}; Theory of Computation --- Computation by Abstract Devices --- Complexity Measures and Classes (F.1.3): {\bf Reducibility and completeness}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Plan execution, formation, and generation}", } @Article{Rawling:2000:OQL, author = "J. P. Rawling and S. A. Selesnick", title = "Orthologic and quantum logic: models and computational elements", journal = j-J-ACM, volume = "47", number = "4", pages = "721--751", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p721-rawling/", abstract = "Motivated by a growing need to understand the computational potential of quantum devices we suggest an approach to the relevant issues via quantum logic and its model theory. By isolating such notions as quantum parallelism and interference within a model-theoretic setting, quite divorced from their customary physical trappings, we seek to lay bare their logical underpinnings and possible computational ramifications.\par In the first part of the paper, a brief account of the relevant model theory is given, and some new results are derived. In the second part, we model the simplest classical gate, namely the $N$-gate, propose a quantization scheme (which translates between classical and quantum models, and from which emerges a logical interpretation of the notion of quantum parallelism), and apply it to the classical $N$-gate model. A class of physical instantiations of the resulting quantum $N$-gate model is also briefly discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Hilbert spaces; quantum computing; quantum logic; quantum physics", subject = "Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Modal logic}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Model theory}", } @Article{Altman:2000:BSO, author = "Eitan Altman and Bruno Gaujal and Arie Hordijk", title = "Balanced sequences and optimal routing", journal = j-J-ACM, volume = "47", number = "4", pages = "752--775", month = jul, year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p752-altman/", abstract = "The objective pursued in this paper is two-fold. The first part addresses the following combinatorial problem: is it possible to construct an infinite sequence over $n$ letters where each letter is distributed as ``evenly'' as possible and appears with a given rate? The second objective of the paper is to use this construction in the framework of optimal routing in queuing networks. We show under rather general assumptions that the optimal deterministic routing in stochastic event graphs is such a sequence.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "balanced sequences; multimodularity; optimal control; stochastic event graphs", subject = "Hardware --- Input/Output and Data Communications --- Performance Analysis and Design Aids^ (B.4.4); Hardware --- Performance and Reliability --- Performance Analysis and Design Aids (B.8.2)", } @Article{Antoy:2000:NNS, author = "Sergio Antoy and Rachid Echahed and Michael Hanus", title = "A needed narrowing strategy", journal = j-J-ACM, volume = "47", number = "4", pages = "776--822", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Sep 20 16:53:37 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/journals/jacm/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-4/p776-antoy/", abstract = "The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms. It also plays an important role in the definition of some algorithms of unification modulo equational theories that are defined by confluent term rewriting systems. Due to the inefficiency of simple narrowing, many refined narrowing strategies have been proposed in the last decade. This paper presents a new narrowing strategy that is optimal in several respects. For this purpose, we propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and L{\'e}vy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal with respect to the cost measure that counts the number of distinct steps of a derivation, computes only incomparable and disjoint unifiers, and is efficiently implemented by unification.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "call-by-need; functional logic programming languages; narrowing strategies; rewrite systems", subject = "Software --- Programming Techniques --- Applicative (Functional) Programming (D.1.1); Software --- Programming Techniques --- Logic Programming (D.1.6); Software --- Programming Languages --- Language Constructs and Features (D.3.3): {\bf Control structures}; Software --- Programming Languages --- Processors (D.3.4): {\bf Optimization}; Theory of Computation --- Mathematical Logic and Formal Languages --- Grammars and Other Rewriting Systems (F.4.2): {\bf Grammar types}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Trees}; Computing Methodologies --- Symbolic and Algebraic Manipulation --- Expressions and Their Representation (I.1.1): {\bf Simplification of expressions}", } @Article{Halpern:2000:EBR, author = "Joe Halpern", title = "Editorial: a bill of rights and responsibilities", journal = j-J-ACM, volume = "47", number = "5", pages = "823--825", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p823-halpern/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen:2000:BTD, author = "David Cohen and Peter Jeavons and Peter Jonsson and Manolis Koubarakis", title = "Building tractable disjunctive constraints", journal = j-J-ACM, volume = "47", number = "5", pages = "826--853", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p826-cohen/", abstract = "Many combinatorial search problems can be expressed as `constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more general, tractable classes. We give examples to show that many known examples of tractable constraint classes, from a wide variety of different contexts, can be constructed from simpler tractable classes using a general method. We also construct several new tractable classes that have not previously been identified.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "complexity; constraint satisfaction problem; disjunctive constraints; independence; NP-completeness; relations", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Mathematics of Computing --- Discrete Mathematics --- Combinatorics (G.2.1): {\bf Combinatorial algorithms}; Computing Methodologies --- Artificial Intelligence --- Knowledge Representation Formalisms and Methods (I.2.4): {\bf Relation systems}", } @Article{Valiant:2000:NAC, author = "Leslie G. Valiant", title = "A neuroidal architecture for cognitive computation", journal = j-J-ACM, volume = "47", number = "5", pages = "854--882", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p854-valiant/", abstract = "An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the full those aspects of computational learning that are known to offer powerful solutions in the acquisition and maintenance of robust knowledge bases. The architecture makes explicit the requirements on the basic computational tasks that are to be performed and is designed to make this computationally tractable even for very large databases. The main claims are that (i) the basic learning and deduction tasks are provably tractable and (ii) tractable learning offers viable approaches to a range of issues that have been previously identified as problematic for artificial intelligence systems that are programmed. Among the issues that learning offers to resolve are robustness to inconsistencies, robustness to incomplete information and resolving among alternatives. Attribute-efficient learning algorithms, which allow learning from few examples in large dimensional systems, are fundamental to the approach. Underpinning the overall architecture is a new principled approach to manipulating relations in learning systems. This approach, of independently quantified arguments, allows propositional learning algorithms to be applied systematically to learning relational concepts in polynomial time and in modular fashion.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "cognitive computation; computational learning; learning relations; nonmonotonic reasoning; PAC learning; robust reasoning", subject = "Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1); Computing Methodologies --- Artificial Intelligence --- General (I.2.0): {\bf Cognitive simulation}; Computing Methodologies --- Artificial Intelligence --- Knowledge Representation Formalisms and Methods (I.2.4); Computing Methodologies --- Artificial Intelligence --- Learning (I.2.6)", } @Article{Cheng:2000:SE, author = "Siu-Wing Cheng and Tamal K. Dey and Herbert Edelsbrunner and Michael A. Facello and Shang-Hua Teng", title = "Silver exudation", journal = j-J-ACM, volume = "47", number = "5", pages = "883--904", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p883-cheng/", abstract = "A silver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Silvers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay triangulation contains no silvers. We also give an algorithm to compute such a weight assignment.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "(weighted) Delaunay triangulations; algorithms; computational geometry; mesh generation; mesh quality; silvers; tetrahedral meshes", subject = "Mathematics of Computing --- Mathematical Software (G.4); Computing Methodologies --- Computer Graphics --- Computational Geometry and Object Modeling (I.3.5)", } @Article{Jiang:2000:LBA, author = "Tao Jiang and Ming Li and Paul Vit{\'a}nyi", title = "A lower bound on the average-case complexity of {Shellsort}", journal = j-J-ACM, volume = "47", number = "5", pages = "905--911", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p905-jiang/", abstract = "We demonstrate an $ \Omega (p n^{1 + 1 / p}) $ lower bound on the average-case running time (uniform distribution) of $p$-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Performance; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "average-case complexity; computational complexity; Kolmogorov complexity; Shellsort; sorting", subject = "Data --- Coding and Information Theory (E.4): {\bf Data compaction and compression}; Data --- Files (E.5): {\bf Sorting/searching}; Theory of Computation --- Computation by Abstract Devices --- Complexity Measures and Classes (F.1.3): {\bf Complexity hierarchies}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}; Computing Methodologies --- Symbolic and Algebraic Manipulation --- Algorithms (I.1.2): {\bf Analysis of algorithms}", } @Article{Chaudhuri:2000:TBS, author = "Soma Chaudhuri and Maurice erlihy and Nancy A. Lynch and Mark R. Tuttle", title = "Tight bounds for $k$-set agreement", journal = j-J-ACM, volume = "47", number = "5", pages = "912--943", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2000-47-5/p912-chaudhuri/p912-chaudhuri.pdf; http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p912-chaudhuri/", abstract = "We prove tight bounds on the time needed to solve {\em $k$-set agreement}. In this problem, each processor starts with an arbitrary input value taken from a fixed set, and halts after choosing an output value. In every execution, at most $k$ distinct output values may be chosen, and every processor's output value must be some processor's input value. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of $ f / k + 1$ degree of coordination required, and the number of faults tolerated, even in idealized models like the synchronous model. The proof of this result is interesting because it is the first to apply topological techniques to the synchronous model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Design; Performance; Reliability; Theory", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Computer Systems Organization --- Computer-Communication Networks --- Distributed Systems (C.2.4): {\bf Distributed applications}; Computer Systems Organization --- Performance of Systems (C.4): {\bf Fault tolerance}; Computer Systems Organization --- Performance of Systems (C.4): {\bf Reliability, availability, and serviceability}; Software --- Programming Techniques --- Concurrent Programming (D.1.3): {\bf Distributed programming}; Software --- Software Engineering --- Software Architectures (D.2.11); Software --- Software Engineering --- Interoperability (D.2.12): {\bf Distributed objects}; Mathematics of Computing --- Discrete Mathematics --- Combinatorics (G.2.1)", } @Article{Kutylowski:2000:PSC, author = "Miros{\l}aw Kuty{\l}owski and Krzysztof Lory{\'s} and Brigitte Oesterdiekhoff and Rolf Wanka", title = "Periodification scheme: constructing sorting networks with constant period", journal = j-J-ACM, volume = "47", number = "5", pages = "944--967", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-5/p944-kutylowski/", abstract = "We consider comparator networks $M$ that are used repeatedly: while the output produced by $M$ is not sorted, it is fed again into $M$. Sorting algorithms working in this way are called {\em periodic}. The number of parallel steps performed during a single run of $M$ is called its {\em period}, the sorting {\em time\/} of $M$ is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.\par Previously, very little was known on such networks. The fastest solutions required time $ O(n^\epsilon)$ where the depth was roughly $ 1 / \epsilon $. We introduce a general method called {\em periodification scheme\/} that converts automatically an arbitrary sorting network that sorts $n$ items in time $ T(n)$ and that has layout area $ A(n)$ into a sorting network that has period 5, sorts $ \Theta (n \cdot T(n))$ items in time $ O(T(n) \cdot \log n)$, and has layout area $ O(A(n) \cdot T(n))$. In particular, applying this scheme to Batcher's algorithms, we get practical period 5 comparator networks that sort in time $ O(\log^3 n)$. For theoretical interest, one may use the AKS network resulting in a period 5 comparator network with runtime $ O(\log^2 n)$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Design", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "comparator network", subject = "Computer Systems Organization --- Computer System Implementation --- VLSI Systems (C.5.4); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}", } @Article{Albers:2000:MST, author = "Susanne Albers and Naveen Garg and Stefano Leonardi", title = "Minimizing stall time in single and parallel disk systems", journal = j-J-ACM, volume = "47", number = "6", pages = "969--986", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-6/p969-albers/", abstract = "We study integrated prefetching and caching problems following the work of Cao et al. [1995] and Kimbrel and Karlin [1996]. Cao et al. and Kimbrel and Karlin gave approximation algorithms for minimizing the total elapsed time in single and parallel disk settings. The total elapsed time is the sum of the processor stall times and the length of the request sequence to be served.\par We show that an optimum prefetching/caching schedule for a single disk problem can be computed in polynomial time, thereby settling an open question by Kimbrel and Karlin. For the parallel disk problem, we give an approximation algorithm for minimizing stall time. The solution uses a few extra memory blocks in cache. Stall time is an important and harder to approximate measure for this problem. All of our algorithms are based on a new approach which involves formulating the prefetching/caching problems as linear programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Design; Performance", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation algorithms; caching algorithms; prefetching", subject = "Software --- Operating Systems --- Storage Management (D.4.2): {\bf Storage hierarchies}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sequencing and scheduling}; Mathematics of Computing --- Numerical Analysis --- Optimization (G.1.6): {\bf Linear programming}", } @Article{Farach-Colton:2000:SCS, author = "Martin Farach-Colton and Paolo Ferragina and S. Muthukrishnan", title = "On the sorting-complexity of suffix tree construction", journal = j-J-ACM, volume = "47", number = "6", pages = "987--1011", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-6/p987-farach-colton/", abstract = "The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. We present a recursive technique for building suffix trees that yields optimal algorithms in different computational models. Sorting is an inherent bottleneck in building suffix trees and our algorithms match the sorting lower bound. Specifically, we present the following results. (1) Weiner [1973], who introduced the data structure, gave an optimal $ O(n)$-time algorithm for building the suffix tree of an $n$-character string drawn from a constant-size alphabet. In the comparison model, there is a trivial $ (n \log n)$-time lower bound based on sorting, and Weiner's algorithm matches this bound. For integer alphabets, the fastest known algorithm is the $ O(n \log n)$ time comparison-based algorithm, but no super-linear lower bound is known. Closing this gap is the main open question in stringology. We settle this open problem by giving a linear time reduction to sorting for building suffix trees. Since sorting is a lower-bound for building suffix trees, this algorithm is time-optimal in every alphabet mode. In particular, for an alphabet consisting of integers in a polynomial range we get the first known linear-time algorithm. (2) All previously known algorithms for building suffix trees exhibit a marked absence of locality of reference, and thus they tend to elicit many page faults (I/Os) when indexing very long strings. They are therefore unsuitable for building suffix trees in secondary storage devices, where I/Os dominate the overall computational cost. We give a linear-I/O reduction to sorting for suffix tree construction. Since sorting is a trivial I/O-lower bound for building suffix trees, our algorithm is I/O-optimal.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Design; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "DAM model; external-memory data structures; RAM model; sorting complexity; suffix array; suffix tree", subject = "Software --- Operating Systems --- Storage Management (D.4.2): {\bf Main memory}; Software --- Operating Systems --- Storage Management (D.4.2): {\bf Secondary storage}; Data --- Data Structures (E.1): {\bf Trees}; Data --- Files (E.5): {\bf Sorting/searching}; Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Pattern matching}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sorting and searching}; Information Systems --- Information Storage and Retrieval --- Content Analysis and Indexing (H.3.1): {\bf Indexing methods}", } @Article{Chazelle:2000:SHA, author = "Bernard Chazelle", title = "The soft heap: an approximate priority queue with optimal error rate", journal = j-J-ACM, volume = "47", number = "6", pages = "1012--1027", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-6/p1012-chazelle/", abstract = "A simple variant of a priority queue, called a {\em soft heap}, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat the logarithmic bound on the complexity of a heap in a comparison-based model. To break this information-theoretic barrier, the entropy of the data structure is reduced by artificially raising the values of certain keys. Given any mixed sequence of $n$ operations, a soft heap with error rate $ \epsilon $ (for any $ 0 < \epsilon < 1 / 2$) ensures that, at any time, at most $ \epsilon n$ of its items have their keys raised. The amortized complexity of each operation is constant, except for insert, which takes $ O(\log 1 / \epsilon)$ time. The soft heap is optimal for any value of $ \epsilon $ in a comparison-based model. The data structure is purely pointer-based. No arrays are move items across the data structure not individually, as is customary, but in groups, in a data-structuring equivalent of ``car pooling.'' Keys must be raised as a result, in order to preserve the heap ordering of the data structure. The soft heap can be used to compute exact or approximate medians and percentiles optimally. It is also useful for approximate sorting and for computing minimum spanning trees of general graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "amortization; heap; priority queue; soft heap", subject = "Data --- Data Structures (E.1)", } @Article{Chazelve:2000:MST, author = "Bernard Chazelve", title = "A minimum spanning tree algorithm with {Inverse-Ackermann} type complexity", journal = j-J-ACM, volume = "47", number = "6", pages = "1028--1047", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-6/p1028-chazelve/", abstract = "A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is $ O(m(m, n)) $, where is the classical functional inverse of Ackermann's function and $n$ (respectively, $m$) is the number of vertices (respectively, edges). The algorithm is comparison-based: it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "graphs; matroids; minimum spanning trees", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2)", } @Article{Goldberg:2000:CRC, author = "Leslie Ann Goldberg and Philip D. Mackenzie and Mike Paterson and Aravind Srinivasan", title = "Contention resolution with constant expected delay", journal = j-J-ACM, volume = "47", number = "6", pages = "1048--1096", year = "2000", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 10 19:20:14 MST 2001", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2000-47-6/p1048-goldberg/", abstract = "We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, $n$ users generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expected {\em delay\/} (time to get serviced) of every message is $ O(\log n)$ when messages are generated according to a Bernoulli distribution with generation rate up to about $ 1 / 10$. Our main results are the following protocols: (a) one in which the expected average message delay is $ O(1)$ when messages are generated according to a Bernoulli distribution with a generation rate smaller than $ 1 / e$, and (b) one in which the expected delay of any message is $ O(1)$ for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to $ 1 / e$. (Each message constitutes a new user.)\par To achieve (a), we first show how to simulate (b) using $n$ synchronized users, and then show how to build the synchronization into the protocol.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "contention resolution; Ethernet; Markov chains; multiple-access channel", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity (F.2); Mathematics of Computing --- Probability and Statistics (G.3)", } @Article{Chan:2001:DPC, author = "Timothy M. Chan", title = "Dynamic planar convex hull operations in near-logarithmic amortized time", journal = j-J-ACM, volume = "48", number = "1", pages = "1--12", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p1-chan/p1-chan.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p1-chan/", abstract = "We give a data structure that allows arbitrary insertions and deletions on a planar point set $P$ and supports basic queries on the convex hull of $P$, such as membership and tangent-finding. Updates take $ O(\log (1 + \epsilon n))$ amortized time and queries take $ O(\log n)$ time each, where $n$ is the maximum size of $P$ and $ \epsilon $ is any fixed positive constant. For some advanced queries such as bridge-finding, both our bounds increase to $ O(\log (3 / 2 n))$. The only previous fully dynamic solution was by Overmars and van Leeuwen from 1981 and required $ O(\log 2 n)$ time per update and $ O (\log n)$ time per query.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computational geometry; convex hulls; dynamic data structures", subject = "Data --- Data Structures (E.1); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Geometrical problems and computations}", } @Article{Borodin:2001:AQT, author = "Allan Borodin and Jon Kleinberg and Prabhakar Raghavan and Madhu Sudan and David P. Williamson", title = "Adversarial queuing theory", journal = j-J-ACM, volume = "48", number = "1", pages = "13--38", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p13-borodin/p13-borodin.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p13-borodin/", abstract = "We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. Our approach sheds light on various queuing policies in simple networks, and paves the way for a systematic study of queuing with few or no probabilistic assumptions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "packet routing; scheduling protocols; stability", subject = "Computer Systems Organization --- Computer-Communication Networks --- Network Architecture and Design (C.2.1): {\bf Store and forward networks}; Mathematics of Computing --- Probability and Statistics (G.3): {\bf Queueing theory}", } @Article{Andrews:2001:USR, author = "Matthew Andrews and Baruch Awerbuch and Antonio Fern{\'a}ndez and Tom Leighton and Zhiyong Liu and Jon Kleinberg", title = "Universal-stability results and performance bounds for greedy contention-resolution protocols", journal = j-J-ACM, volume = "48", number = "1", pages = "39--69", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p39-andrews/p39-andrews.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p39-andrews/", abstract = "In this paper, we analyze the behavior of packet-switched communication networks in which packets arrive dynamically at the nodes and are routed in discrete time steps across the edges. We focus on a basic adversarial model of packet arrival and path determination for which the time-averaged arrival rate of packets requiring the use of any edge is limited to be less than 1. This model can reflect the behavior of connection-oriented networks with transient connections (such as ATM networks) as well as connectionless networks (such as the Internet).\par We concentrate on greedy (also known as work-conserving) contention-resolution protocols. A crucial issue that arises in such a setting is that of {\em stability\/} --- will the number of packets in the system remain bounded, as the system runs for an arbitrarily long period of time? We study the universal stability of network (i.e., stability under all greedy protocols) and universal stability of protocols (i.e., stability in all networks). Once the stability of a system is granted, we focus on the two main parameters that characterize its performance: maximum queue size required and maximum end-to-end delay experienced by any packet.\par Among other things, we show:\par (i) There exist simple greedy protocols that are stable for all networks.\par (ii) There exist other commonly used protocols (such as FIFO) and networks (such as arrays and hypercubes) that are not stable.\par (iii) The $n$-node ring is stable for all greedy routing protocols (with maximum queue-size and packet delay that is linear in $n$).\par (iv) There exists a simple distributed randomized greedy protocol that is stable for all networks and requires only polynomial queue size and polynomial delay.\par Our results resolve several questions posed by Borodin et al., and provide the first examples of (i) a protocol that is stable for all networks, and (ii) a protocol that is not stable for all networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "adversarial queuing theory; end-to-end delay; network stability; packet scheduling", subject = "Computer Systems Organization --- Computer-Communication Networks --- Network Architecture and Design (C.2.1): {\bf Packet-switching networks}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sequencing and scheduling}; Computer Systems Organization --- Computer-Communication Networks --- Network Architecture and Design (C.2.1): {\bf Store and forward networks}", } @Article{Basin:2001:ACA, author = "David Basin and Harald Ganzinger", title = "Automated complexity analysis based on ordered resolution", journal = j-J-ACM, volume = "48", number = "1", pages = "70--109", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p70-basin/p70-basin.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p70-basin/", abstract = "We define order locality to be a property of clauses relative to a term ordering. This property generalizes the subformula property for proofs where the terms appearing in proofs can be bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrivial entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory; Verification", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "automated theorem proving; complexity analysis; first-order theories; ordered resolution", subject = "Theory of Computation --- Computation by Abstract Devices --- Complexity Measures and Classes (F.1.3); Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1); Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3)", } @Article{Case:2001:LCA, author = "John Case and Dayanand S. Rajan and Anil M. Shende", title = "Lattice computers for approximating {Euclidean} space", journal = j-J-ACM, volume = "48", number = "1", pages = "110--144", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p110-case/p110-case.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p110-case/", abstract = "In the context of mesh-like, parallel processing computers for (i) approximating continuous space and (ii) {\em analog\/} simulation of the motion of objects and waves in continuous space, the present paper is concerned with {\em which\/} mesh-like interconnection of processors might be particularly suitable for the task and why.\par Processor interconnection schemes based on nearest neighbor connections in geometric lattices are presented along with motivation. Then two major threads are exploded regarding which lattices would be good: the {\em regular lattices}, for their symmetry and other properties in common with continuous space, and the well-known {\em root lattices}, for being, in a sense, the lattices required for physically natural basic algorithms for motion.\par The main theorem of the present paper implies that {\em the well-known lattice} $ A n $ is the regular lattice having the maximum number of nearest neighbors among the $n$-dimensional regular lattices. It is noted that the only $n$-dimensional lattices that are both regular and root are $ A n$ and $ Z n$ ($ Z n$ is the lattice of $n$-cubes). The remainder of the paper specifies other desirable properties of $ A n$ including other ways it is superior to $ Z n$ for our purposes.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Design; Theory", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Hardware --- Input/Output and Data Communications --- Interconnections (Subsystems) (B.4.3): {\bf Topology}; Theory of Computation --- Computation by Abstract Devices --- Models of Computation (F.1.1): {\bf Unbounded-action devices}; Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2): {\bf Parallelism and concurrency}; Mathematics of Computing --- Numerical Analysis --- General (G.1.0): {\bf Parallel algorithms}; Computing Methodologies --- Artificial Intelligence --- Vision and Scene Understanding (I.2.10): {\bf Motion}", } @Article{Siekmann:2001:ECW, author = "J{\"o}rg H. Siekmann and Graham Wrightson", title = "Erratum: a counterexample to {W. Bibel}'s and {E. Eder}'s strong completeness result for connection graph resolution", journal = j-J-ACM, volume = "48", number = "1", pages = "145--147", month = jan, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:06 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{Bibel:1997:DTR}.", URL = "http://www.acm.org/pubs/articles/journals/jacm/2001-48-1/p145-siekmann/p145-siekmann.pdf; http://www.acm.org/pubs/citations/journals/jacm/2001-48-1/p145-siekmann/", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computational logic; mathematical logic; mechanical theorem proving", subject = "Theory of Computation --- Computation by Abstract Devices --- Complexity Measures and Classes (F.1.3): {\bf Machine-independent complexity^}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Complexity of proof procedures}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Mechanical theorem proving}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Deduction}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Proof theory}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Resolution}", } @Article{Ben-Sasson:2001:SPN, author = "Eli Ben-Sasson and Avi Wigderson", title = "Short proofs are {narrow---resolution} made simple", journal = j-J-ACM, volume = "48", number = "2", pages = "149--169", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p149-ben-sasson/", abstract = "The {\em width\/} of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (=size), in both general Resolution, and its tree-like variant. The following consequences of these relations reveal width as a crucial ``resource'' of Resolution proofs.\par In one direction, the relations allow us to give {\em simple, unified\/} proofs for almost all known exponential lower bounds on size of resolution proofs, as well as several interesting new ones. They all follow from width lower bounds, and we show how these follow from natural expansion property of clauses of the input tautology.\par In the other direction, the width-size relations naturally suggest a simple dynamic programming procedure for automated theorem proving--one which simply searches for small width proofs. This relation guarantees that the running time (and thus the size of the produced proof) is at most quasi-polynomial in the smallest tree-like proof. This algorithm is never much worse than any of the recursive automated provers (such as DLL) used in practice. In contrast, we present a family of tautologies on which it is exponentially faster.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Proof theory}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3)", } @Article{Roura:2001:IMT, author = "Salvador Roura", title = "Improved master theorems for divide-and-conquer recurrences", journal = j-J-ACM, volume = "48", number = "2", pages = "170--205", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p170-roura/", abstract = "This paper presents new theorems to analyze divide-and-conquer recurrences, which improve other similar ones in several aspects. In particular, these theorems provide more information, free us almost completely from technicalities like floors and ceilings, and cover a wider set of toll functions and weight distributions, stochastic recurrences included.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Measurement; Performance", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "asymptotic analysis; divide-and-conquer; master theorem", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity (F.2); Mathematics of Computing --- Discrete Mathematics --- Combinatorics (G.2.1): {\bf Recurrences and difference equations}", } @Article{Skutella:2001:CQS, author = "Martin Skutella", title = "Convex quadratic and semidefinite programming relaxations in scheduling", journal = j-J-ACM, volume = "48", number = "2", pages = "206--242", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p206-skutella/", abstract = "We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a provably good convex quadratic programming relaxation of strongly polynomial size for this problem. The best previously known approximation algorithms are based on LP relaxations in time- or interval-indexed variables. Those LP relaxations, however, suffer from a huge number of variables. As a result of the convex quadratic programming approach we can give a very simple and easy to analyze 2-approximation algorithm which can be further improved to performance guarantee 3/2 in the absence of release dates. We also consider preemptive scheduling problems and derive approximation algorithms and results on the power of preemption which improve upon the best previously known results for these settings. Finally, for the special case of two machines we introduce a more sophisticated semidefinite programming relaxation and apply the random hyperplane technique introduced by Goemans and Williamson for the MaxCut problem; this leads to an improved 1.2752-approximation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation algorithms; convex optimization; performance guarantee; randomized algorithms; scheduling theory; unrelated machines; worst-case ratio", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sequencing and scheduling}; Mathematics of Computing --- Numerical Analysis --- Optimization (G.1.6): {\bf Convex programming}; Mathematics of Computing --- Discrete Mathematics --- General (G.2.0); Mathematics of Computing --- Probability and Statistics (G.3): {\bf Probabilistic algorithms (including Monte Carlo)}; Computing Methodologies --- Symbolic and Algebraic Manipulation --- Algorithms (I.1.2): {\bf Analysis of algorithms}", } @Article{Dooly:2001:LAT, author = "Daniel R. Dooly and Sally A. Goldman and Stephen D. Scott", title = "On-line analysis of the {TCP} acknowledgment delay problem", journal = j-J-ACM, volume = "48", number = "2", pages = "243--273", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p243-dooly/", abstract = "We study an on-line problem that is motivated by the networking problem of dynamically adjusting of acknowledgments in the Transmission Control Protocol (TCP). We provide a theoretical model for this problem in which the goal is to send acks at a time that minimize a linear combination of the cost for the number of acknowledgments sent and the cost for the additional latency introduced by delaying acknowledgments. To study the usefulness of applying packet arrival time prediction to this problem, we assume there is an oracle that provides the algorithm with the times of the next $L$ arrivals, for some $ L > 0$.\par We give two different objective functions for measuring the cost of a solution, each with its own measure of latency cost. For each objective function we first give an $ O(n^2)$-time dynamic programming algorithm for optimally solving the off-line problem. Then we describe an on-line algorithm that greedily acknowledges exactly when the cost for an acknowledgment is less than the latency cost incurred by not acknowledging. We show that for this algorithm there is a sequence of $n$ packet arrivals for which it is ($^*$)-competitive for the first objective function, 2-competitive for the second function for $ L = 0$, and 1-competitive for the second function for $ L = 1$. Next we present a second on-line algorithm which is a slight modification of the first, and we prove that it is 2-competitive for both objective functions for all $L$. We also give lower bounds on the competitive ratio for any deterministic on-line algorithm. These results show that for each objective function, at least one of our algorithms is optimal.\par Finally, we give some initial empirical results using arrival sequences from real network traffic where we compare the two methods used in TCP for acknowledgment delay with our two on-line algorithms. In all cases we examine performance with $ L = 0$ and $ L = 1$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "acknowledgment delay problem; competitive analysis; Internet traffic simulations; lookahead; Transmission Control Protocol (TCP)", subject = "Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2): {\bf Online computation}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Sequencing and scheduling}; Computer Systems Organization --- Computer-Communication Networks --- Network Protocols (C.2.2): {\bf Applications (SMTP, FTP, etc.)}", } @Article{Jain:2001:AAM, author = "Kamal Jain and Vijay V. Vazirani", title = "Approximation algorithms for metric facility location and $k$ {-Median} problems using the primal-dual schema and {Lagrangian} relaxation", journal = j-J-ACM, volume = "48", number = "2", pages = "274--296", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p274-jain/", abstract = "We present approximation algorithms for the metric uncapacitated facility location problem and the metric $k$-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: $ O(m \log m)$ and $ O(m \log m(L + \log (n)))$ respectively, where $n$ and $m$ are the total number of vertices and edges in the underlying complete bipartite graph on cities and facilities. The main algorithmic ideas are a new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2)", } @Article{Chong:2001:CTO, author = "Ka Wong Chong and Yijie Han and Tak Wah Lam", title = "Concurrent threads and optimal parallel minimum spanning trees algorithm", journal = j-J-ACM, volume = "48", number = "2", pages = "297--323", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p297-chong/", abstract = "This paper resolves a long-standing open problem on whether the concurrent write capability of parallel random access machine (PRAM) is essential for solving fundamental graph problems like connected components and minimum spanning trees in $ O(\log n) $ time. Specifically, we present a new algorithm to solve these problems in $ O(\log n) $ time using a linear number of processors on the exclusive-read exclusive-write PRAM. The logarithmic time bound is actually optimal since it is well known that even computing the ``OR'' of $n$ bit requires $ \log n$ time on the exclusive-write PRAM. The efficiency achieved by the new algorithm is based on a new schedule which can exploit a high degree of parallelism.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "connected components; EREW PRAM; minimum spanning trees; parallel algorithms", subject = "Theory of Computation --- Computation by Abstract Devices --- Modes of Computation (F.1.2): {\bf Parallelism and concurrency}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Graph algorithms}", } @Article{Broder:2001:GAD, author = "Andrei Z. Broder and Alan M. Frieze and Eli Upfal", title = "A general approach to dynamic packet routing with bounded buffers", journal = j-J-ACM, volume = "48", number = "2", pages = "324--349", month = mar, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-2/p324-broder/", abstract = "We prove a sufficient condition for the stability of dynamic packet routing algorithms. Our approach reduces the problem of steady state analysis to the easier and better understood question of static routing. We show that certain high probability and worst case bounds on the quasi-static (finite past) performance of a routing algorithm imply bounds on the performance of the dynamic version of that algorithm. Our technique is particularly useful in analyzing routing on networks with bounded buffers where complicated dependencies make standard queuing techniques inapplicable.\par We present several applications of our approach. In all cases we start from a known static algorithm, and modify it to fit our framework. In particular we give the first dynamic algorithms for routing on a butterfly or two-dimensional mesh with bounded buffers. Both the injection rate for which the algorithm is stable, and the expected time a packet spends in the system are optimal up to constant factors. Our approach is also applicable to the recently introduced adversarial input model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Theory", journal-URL = "https://dl.acm.org/loi/jacm", subject = "Computer Systems Organization --- Computer-Communication Networks --- Network Architecture and Design (C.2.1); Computer Systems Organization --- Computer-Communication Networks --- Network Protocols (C.2.2); Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2)", } @Article{Mayers:2001:USQ, author = "Dominic Mayers", title = "Unconditional security in quantum cryptography", journal = j-J-ACM, volume = "48", number = "3", pages = "351--406", month = may, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p351-mayers/", abstract = "Basic techniques to prove the unconditional security of quantum cryptography are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard [1984]. The proof considers a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission. Each individual signal sent into the channel must contain a single photon or any two-dimensional system in the exact state described in the protocol. No restriction is imposed on the detector used at the receiving side of the channel, except that whether or not the received system is detected must be independent of the basis used to measure this system.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Security", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "quantum cryptography; quantum information theory; unconditional security", subject = "Data --- Data Encryption (E.3): {\bf Public key cryptosystems}", } @Article{Manzini:2001:ABW, author = "Giovanni Manzini", title = "An analysis of the {Burrows --- Wheeler} transform", journal = j-J-ACM, volume = "48", number = "3", pages = "407--430", month = may, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p407-manzini/", abstract = "The Burrows--Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms that are the state of the art in lossless data compression. In this paper, we analyze two algorithms that use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity outperforms the Gzip compressor. The second one uses an additional run-length encoding step to improve compression. We prove that the compression ratio of both algorithms can be bounded in terms of the $k$ th order empirical entropy of the input string for any $ k > 0$. We make no assumptions on the input and we obtain bounds which hold in the worst case that is for every possible input string. All previous results for Block-Sorting algorithms were concerned with the average compression ratio and have been established assuming that the input comes from a finite-order Markov source.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "block sorting; Burrows --- move-to-front encoding; Wheeler transform; worst-case analysis of compression", subject = "Data --- Coding and Information Theory (E.4): {\bf Data compaction and compression}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2)", } @Article{Gottlob:2001:CAC, author = "Georg Gottlob and Nicola Leone and Francesco Scarcello", title = "The complexity of acyclic conjunctive queries", journal = j-J-ACM, volume = "48", number = "3", pages = "431--498", month = may, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "acyclic hypergraph; algorithm; bounded treewidth; conjunctive query; constraint; constraint satisfaction problem; CSP; database theory; degree of cyclicity; hinge; join tree; LOGCFL; parallel algorithm; query containment; query-width; subsumption; tree query", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Computations on discrete structures}; Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2): {\bf Complexity of proof procedures}; Information Systems --- Database Management --- Systems (H.2.4): {\bf Query processing}; Information Systems --- Database Management --- Systems (H.2.4): {\bf Parallel databases}; Information Systems --- Database Management --- Systems (H.2.4): {\bf Rule-based databases}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Answer/reason extraction}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Deduction}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Inference engines}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Logic programming}; Computing Methodologies --- Artificial Intelligence --- Deduction and Theorem Proving (I.2.3): {\bf Resolution}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Backtracking}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Graph and tree search strategies}; Computing Methodologies --- Artificial Intelligence --- Problem Solving, Control Methods, and Search (I.2.8): {\bf Plan execution, formation, and generation}", } @Article{Bazzi:2001:SFT, author = "Rida A. Bazzi and Gil Neiger", title = "Simplifying fault-tolerance: providing the abstraction of crash failures", journal = j-J-ACM, volume = "48", number = "3", pages = "499--554", month = may, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p499-bazzi/", abstract = "The difficulty of designing fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate, especially for systems with synchronous message passing. This paper considers methods that automatically translate algorithms tolerant of simple crash failures into ones tolerant of more severe failures. These translations simplify the design task by allowing algorithm designers to assume that processors fail only by stopping. Such translations can be quantified by two measures: {\em fault-tolerance}, which is a measure of how many processors must remain correct for the translation to be correct, and {\em round-complexity}, which is a measure of how the translation increases the running time of an algorithm. Understanding these translations and their limitations with respect to these measures can provide insight into the relative impact of different models of faculty behavior on the ability to provide fault-tolerant applications for systems with synchronous message passing. \par This paper considers translations from crash failures to each of the following types of more severe failures: omission to send messages; omission to send and receive messages; and totally arbitrary behavior. It shows that previously developed translations to send-omission failures are optimal with respect to both fault-tolerance and round-complexity. It exhibits a hierarchy of translations to general (send/receive) omission failures that improves upon the fault-tolerance of previously developed translations. These translations are optimal in that they cannot be improved with respect to one measure without negatively affecting the other; that is, the hierarchy of translations is matched by corresponding hierarchy of impossibility results. The paper also gives a hierarchy of translations to arbitrary failures that improves upon the round-complexity of previously developed translations. These translations are near-optimal", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Algorithms; Reliability; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "crash failures; fault-tolerance; translations", subject = "Computer Systems Organization --- Computer-Communication Networks --- Distributed Systems (C.2.4): {\bf Distributed applications}; Software --- Programming Techniques --- Concurrent Programming (D.1.3): {\bf Distributed programming}; Software --- Operating Systems --- Reliability (D.4.5): {\bf Fault-tolerance}", } @Article{Davies:2001:MAS, author = "Rowan Davies and Frank Pfenning", title = "A modal analysis of staged computation", journal = j-J-ACM, volume = "48", number = "3", pages = "555--604", month = may, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:52:07 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p555-davies/", abstract = "We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of typed ?-calculi and functional languages. We directly demonstrate the sense in which our $ e^*$-calculus captures staging, and also give a conservative embedding of Nielson and Nielson's two-level functional language in our functional language Mini-ML$^*$, thus proving that binding-time correctness is equivalent to modal correctness on this fragment. In addition Mini-ML$^*$ can also express immediate evaluation and sharing of code across multiple stages, thus supporting run-time code generation as well as partial evaluation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", generalterms = "Languages; Theory", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "binding times; run-time code generation; staged computation", subject = "Software --- Programming Languages --- Language Constructs and Features (D.3.3); Theory of Computation --- Logics and Meanings of Programs --- Semantics of Programming Languages (F.3.2): {\bf Partial evaluation}; Theory of Computation --- Logics and Meanings of Programs --- Studies of Program Constructs (F.3.3): {\bf Type structure}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Lambda calculus and related systems}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Model theory}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Proof theory}", } @Article{Darwiche:2001:DNN, author = "Adnan Darwiche", title = "Decomposable negation normal form", journal = j-J-ACM, volume = "48", number = "4", pages = "608--647", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Friedman:2001:PMD, author = "Nir Friedman and Joseph Y. Halpern", title = "Plausibility measures and default reasoning", journal = j-J-ACM, volume = "48", number = "4", pages = "648--685", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hochbaum:2001:EAI, author = "Dorit S. Hochbaum", title = "An efficient algorithm for image segmentation, {Markov} random fields and related problems", journal = j-J-ACM, volume = "48", number = "4", pages = "686--701", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Boneh:2001:EGS, author = "Dan Boneh and Matthew Franklin", title = "Efficient generation of shared {RSA} keys", journal = j-J-ACM, volume = "48", number = "4", pages = "702--722", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Holm:2001:PLD, author = "Jacob Holm and Kristian de Lichtenberg and Mikkel Thorup", title = "Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, $2$-edge, and biconnectivity", journal = j-J-ACM, volume = "48", number = "4", pages = "723--760", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Iwata:2001:CSP, author = "Satoru Iwata and Lisa Fleischer and Satoru Fujishige", title = "A combinatorial strongly polynomial algorithm for minimizing submodular functions", journal = j-J-ACM, volume = "48", number = "4", pages = "761--777", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beals:2001:QLB, author = "Robert Beals and Harry Buhrman and Richard Cleve and Michele Mosca and Ronald de Wolf", title = "Quantum lower bounds by polynomials", journal = j-J-ACM, volume = "48", number = "4", pages = "778--797", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haastad:2001:SOI, author = "Johan H{\aa}stad", title = "Some optimal inapproximability results", journal = j-J-ACM, volume = "48", number = "4", pages = "798--859", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Trevisan:2001:EPG, author = "Luca Trevisan", title = "Extractors and pseudorandom generators", journal = j-J-ACM, volume = "48", number = "4", pages = "860--879", month = jul, year = "2001", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/502090.502099", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 2002", 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 = "We introduce a new approach to constructing extractors. Extractors are algorithms that transform a `weakly random' distribution into an almost uniform distribution. Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to obtain. We demonstrate an unsuspected connection between extractors and pseudorandom generators. In fact, we show that every pseudorandom generator of a certain kind is an extractor. A pseudorandom generator construction due to Impagliazzo and Wigderson, once reinterpreted via our connection, is already an extractor that beats most known constructions and solves an important open question. We also show that, using the simpler Nisan--Wigderson generator and standard error-correcting codes, one can build even better extractors with the additional advantage that both the construction and the analysis are simple and admit a short self-contained description.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hella:2001:LAO, author = "Lauri Hella and Leonid Libkin and Juha Nurmonen and Limsoon Wong", title = "Logics with aggregate operators", journal = j-J-ACM, volume = "48", number = "4", pages = "880--907", month = jul, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:42:49 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Meghini:2001:MMI, author = "Carlo Meghini and Fabrizio Sebastiani and Umberto Straccia", title = "A model of multimedia information retrieval", journal = j-J-ACM, volume = "48", number = "5", pages = "909--970", month = sep, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:37:22 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halevy:2001:SAD, author = "Alon Y. Halevy and Inderpal Singh Mumick and Yehoshua Sagiv and Oded Shmueli", title = "Static analysis in datalog extensions", journal = j-J-ACM, volume = "48", number = "5", pages = "971--1012", month = sep, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:37:22 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Attiya:2001:IIB, author = "Hagit Attiya and Eyal Dagan", title = "Improved implementations of binary universal operations", journal = j-J-ACM, volume = "48", number = "5", pages = "1013--1037", month = sep, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:37:22 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hickey:2001:IAP, author = "T. Hickey and Q. Ju and M. H. {Van Emden}", title = "Interval arithmetic: {From} principles to implementation", journal = j-J-ACM, volume = "48", number = "5", pages = "1038--1068", month = sep, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:37:22 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "http://csr.uvic.ca/~vanemden/Publications/hickeyJuvE.ps; http://www.cs.brandeis.edu/~tim/Papers/jacm01.pdf; http://www.cs.brandeis.edu/~tim/Papers/jacm01.ps; http://www.cs.brandeis.edu/~tim/Papers/jacm01.ps.gz", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", subject = "D. Software: D.2 SOFTWARE ENGINEERING: D.2.4 Software/Program Verification Subjects: Correctness proofs; Additional Classification: D. Software: D.2 SOFTWARE ENGINEERING: D.2.4 Software/Program Verification Subjects: Validation; G. Mathematics of Computing: G.0 GENERAL: G.1 NUMERICAL ANALYSIS: G.1.0 General: Subjects: Error analysis; Computer arithmetic; Conditioning (and ill-conditioning); Interval arithmetic. G.1.5 Roots of Nonlinear Equations: Subjects: Iterative methods", } @Article{Bar-Noy:2001:UAA, author = "Amotz Bar-Noy and Reuven Bar-Yehuda and Ari Freund and Joseph (Seffi) Naor and Baruch Schieber", title = "A unified approach to approximating resource allocation and scheduling", journal = j-J-ACM, volume = "48", number = "5", pages = "1069--1090", month = sep, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:37:22 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Liberatore:2001:MRR, author = "Paolo Liberatore", title = "Monotonic reductions, representative equivalence, and compilation of intractable problems", journal = j-J-ACM, volume = "48", number = "6", pages = "1091--1125", month = nov, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lasserre:2001:LTA, author = "Jean B. Lasserre and Eduardo S. Zeron", title = "A {Laplace} transform algorithm for the volume of a convex polytope", journal = j-J-ACM, volume = "48", number = "6", pages = "1126--1140", month = nov, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gal:2001:MPU, author = "Avigdor Gal and Jonathan Eckstein", title = "Managing periodically updated data in relational databases: a stochastic modeling approach", journal = j-J-ACM, volume = "48", number = "6", pages = "1141--1183", month = nov, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Frick:2001:DFO, author = "Markus Frick and Martin Grohe", title = "Deciding first-order properties of locally tree-decomposable structures", journal = j-J-ACM, volume = "48", number = "6", pages = "1184--1206", month = nov, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bergstra:2001:RMB, author = "Jan A. Bergstra and Alban Ponse", title = "Register-machine based processes", journal = j-J-ACM, volume = "48", number = "6", pages = "1207--1241", month = nov, year = "2001", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lee:2002:FCF, author = "Lillian Lee", title = "Fast context-free grammar parsing requires fast {Boolean} matrix multiplication", journal = j-J-ACM, volume = "49", number = "1", pages = "1--15", month = jan, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Pettie:2002:OMS, author = "Seth Pettie and Vijaya Ramachandran", title = "An optimal minimum spanning tree algorithm", journal = j-J-ACM, volume = "49", number = "1", pages = "16--34", month = jan, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hellerstein:2002:MIB, author = "Joseph M. Hellerstein and Elias Koutsoupias and Daniel P. Miranker and Christos H. Papadimitriou and Vasilis Samoladas", title = "On a model of indexability and its bounds for range queries", journal = j-J-ACM, volume = "49", number = "1", pages = "35--55", month = jan, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Neven:2002:ESD, author = "Frank Neven and Jan {Van Den Bussche}", title = "Expressiveness of structured document query languages based on attribute grammars", journal = j-J-ACM, volume = "49", number = "1", pages = "56--100", month = jan, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haldar:2002:BCT, author = "Sibsankar Haldar and Paul Vit{\'a}nyi", title = "Bounded concurrent timestamp systems using vector clocks", journal = j-J-ACM, volume = "49", number = "1", pages = "101--126", month = jan, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 1 16:35:09 MST 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2002:MG, author = "Zhi-Zhong Chen and Michelangelo Grigni and Christos H. Papadimitriou", title = "Map graphs", journal = j-J-ACM, volume = "49", number = "2", pages = "127--138", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ostrovsky:2002:PTA, author = "Rafail Ostrovsky and Yuval Rabani", title = "Polynomial-time approximation schemes for geometric min-sum median clustering", journal = j-J-ACM, volume = "49", number = "2", pages = "139--156", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Li:2002:CSS, author = "Ming Li and Bin Ma and Lusheng Wang", title = "On the closest string and substring problems", journal = j-J-ACM, volume = "49", number = "2", pages = "157--171", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Asarin:2002:TRE, author = "Eugene Asarin and Paul Caspi and Oded Maler", title = "Timed regular expressions", journal = j-J-ACM, volume = "49", number = "2", pages = "172--206", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Low:2002:UTV, author = "Steven H. Low and Larry L. Peterson and Limin Wang", title = "Understanding {TCP Vegas}: a duality model", journal = j-J-ACM, volume = "49", number = "2", pages = "207--235", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Roughgarden:2002:HBS, author = "Tim Roughgarden and {\'E}va Tardos", title = "How bad is selfish routing?", journal = j-J-ACM, volume = "49", number = "2", pages = "236--259", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harchol-Balter:2002:TAU, author = "Mor Harchol-Balter", title = "Task assignment with unknown duration", journal = j-J-ACM, volume = "49", number = "2", pages = "260--288", month = mar, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 25 17:35:56 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zwick:2002:APS, author = "Uri Zwick", title = "All pairs shortest paths using bridging sets and rectangular matrix multiplication", journal = j-J-ACM, volume = "49", number = "3", pages = "289--317", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ajtai:2002:CEU, author = "Miklos Ajtai and Randal Burns and Ronald Fagin and Darrell D. E. Long and Larry Stockmeyer", title = "Compactly encoding unstructured inputs with differential compression", journal = j-J-ACM, volume = "49", number = "3", pages = "318--367", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fan:2002:XIC, author = "Wenfei Fan and Leonid Libkin", title = "On {XML} integrity constraints in the presence of {DTDs}", journal = j-J-ACM, volume = "49", number = "3", pages = "368--406", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kameda:2002:PDD, author = "Hisao Kameda and Odile Pourtallier", title = "Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers", journal = j-J-ACM, volume = "49", number = "3", pages = "407--433", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Frumkin:2002:TBC, author = "Michael A. Frumkin and Rob F. {Van der Wijngaart}", title = "Tight bounds on cache use for stencil operations on rectangular grids", journal = j-J-ACM, volume = "49", number = "3", pages = "434--453", month = may, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 10 17:35:44 MDT 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 Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dubois:2002:QDT, author = "Didier Dubois and H{\'e}l{\`e}ne Fargier and Henri Prade and Patrice Perny", title = "Qualitative decision theory: from {Savage}'s axioms to nonmonotonic reasoning", journal = j-J-ACM, volume = "49", number = "4", pages = "455--495", month = jul, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ambainis:2002:DQC, author = "Andris Ambainis and Ashwin Nayak and Amnon Ta-Shma and Umesh Vazirani", title = "Dense quantum coding and quantum finite automata", journal = j-J-ACM, volume = "49", number = "4", pages = "496--511", month = jul, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{McAllester:2002:CAS, author = "David McAllester", title = "On the complexity analysis of static analyses", journal = j-J-ACM, volume = "49", number = "4", pages = "512--537", month = jul, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bhargavan:2002:FVS, author = "Karthikeyan Bhargavan and Davor Obradovic and Carl A. Gunter", title = "Formal verification of standards for distance vector routing protocols", journal = j-J-ACM, volume = "49", number = "4", pages = "538--576", month = jul, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lehmann:2002:TRA, author = "Daniel Lehmann and Liadan Ita O'Callaghan and Yoav Shoham", title = "Truth revelation in approximately efficient combinatorial auctions", journal = j-J-ACM, volume = "49", number = "5", pages = "577--602", month = sep, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Huson:2002:GPM, author = "Daniel H. Huson and Knut Reinert and Eugene W. Myers", title = "The greedy path-merging algorithm for contig scaffolding", journal = j-J-ACM, volume = "49", number = "5", pages = "603--615", month = sep, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kleinberg:2002:AAC, author = "Jon Kleinberg and {\'E}va Tardos", title = "Approximation algorithms for classification problems with pairwise relationships: metric labeling and {Markov} random fields", journal = j-J-ACM, volume = "49", number = "5", pages = "616--639", month = sep, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Seiden:2002:OPP, author = "Steven S. Seiden", title = "On the online bin packing problem", journal = j-J-ACM, volume = "49", number = "5", pages = "640--671", month = sep, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alur:2002:ATT, author = "Rajeev Alur and Thomas A. Henzinger and Orna Kupferman", title = "Alternating-time temporal logic", journal = j-J-ACM, volume = "49", number = "5", pages = "672--713", month = sep, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:2002:UTP, author = "Joe Halpern", title = "Update: {Time} to publication statistics", journal = j-J-ACM, volume = "49", number = "6", pages = "715--715", month = nov, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Flum:2002:QET, author = "J{\"o}rg Flum and Markus Frick and Martin Grohe", title = "Query evaluation via tree-decompositions", journal = j-J-ACM, volume = "49", number = "6", pages = "716--752", month = nov, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stockmeyer:2002:CLB, author = "Larry Stockmeyer and Albert R. Meyer", title = "Cosmological lower bound on the circuit complexity of a small problem in logic", journal = j-J-ACM, volume = "49", number = "6", pages = "753--784", month = nov, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Caplain:2002:CPS, author = "Gilbert Caplain", title = "Correctness properties in a shared-memory parallel language", journal = j-J-ACM, volume = "49", number = "6", pages = "785--827", month = nov, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sen:2002:TTC, author = "Sandeep Sen and Siddhartha Chatterjee and Neeraj Dumir", title = "Towards a theory of cache-efficient algorithms", journal = j-J-ACM, volume = "49", number = "6", pages = "828--858", month = nov, year = "2002", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:34:59 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:2003:JA, author = "Joseph Y. Halpern", title = "{JACM}'s 50th anniversary", journal = j-J-ACM, volume = "50", number = "1", pages = "3--7", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Staff:2003:JEC, author = "{Journal of the ACM staff}", title = "{JACM} editors-in-chief", journal = j-J-ACM, volume = "50", number = "1", pages = "9--9", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alt:2003:JAB, author = "Franz Alt", title = "{Journal of the ACM}---the beginnings", journal = j-J-ACM, volume = "50", number = "1", pages = "10--11", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Juncosa:2003:T, author = "Mario L. Juncosa", title = "Transitions 1959--1964", journal = j-J-ACM, volume = "50", number = "1", pages = "12--13", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gotlieb:2003:GAJ, author = "C. C. Gotlieb", title = "A {Golden Age} for {JACM}", journal = j-J-ACM, volume = "50", number = "1", pages = "14--14", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Miller:2003:J, author = "Ray Miller", title = "{JACM} 1973--1975", journal = j-J-ACM, volume = "50", number = "1", pages = "15--15", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Coffman:2003:J, author = "Ed Coffman", title = "{JACM} 1976--1979", journal = j-J-ACM, volume = "50", number = "1", pages = "16--16", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fischer:2003:J, author = "Michael J. Fischer", title = "{JACM} 1983--1986", journal = j-J-ACM, volume = "50", number = "1", pages = "17--17", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rosenkrantz:2003:J, author = "Daniel J. Rosenkrantz", title = "{JACM} 1986--1990", journal = j-J-ACM, volume = "50", number = "1", pages = "18--18", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Leighton:2003:J, author = "Tom Leighton", title = "{JACM} 1991--1997", journal = j-J-ACM, volume = "50", number = "1", pages = "19--19", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mandelbaum:2003:RH, author = "Mark Mandelbaum", title = "A report from {Headquarters}", journal = j-J-ACM, volume = "50", number = "1", pages = "21--23", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brooks:2003:TGC, author = "Frederick P. {Brooks, Jr.}", title = "Three great challenges for half-century-old computer science", journal = j-J-ACM, volume = "50", number = "1", pages = "25--26", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cook:2003:IPV, author = "Stephen Cook", title = "The importance of the {P} versus {NP} question", journal = j-J-ACM, volume = "50", number = "1", pages = "27--29", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Corbato:2003:CSC, author = "Fernando J. Corbat{\'o}", title = "On computer system challenges", journal = j-J-ACM, volume = "50", number = "1", pages = "30--31", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Feigenbaum:2003:SCG, author = "Edward A. Feigenbaum", title = "Some challenges and grand challenges for computational intelligence", journal = j-J-ACM, volume = "50", number = "1", pages = "32--40", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gray:2003:WND, author = "Jim Gray", title = "What next?: a dozen information-technology research goals", journal = j-J-ACM, volume = "50", number = "1", pages = "41--57", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hartmanis:2003:SCC, author = "Juris Hartmanis", title = "Separation of complexity classes", journal = j-J-ACM, volume = "50", number = "1", pages = "58--62", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hoare:2003:VCG, author = "Tony Hoare", title = "The verifying compiler: a grand challenge for computing research", journal = j-J-ACM, volume = "50", number = "1", pages = "63--69", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lampson:2003:GCU, author = "Butler Lampson", title = "Getting computers to understand", journal = j-J-ACM, volume = "50", number = "1", pages = "70--72", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{McCarthy:2003:PPC, author = "John McCarthy", title = "Problems and projections in {CS} for the next 49 years", journal = j-J-ACM, volume = "50", number = "1", pages = "73--79", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Razborov:2003:PPC, author = "Alexander Razborov", title = "Propositional proof complexity", journal = j-J-ACM, volume = "50", number = "1", pages = "80--82", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Reddy:2003:TOP, author = "Raj Reddy", title = "Three open problems in {AI}", journal = j-J-ACM, volume = "50", number = "1", pages = "83--86", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Shor:2003:WHM, author = "Peter W. Shor", title = "Why haven't more quantum algorithms been found?", journal = j-J-ACM, volume = "50", number = "1", pages = "87--90", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stearns:2003:DVN, author = "Richard E. Stearns", title = "Deterministic versus nondeterministic time and lower bound problems", journal = j-J-ACM, volume = "50", number = "1", pages = "91--95", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Valiant:2003:TPC, author = "Leslie G. Valiant", title = "Three problems in computer science", journal = j-J-ACM, volume = "50", number = "1", pages = "96--99", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Yao:2003:CPC, author = "Andrew Chi-Chih Yao", title = "Classical physics and the {Church--Turing Thesis}", journal = j-J-ACM, volume = "50", number = "1", pages = "100--105", month = jan, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dechter:2003:MBG, author = "Rina Dechter and Irina Rish", title = "Mini-buckets: a general scheme for bounded inference", journal = j-J-ACM, volume = "50", number = "2", pages = "107--153", month = mar, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beame:2003:TST, author = "Paul Beame and Michael Saks and Xiaodong Sun and Erik Vee", title = "Time-space trade-off lower bounds for randomized computation of decision problems", journal = j-J-ACM, volume = "50", number = "2", pages = "154--195", month = mar, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sahai:2003:CPS, author = "Amit Sahai and Salil Vadhan", title = "A complete problem for statistical zero knowledge", journal = j-J-ACM, volume = "50", number = "2", pages = "196--249", month = mar, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jayasimha:2003:FDD, author = "D. N. Jayasimha and Loren Schwiebert and D. Manivannan and Jeff A. May", title = "A foundation for designing deadlock-free routing algorithms in wormhole networks", journal = j-J-ACM, volume = "50", number = "2", pages = "250--275", month = mar, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Mar 26 13:35:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zhang:2003:EPV, author = "Yuanlin Zhang and Roland H. C. Yap", title = "Erratum: {P. van Beek} and {R. Dechter}'s theorem on constraint looseness and local consistency", journal = j-J-ACM, volume = "50", number = "3", pages = "277--279", month = may, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:05:50 MDT 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "See \cite{vanBeek:1997:CTL}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Darwiche:2003:DAI, author = "Adnan Darwiche", title = "A differential approach to inference in {Bayesian} networks", journal = j-J-ACM, volume = "50", number = "3", pages = "280--305", month = may, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:05:50 MDT 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Reed:2003:HRB, author = "Bruce Reed", title = "The height of a random binary search tree", journal = j-J-ACM, volume = "50", number = "3", pages = "306--332", month = may, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:05:50 MDT 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Drmota:2003:AAH, author = "Michael Drmota", title = "An analytic approach to the height of binary search trees {II}", journal = j-J-ACM, volume = "50", number = "3", pages = "333--374", month = may, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:05:50 MDT 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bilardi:2003:ACS, author = "Gianfranco Bilardi and Keshav Pingali", title = "Algorithms for computing the static single assignment form", journal = j-J-ACM, volume = "50", number = "3", pages = "375--425", month = may, year = "2003", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon May 12 19:05:50 MDT 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raghavan:2003:EPE, author = "Prabhakar Raghavan", title = "Editorial: Preserving excellence through change", journal = j-J-ACM, volume = "50", number = "4", pages = "427--428", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792539", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Agrawal:2003:PIT, author = "Manindra Agrawal and Somenath Biswas", title = "Primality and identity testing via {Chinese} remaindering", journal = j-J-ACM, volume = "50", number = "4", pages = "429--443", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792540", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a simple and new randomized primality testing algorithm by reducing primality testing for number $n$ to testing if a specific univariate identity over $ Z_n$ holds.\par We also give new randomized algorithms for testing if a multivariate polynomial, over a finite field or over rationals, is identically zero. The first of these algorithms also works over $ Z_n$ for any $n$. The running time of the algorithms is polynomial in the size of arithmetic circuit representing the input polynomial and the error parameter. These algorithms use fewer random bits and work for a larger class of polynomials than all the previously known methods, for example, the Schwartz--Zippel test [Schwartz 1980; Zippel 1979], Chen--Kao and Lewin--Vadhan tests [Chen and Kao 1997; Lewin and Vadhan 1998].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "polynomial identity testing; primality testing", } @Article{Attiya:2003:AAP, author = "Hagit Attiya and Arie Fouren", title = "Algorithms adapting to point contention", journal = j-J-ACM, volume = "50", number = "4", pages = "444--468", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792541", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article introduces the {\em sieve}, a novel building block that allows to adapt to the number of simultaneously active processes (the {\em point contention\/}) during the execution of an operation. We present an implementation of the sieve in which each sieve operation requires $ O(k \log k) $ steps, where $k$ is the point contention during the operation.\par The sieve is the cornerstone of the first wait-free algorithms that adapt to point contention using only read and write operations. Specifically, we present efficient algorithms for long-lived renaming, timestamping and collecting information.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zhong:2003:CTG, author = "Ning Zhong and Klaus Weihrauch", title = "Computability theory of generalized functions", journal = j-J-ACM, volume = "50", number = "4", pages = "469--505", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792542", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The theory of generalized functions is the foundation of the modern theory of partial differential equations (PDE). As computers are playing an ever-larger role in solving PDEs, it is important to know those operations involving generalized functions in analysis and PDE that can be computed on digital computers. In this article, we introduce natural concepts of computability on test functions and generalized functions, as well as computability on Schwartz test functions and tempered distributions. Type-2 Turing machines are used as the machine model [Weihrauch 2000]. It is shown here that differentiation and integration on distributions are computable operators, and various types of Fourier transforms and convolutions are also computable operators. As an application, it is shown that the solution operator of the distributional inhomogeneous three dimensional wave equation is computable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blum:2003:NTL, author = "Avrim Blum and Adam Kalai and Hal Wasserman", title = "Noise-tolerant learning, the parity problem, and the statistical query model", journal = j-J-ACM, volume = "50", number = "4", pages = "506--519", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792543", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptographic and coding problems. Our algorithm runs in polynomial time for the case of parity functions that depend on only the first $ O(\log n \log \log n) $ bits of input, which provides the first known instance of an efficient noise-tolerant algorithm for a concept class that is not learnable in the Statistical Query model of Kearns [1998]. Thus, we demonstrate that the set of problems learnable in the statistical query model is a strict subset of those problems learnable in the presence of noise in the PAC model.\par In coding-theory terms, what we give is a poly(n)-time algorithm for decoding linear $ k \times n $ codes in the presence of random noise for the case of $ k = c \log n \log \log n $ for some $ c > 0 $. (The case of $ k = O(\log n) $ is trivial since one can just individually check each of the $ 2^k $ possible messages and choose the one that yields the closest codeword.)\par A natural extension of the statistical query model is to allow queries about statistical properties that involve $t$-tuples of examples, as opposed to just single examples. The second result of this article is to show that any class of functions learnable (strongly or weakly) with $t$-wise queries for $ t = O(\log n)$ is also weakly learnable with standard unary queries. Hence, this natural extension to the statistical query model does not increase the set of weakly learnable functions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Leonardi:2003:BDQ, author = "Emilio Leonardi and Marco Mellia and Fabio Neri and Marco Ajmone Marsan", title = "Bounds on delays and queue lengths in input-queued cell switches", journal = j-J-ACM, volume = "50", number = "4", pages = "520--550", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792544", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we develop a general methodology, mainly based upon Lyapunov functions, to derive bounds on average delays, and on averages and variances of queue lengths in complex systems of queues. We apply this methodology to cell-based switches and routers, considering first output-queued (OQ) architectures, in order to provide a simple example of our methodology, and then both input-queued (IQ), and combined input/output queued (CIOQ) architectures. These latter switching architectures require a scheduling algorithm to select at each slot a subset of input-buffered cells that can be transferred toward output ports. Although the stability properties (i.e., the limit throughput) of IQ and CIOQ cell-based switches were already studied for several classes of scheduling algorithms, very few analytical results concerning cell delays or queue lengths are available in the technical literature. We concentrate on Maximum Weight Matching (MWM) and Maximal Size Matching (mSM) scheduling algorithms; while the former was proved to maximize throughput, the latter allows simpler implementation. The derived bounds are shown to be rather tight when compared to simulation results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kalyanasundaram:2003:MFT, author = "Bala Kalyanasundaram and Kirk R. Pruhs", title = "Minimizing flow time nonclairvoyantly", journal = j-J-ACM, volume = "50", number = "4", pages = "551--567", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792545", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the problem of scheduling a collection of dynamically arriving jobs with unknown execution times so as to minimize the average flow time. This is the classic CPU scheduling problem faced by time-sharing operating systems where preemption is allowed. It is easy to see that every algorithm that doesn't unnecessarily idle the processor is at worst $n$-competitive, where $n$ is the number of jobs. Yet there was no known nonclairvoyant algorithm, deterministic or randomized, with a competitive ratio provably $ O(n^{1 - \epsilon })$. In this article, we give a randomized nonclairvoyant algorithm, RMLF, that has competitive ratio $ O(\log n \log \log n)$ against an oblivious adversary. RMLF is a slight variation of the multilevel feedback (MLF) algorithm used by the UNIX operating system, further justifying the adoption of this algorithm. It is known that every randomized nonclairvoyant algorithm is $ \Omega (\log n)$-competitive, and that every deterministic nonclairvoyant algorithm is $ \Omega (n^{1 / 3})$-competitive.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vocking:2003:HAH, author = "Berthold V{\"o}cking", title = "How asymmetry helps load balancing", journal = j-J-ACM, volume = "50", number = "4", pages = "568--589", month = jul, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/792538.792546", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article deals with randomized allocation processes placing sequentially $n$ balls into $n$ bins. We consider multiple-choice algorithms that choose $d$ locations (bins) for each ball at random, inspect the content of these locations, and then place the ball into one of them, for example, in a location with minimum number of balls. The goal is to achieve a good load balancing. This objective is measured in terms of the maximum load, that is, the maximum number of balls in the same bin.\par Multiple-choice algorithms have been studied extensively in the past. Previous analyses typically assume that the $d$ locations for each ball are drawn uniformly and independently from the set of all bins. We investigate whether a nonuniform or dependent selection of the $d$ locations of a ball may lead to a better load balancing. Three types of selection, resulting in three classes of algorithms, are distinguished: (1) uniform and independent, (2) nonuniform and independent, and (3) nonuniform and dependent.\par Our first result shows that the well-studied uniform greedy algorithm (class 1) does not obtain the smallest possible maximum load. In particular, we introduce a nonuniform algorithm (class 2) that obtains a better load balancing. Surprisingly, this algorithm uses an unfair tie-breaking mechanism, called Always-Go-Left, resulting in an asymmetric assignment of the balls to the bins. Our second result is a lower bound showing that a dependent allocation (class 3) cannot yield significant further improvement.\par Our upper and lower bounds on the maximum load are tight up to additive constants, proving that the Always-Go-Left algorithm achieves an almost optimal load balancing among all sequential multiple-choice algorithm. Furthermore, we show that the results for the Always-Go-Left algorithm can be generalized to allocation processes with more balls than bins and even to infinite processes in which balls are inserted and deleted by an oblivious adversary.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Krokhin:2003:RAT, author = "Andrei Krokhin and Peter Jeavons and Peter Jonsson", title = "Reasoning about temporal relations: {The} tractable subalgebras of {Allen}'s interval algebra", journal = j-J-ACM, volume = "50", number = "5", pages = "591--640", month = sep, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/876638.876639", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the constraints are chosen from the full Allen's algebra, this form of satisfiability problem is known to be NP-complete. However, eighteen tractable subalgebras have previously been identified; we show here that these subalgebras include all possible tractable subsets of Allen's algebra. In other words, we show that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalgebras is NP-complete. We obtain this dichotomy result by giving a new uniform description of the known maximal tractable subalgebras, and then systematically using a general algebraic technique for identifying maximal subalgebras with a given property.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barvinok:2003:GMT, author = "Alexander Barvinok and S{\'a}ndor P. Fekete and David S. Johnson and Arie Tamir and Gerhard J. Woeginger and Russ Woodroofe", title = "The geometric maximum traveling salesman problem", journal = j-J-ACM, volume = "50", number = "5", pages = "641--664", month = sep, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/876638.876640", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the traveling salesman problem when the cities are points in $ \mathbb {R}^d $ for some fixed $d$ and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding a tour of maximum length can be solved in polynomial time. If arithmetic operations are assumed to take unit time, our algorithms run in time $ O(n^{f - 2} \log n)$, where $f$ is the number of facets of the polyhedron determining the polyhedral norm. Thus, for example, we have $ O(n^2 \log n)$ algorithms for the cases of points in the plane under the Rectilinear and Sup norms. This is in contrast to the fact that finding a minimum length tour in each case is NP-hard. Our approach can be extended to the more general case of quasi-norms with a not necessarily symmetric unit ball, where we get a complexity of $ O(n^{2f - 2} \log n)$.\par For the special case of two-dimensional metrics with $ f = 4$ (which includes the Rectilinear and Sup norms), we present a simple algorithm with $ O(n)$ running time. The algorithm does not use any indirect addressing, so its running time remains valid even in comparison based models in which sorting requires $ \Omega (n \log n)$ time. The basic mechanism of the algorithm provides some intuition on why polyhedral norms allow fast algorithms.\par Complementing the results on simplicity for polyhedral norms, we prove that, for the case of Euclidean distances in $ \mathbb {R}^d$ for $ d \geq 3$, the Maximum TSP is NP-hard. This sheds new light on the well-studied difficulties of Euclidean distances.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wu:2003:PDC, author = "Wei Biao Wu and Chinya V. Ravishankar", title = "The performance of difference coding for sets and relational tables", journal = j-J-ACM, volume = "50", number = "5", pages = "665--693", month = sep, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/876638.876641", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We characterize the performance of difference coding for compressing sets and database relations through an analysis of the problem of estimating the number of bits needed for storing the spacings between values in sets of integers. We provide analytical expressions for estimating the effectiveness of difference coding when the elements of the sets or the attribute fields in database tuples are drawn from the uniform and Zipf distributions. We also examine the case where a uniformly distributed domain is combined with a Zipf distribution, and with an arbitrary distribution. We present limit theorems for most cases, and probabilistic convergence results in other cases. We also examine the effects of attribute domain reordering on the compression ratio. Our simulations show excellent agreement with theory.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Benedikt:2003:DRF, author = "Michael Benedikt and Leonid Libkin and Thomas Schwentick and Luc Segoufin", title = "Definable relations and first-order query languages over strings", journal = j-J-ACM, volume = "50", number = "5", pages = "694--751", month = sep, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/876638.876642", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study analogs of classical relational calculus in the context of strings. We start by studying string logics. Taking a classical model-theoretic approach, we fix a set of string operations and look at the resulting collection of definable relations. These form an algebra---a class of $n$-ary relations for every $n$, closed under projection and Boolean operations. We show that by choosing the string vocabulary carefully, we get string logics that have desirable properties: computable evaluation and normal forms. We identify five distinct models and study the differences in their model-theory and complexity of evaluation. We identify a subset of these models that have additional attractive properties, such as finite VC dimension and quantifier elimination.\par Once you have a logic, the addition of free predicate symbols gives you a string query language. The resulting languages have attractive closure properties from a database point of view: while SQL does not allow the full composition of string pattern-matching expressions with relational operators, these logics yield compositional query languages that can capture common string-matching queries while remaining tractable. For each of the logics studied in the first part of the article, we study properties of the corresponding query languages. We give bounds on the data complexity of queries, extend the normal form results from logics to queries, and show that the languages have corresponding algebras expressing safe queries.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Clarke:2003:CGA, author = "Edmund Clarke and Orna Grumberg and Somesh Jha and Yuan Lu and Helmut Veith", title = "Counterexample-guided abstraction refinement for symbolic model checking", journal = j-J-ACM, volume = "50", number = "5", pages = "752--794", month = sep, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/876638.876643", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Sep 8 17:55:23 MDT 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The state explosion problem remains a major hurdle in applying symbolic model checking to large hardware designs. State space abstraction, having been essential for verifying designs of industrial complexity, is typically a manual process, requiring considerable creativity and insight.\par In this article, we present an automatic iterative abstraction-refinement methodology that extends symbolic model checking. In our method, the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or ``spurious'') counterexamples. We devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly. We describe aSMV, a prototype implementation of our methodology in NuSMV. Practical experiments including a large Fujitsu IP core design with about 500 latches and 10000 lines of SMV code confirm the effectiveness of our approach.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jain:2003:GFL, author = "Kamal Jain and Mohammad Mahdian and Evangelos Markakis and Amin Saberi and Vijay V. Vazirani", title = "Greedy facility location algorithms analyzed using dual fitting with factor-revealing {LP}", journal = j-J-ACM, volume = "50", number = "6", pages = "795--824", month = nov, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/950620.950621", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 28 14:26:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of $ O(m \log m) $ and $ O(n^3) $, respectively, where $n$ is the total number of vertices and $m$ is the number of edges in the underlying complete bipartite graph between cities and facilities. The algorithms are used to improve recent results for several variants of the problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Buchsbaum:2003:ITC, author = "Adam L. Buchsbaum and Glenn S. Fowler and Raffaele Giancarlo", title = "Improving table compression with combinatorial optimization", journal = j-J-ACM, volume = "50", number = "6", pages = "825--851", month = nov, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/950620.950622", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 28 14:26:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [2000], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on this theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, off-line training algorithm, based on a link to the asymmetric traveling salesman problem, which improves on prior work by rearranging columns prior to partitioning. We demonstrate these results experimentally. On various test files, the on-line algorithms provide 35--55\% improvement over gzip with negligible slowdown; the off-line reordering provides up to 20\% further improvement over partitioning alone. We also show that a variation of the table compression problem is MAX-SNP hard.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dwork:2003:MFM, author = "Cynthia Dwork and Moni Naor and Omer Reingold and Larry Stockmeyer", title = "Magic Functions: In Memoriam: {Bernard M. Dwork} 1923--1998", journal = j-J-ACM, volume = "50", number = "6", pages = "852--921", month = nov, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/950620.950623", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 28 14:26:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that three apparently unrelated fundamental problems in distributed computing, cryptography, and complexity theory, are essentially the same problem. These three problems and brief descriptions of them follow. (1) The selective decommitment problem. An adversary is given commitments to a collection of messages, and the adversary can ask for some subset of the commitments to be opened. The question is whether seeing the decommitments to these open plaintexts allows the adversary to learn something unexpected about the plaintexts that are unopened. (2) The power of 3-round weak zero-knowledge arguments. The question is what can be proved in (a possibly weakened form of) zero-knowledge in a 3-round argument. In particular, is there a language outside of BPP that has a 3-round public-coin weak zero-knowledge argument? (3) The Fiat--Shamir methodology. This is a method for converting a 3-round public-coin argument (viewed as an identification scheme) to a 1-round signature scheme. The method requires what we call a ``magic function'' that the signer applies to the first-round message of the argument to obtain a second-round message (queries from the verifier). An open question here is whether every 3-round public-coin argument for a language outside of BPP has a magic function.\par It follows easily from definitions that if a 3-round public-coin argument system is zero-knowledge in the standard (fairly strong) sense, then it has no magic function. We define a weakening of zero-knowledge such that zero-knowledge ? no-magic-function still holds. For this weakened form of zero-knowledge, we give a partial converse: informally, if a 3-round public-coin argument system is not weakly zero-knowledge, then some form of magic is possible for this argument system. We obtain our definition of weak zero-knowledge by a sequence of weakenings of the standard definition, forming a hierarchy. Intermediate forms of zero-knowledge in this hierarchy are reasonable ones, and they may be useful in applications. Finally, we relate the selective decommitment problem to public-coin proof systems and arguments at an intermediate level of the hierarchy, and obtain several positive security results for selective decommitment.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mostefaoui:2003:CIV, author = "Achour Mostefaoui and Sergio Rajsbaum and Michel Raynal", title = "Conditions on input vectors for consensus solvability in asynchronous distributed systems", journal = j-J-ACM, volume = "50", number = "6", pages = "922--954", month = nov, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/950620.950624", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 28 14:26:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for which it is possible to solve consensus despite the occurrence of up to $f$ process crashes. The first main result defines acceptable conditions and shows that these are exactly the conditions for which a consensus protocol exists. Two examples of realistic acceptable conditions are presented, and proved to be maximal, in the sense that they cannot be extended and remain acceptable. The second main result is a generic consensus shared-memory protocol for any acceptable condition. The protocol always guarantees agreement and validity, and terminates (at least) when the inputs satisfy the condition with which the protocol has been instantiated, or when there are no crashes. An efficient version of the protocol is then designed for the message passing model that works when $ f < n / 2$, and it is shown that no such protocol exists when $ f \geq n / 2$. It is also shown how the protocol's safety can be traded for its liveness.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beal:2003:GSR, author = "Marie-Pierre B{\'e}al and Dominique Perrin", title = "On the generating sequences of regular languages on $k$ symbols", journal = j-J-ACM, volume = "50", number = "6", pages = "955--980", month = nov, year = "2003", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/950620.950625", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 28 14:26:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The main result is a characterization of the generating sequences of the length of words in a regular language on $k$ symbols. We say that a sequence $s$ of integers is regular if there is a finite graph $G$ with two vertices $i$, $t$ such that $ s_n$ is the number of paths of length $n$ from $i$ to $t$ in $G$. Thus the generating sequence of a regular language is regular. We prove that a sequence $s$ is the generating sequence of a regular language on $k$ symbols if and only if both sequences $ s = (s_n)_{n \geq 0}$ and $ t = (k^n - s_n)_{n \geq 0}$ are regular.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kolaitis:2004:F, author = "Phokion Kolaitis and Victor Vianu", title = "Foreword", journal = j-J-ACM, volume = "51", number = "1", pages = "1--1", month = jan, year = "2004", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/962446.962447", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jan 5 17:16:06 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Miklau:2004:CEF, author = "Gerome Miklau and Dan Suciu", title = "Containment and equivalence for a fragment of {XPath}", journal = j-J-ACM, volume = "51", number = "1", pages = "2--45", month = jan, year = "2004", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/962446.962448", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jan 5 17:16:06 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2004:DDN, author = "Chung-Min Chen and Christine T. Cheng", title = "From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries", journal = j-J-ACM, volume = "51", number = "1", pages = "46--73", month = jan, year = "2004", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/962446.962449", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jan 5 17:16:06 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2004:MDE, author = "Georg Gottlob and Christoph Koch", title = "Monadic datalog and the expressive power of languages for {Web} information extraction", journal = j-J-ACM, volume = "51", number = "1", pages = "74--113", month = jan, year = "2004", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/962446.962450", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jan 5 17:16:06 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raz:2004:RLB, author = "Ran Raz", title = "Resolution lower bounds for the weak pigeonhole principle", journal = j-J-ACM, volume = "51", number = "2", pages = "115--138", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Agarwal:2004:LAP, author = "Pankaj K. Agarwal and Eran Nevo and J{\'a}nos Pach and Rom Pinchasi and Micha Sharir and Shakhar Smorodinsky", title = "Lenses in arrangements of pseudo-circles and their applications", journal = j-J-ACM, volume = "51", number = "2", pages = "139--186", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haastad:2004:SAR, author = "Johan H{\aa}stad and Mats N{\aa}slund", title = "The security of all {RSA} and discrete log bits", journal = j-J-ACM, volume = "51", number = "2", pages = "187--230", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Naor:2004:NTC, author = "Moni Naor and Omer Reingold", title = "Number-theoretic constructions of efficient pseudo-random functions", journal = j-J-ACM, volume = "51", number = "2", pages = "231--262", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kleinberg:2004:SP, author = "Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan", title = "Segmentation problems", journal = j-J-ACM, volume = "51", number = "2", pages = "263--280", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Atserias:2004:SCU, author = "Albert Atserias", title = "On sufficient conditions for unsatisfiability of random formulas", journal = j-J-ACM, volume = "51", number = "2", pages = "281--311", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2004:ESO, author = "Georg Gottlob and Phokion G. Kolaitis and Thomas Schwentick", title = "Existential second-order logic over graphs: {Charting} the tractability frontier", journal = j-J-ACM, volume = "51", number = "2", pages = "312--362", month = mar, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Mar 6 07:04:43 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alber:2004:PTD, author = "Jochen Alber and Michael R. Fellows and Rolf Niedermeier", title = "Polynomial-time data reduction for dominating set", journal = j-J-ACM, volume = "51", number = "3", pages = "363--384", month = may, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 8 16:54:20 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Spielman:2004:SAA, author = "Daniel A. Spielman and Shang-Hua Teng", title = "Smoothed analysis of algorithms: {Why} the simplex algorithm usually takes polynomial time", journal = j-J-ACM, volume = "51", number = "3", pages = "385--463", month = may, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 8 16:54:20 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Burgisser:2004:LBB, author = "Peter B{\"u}rgisser and Martin Lotz", title = "Lower bounds on the bounded coefficient complexity of bilinear maps", journal = j-J-ACM, volume = "51", number = "3", pages = "464--482", month = may, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 8 16:54:20 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Plandowski:2004:SWE, author = "Wojciech Plandowski", title = "Satisfiability of word equations with constants is in {PSPACE}", journal = j-J-ACM, volume = "51", number = "3", pages = "483--496", month = may, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 8 16:54:20 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kannan:2004:CGB, author = "Ravi Kannan and Santosh Vempala and Adrian Vetta", title = "On clusterings: {Good}, bad and spectral", journal = j-J-ACM, volume = "51", number = "3", pages = "497--515", month = may, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 8 16:54:20 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Becchetti:2004:NSM, author = "Luca Becchetti and Stefano Leonardi", title = "Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines", journal = j-J-ACM, volume = "51", number = "4", pages = "517--539", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bertsimas:2004:SCP, author = "Dimitris Bertsimas and Santosh Vempala", title = "Solving convex programs by random walks", journal = j-J-ACM, volume = "51", number = "4", pages = "540--556", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Canetti:2004:ROM, author = "Ran Canetti and Oded Goldreich and Shai Halevi", title = "The random oracle methodology, revisited", journal = j-J-ACM, volume = "51", number = "4", pages = "557--594", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aaronson:2004:QLB, author = "Scott Aaronson and Yaoyun Shi", title = "Quantum lower bounds for the collision and the element distinctness problems", journal = j-J-ACM, volume = "51", number = "4", pages = "595--605", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Agarwal:2004:AEM, author = "Pankaj K. Agarwal and Sariel Har-Peled and Kasturi R. Varadarajan", title = "Approximating extent measures of points", journal = j-J-ACM, volume = "51", number = "4", pages = "606--635", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hochstein:2004:EDR, author = "Jan M. Hochstein and Karsten Weihe", title = "Edge-disjoint routing in plane switch graphs in linear time", journal = j-J-ACM, volume = "51", number = "4", pages = "636--670", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jerrum:2004:PTA, author = "Mark Jerrum and Alistair Sinclair and Eric Vigoda", title = "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries", journal = j-J-ACM, volume = "51", number = "4", pages = "671--697", month = jul, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jul 10 09:49:01 MDT 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Koltun:2004:ATU, author = "Vladlen Koltun", title = "Almost tight upper bounds for vertical decompositions in four dimensions", journal = j-J-ACM, volume = "51", number = "5", pages = "699--730", month = sep, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Crescenzi:2004:AIE, author = "Valter Crescenzi and Giansalvatore Mecca", title = "Automatic information extraction from large websites", journal = j-J-ACM, volume = "51", number = "5", pages = "731--779", month = sep, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dolev:2004:SSC, author = "Shlomi Dolev and Jennifer L. Welch", title = "Self-stabilizing clock synchronization in the presence of {Byzantine} faults", journal = j-J-ACM, volume = "51", number = "5", pages = "780--799", month = sep, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Steinke:2004:UTS, author = "Robert C. Steinke and Gary J. Nutt", title = "A unified theory of shared memory consistency", journal = j-J-ACM, volume = "51", number = "5", pages = "800--849", month = sep, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dwork:2004:CZK, author = "Cynthia Dwork and Moni Naor and Amit Sahai", title = "Concurrent zero-knowledge", journal = j-J-ACM, volume = "51", number = "6", pages = "851--898", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Regev:2004:NLB, author = "Oded Regev", title = "New lattice-based cryptographic constructions", journal = j-J-ACM, volume = "51", number = "6", pages = "899--942", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kempe:2004:SGR, author = "David Kempe and Jon Kleinberg and Alan Demers", title = "Spatial gossip and resource location protocols", journal = j-J-ACM, volume = "51", number = "6", pages = "943--967", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Demetrescu:2004:NAD, author = "Camil Demetrescu and Giuseppe F. Italiano", title = "A new approach to dynamic all pairs shortest paths", journal = j-J-ACM, volume = "51", number = "6", pages = "968--992", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Thorup:2004:COR, author = "Mikkel Thorup", title = "Compact oracles for reachability and approximate distances in planar digraphs", journal = j-J-ACM, volume = "51", number = "6", pages = "993--1024", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Frieze:2004:FMC, author = "Alan Frieze and Ravi Kannan and Santosh Vempala", title = "Fast {Monte-Carlo} algorithms for finding low-rank approximations", journal = j-J-ACM, volume = "51", number = "6", pages = "1025--1041", month = nov, year = "2004", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 15 06:33:05 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Thorup:2005:ADO, author = "Mikkel Thorup and Uri Zwick", title = "Approximate distance oracles", journal = j-J-ACM, volume = "52", number = "1", pages = "1--24", month = jan, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aleksandrov:2005:DAS, author = "L. Aleksandrov and A. Maheshwari and J.-R. Sack", title = "Determining approximate shortest paths on weighted polyhedral surfaces", journal = j-J-ACM, volume = "52", number = "1", pages = "25--53", month = jan, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ross:2005:AOP, author = "Robert Ross and V. S. Subrahmanian and John Grant", title = "Aggregate operators in probabilistic databases", journal = j-J-ACM, volume = "52", number = "1", pages = "54--101", month = jan, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abadi:2005:ASP, author = "Mart{\'\i}n Abadi and Bruno Blanchet", title = "Analyzing security protocols with secrecy types and logic programs", journal = j-J-ACM, volume = "52", number = "1", pages = "102--146", month = jan, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Demetrescu:2005:TOF, author = "Camil Demetrescu and Giuseppe F. Italiano", title = "Trade-offs for fully dynamic transitive closure on {DAGs}: breaking through the {$ O(n^2) $} barrier", journal = j-J-ACM, volume = "52", number = "2", pages = "147--156", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ailon:2005:LBL, author = "Nir Ailon and Bernard Chazelle", title = "Lower bounds for linear degeneracy testing", journal = j-J-ACM, volume = "52", number = "2", pages = "157--171", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Shaltiel:2005:SEA, author = "Ronen Shaltiel and Christopher Umans", title = "Simple extractors for all min-entropies and a new pseudorandom generator", journal = j-J-ACM, volume = "52", number = "2", pages = "172--216", month = mar, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1059513.1059516", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", 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 = "A ``randomness extractor'' is an algorithm that given a sample from a distribution with sufficiently high min-entropy and a short random seed produces an output that is statistically indistinguishable from uniform. (Min-entropy is a measure of the amount of randomness in a distribution.) We present a simple, self-contained extractor construction that produces good extractors for all min-entropies. Our construction is algebraic and builds on a new polynomial-based approach introduced by Ta-Shma et al. [2001b]. Using our improvements, we obtain, for example, an extractor with output length $ m = k / (\log n) O(1 / \alpha) $ and seed length $ (1 + \alpha) \log n $ for an arbitrary $ 0 < \alpha 1 $, where $n$ is the input length, and $k$ is the min-entropy of the input distribution.A ``pseudorandom generator'' is an algorithm that given a short random seed produces a long output that is computationally indistinguishable from uniform. Our technique also gives a new way to construct pseudorandom generators from functions that require large circuits. Our pseudorandom generator construction is not based on the Nisan-Wigderson generator [Nisan and Wigderson 1994], and turns worst-case hardness directly into pseudorandomness. The parameters of our generator match those in Impagliazzo and Wigderson [1997] and Sudan et al. [2001] and in particular are strong enough to obtain a new proof that $ P = \hbox {BPP}$ if $E$ requires exponential size circuits.Our construction also gives the following improvements over previous work:---We construct an optimal ``hitting set generator'' that stretches $ O(\log n)$ random bits into $ s(1)$ pseudorandom bits when given a function on $ \log n$ bits that requires circuits of size $s$. This yields a quantitatively optimal hardness versus randomness tradeoff for both RP and BPP and solves an open problem raised in Impagliazzo et al. [1999].---We give the first construction of pseudorandom generators that fool nondeterministic circuits when given a function that requires large nondeterministic circuits. This technique also give a quantitatively optimal hardness versus randomness tradeoff for AM and the first hardness amplification result for nondeterministic circuits.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Adler:2005:TOP, author = "Micah Adler", title = "Trade-offs in probabilistic packet marking for {IP} traceback", journal = j-J-ACM, volume = "52", number = "2", pages = "217--244", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Milo:2005:I, author = "Tova Milo and Victor Vianu", title = "Introduction", journal = j-J-ACM, volume = "52", number = "2", pages = "245--245", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arenas:2005:ITA, author = "Marcelo Arenas and Leonid Libkin", title = "An information-theoretic approach to normal forms for relational and {XML} data", journal = j-J-ACM, volume = "52", number = "2", pages = "246--283", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2005:CXQ, author = "Georg Gottlob and Christoph Koch and Reinhard Pichler and Luc Segoufin", title = "The complexity of {XPath} query evaluation and {XML} typing", journal = j-J-ACM, volume = "52", number = "2", pages = "284--335", month = mar, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Apr 25 11:15:54 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Paturi:2005:IET, author = "Ramamohan Paturi and Pavel Pudl{\'a}k and Michael E. Saks and Francis Zane", title = "An improved exponential-time algorithm for {$k$-SAT}", journal = j-J-ACM, volume = "52", number = "3", pages = "337--364", month = may, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1066100.1066101", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Jul 5 06:39:45 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, followed by a search stage that uses a simple randomized greedy procedure to look for a satisfying assignment. Currently, this is the fastest known probabilistic algorithm for $k$-CNF satisfiability for $ k \geq 4$ (with a running time of $ O(2^{0.5625 n})$ for $4$-CNF). In addition, it is the fastest known probabilistic algorithm for $k$-CNF, $ k \geq 3$, that have at most one satisfying assignment (unique $k$-SAT) (with a running time $ O(2^{(2 \ln 2 - 1)n + o(n)}) = O(2^{0.386 \ldots n})$ in the case of $3$-CNF). The analysis of the algorithm also gives an upper bound on the number of the codewords of a code defined by a $k$-CNF. This is applied to prove a lower bounds on depth $3$ circuits accepting codes with nonconstant distance. In particular we prove a lower bound $ \Omega (2^{1.282 \ldots \sqrt {n}})$ for an explicitly given Boolean function of $n$ variables. This is the first such lower bound that is asymptotically bigger than $ 2 \sqrt {n} + o(\sqrt {n})$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Detlefs:2005:STP, author = "David Detlefs and Greg Nelson and James B. Saxe", title = "{Simplify}: a theorem prover for program checking", journal = j-J-ACM, volume = "52", number = "3", pages = "365--473", month = may, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1066100.1066102", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Jul 5 06:39:45 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson--Oppen method to combine decision procedures for several important theories, and also employs a matcher to reason about quantifiers. Instead of conventional matching in a term DAG, Simplify matches up to equivalence in an E-graph, which detects many relevant pattern instances that would be missed by the conventional approach. The article describes two techniques, error context reporting and error localization, for helping the user to determine the reason that a false conjecture is false. The article includes detailed performance figures on conjectures derived from realistic program-checking problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Li:2005:BPC, author = "Ninghui Li and John C. Mitchell and William H. Winsborough", title = "Beyond proof-of-compliance: security analysis in trust management", journal = j-J-ACM, volume = "52", number = "3", pages = "474--514", month = may, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1066100.1066103", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Jul 5 06:39:45 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Trust management is a form of distributed access control that allows one principal to delegate some access decisions to other principals. While the use of delegation greatly enhances flexibility and scalability, it may also reduce the control that a principal has over the resources it owns. Security analysis asks whether safety, availability, and other properties can be maintained while delegating to partially trusted principals. We show that in contrast to the undecidability of classical Harrison--Ruzzo--Ullman safety properties, our primary security properties are decidable. In particular, most security properties we study are decidable in polynomial time. The computational complexity of containment analysis, the most complicated security property we study, varies according to the expressive power of the trust management language.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Franceschini:2005:PSC, author = "Gianni Franceschini and Viliam Geffert", title = "An in-place sorting with {$ O(n \log n) $} comparisons and {$ O(n) $} moves", journal = j-J-ACM, volume = "52", number = "4", pages = "515--537", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082037", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present the first in-place algorithm for sorting an array of size $n$ that performs, in the worst case, at most $ O(n \log n)$ element comparisons and $ O(n)$ element transports.This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chuzhoy:2005:ACH, author = "Julia Chuzhoy and Sudipto Guha and Eran Halperin and Sanjeev Khanna and Guy Kortsarz and Robert Krauthgamer and Joseph (Seffi) Naor", title = "Asymmetric $k$-center is $ \log^*n$-hard to approximate", journal = j-J-ACM, volume = "52", number = "4", pages = "538--551", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082038", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ferragina:2005:ICT, author = "Paolo Ferragina and Giovanni Manzini", title = "Indexing compressed text", journal = j-J-ACM, volume = "52", number = "4", pages = "552--581", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082039", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andrews:2005:SRS, author = "Matthew Andrews and Antonio Fern{\'a}ndez and Ashish Goel and Lisa Zhang", title = "Source routing and scheduling in packet networks", journal = j-J-ACM, volume = "52", number = "4", pages = "582--601", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082040", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kaplan:2005:AAA, author = "Haim Kaplan and Moshe Lewenstein and Nira Shafrir and Maxim Sviridenko", title = "Approximation algorithms for asymmetric {TSP} by decomposing directed regular multigraphs", journal = j-J-ACM, volume = "52", number = "4", pages = "602--626", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082041", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Boyland:2005:RAG, author = "John Tang Boyland", title = "Remote attribute grammars", journal = j-J-ACM, volume = "52", number = "4", pages = "627--687", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082042", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ferragina:2005:BTC, author = "Paolo Ferragina and Raffaele Giancarlo and Giovanni Manzini and Marinella Sciortino", title = "Boosting textual compression in optimal linear time", journal = j-J-ACM, volume = "52", number = "4", pages = "688--713", month = jul, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1082036.1082043", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:09 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performance guarantee. It displays the following remarkable properties: (a) it can turn any memoryless compressor into a compression algorithm that uses the `best possible' contexts; (b) it is very simple and optimal in terms of time; and (c) it admits a decompression algorithm again optimal in time. To the best of our knowledge, this is the first boosting technique displaying these properties.Technically, our boosting technique builds upon three main ingredients: the Burrows--Wheeler Transform, the Suffix Tree data structure, and a greedy algorithm to process them. Specifically, we show that there exists a proper partition of the Burrows--Wheeler Transform of a string $s$ that shows a deep combinatorial relation with the $k$-th order entropy of $s$. That partition can be identified via a greedy processing of the suffix tree of $s$ with the aim of minimizing a proper objective function over its nodes. The final compressed string is then obtained by compressing individually each substring of the partition by means of the base compressor we wish to boost.Our boosting technique is inherently combinatorial because it does not need to assume any prior probabilistic model about the source emitting $s$, and it does not deploy any training, parameter estimation and learning. Various corollaries are derived from this main achievement. Among the others, we show analytically that using our booster, we get better compression algorithms than some of the best existing ones, that is, LZ77, LZ78, PPMC and the ones derived from the Burrows--Wheeler Transform. Further, we settle analytically some long-standing open problems about the algorithmic structure and the performance of BWT-based compressors. Namely, we provide the first family of BWT algorithms that do not use Move-To-Front or Symbol Ranking as a part of the compression process.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Korf:2005:FS, author = "Richard E. Korf and Weixiong Zhang and Ignacio Thayer and Heath Hohwald", title = "Frontier search", journal = j-J-ACM, volume = "52", number = "5", pages = "715--748", month = sep, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1089023.1089024", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:10 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aharonov:2005:LPN, author = "Dorit Aharonov and Oded Regev", title = "Lattice problems in {NP $ \cap $ coNP}", journal = j-J-ACM, volume = "52", number = "5", pages = "749--765", month = sep, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1089023.1089025", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:10 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brinkman:2005:IDR, author = "Bo Brinkman and Moses Charikar", title = "On the impossibility of dimension reduction in $ \ell_1 $", journal = j-J-ACM, volume = "52", number = "5", pages = "766--788", month = sep, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1089023.1089026", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:10 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Khot:2005:HAS, author = "Subhash Khot", title = "Hardness of approximating the shortest vector problem in lattices", journal = j-J-ACM, volume = "52", number = "5", pages = "789--808", month = sep, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1089023.1089027", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:10 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andrews:2005:STV, author = "Matthew Andrews and Lisa Zhang", title = "Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data", journal = j-J-ACM, volume = "52", number = "5", pages = "809--834", month = sep, year = "2005", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1089023.1089028", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 5 07:28:10 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fortnow:2005:TSL, author = "Lance Fortnow and Richard Lipton and Dieter van Melkebeek and Anastasios Viglas", title = "Time-space lower bounds for satisfiability", journal = j-J-ACM, volume = "52", number = "6", pages = "835--865", month = nov, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 25 06:01:03 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Demaine:2005:SPA, author = "Erik D. Demaine and Fedor V. Fomin and Mohammadtaghi Hajiaghayi and Dimitrios M. Thilikos", title = "Subexponential parameterized algorithms on bounded-genus graphs and {$H$}-minor-free graphs", journal = j-J-ACM, volume = "52", number = "6", pages = "866--893", month = nov, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 25 06:01:03 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Banerjee:2005:OCE, author = "Anindya Banerjee and David A. Naumann", title = "Ownership confinement ensures representation independence for object-oriented programs", journal = j-J-ACM, volume = "52", number = "6", pages = "894--960", month = nov, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 25 06:01:03 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Merro:2005:BTM, author = "Massimo Merro and Francesco Zappa Nardelli", title = "Behavioral theory for mobile ambients", journal = j-J-ACM, volume = "52", number = "6", pages = "961--1023", month = nov, year = "2005", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 25 06:01:03 MST 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Csirik:2006:SSA, author = "Janos Csirik and David S. Johnson and Claire Kenyon and James B. Orlin and Peter W. Shor and Richard R. Weber", title = "On the {Sum-of-Squares} algorithm for bin packing", journal = j-J-ACM, volume = "53", number = "1", pages = "1--65", month = jan, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1120582.1120583", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 17 06:27:47 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bulatov:2006:DTC, author = "Andrei A. Bulatov", title = "A dichotomy theorem for constraint satisfaction problems on a $3$-element set", journal = j-J-ACM, volume = "53", number = "1", pages = "66--120", month = jan, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1120582.1120584", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 17 06:27:47 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Scharbrodt:2006:NAC, author = "Mark Scharbrodt and Thomas Schickinger and Angelika Steger", title = "A new average case analysis for completion time scheduling", journal = j-J-ACM, volume = "53", number = "1", pages = "121--146", month = jan, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1120582.1120585", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 17 06:27:47 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Flajolet:2006:HWS, author = "Philippe Flajolet and Wojciech Szpankowski and Brigitte Vall{\'e}e", title = "Hidden word statistics", journal = j-J-ACM, volume = "53", number = "1", pages = "147--183", month = jan, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1120582.1120586", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 17 06:27:47 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Nayak:2006:LAQ, author = "Ashwin Nayak and Julia Salzman", title = "Limits on the ability of quantum states to convey classical messages", journal = j-J-ACM, volume = "53", number = "1", pages = "184--206", month = jan, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1120582.1120587", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 17 06:27:47 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Suciu:2006:I, author = "Dan Suciu and Victor Vianu", title = "Introduction", journal = j-J-ACM, volume = "53", number = "2", pages = "207--207", month = mar, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1131342.1131343", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 11 11:34:50 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Atserias:2006:PUH, author = "Albert Atserias and Anuj Dawar and Phokion G. Kolaitis", title = "On preservation under homomorphisms and unions of conjunctive queries", journal = j-J-ACM, volume = "53", number = "2", pages = "208--237", month = mar, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1131342.1131344", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 11 11:34:50 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2006:CQT, author = "Georg Gottlob and Christoph Koch and Klaus U. Schulz", title = "Conjunctive queries over trees", journal = j-J-ACM, volume = "53", number = "2", pages = "238--272", month = mar, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1131342.1131345", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 11 11:34:50 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Benedikt:2006:CFO, author = "Michael Benedikt and Bart Kuijpers and Christof L{\"o}ding and Jan Van den Bussche and Thomas Wilke", title = "A characterization of first-order topological properties of planar spatial data", journal = j-J-ACM, volume = "53", number = "2", pages = "273--305", month = mar, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1131342.1131346", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu May 11 11:34:50 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Indyk:2006:SDP, author = "Piotr Indyk", title = "Stable distributions, pseudorandom generators, embeddings, and data stream computation", journal = j-J-ACM, volume = "53", number = "3", pages = "307--323", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147955", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gandhi:2006:DRA, author = "Rajiv Gandhi and Samir Khuller and Srinivasan Parthasarathy and Aravind Srinivasan", title = "Dependent rounding and its applications to approximation algorithms", journal = j-J-ACM, volume = "53", number = "3", pages = "324--360", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147956", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ban:2006:ISP, author = "Yih-En Andrew Ban and Herbert Edelsbrunner and Johannes Rudolph", title = "Interface surfaces for protein-protein complexes", journal = j-J-ACM, volume = "53", number = "3", pages = "361--378", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147957", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Shalev:2006:SOL, author = "Ori Shalev and Nir Shavit", title = "Split-ordered lists: {Lock-free} extensible hash tables", journal = j-J-ACM, volume = "53", number = "3", pages = "379--405", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147958", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations with an expected $ O(1) $ cost. It consists of very simple code, easily implementable using only load, store, and compare-and-swap operations. The new mathematical structure at the core of our algorithm is recursive split-ordering, a way of ordering elements in a linked list so that they can be repeatedly ``split'' using a single compare-and-swap operation. Metaphorically speaking, our algorithm differs from prior known algorithms in that extensibility is derived by ``moving the buckets among the items'' rather than ``the items among the buckets.'' Though lock-free algorithms are expected to work best in multiprogrammed environments, empirical tests we conducted on a large shared memory multiprocessor show that even in non-multiprogrammed environments, the new algorithm performs as well as the most efficient known lock-based resizable hash-table algorithm, and in high load cases it significantly outperforms it.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Nederhof:2006:PPS, author = "Mark-Jan Nederhof and Giorgio Satta", title = "Probabilistic parsing strategies", journal = j-J-ACM, volume = "53", number = "3", pages = "406--436", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147959", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sitters:2006:GTS, author = "Ren{\'e} A. Sitters and Leen Stougie", title = "The generalized two-server problem", journal = j-J-ACM, volume = "53", number = "3", pages = "437--458", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147960", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Pitts:2006:ASR, author = "Andrew M. Pitts", title = "Alpha-structural recursion and induction", journal = j-J-ACM, volume = "53", number = "3", pages = "459--506", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147961", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ambainis:2006:CHM, author = "Andris Ambainis and Leonard J. Schulman and Umesh Vazirani", title = "Computing with highly mixed states", journal = j-J-ACM, volume = "53", number = "3", pages = "507--531", month = may, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1147954.1147962", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 23 06:38:20 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Xu:2006:FAA, author = "Jinbo Xu and Bonnie Berger", title = "Fast and accurate algorithms for protein side-chain packing", journal = j-J-ACM, volume = "53", number = "4", pages = "533--557", month = jul, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1162349.1162350", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Sep 21 07:53:28 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article studies the protein side-chain packing problem using the tree-decomposition of a protein structure. To obtain fast and accurate protein side-chain packing, protein structures are modeled using a geometric neighborhood graph, which can be easily decomposed into smaller blocks. Therefore, the side-chain assignment of the whole protein can be assembled from the assignment of the small blocks. Although we will show that the side-chain packing problem is still NP-hard, we can achieve a tree-decomposition-based globally optimal algorithm with time complexity of $ O(N n_{\rm rot}^{\rm tw} + 1) $ and several polynomial-time approximation schemes (PTAS), where $N$ is the number of residues contained in the protein, $ n_{\rm rot}$ the average number of rotamers for each residue, and $ {\rm tw} = O(N^{2 / 3} \log N)$ the treewidth of the protein structure graph. Experimental results indicate that after Goldstein dead-end elimination is conducted, $ n_{\rm rot}$ is very small and $ {\rm tw}$ is equal to $3$ or $4$ most of the time. Based on the globally optimal algorithm, we developed a protein side-chain assignment program TreePack, which runs up to 90 times faster than SCWRL 3.0, a widely-used side-chain packing program, on some large test proteins in the SCWRL benchmark database and an average of five times faster on all the test proteins in this database. There are also some real-world instances that TreePack can solve but that SCWRL 3.0 cannot. The TreePack program is available at {\tt http://ttic.uchicago.edu/~jinbo/TreePack.htm}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldreich:2006:LTC, author = "Oded Goldreich and Madhu Sudan", title = "Locally testable codes and {PCPs} of almost-linear length", journal = j-J-ACM, volume = "53", number = "4", pages = "558--655", month = jul, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1162349.1162351", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Sep 21 07:53:28 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We initiate a systematic study of locally testable codes; that is, error-correcting codes that admit very efficient membership tests. Specifically, these are codes accompanied with tests that make a constant number of (random) queries into any given word and reject non-codewords with probability proportional to their distance from the code.\par Locally testable codes are believed to be the combinatorial core of PCPs. However, the relation is less immediate than commonly believed. Nevertheless, we show that certain PCP systems can be modified to yield locally testable codes. On the other hand, we adapt techniques that we develop for the construction of the latter to yield new PCPs.\par Our main results are locally testable codes and PCPs of almost-linear length. Specifically, we prove the existence of the following constructs:\par ---Locally testable binary (linear) codes in which $k$ information bits are encoded by a codeword of length $ k - \exp (\tilde {O}(\sqrt {(\log k)}))$. This improves over previous results that either yield codewords of exponential length or obtained almost quadratic length codewords for sufficiently large nonbinary alphabet.\par ---PCP systems of almost-linear length for SAT. The length of the proof is $ n - \exp (\tilde {O}(\sqrt {(\log n)}))$ and verification in performed by a constant number (i.e., $ 19$) of queries, as opposed to previous results that used proof length $ n^{(1 + O(1 / q))}$ for verification by $q$ queries.\par The novel techniques in use include a random projection of certain codewords and PCP-oracles that preserves local-testability, an adaptation of PCP constructions to obtain ``linear PCP-oracles'' for proving conjunctions of linear conditions, and design of PCPs with some new soundness properties---a direct construction of locally testable (linear) codes of subexponential length.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vitter:2006:DSR, author = "Jeffrey Scott Vitter and David Alexander Hutchinson", title = "Distribution sort with randomized cycling", journal = j-J-ACM, volume = "53", number = "4", pages = "656--680", month = jul, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1162349.1162352", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Sep 21 07:53:28 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often difficult. Each disk can service only one read or write request at a time; the challenge is to keep the disks as busy as possible. In this article, we develop a randomized allocation discipline for parallel independent disks, called randomized cycling. We show how it can be used as the basis for an efficient distribution sort algorithm, which we call randomized cycling distribution sort (RCD). We prove that the expected I/O complexity of RCD is optimal. The analysis uses a novel reduction to a scenario with significantly fewer probabilistic interdependencies. We demonstrate RCD's practicality by experimental simulations. Using the randomized cycling discipline, algorithms developed for the unrealistic multihead disk model can be simulated on the realistic parallel disk model for the class of multipass algorithms, which make a complete pass through their data before accessing any element a second time. In particular, algorithms based upon the well-known distribution and merge paradigms of EM computation can be optimally extended from a single disk to parallel disks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Amram:2006:BSL, author = "Amir M. Ben-Amram and Holger Petersen", title = "Backing up in singly linked lists", journal = j-J-ACM, volume = "53", number = "4", pages = "681--705", month = jul, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1162349.1162353", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Sep 21 07:53:28 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show how to reduce the time overhead for implementing two-way movement on a singly linked list to $ O(n^\epsilon) $ per operation without modifying the list and without making use of storage other than a finite number of pointers into the list. We also prove a matching lower bound. These results add precision to the intuitive feeling that doubly linked lists are more efficient than singly linked lists, and quantify the efficiency gap in a read-only situation. We further analyze the number of points of access into the list (pointers) necessary for obtaining a desired value of $ \epsilon $. We obtain tight tradeoffs which also separate the amortized and worst-case settings. Our upper bound implies that read-only programs with singly-linked input can do string matching much faster than previously expected.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chuzhoy:2006:NHR, author = "Julia Chuzhoy and Joseph (Seffi) Naor", title = "New hardness results for congestion minimization and machine scheduling", journal = j-J-ACM, volume = "53", number = "5", pages = "707--721", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183908", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chor:2006:FML, author = "Benny Chor and Tamir Tuller", title = "Finding a maximum likelihood tree is hard", journal = j-J-ACM, volume = "53", number = "5", pages = "722--744", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183909", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andrews:2006:LHU, author = "Matthew Andrews and Lisa Zhang", title = "Logarithmic hardness of the undirected edge-disjoint paths problem", journal = j-J-ACM, volume = "53", number = "5", pages = "745--761", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183910", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{PucciDeFarias:2006:CEA, author = "Daniela {Pucci De Farias} and Nimrod Megiddo", title = "Combining expert advice in reactive environments", journal = j-J-ACM, volume = "53", number = "5", pages = "762--799", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183911", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gabow:2006:UEG, author = "Harold N. Gabow", title = "Using expander graphs to find vertex connectivity", journal = j-J-ACM, volume = "53", number = "5", pages = "800--844", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183912", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blum:2006:OAM, author = "Avrim Blum and Tuomas Sandholm and Martin Zinkevich", title = "Online algorithms for market clearing", journal = j-J-ACM, volume = "53", number = "5", pages = "845--879", month = sep, year = "2006", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1183907.1183913", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Dec 1 16:43:39 MST 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lindell:2006:CAB, author = "Yehuda Lindell and Anna Lysyanskaya and Tal Rabin", title = "On the composition of authenticated {Byzantine Agreement}", journal = j-J-ACM, volume = "53", number = "6", pages = "881--917", month = nov, year = "2006", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Karkkainen:2006:LWS, author = "Juha K{\"a}rkk{\"a}inen and Peter Sanders and Stefan Burkhardt", title = "Linear work suffix array construction", journal = j-J-ACM, volume = "53", number = "6", pages = "918--936", month = nov, year = "2006", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Nieuwenhuis:2006:SSS, author = "Robert Nieuwenhuis and Albert Oliveras and Cesare Tinelli", title = "Solving {SAT} and {SAT Modulo Theories}: {From} an abstract {Davis--Putnam--Logemann--Loveland} procedure to {DPLL($T$)}", journal = j-J-ACM, volume = "53", number = "6", pages = "937--977", month = nov, year = "2006", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Shmoys:2006:ASS, author = "David B. Shmoys and Chaitanya Swamy", title = "An approximation scheme for stochastic linear programming and its application to stochastic integer programs", journal = j-J-ACM, volume = "53", number = "6", pages = "978--1012", month = nov, year = "2006", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2007:CHC, author = "Martin Grohe", title = "The complexity of homomorphism and constraint satisfaction problems seen from the other side", journal = j-J-ACM, volume = "54", number = "1", pages = "1:1--1:24", month = mar, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jouannaud:2007:PHO, author = "Jean-Pierre Jouannaud and Albert Rubio", title = "Polymorphic higher-order recursive path orderings", journal = j-J-ACM, volume = "54", number = "1", pages = "2:1--2:48", month = mar, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bansal:2007:SSM, author = "Nikhil Bansal and Tracy Kimbrel and Kirk Pruhs", title = "Speed scaling to manage energy and temperature", journal = j-J-ACM, volume = "54", number = "1", pages = "3:1--3:39", month = mar, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hallgren:2007:PTQ, author = "Sean Hallgren", title = "Polynomial-time quantum algorithms for {Pell}'s equation and the principal ideal problem", journal = j-J-ACM, volume = "54", number = "1", pages = "4:1--4:19", month = mar, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen:2007:DEA, author = "Sara Cohen and Werner Nutt and Yehoshua Sagiv", title = "Deciding equivalences among conjunctive aggregate queries", journal = j-J-ACM, volume = "54", number = "2", pages = "5:1--5:50", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Baeten:2007:CRE, author = "J. C. M. Baeten and F. Corradini and C. A. Grabmayer", title = "A characterization of regular expressions under bisimulation", journal = j-J-ACM, volume = "54", number = "2", pages = "6:1--6:28", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bergstra:2007:RNA, author = "J. A. Bergstra and J. V. Tucker", title = "The rational numbers as an abstract data type", journal = j-J-ACM, volume = "54", number = "2", pages = "7:1--7:25", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Danos:2007:MC, author = "Vincent Danos and Elham Kashefi and Prakash Panangaden", title = "The measurement calculus", journal = j-J-ACM, volume = "54", number = "2", pages = "8:1--8:45", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Achlioptas:2007:FCL, author = "Dimitris Achlioptas and Frank Mcsherry", title = "Fast computation of low-rank matrix approximations", journal = j-J-ACM, volume = "54", number = "2", pages = "9:1--9:19", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Achlioptas:2007:MSR, author = "Dimitris Achlioptas and Assaf Naor and Yuval Peres", title = "On the maximum satisfiability of random formulas", journal = j-J-ACM, volume = "54", number = "2", pages = "10:1--10:21", month = apr, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Apr 14 10:54:02 MDT 2007", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gupta:2007:ACS, author = "Anupam Gupta and Amit Kumar and Martin P{\'{}}al and Tim Roughgarden", title = "Approximation via cost sharing: {Simpler} and better approximation algorithms for network design", journal = j-J-ACM, volume = "54", number = "3", pages = "11:1--11:38", month = jun, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:18 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dinur:2007:PTG, author = "Irit Dinur", title = "The {PCP} theorem by gap amplification", journal = j-J-ACM, volume = "54", number = "3", pages = "12:1--12:44", month = jun, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:18 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andersson:2007:DOS, author = "Arne Andersson and Mikkel Thorup", title = "Dynamic ordered sets with exponential search trees", journal = j-J-ACM, volume = "54", number = "3", pages = "13:1--13:40", month = jun, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:18 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Conitzer:2007:WEF, author = "Vincent Conitzer and Tuomas Sandholm and J{\'e}r{\^o}me Lang", title = "When are elections with few candidates hard to manipulate?", journal = j-J-ACM, volume = "54", number = "3", pages = "14:1--14:33", month = jun, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:18 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:2007:CRA, author = "Joseph Y. Halpern and Riccardo Pucella", title = "Characterizing and reasoning about probabilistic and non-probabilistic expectation", journal = j-J-ACM, volume = "54", number = "3", pages = "15:1--15:49", month = jun, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:18 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2007:ATB, author = "Jiangzhuo Chen and Robert D. Kleinberg and L{\'a}szl{\'o} Lov{\'a}sz and Rajmohan Rajaraman and Ravi Sundaram and Adrian Vetta", title = "(Almost) Tight bounds and existence theorems for single-commodity confluent flows", journal = j-J-ACM, volume = "54", number = "4", pages = "16:1--16:32", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Maneva:2007:NLS, author = "Elitza Maneva and Elchanan Mossel and Martin J. Wainwright", title = "A new look at survey propagation and its generalizations", journal = j-J-ACM, volume = "54", number = "4", pages = "17:1--17:41", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{DeVerdiere:2007:OPD, author = "{\'E}ric Colin {De Verdi{\`e}re} and Francis Lazarus", title = "Optimal pants decompositions and shortest homotopic cycles on an orientable surface", journal = j-J-ACM, volume = "54", number = "4", pages = "18:1--18:27", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vansummeren:2007:DWD, author = "Stijn Vansummeren", title = "On deciding well-definedness for query languages on trees", journal = j-J-ACM, volume = "54", number = "4", pages = "19:1--19:37", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harju:2007:PUW, author = "Tero Harju and Dirk Nowotka", title = "Periodicity and unbordered words: a proof of the extended {Duval} conjecture", journal = j-J-ACM, volume = "54", number = "4", pages = "20:1--20:20", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rudelson:2007:SLM, author = "Mark Rudelson and Roman Vershynin", title = "Sampling from large matrices: {An} approach through geometric functional analysis", journal = j-J-ACM, volume = "54", number = "4", pages = "21:1--21:19", month = jul, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:45:35 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mehta:2007:AGO, author = "Aranyak Mehta and Amin Saberi and Umesh Vazirani and Vijay Vazirani", title = "{AdWords} and generalized online matching", journal = j-J-ACM, volume = "54", number = "5", pages = "22:1--22:19", month = oct, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:19 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ostrovsky:2007:LDE, author = "Rafail Ostrovsky and Yuval Rabani", title = "Low distortion embeddings for edit distance", journal = j-J-ACM, volume = "54", number = "5", pages = "23:1--23:16", month = oct, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:19 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Eiter:2007:CAA, author = "Thomas Eiter and Kazuhisa Makino", title = "On computing all abductive explanations from a propositional {Horn} theory", journal = j-J-ACM, volume = "54", number = "5", pages = "24:1--24:54", month = oct, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:19 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gilpin:2007:LAI, author = "Andrew Gilpin and Tuomas Sandholm", title = "Lossless abstraction of imperfect information games", journal = j-J-ACM, volume = "54", number = "5", pages = "25:1--25:30", month = oct, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:19 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sumii:2007:BTA, author = "Eijiro Sumii and Benjamin C. Pierce", title = "A bisimulation for type abstraction and recursion", journal = j-J-ACM, volume = "54", number = "5", pages = "26:1--26:43", month = oct, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:19 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dyer:2007:CHD, author = "Martin Dyer and Leslie Ann Goldberg and Mike Paterson", title = "On counting homomorphisms to directed acyclic graphs", journal = j-J-ACM, volume = "54", number = "6", pages = "27:1--27:23", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Thorup:2007:EBP, author = "Mikkel Thorup", title = "Equivalence between priority queues and sorting", journal = j-J-ACM, volume = "54", number = "6", pages = "28:1--28:27", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cheung:2007:TSP, author = "Ling Cheung and Mari{\"e}lle Stoelinga and Frits Vaandrager", title = "A testing scenario for probabilistic processes", journal = j-J-ACM, volume = "54", number = "6", pages = "29:1--29:45", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ellen:2007:TLB, author = "Faith Ellen and Panagiota Fatourou and Eric Ruppert", title = "Time lower bounds for implementations of multi-writer snapshots", journal = j-J-ACM, volume = "54", number = "6", pages = "30:1--30:34", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haldar:2007:SRW, author = "Sibsankar Haldar and K. Vidyasankar", title = "On specification of {Read\slash Write} shared variables", journal = j-J-ACM, volume = "54", number = "6", pages = "31:1--31:19", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Duffield:2007:PSE, author = "Nick Duffield and Carsten Lund and Mikkel Thorup", title = "Priority sampling for estimation of arbitrary subset sums", journal = j-J-ACM, volume = "54", number = "6", pages = "32:1--32:37", month = dec, year = "2007", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 2 14:43:20 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Yekhanin:2008:TQL, author = "Sergey Yekhanin", title = "Towards 3-query locally decodable codes of subexponential length", journal = j-J-ACM, volume = "55", number = "1", pages = "1:1--1:16", month = feb, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1326554.1326555", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 11 12:05:42 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Flesca:2008:MXQ, author = "S. Flesca and F. Furfaro and E. Masciari", title = "On the minimization of {XPath} queries", journal = j-J-ACM, volume = "55", number = "1", pages = "2:1--2:46", month = feb, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1326554.1326556", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 11 12:05:42 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dinitz:2008:BCB, author = "Yefim Dinitz and Shlomo Moran and Sergio Rajsbaum", title = "Bit complexity of breaking and achieving symmetry in chains and rings", journal = j-J-ACM, volume = "55", number = "1", pages = "3:1--3:28", month = feb, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1326554.1326557", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 11 12:05:42 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Halpern:2008:FFX, author = "Joseph Y. Halpern and Vicky Weissman", title = "A formal foundation for {XrML}", journal = j-J-ACM, volume = "55", number = "1", pages = "4:1--4:42", month = feb, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1326554.1326558", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 11 12:05:42 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "XrML is becoming a popular language in industry for writing software licenses. The semantics for XrML is implicitly given by an algorithm that determines if a permission follows from a set of licenses. We focus on a fragment of the language and use it to highlight some problematic aspects of the algorithm. We then correct the problems, introduce formal semantics, and show that our semantics captures the (corrected) algorithm. Next, we consider the complexity of determining if a permission is implied by a set of XrML licenses. We prove that the general problem is undecidable, but it is polynomial-time computable for an expressive fragment of the language. We extend XrML to capture a wider range of licenses by adding negation to the language. Finally, we discuss the key differences between XrML and MPEG-21, an international standard based on XrML.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jancar:2008:UBD, author = "Petr Jan{\v{c}}ar and Jiv{\v{r}}{\'\i} Srba", title = "Undecidability of bisimilarity by defender's forcing", journal = j-J-ACM, volume = "55", number = "1", pages = "5:1--5:26", month = feb, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1326554.1326559", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 11 12:05:42 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abadi:2008:SAC, author = "Mart{\'i}n Abadi and Bogdan Warinschi", title = "Security analysis of cryptographically controlled access to {XML} documents", journal = j-J-ACM, volume = "55", number = "2", pages = "6:1--6:29", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346331", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Some promising recent schemes for XML access control employ encryption for implementing security policies on published data, avoiding data duplication. In this article, we study one such scheme, due to Miklau and Suciu [2003]. That scheme was introduced with some intuitive explanations and goals, but without precise definitions and guarantees for the use of cryptography (specifically, symmetric encryption and secret sharing). We bridge this gap in the present work. We analyze the scheme in the context of the rigorous models of modern cryptography. We obtain formal results in simple, symbolic terms close to the vocabulary of Miklau and Suciu. We also obtain more detailed computational results that establish security against probabilistic polynomial-time adversaries. Our approach, which relates these two layers of the analysis, continues a recent thrust in security research and may be applicable to a broad class of systems that rely on cryptographic data protection.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "access control; authorization; encryption; XML", } @Article{Arenas:2008:XDE, author = "Marcelo Arenas and Leonid Libkin", title = "{XML} data exchange: {Consistency} and query answering", journal = j-J-ACM, volume = "55", number = "2", pages = "7:1--7:72", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346332", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. Theoretical foundations of data exchange have recently been investigated for relational data.\par In this article, we start looking into the basic properties of XML data exchange, that is, restructuring of XML documents that conform to a source DTD under a target DTD, and answering queries written over the target schema. We define XML data exchange settings in which source-to-target dependencies refer to the hierarchical structure of the data. Combining DTDs and dependencies makes some XML data exchange settings inconsistent. We investigate the consistency problem and determine its exact complexity.\par We then move to query answering, and prove a dichotomy theorem that classifies data exchange settings into those over which query answering is tractable, and those over which it is coNP-complete, depending on classes of regular expressions used in DTDs. Furthermore, for all tractable cases we give polynomial-time algorithms that compute target XML documents over which queries can be answered.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "computing certain answers; consistency; data exchange; XML", } @Article{Benedikt:2008:XSP, author = "Michael Benedikt and Wenfei Fan and Floris Geerts", title = "{XPath} satisfiability in the presence of {DTDs}", journal = j-J-ACM, volume = "55", number = "2", pages = "8:1--8:79", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346333", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or not there exists an XML document T such that $T$ conforms to $D$ and the answer of p on $T$ is nonempty. We consider a variety of XPath fragments widely used in practice, and investigate the impact of different XPath operators on the satisfiability analysis. We first study the problem for negation-free XPath fragments with and without upward axes, recursion and data-value joins, identifying which factors lead to tractability and which to NP-completeness. We then turn to fragments with negation but without data values, establishing lower and upper bounds in the absence and in the presence of upward modalities and recursion. We show that with negation the complexity ranges from PSPACE to EXPTIME. Moreover, when both data values and negation are in place, we find that the complexity ranges from NEXPTIME to undecidable. Furthermore, we give a finer analysis of the problem for particular classes of DTDs, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone. Finally, we investigate the problem for XPath fragments with sibling axes, exploring the impact of horizontal modalities on the satisfiability analysis.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "containment; DTDs; satisfiability; XML; XPath", } @Article{Gottlob:2008:ECC, author = "Georg Gottlob and Alan Nash", title = "Efficient core computation in data exchange", journal = j-J-ACM, volume = "55", number = "2", pages = "9:1--9:49", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346334", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Data exchange deals with inserting data from one database into another database having a different schema. Fagin et al. [2005] have shown that among the universal solutions of a solvable data exchange problem, there exists --- up to isomorphism --- a unique most compact one, ``the core'', and have convincingly argued that this core should be the database to be materialized. They stated as an important open problem whether the core can be computed in polynomial time in the general setting where the mapping between the source and target schemas is given by source-to-target constraints that are arbitrary tuple generating dependencies (tgds) and target constraints consisting of equality generating dependencies (egds) and a weakly acyclic set of tgds. In this article, we solve this problem by developing new methods for efficiently computing the core of a universal solution. This positive result shows that data exchange based on cores is feasible and applicable in a very general setting. In addition to our main result, we use the method of hypertree decompositions to derive new algorithms and upper bounds for query containment checking and computing cores of arbitrary database instances. We also show that computing the core of a data exchange problem is fixed-parameter intractable with respect to a number of relevant parameters, and that computing cores is NP-complete if the rule bodies of target tgds are augmented by a special predicate that distinguishes a null value from a constant data value.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "chase; complexity; conjunctive queries; constraints; core; data exchange; data integration; dependencies; query evaluation; tractability; universal solutions", } @Article{Tardos:2008:OPF, author = "G{\'a}bor Tardos", title = "Optimal probabilistic fingerprint codes", journal = j-J-ACM, volume = "55", number = "2", pages = "10:1--10:24", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346335", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We construct binary codes for fingerprinting digital documents. Our codes for $n$ users that are $ \epsilon $-secure against $c$ pirates have length $ O(c^2 \log (n / \epsilon))$. This improves the codes proposed by Boneh and Shaw [1998] whose length is approximately the square of this length. The improvement carries over to works using the Boneh--Shaw code as a primitive, for example, to the dynamic traitor tracing scheme of Tassa [2005].\par By proving matching lower bounds we establish that the length of our codes is best within a constant factor for reasonable error probabilities. This lower bound generalizes the bound found independently by Peikert et al. [2003] that applies to a limited class of codes. Our results also imply that randomized fingerprint codes over a binary alphabet are as powerful as over an arbitrary alphabet and the equal strength of two distinct models for fingerprinting.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "collusion attack; fingerprint codes", } @Article{Mulzer:2008:MWT, author = "Wolfgang Mulzer and G{\"u}nter Rote", title = "Minimum-weight triangulation is {NP}-hard", journal = j-J-ACM, volume = "55", number = "2", pages = "11:1--11:29", month = may, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1346330.1346336", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jun 16 18:08:44 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A triangulation of a planar point set $S$ is a maximal plane straight-line graph with vertex set $S$. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths. We prove that the decision version of this problem is NP-hard, using a reduction from PLANAR 1-IN-3-SAT. The correct working of the gadgets is established with computer assistance, using dynamic programming on polygonal faces, as well as the $ \beta $-skeleton heuristic to certify that certain edges belong to the minimum-weight triangulation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "optimal triangulations; PLANAR 1-IN-3-SAT", } @Article{Li:2008:BSD, author = "Ninghui Li and Qihua Wang", title = "Beyond separation of duty: {An} algebra for specifying high-level security policies", journal = j-J-ACM, volume = "55", number = "3", pages = "12:1--12:56", month = jul, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1379759.1379760", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 6 08:30:17 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The process of introducing security controls into a sensitive task, which we call {\em secure task design\/} in this article, consists of two steps: high-level security policy design and low-level enforcement scheme design. A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a task to be performed by a team of at least $k$ users. Unlike low-level enforcement schemes such as security constraints in workflows, a separation of duty policy states a high-level requirement about the task without referring to individual steps in the task. While extremely important and widely used, separation of duty policies state only requirements on the number of users involved in the task and do not capture the requirements on these users' attributes. In this article, we introduce a novel algebra that enables the formal specification of high-level policies that combine requirements on users' attributes with requirements on the number of users motivated by separation of duty considerations. We give the syntax and semantics of the algebra and study algebraic properties of its operators. After that, we study potential mechanisms to enforce high-level policies specified in the algebra and a number of computational problems related to policy analysis and enforcement.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "access control; policy design; separation of duty", } @Article{Chen:2008:MAB, author = "Xi Chen and Xiaotie Deng", title = "Matching algorithmic bounds for finding a {Brouwer} fixed point", journal = j-J-ACM, volume = "55", number = "3", pages = "13:1--13:23", month = jul, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1379759.1379761", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 6 08:30:17 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove a new discrete fixed point theorem for direction-preserving functions defined on integer points, based on a novel characterization of boundary conditions for the existence of fixed points. The theorem allows us to derive an improved algorithm for finding such a fixed point. We also develop a new lower bound proof technique. Together, they allow us to derive an asymptotic matching bound for the problem of finding a fixed point in a hypercube of any constantly bounded finite dimension.\par Exploring a linkage with the approximation version of the continuous fixed point problem, we obtain asymptotic matching bounds for the complexity of the approximate Brouwer fixed point problem in the continuous case for Lipschitz functions. It settles a fifteen-years-old open problem of Hirsch, Papadimitriou, and Vavasis by improving both the upper and lower bounds.\par Our characterization for the existence of a fixed point is also applicable to functions defined on nonconvex domains, which makes it a potentially useful tool for the design and analysis of algorithms for fixed points in general domains.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximate fixed point; fixed point theorem; Lipschitz function; Sperner's lemma", } @Article{Papadimitriou:2008:CCE, author = "Christos H. Papadimitriou and Tim Roughgarden", title = "Computing correlated equilibria in multi-player games", journal = j-J-ACM, volume = "55", number = "3", pages = "14:1--14:29", month = jul, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1379759.1379762", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 6 08:30:17 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We develop polynomial-time algorithms for finding correlated equilibria --- a well-studied notion of rationality that generalizes the Nash equilibrium --- in a broad class of succinctly representable multiplayer games, encompassing graphical games, anonymous games, polymatrix games, congestion games, scheduling games, local effect games, as well as several generalizations. Our algorithm is based on a variant of the existence proof due to Hart and Schmeidler, and employs linear programming duality, the ellipsoid algorithm, Markov chain steady state computations, as well as application-specific methods for computing multivariate expectations over product distributions.\par For anonymous games and graphical games of bounded tree-width, we provide a different polynomial-time algorithm for optimizing an arbitrary linear function over the set of correlated equilibria of the game. In contrast to our sweeping positive results for computing an arbitrary correlated equilibrium, we prove that optimizing over correlated equilibria is NP-hard in all of the other classes of games that we consider.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "complexity of equilibria; correlated equilibria; Nash equilibria", } @Article{Rossman:2008:HPT, author = "Benjamin Rossman", title = "Homomorphism preservation theorems", journal = j-J-ACM, volume = "55", number = "3", pages = "15:1--15:53", month = jul, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1379759.1379763", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Aug 6 08:30:17 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The homomorphism preservation theorem (h.p.t.), a result in classical model theory, states that a first-order formula is preserved under homomorphisms on all structures (finite and infinite) if and only if it is equivalent to an existential-positive formula. Answering a long-standing question in finite model theory, we prove that the h.p.t. remains valid when restricted to finite structures (unlike many other classical preservation theorems, including the {\L}o{\'s}--Tarski theorem and Lyndon's positivity theorem). Applications of this result extend to constraint satisfaction problems and to database theory via a correspondence between existential-positive formulas and unions of conjunctive queries. A further result of this article strengthens the classical h.p.t.: we show that a first-order formula is preserved under homomorphisms on all structures if and only if it is equivalent to an existential-positive formula {\em of equal quantifier-rank}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "conjunctive queries; finite model theory; first-order logic; homomorphisms; preservation theorems; quantifier-rank; tree-depth", } @Article{Deineko:2008:AMC, author = "Vladimir Deineko and Peter Jonsson and Mikael Klasson and Andrei Krokhin", title = "The approximability of {MAX CSP} with fixed-value constraints", journal = j-J-ACM, volume = "55", number = "4", pages = "16:1--16:37", month = sep, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1391289.1391290", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 16 14:29:55 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. In this article, we show that any MAX CSP problem with a finite set of allowed constraint types, which includes all fixed-value constraints (i.e., constraints of the form $ x = a$), is either solvable exactly in polynomial time or else is APX-complete, even if the number of occurrences of variables in instances is bounded. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description relies on the well-known algebraic combinatorial property of supermodularity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Complexity of approximation; dichotomy; maximum constraint satisfaction; Monge properties; supermodularity", } @Article{Reingold:2008:UCL, author = "Omer Reingold", title = "Undirected connectivity in log-space", journal = j-J-ACM, volume = "55", number = "4", pages = "17:1--17:24", month = sep, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1391289.1391291", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 16 14:29:55 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a {\em deterministic}, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was $ \log^{4 / 3}(\cdot) $ obtained by Armoni, Ta-Shma, Wigderson and Zhou (JACM 2000). As undirected st-connectivity is complete for the class of problems solvable by symmetric, nondeterministic, log-space computations (the class SL), this algorithm implies that SL = L (where $L$ is the class of problems solvable by deterministic log-space computations). Independent of our work (and using different techniques), Trifonov (STOC 2005) has presented an $ O(\log n \log \log n)$-space, deterministic algorithm for undirected st-connectivity.\par Our algorithm also implies a way to construct in log-space a {\em fixed\/} sequence of directions that guides a deterministic walk through all of the vertices of any connected graph. Specifically, we give log-space constructible universal-traversal sequences for graphs with restricted labeling and log-space constructible universal-exploration sequences for general graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "bounded space algorithms; Derandomization; pseudorandom generator", } @Article{Awerbuch:2008:OMS, author = "Baruch Awerbuch and Israel Cidon and Shay Kutten", title = "Optimal maintenance of a spanning tree", journal = j-J-ACM, volume = "55", number = "4", pages = "18:1--18:45", month = sep, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1391289.1391292", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 16 14:29:55 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we show that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols. We present a communication optimal maintenance of a spanning tree in a dynamic network. The amortized (on the number of topological changes) message complexity is $ O(V) $, where $V$ is the number of nodes in the network. The message size used by the algorithm is $ O(\log |I D|)$ where $ |I D|$ is the size of the name space of the nodes. Typically, $ \log |I D| = O(\log V)$.\par Previous algorithms that adapt to dynamic networks involved $ \Omega (E)$ messages per topological change --- inherently paying for re-computation of the tree from scratch.\par Spanning trees are essential components in many distributed algorithms. Some examples include {\em broadcast\/} (dissemination of messages to all network nodes), {\em multicast, reset\/} (general adaptation of static algorithms to dynamic networks), routing, {\em termination detection}, and more. Thus, our efficient maintenance of a spanning tree implies the improvement of algorithms for these tasks. Our results are obtained using a novel technique to save communication. A node uses information received in the past in order to deduce present information from the fact that certain messages were NOT sent by the node's neighbor. This technique is one of our main contributions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "amortized complexity; Distributed algorithms; dynamic networks; leader election; optimal message complexity; spanning tree; topological changes", } @Article{Frisch:2008:SSD, author = "Alain Frisch and Giuseppe Castagna and V{\'e}ronique Benzaken", title = "Semantic subtyping: {Dealing} set-theoretically with function, union, intersection, and negation types", journal = j-J-ACM, volume = "55", number = "4", pages = "19:1--19:64", month = sep, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1391289.1391293", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 16 14:29:55 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "higher-order functions; intersection types; negation types; Subtyping; union types", } @Article{Attiya:2008:TBA, author = "Hagit Attiya and Keren Censor", title = "Tight bounds for asynchronous randomized consensus", journal = j-J-ACM, volume = "55", number = "5", pages = "20:1--20:26", month = oct, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1411509.1411510", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 11 15:50:40 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A distributed consensus algorithm allows $n$ processes to reach a common decision value starting from individual inputs. {\em Wait-free\/} consensus, in which a process always terminates within a finite number of its own steps, is impossible in an asynchronous shared-memory system. However, consensus becomes solvable using randomization when a process only has to terminate with probability 1. Randomized consensus algorithms are typically evaluated by their {\em total step complexity}, which is the expected total number of steps taken by all processes.\par This article proves that the total step complexity of randomized consensus is $ \Theta (n^2)$ in an asynchronous shared memory system using multi-writer multi-reader registers. This result is achieved by improving both the lower and the upper bounds for this problem.\par In addition to improving upon the best previously known result by a factor of $ \log^2 n$, the lower bound features a greatly streamlined proof. Both goals are achieved through restricting attention to a set of {\em layered\/} executions and using an isoperimetric inequality for analyzing their behavior.\par The matching algorithm decreases the expected total step complexity by a $ \log n$ factor, by leveraging the multi-writing capability of the shared registers. Its correctness proof is facilitated by viewing each execution of the algorithm as a stochastic process and applying Kolmogorov's inequality.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Distributed computing; isoperimetric inequality; lower bound; randomized algorithms; shared-memory", } @Article{Chen:2008:FPA, author = "Jianer Chen and Yang Liu and Songjian Lu and Barry O'Sullivan and Igor Razgon", title = "A fixed-parameter algorithm for the directed feedback vertex set problem", journal = j-J-ACM, volume = "55", number = "5", pages = "21:1--21:19", month = oct, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1411509.1411511", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 11 15:50:40 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a directed graph $G$ and a parameter $k$, either construct a feedback vertex set of at most $k$ vertices in $G$ or report that no such a set exists. It has been a well-known open problem in parameterized computation and complexity whether the DFVS problem is fixed-parameter tractable, that is, whether the problem can be solved in time $ f(k) n^{O(1)}$ for some function $f$. In this article, we develop new algorithmic techniques that result in an algorithm with running time $ 4^k k! n^{O(1)}$ for the DFVS problem. Therefore, we resolve this open problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Deadlock; feedback vertex set; parameterized computation", } @Article{Devanur:2008:MEP, author = "Nikhil R. Devanur and Christos H. Papadimitriou and Amin Saberi and Vijay V. Vazirani", title = "Market equilibrium via a primal--dual algorithm for a convex program", journal = j-J-ACM, volume = "55", number = "5", pages = "22:1--22:18", month = oct, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1411509.1411512", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 11 15:50:40 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give the first polynomial time algorithm for exactly computing an equilibrium for the linear utilities case of the market model defined by Fisher. Our algorithm uses the primal--dual paradigm in the enhanced setting of KKT conditions and convex programs. We pinpoint the added difficulty raised by this setting and the manner in which our algorithm circumvents it.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Market equilibria; primal--dual algorithms", } @Article{Ailon:2008:AII, author = "Nir Ailon and Moses Charikar and Alantha Newman", title = "Aggregating inconsistent information: {Ranking} and clustering", journal = j-J-ACM, volume = "55", number = "5", pages = "23:1--23:27", month = oct, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1411509.1411513", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 11 15:50:40 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We address optimization problems in which we are given contradictory pieces of input information and the goal is to find a globally consistent solution that minimizes the extent of disagreement with the respective inputs. Specifically, the problems we address are rank aggregation, the feedback arc set problem on tournaments, and correlation and consensus clustering. We show that for all these problems (and various weighted versions of them), we can obtain improved approximation factors using essentially the same remarkably simple algorithm. Additionally, we almost settle a long-standing conjecture of Bang-Jensen and Thomassen and show that unless NP $ \subseteq $ BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "consensus clustering; correlation clustering; minimum feedback arc-set; Rank aggregation; tournaments", } @Article{Bar-Yossef:2008:RSS, author = "Ziv Bar-Yossef and Maxim Gurevich", title = "Random sampling from a search engine's index", journal = j-J-ACM, volume = "55", number = "5", pages = "24:1--24:74", month = oct, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1411509.1411514", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 11 15:50:40 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We revisit a problem introduced by Bharat and Broder almost a decade ago: How to sample random pages from the corpus of documents indexed by a search engine, using only the search engine's public interface? Such a primitive is particularly useful in creating objective benchmarks for search engines.\par The technique of Bharat and Broder suffers from a well-recorded bias: it favors long documents. In this article we introduce two novel sampling algorithms: a lexicon-based algorithm and a random walk algorithm. Our algorithms produce {\em biased\/} samples, but each sample is accompanied by a {\em weight}, which represents its bias. The samples, in conjunction with the weights, are then used to {\em simulate\/} near-uniform samples. To this end, we resort to four well-known Monte Carlo simulation methods: {\em rejection sampling}, {\em importance sampling}, the {\em Metropolis--Hastings\/} algorithm, and the {\em Maximum Degree\/} method.\par The limited access to search engines force our algorithms to use bias weights that are only ``approximate''. We characterize analytically the effect of approximate bias weights on Monte Carlo methods and conclude that our algorithms are {\em guaranteed\/} to produce near-uniform samples from the search engine's corpus. Our study of approximate Monte Carlo methods could be of independent interest.\par Experiments on a corpus of 2.4 million documents substantiate our analytical findings and show that our algorithms do not have significant bias towards long documents. We use our algorithms to collect comparative statistics about the corpora of the Google, MSN Search, and Yahoo! search engines.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Benchmarks; sampling; search engines; size estimation", } @Article{Ackermann:2008:ICS, author = "Heiner Ackermann and Heiko R{\"o}glin and Berthold V{\"o}cking", title = "On the impact of combinatorial structure on congestion games", journal = j-J-ACM, volume = "55", number = "6", pages = "25:1--25:22", month = dec, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1455248.1455249", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 23 12:10:55 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time. We show that if the strategy space of each player consists of the bases of a matroid over the set of resources, then the lengths of all best response sequences are polynomially bounded in the number of players and resources. We also prove that this result is tight, that is, the matroid property is a necessary and sufficient condition on the players' strategy spaces for guaranteeing polynomial-time convergence to a Nash equilibrium.\par In addition, we present an approach that enables us to devise hardness proofs for various kinds of combinatorial games, including first results about the hardness of market sharing games and congestion games for overlay network design. Our approach also yields a short proof for the PLS-completeness of network congestion games. In particular, we show that network congestion games are PLS-complete for directed and undirected networks even in case of linear latency functions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Congestion games; convergence; local search; Nash equilibria", } @Article{Korf:2008:LTD, author = "Richard E. Korf", title = "Linear-time disk-based implicit graph search", journal = j-J-ACM, volume = "55", number = "6", pages = "26:1--26:40", month = dec, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1455248.1455250", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 23 12:10:55 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Many search algorithms are limited by the amount of memory available. Magnetic disk storage is over two orders of magnitude cheaper than semiconductor memory, and individual disks can hold up to a terabyte. We augment memory with magnetic disks to perform brute-force and heuristic searches that are orders of magnitude larger than any previous such searches. The main difficulty is detecting duplicate nodes, which is normally done with a hash table. Due to long disk latencies, however, randomly accessed hash tables are infeasible on disk, and are replaced by a mechanism we call delayed duplicate detection. In contrast to previous work, we perform delayed duplicate detection without sorting, which runs in time linear in the number of nodes in practice. Using this technique, we performed the first complete breadth-first searches of the $ 2 \times 7 $, $ 3 \times 5 $, $ 4 \times 4 $, and $ 2 \times 8 $ sliding-tile Puzzles, verifying the radius of the $ 4 \times 4 $ puzzle and determining the radius of the others. We also performed the first complete breadth-first searches of the four-peg Towers of Hanoi problem with up to 22 discs, discovering a surprising anomaly regarding the radii of these problems. In addition, we performed the first heuristic searches of the four-peg Towers of Hanoi problem with up to 31 discs, verifying a conjectured optimal solution length to these problems. We also performed partial breadth-first searches of Rubik's Cube to depth ten in the face-turn metric, and depth eleven in the quarter-turn metric, confirming previous results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "External memory; magnetic disk storage; permutation encodings; Rubik's Cube; sliding-tile puzzles; Towers of Hanoi", } @Article{Andrews:2008:ATH, author = "Matthew Andrews and Lisa Zhang", title = "Almost-tight hardness of directed congestion minimization", journal = j-J-ACM, volume = "55", number = "6", pages = "27:1--27:20", month = dec, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1455248.1455251", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 23 12:10:55 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Given a set of demands in a directed graph, the {\em directed congestion minimization\/} problem is to route every demand with the objective of minimizing the heaviest load over all edges. We show that for any constant $ \epsilon > 0 $, there is no $ \Omega (\log^{1 - \epsilon } M)$-approximation algorithm on networks of size $M$ unless {\em NP\_ZPTIME\/}$ (n^{\polylog (n)})$. This bound is almost tight given the $ O(\log M / \log \log M)$-approximation via randomized rounding due to Raghavan and Thompson.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "congestion minimization; Hardness of approximation; undirected graphs", } @Article{Alon:2008:WNI, author = "Noga Alon and Haim Kaplan and Gabriel Nivasch and Micha Sharir and Shakhar Smorodinsky", title = "Weak $ \epsilon $-nets and interval chains", journal = j-J-ACM, volume = "55", number = "6", pages = "28:1--28:32", month = dec, year = "2008", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1455248.1455252", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 23 12:10:55 MST 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We construct weak $ \epsilon $-nets of almost linear size for certain types of point sets. Specifically, for planar point sets in convex position we construct weak $ 1 / r$-nets of size $ O(r \alpha (r))$, where $ \alpha (r)$ denotes the inverse Ackermann function. For point sets along the moment curve in $ \mathbb {R}^d$ we construct weak $ 1 / r$-nets of size $ r \cdot 2^{\mathrm {poly}(\alpha (r))}$, where the degree of the polynomial in the exponent depends (quadratically) on $d$.\par Our constructions result from a reduction to a new problem, which we call stabbing interval chains with $j$-tuples. Given the range of integers $ N = [1, n]$, an interval chain of length $k$ is a sequence of $k$ consecutive, disjoint, nonempty intervals contained in $N$. A $j$-tuple $ \bar {P} = (p1, \ldots {}, p j)$ is said to stab an interval chain $ C = I_1 \ldots {} I_k$ if each $ p_i$ falls on a different interval of $C$. The problem is to construct a small-size family $Z$ of $j$-tuples that stabs all $k$-interval chains in $N$.\par Let $ z^{(j)}_k(n)$ denote the minimum size of such a family $Z$. We derive almost-tight upper and lower bounds for $ z^{(j)}_k(n)$ for every fixed $j$; our bounds involve functions $ \alpha_m(n)$ of the inverse Ackermann hierarchy. Specifically, we show that for $ j = 3$ we have $ z^{(3)}_k(n) = \Theta (n \alpha_{\lfloor k / 2 \rfloor }(n))$ for all $ k \geq 6$. For each $ j \geq 4$, we construct a pair of functions $ P'_j(m), Q'_j(m)$, almost equal asymptotically, such that $ z^{(j)}_{P'} j(m)(n) = O(n \alpha_m (n))$ and $ z^{(j)}_{Q'} j(m)(n) = \Omega (n \alpha_m(n))$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Interval chain; inverse Ackermann function; moment curve; weak epsilon-net", } @Article{Etessami:2009:RMC, author = "Kousha Etessami and Mihalis Yannakakis", title = "Recursive {Markov} chains, stochastic grammars, and monotone systems of nonlinear equations", journal = j-J-ACM, volume = "56", number = "1", pages = "1:1--1:66", month = jan, year = "2009", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Feb 2 16:30:40 MST 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Naor:2009:COM, author = "Moni Naor and Guy N. Rothblum", title = "The complexity of online memory checking", journal = j-J-ACM, volume = "56", number = "1", pages = "2:1--2:46", month = jan, year = "2009", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Feb 2 16:30:40 MST 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Valiant:2009:E, author = "Leslie G. Valiant", title = "Evolvability", journal = j-J-ACM, volume = "56", number = "1", pages = "3:1--3:21", month = jan, year = "2009", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Feb 2 16:30:40 MST 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Babaioff:2009:SVC, author = "Moshe Babaioff and Ron Lavi and Elan Pavlov", title = "Single-value combinatorial auctions and algorithmic implementation in undominated strategies", journal = j-J-ACM, volume = "56", number = "1", pages = "4:1--4:32", month = jan, year = "2009", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Feb 2 16:30:40 MST 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arora:2009:EFG, author = "Sanjeev Arora and Satish Rao and Umesh Vazirani", title = "Expander flows, geometric embeddings and graph partitioning", journal = j-J-ACM, volume = "56", number = "2", pages = "5:1--5:37", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502794", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a $ O(\sqrt {\log n})$-approximation algorithm for the sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the $ O(\log n)$-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in $ R^d$, whose proof makes essential use of a phenomenon called measure concentration.\par We also describe an interesting and natural ``approximate certificate'' for a graph's expansion, which involves embedding an $n$-node expander in it with appropriate dilation and congestion. We call this an expander flow.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "expanders; expansion; Graph partitioning; graph separators; multicommodity flows; semidefinite programs", } @Article{Chuzhoy:2009:PFC, author = "Julia Chuzhoy and Sanjeev Khanna", title = "Polynomial flow-cut gaps and hardness of directed cut problems", journal = j-J-ACM, volume = "56", number = "2", pages = "6:1--6:28", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502795", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the multicut and the sparsest cut problems in directed graphs. In the multicut problem, we are a given an $n$-vertex graph $G$ along with $k$ source-sink pairs, and the goal is to find the minimum cardinality subset of edges whose removal separates all source-sink pairs. The sparsest cut problem has the same input, but the goal is to find a subset of edges to delete so as to minimize the ratio of the number of deleted edges to the number of source-sink pairs that are separated by this deletion. The natural linear programming relaxation for multicut corresponds, by LP-duality, to the well-studied maximum (fractional) multicommodity flow problem, while the standard LP-relaxation for sparsest cut corresponds to maximum concurrent flow. Therefore, the integrality gap of the linear programming relaxation for multicut/sparsest cut is also the {\em flow-cut gap\/}: the largest gap, achievable for any graph, between the maximum flow value and the minimum cost solution for the corresponding cut problem.\par Our first result is that the flow-cut gap between maximum multicommodity flow and minimum multicut is $ \Omega \tilde (n^{1 / 7})$ in directed graphs. We show a similar result for the gap between maximum concurrent flow and sparsest cut in directed graphs. These results improve upon a long-standing lower bound of $ \Omega (\log n)$ for both types of flow-cut gaps. We notice that these polynomially large flow-cut gaps are in a sharp contrast to the undirected setting where both these flow-cut gaps are known to be $ \Theta (\log n)$. Our second result is that both directed multicut and sparsest cut are hard to approximate to within a factor of $ 2^{\Omega (\log 1 - \epsilon n)}$ for any constant $ \epsilon > 0$, unless NP $ \subseteq $ ZPP. This improves upon the recent $ \Omega (\log n / \log \log n)$-hardness result for these problems. We also show that existence of PCP's for NP with perfect completeness, polynomially small soundness, and constant number of queries would imply a polynomial factor hardness of approximation for both these problems. All our results hold for directed acyclic graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Directed multicut; hardness of approximation; sparsest cut", } @Article{Arvestad:2009:GEM, author = "Lars Arvestad and Jens Lagergren and Bengt Sennblad", title = "The gene evolution model and computing its associated probabilities", journal = j-J-ACM, volume = "56", number = "2", pages = "7:1--7:44", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502796", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Phylogeny is both a fundamental tool in biology and a rich source of fascinating modeling and algorithmic problems. Today's wealth of sequenced genomes makes it increasingly important to understand evolutionary events such as duplications, losses, transpositions, inversions, lateral transfers, and domain shuffling. We focus on the gene duplication event, that constitutes a major force in the creation of genes with new function [Ohno 1970; Lynch and Force 2000] and, thereby also, of biodiversity.\par We introduce the probabilistic {\em gene evolution model}, which describes how a gene tree evolves within a given species tree with respect to speciation, gene duplication, and gene loss. The actual relation between gene tree and species tree is captured by a reconciliation, a concept which we generalize for more expressiveness. The model is a canonical generalization of the classical linear birth-death process, obtained by replacing the interval where the process takes place by a tree.\par For the {\em gene evolution model}, we derive efficient algorithms for some associated probability distributions: the probability of a reconciled tree, the probability of a gene tree, the maximum probability reconciliation, the posterior probability of a reconciliation, and sampling reconciliations with respect to the posterior probability. These algorithms provides the basis for several applications, including species tree construction, reconciliation analysis, orthology analysis, biogeography, and host-parasite co-evolution.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "duplication; evolution; gene; loss; Phylogeny; probability; reconciliation", } @Article{Raz:2009:MLF, author = "Ran Raz", title = "Multi-linear formulas for permanent and determinant are of super-polynomial size", journal = j-J-ACM, volume = "56", number = "2", pages = "8:1--8:17", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502797", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An arithmetic formula is multilinear if the polynomial computed by each of its subformulas is multilinear. We prove that any multilinear arithmetic formula for the permanent or the determinant of an $ n \times n $ matrix is of size super-polynomial in $n$. Previously, super-polynomial lower bounds were not known (for any explicit function) even for the special case of multilinear formulas of constant depth.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algebraic complexity; arithmetic formulas; circuit complexity; lower bounds", } @Article{Borradaile:2009:AMS, author = "Glencora Borradaile and Philip Klein", title = "An {$ O(n \log n) $} algorithm for maximum {\em st}-flow in a directed planar graph", journal = j-J-ACM, volume = "56", number = "2", pages = "9:1--9:30", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502798", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give the first correct $ O(n \log n) $ algorithm for finding a maximum {\em st\/}-flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual $s$-to-$t$ path.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Maximum flow; planar graphs", } @Article{Puschel:2009:PSD, author = "Markus P{\"u}schel and Peter A. Milder and James C. Hoe", title = "Permuting streaming data using {RAMs}", journal = j-J-ACM, volume = "56", number = "2", pages = "10:1--10:34", month = apr, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1502793.1502799", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 16 14:07:37 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents a method for constructing hardware structures that perform a fixed permutation on streaming data. The method applies to permutations that can be represented as linear mappings on the bit-level representation of the data locations. This subclass includes many important permutations such as stride permutations (corner turn, perfect shuffle, etc.), the bit reversal, the Hadamard reordering, and the Gray code reordering.\par The datapath for performing the streaming permutation consists of several independent banks of memory and two interconnection networks. These structures are built for a given streaming width (i.e., number of inputs and outputs per cycle) and operate at full throughput for this streaming width.\par We provide an algorithm that completely specifies the datapath and control logic given the desired permutation and streaming width. Further, we provide lower bounds on the achievable cost of a solution and show that for an important subclass of permutations our solution is optimal.\par We apply our algorithm to derive datapaths for several important permutations, including a detailed example that carefully illustrates each aspect of the design process. Lastly, we compare our permutation structures to those of J{\"a}rvinen et al. [2004], which are specialized for stride permutations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "connection network; data reordering; linear bit mapping; matrix transposition; Permutation; RAM; streaming datapath; stride permutation; switch", } @Article{Vianu:2009:IPS, author = "Victor Vianu and Jan {Van den Bussche}", title = "Introduction to {PODS 2006} special section", journal = j-J-ACM, volume = "56", number = "3", pages = "11:1--11:1", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516513", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2009:LBP, author = "Martin Grohe and Andr{\'e} Hernich and Nicole Schweikardt", title = "Lower bounds for processing data with few random accesses to external memory", journal = j-J-ACM, volume = "56", number = "3", pages = "12:1--12:58", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516514", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situation are the size of the main memory and the number of random accesses to external memory. We note that sequentially streaming data from external memory through main memory is much less prohibitive.\par We propose an abstract model of this scenario in which we restrict the size of the main memory and the number of random accesses to external memory, but admit arbitrary sequential access. A distinguishing feature of our model is that it allows the usage of unlimited external memory for storing intermediate results, such as several hard disks that can be accessed in parallel.\par In this model, we prove lower bounds for the problem of sorting a sequence of strings (or numbers), the problem of deciding whether two given sets of strings are equal, and two closely related decision problems. Intuitively, our results say that there is no algorithm for the problems that uses internal memory space bounded by $ N^{1 - \epsilon } $ and at most $ o(\log N) $ random accesses to external memory, but unlimited ``streaming access'', both for writing to and reading from external memory. (Here, $N$ denotes the size of the input and $ \epsilon $ is an arbitrary constant greater than 0.) We even permit randomized algorithms with one-sided bounded error. We also consider the problem of evaluating database queries and prove similar lower bounds for evaluating relational algebra queries against relational databases and XQuery and XPath queries against XML-databases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Complexity; data streams; query optimization; query processing; real-time data; semi-structured data; XML", } @Article{Bojanczyk:2009:TVL, author = "Mikoaj Boja{\'n}czyk and Anca Muscholl and Thomas Schwentick and Luc Segoufin", title = "Two-variable logic on data trees and {XML} reasoning", journal = j-J-ACM, volume = "56", number = "3", pages = "13:1--13:48", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516515", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on {\em data trees\/} is investigated. The nodes of a data tree have a {\em label\/} from a finite set and a {\em data value\/} from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the {\em child\/} and the {\em next sibling\/} predicates and the access to data values is restricted to equality tests. From this main result, decidability of satisfiability and containment for a data-aware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "consistency; DTDs; implications; Integrity constraints; XML", } @Article{Chen:2009:SCC, author = "Xi Chen and Xiaotie Deng and Shang-Hua Teng", title = "Settling the complexity of computing two-player {Nash} equilibria", journal = j-J-ACM, volume = "56", number = "3", pages = "14:1--14:57", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516516", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991.\par Our result, building upon the work of Daskalakis et al. [2006a] on the complexity of four-player Nash equilibria, settles a long standing open problem in algorithmic game theory. It also serves as a starting point for a series of results concerning the complexity of two-player Nash equilibria. In particular, we prove the following theorems:\par --- Bimatrix does not have a fully polynomial-time approximation scheme unless every problem in PPAD is solvable in polynomial time.\par --- The smoothed complexity of the classic Lemke--Howson algorithm and, in fact, of any algorithm for Bimatrix is not polynomial unless every problem in PPAD is solvable in randomized polynomial time.\par Our results also have a complexity implication in mathematical economics:\par --- Arrow--Debreu market equilibria are PPAD-hard to compute.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Arrow--Debreu market; Brouwer's fixed point; Lemke--Howson algorithm; Nash equilibrium; PPAD-completeness; smoothed analysis; Sperner's lemma; Two-player game", } @Article{Remy:2009:QPT, author = "Jan Remy and Angelika Steger", title = "A quasi-polynomial time approximation scheme for minimum weight triangulation", journal = j-J-ACM, volume = "56", number = "3", pages = "15:1--15:47", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516517", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Minimum Weight Triangulation problem is to find a triangulation $ T* $ of minimum length for a given set of points $P$ in the Euclidean plane. It was one of the few longstanding open problems from the famous list of twelve problems with unknown complexity status, published by Garey and Johnson [1979]. Very recently, the problem was shown to be {\em NP\/}-hard by Mulzer and Rote [2006]. In this article, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "approximation algorithms; Minimum weight triangulation", } @Article{Alur:2009:ANS, author = "Rajeev Alur and P. Madhusudan", title = "Adding nesting structure to words", journal = j-J-ACM, volume = "56", number = "3", pages = "16:1--16:43", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516518", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We propose the model of {\em nested words\/} for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define {\em nested word automata\/} --- finite-state acceptors for nested words, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nested word automata are as expressive as their nondeterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-*, prefixes, and language homomorphisms; membership, emptiness, language inclusion, and language equivalence are all decidable; and definability in monadic second order logic corresponds exactly to finite-state recognizability. We also consider regular languages of infinite nested words and show that the closure properties, MSO-characterization, and decidability of decision problems carry over.\par The linear encodings of nested words give the class of {\em visibly pushdown languages\/} of words, and this class lies between balanced languages and deterministic context-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, a visibly pushdown language), and this would allow model checking of many properties (such as stack inspection, pre-post conditions) that are not expressible in existing specification logics.\par We also study the relationship between ordered trees and nested words, and the corresponding automata: while the analysis complexity of nested word automata is the same as that of classical tree automata, they combine both bottom-up and top-down traversals, and enjoy expressiveness and succinctness benefits over tree automata.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Pushdown automata; software model checking; tree automata; XML processing", } @Article{Lueker:2009:IBA, author = "George S. Lueker", title = "Improved bounds on the average length of longest common subsequences", journal = j-J-ACM, volume = "56", number = "3", pages = "17:1--17:38", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516519", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It has long been known [Chv{\'a}tal and Sankoff 1975] that the average length of the longest common subsequence of two random strings of length $n$ over an alphabet of size $k$ is asymptotic to $ \gamma_k n$ for some constant $ \gamma_k$ depending on $k$. The value of these constants remains unknown, and a number of papers have proved upper and lower bounds on them. We discuss techniques, involving numerical calculations with recurrences on many variables, for determining lower and upper bounds on these constants. To our knowledge, the previous best-known lower and upper bounds for $ \gamma_2$ were those of Dan{\v{c}}{\'\i}k and Paterson, approximately 0.773911 and 0.837623 [Dan{\v{c}}{\'\i}k 1994; Dan{\v{c}}{\'\i}k and Paterson 1995]. We improve these to 0.788071 and 0.826280. This upper bound is less than the $ \gamma_2$ given by Steele's old conjecture (see Steele [1997, page 3]) that $ \gamma_2 = 2 / (1 + \sqrt 2) \approx 0.828427$. (As Steele points out, experimental evidence had already suggested that this conjectured value was too high.) Finally, we show that the upper bound technique described here could be used to produce, for any $k$, a sequence of upper bounds converging to $ \gamma_k$, though the computation time grows very quickly as better bounds are guaranteed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Arratia-Steele conjecture; average-case analysis; dynamic programming; Longest common subsequences", } @Article{Stefankovic:2009:ASA, author = "Daniel {\v{S}}tefankovi{\v{c}} and Santosh Vempala and Eric Vigoda", title = "Adaptive simulated annealing: a near-optimal connection between sampling and counting", journal = j-J-ACM, volume = "56", number = "3", pages = "18:1--18:36", month = may, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1516512.1516520", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri May 15 14:56:06 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our work is to approximating the partition function $Z$ of a discrete system, such as the Ising model, matchings or colorings of a graph. The typical approach to estimating the partition function $ Z(\beta^*)$ at some desired inverse temperature $ \beta^*$ is to define a sequence, which we call a {\em cooling schedule}, $ \beta_0 = 0$.\par For well-studied problems such as estimating the partition function of the Ising model, or approximating the number of colorings or matchings of a graph, our cooling schedule is of length $ O^*(\sqrt n)$, which implies an overall savings of $ O^(n)$ in the running time of the approximate counting algorithm (since roughly $ \ell $ samples are needed to estimate each ratio).\par A similar improvement in the length of the cooling schedule was recently obtained by Lov{\'a}sz and Vempala in the context of estimating the volume of convex bodies. While our reduction is inspired by theirs, the discrete analogue of their result turns out to be significantly more difficult. Whereas a fixed schedule suffices in their setting, we prove that in the discrete setting we need an adaptive schedule, that is, the schedule depends on $Z$. More precisely, we prove any nonadaptive cooling schedule has length at least $ O^*(\ln A)$, and we present an algorithm to find an adaptive schedule of length $ O^*(\sqrt {\ln A})$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Counting; Markov chain Monte Carlo; simulated annealing", } @Article{Khandekar:2009:GPU, author = "Rohit Khandekar and Satish Rao and Umesh Vazirani", title = "Graph partitioning using single commodity flows", journal = j-J-ACM, volume = "56", number = "4", pages = "19:1--19:15", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538903", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that the sparsest cut in graphs with $n$ vertices and $m$ edges can be approximated within $ O(\log^2 n)$ factor in $ \tilde {O}(m + n^{3 / 2})$ time using polylogarithmic single commodity max-flow computations. Previous algorithms are based on multicommodity flows that take time $ \tilde {O}(m + n^2)$. Our algorithm iteratively employs max-flow computations to embed an expander flow, thus providing a certificate of expansion. Our technique can also be extended to yield an $ O(\log^2 n)$-(pseudo-) approximation algorithm for the edge-separator problem with a similar running time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Edge-separator; single commodity max-flow; sparse cut; spectral method", } @Article{Guruswami:2009:UER, author = "Venkatesan Guruswami and Christopher Umans and Salil Vadhan", title = "Unbalanced expanders and randomness extractors from {Parvaresh--Vardy} codes", journal = j-J-ACM, volume = "56", number = "4", pages = "20:1--20:34", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538904", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma et al. [2007] required at least one of these to be quasipolynomial in the optimal. Our expanders have a short and self-contained description and analysis, based on the ideas underlying the recent list-decodable error-correcting codes of Parvaresh and Vardy [2005].\par Our expanders can be interpreted as near-optimal ``randomness condensers,'' that reduce the task of extracting randomness from sources of arbitrary min-entropy rate to extracting randomness from sources of min-entropy rate arbitrarily close to 1, which is a much easier task. Using this connection, we obtain a new, self-contained construction of randomness extractors that is optimal up to constant factors, while being much simpler than the previous construction of Lu et al. [2003] and improving upon it when the error parameter is small (e.g., 1/poly(n)).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "condensers; error-correcting codes; Expander graphs; list decoding; randomness extractors", } @Article{Achlioptas:2009:BTS, author = "Dimitris Achlioptas and Aaron Clauset and David Kempe and Cristopher Moore", title = "On the bias of traceroute sampling: {Or}, power-law degree distributions in regular graphs", journal = j-J-ACM, volume = "56", number = "4", pages = "21:1--21:28", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538905", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining this graph structure can be a surprisingly difficult task, as edges cannot be explicitly queried. For instance, empirical studies of the network of Internet Protocol (IP) addresses typically rely on indirect methods like {\em traceroute\/} to build what are approximately single-source, all-destinations, shortest-path trees. These trees only sample a fraction of the network's edges, and a paper by Lakhina et al. [2003] found empirically that the resulting sample is intrinsically biased. Further, in simulations, they observed that the degree distribution under traceroute sampling exhibits a power law even when the underlying degree distribution is Poisson.\par In this article, we study the bias of traceroute sampling mathematically and, for a very general class of underlying degree distributions, explicitly calculate the distribution that will be observed. As example applications of our machinery, we prove that traceroute sampling finds power-law degree distributions in both $ \delta $-regular and Poisson-distributed random graphs. Thus, our work puts the observations of Lakhina et al. on a rigorous footing, and extends them to nearly arbitrary degree distributions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Internet topology; sampling bias; traceroute", } @Article{Leyton-Brown:2009:EHM, author = "Kevin Leyton-Brown and Eugene Nudelman and Yoav Shoham", title = "Empirical hardness models: {Methodology} and a case study on combinatorial auctions", journal = j-J-ACM, volume = "56", number = "4", pages = "22:1--22:52", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538906", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Is it possible to predict how long an algorithm will take to solve a previously-unseen instance of an NP-complete problem? If so, what uses can be found for models that make such predictions? This article provides answers to these questions and evaluates the answers experimentally.\par We propose the use of supervised machine learning to build models that predict an algorithm's runtime given a problem instance. We discuss the construction of these models and describe techniques for interpreting them to gain understanding of the characteristics that cause instances to be hard or easy. We also present two applications of our models: building algorithm portfolios that outperform their constituent algorithms, and generating test distributions that emphasize hard problems.\par We demonstrate the effectiveness of our techniques in a case study of the combinatorial auction winner determination problem. Our experimental results show that we can build very accurate models of an algorithm's running time, interpret our models, build an algorithm portfolio that strongly outperforms the best single algorithm, and tune a standard benchmark suite to generate much harder problem instances.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithm portfolios; combinatorial auctions; Empirical analysis of algorithms; runtime prediction", } @Article{Roughgarden:2009:QIC, author = "Tim Roughgarden and Mukund Sundararajan", title = "Quantifying inefficiency in cost-sharing mechanisms", journal = j-J-ACM, volume = "56", number = "4", pages = "23:1--23:33", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538907", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In a cost-sharing problem, several participants with unknown preferences vie to receive some good or service, and each possible outcome has a known cost. A cost-sharing mechanism is a protocol that decides which participants are allocated a good and at what prices. Three desirable properties of a cost-sharing mechanism are: incentive-compatibility, meaning that participants are motivated to bid their true private value for receiving the good; budget-balance, meaning that the mechanism recovers its incurred cost with the prices charged; and economic efficiency, meaning that the cost incurred and the value to the participants are traded off in an optimal way. These three goals have been known to be mutually incompatible for thirty years. Nearly all the work on cost-sharing mechanism design by the economics and computer science communities has focused on achieving two of these goals while completely ignoring the third.\par We introduce novel measures for quantifying efficiency loss in cost-sharing mechanisms and prove simultaneous approximate budget-balance and approximate efficiency guarantees for mechanisms for a wide range of cost-sharing problems, including all submodular and Steiner tree problems. Our key technical tool is an exact characterization of worst-case efficiency loss in Moulin mechanisms, the dominant paradigm in cost-sharing mechanism design.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "cost sharing; inefficiency; Mechanism design; Steiner tree; submodular functions", } @Article{Attiya:2009:COF, author = "Hagit Attiya and Rachid Guerraoui and Danny Hendler and Petr Kuznetsov", title = "The complexity of obstruction-free implementations", journal = j-J-ACM, volume = "56", number = "4", pages = "24:1--24:24", month = jun, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1538902.1538908", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jul 2 12:21:01 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "{\em Obstruction-free\/} implementations of concurrent objects are optimized for the common case where there is no {\em step contention}, and were recently advocated as a solution to the costs associated with synchronization without locks. In this article, we study this claim and this goes through precisely defining the notions of obstruction-freedom and step contention. We consider several classes of obstruction-free implementations, present corresponding generic object implementations, and prove lower bounds on their complexity. Viewed collectively, our results establish that the worst-case operation time complexity of obstruction-free implementations is high, even in the absence of step contention. We also show that lock-based implementations are not subject to some of the time-complexity lower bounds we present.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "lower bounds; memory contention; perturbable objects; Shared memory; solo-fast implementations; step contention", } @Article{Fomin:2009:MCA, author = "Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch", title = "A measure \& conquer approach for the analysis of exact algorithms", journal = j-J-ACM, volume = "56", number = "5", pages = "25:1--25:32", month = aug, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1552285.1552286", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Aug 20 13:54:33 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "For more than 40 years, Branch \& Reduce exponential-time backtracking algorithms have been among the most common tools used for finding exact solutions of NP-hard problems. Despite that, the way to analyze such recursive algorithms is still far from producing tight worst-case running time bounds. Motivated by this, we use an approach, that we call ``Measure \& Conquer'', as an attempt to step beyond such limitations. The approach is based on the careful design of a nonstandard measure of the subproblem size; this measure is then used to lower bound the progress made by the algorithm at each branching step. The idea is that a smarter measure may capture behaviors of the algorithm that a standard measure might not be able to exploit, and hence lead to a significantly better worst-case time analysis.\par In order to show the potentialities of Measure \& Conquer, we consider two well-studied NP-hard problems: minimum dominating set and maximum independent set. For the first problem, we consider the current best algorithm, and prove (thanks to a better measure) a much tighter running time bound for it. For the second problem, we describe a new, simple algorithm, and show that its running time is competitive with the current best time bounds, achieved with far more complicated algorithms (and standard analysis).\par Our examples show that a good choice of the measure, made in the very first stages of exact algorithms design, can have a tremendous impact on the running time bounds achievable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Dominating set; exact algorithm; independent set", } @Article{Chadha:2009:ECR, author = "Rohit Chadha and A. Prasad Sistla and Mahesh Viswanathan", title = "On the expressiveness and complexity of randomization in finite state monitors", journal = j-J-ACM, volume = "56", number = "5", pages = "26:1--26:44", month = aug, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1552285.1552287", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Aug 20 13:54:33 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we introduce the model of {\em finite state probabilistic monitors\/} (FPM), which are finite state automata on infinite strings that have probabilistic transitions and an absorbing reject state. FPMs are a natural automata model that can be seen as either randomized run-time monitoring algorithms or as models of open, probabilistic reactive systems that can fail. We give a number of results that characterize, topologically as well as with respect to their computational power, the sets of languages recognized by FPMs. We also study the emptiness and universality problems for such automata and give exact complexity bounds for these problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Omega automata; probabilistic automata; randomization; runtime verification; topology", } @Article{Bilardi:2009:AIR, author = "Gianfranco Bilardi and Kattamuri Ekanadham and Pratap Pattnaik", title = "On approximating the ideal random access machine by physical machines", journal = j-J-ACM, volume = "56", number = "5", pages = "27:1--27:57", month = aug, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1552285.1552288", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Aug 20 13:54:33 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The capability of the {\em Random Access Machine\/} (RAM) to execute any instruction in constant time is not realizable, due to fundamental physical constraints on the minimum size of devices and on the maximum speed of signals. This work explores how well the ideal RAM performance can be approximated, for significant classes of computations, by machines whose building blocks have constant size and are connected at a constant distance.\par A novel memory structure is proposed, which is {\em pipelined\/} (can accept a new request at each cycle) and {\em hierarchical}, exhibiting optimal latency $ a(x) = O(x^{1 / d}) $ to address $x$, in $d$-dimensional realizations.\par In spite of block-transfer or other memory-pipeline capabilities, a number of previous machine models do not achieve a full overlap of memory accesses. These are examples of machines with {\em explicit data movement}. It is shown that there are {\em direct-flow\/} computations (without branches and indirect accesses) that require time superlinear in the number of instructions, on all such machines.\par To circumvent the explicit-data-movement constraints, the {\em Speculative Prefetcher\/} (SP) and the {\em Speculative Prefetcher and Evaluator\/} (SPE) processors are developed. Both processors can execute any {\em direct-flow\/} program in linear time. The SPE also executes in linear time a class of loop programs that includes many significant algorithms. Even quicksort, a somewhat irregular, recursive algorithm admits a linear-time SPE implementation. A relation between instructions called {\em address dependence\/} is introduced, which limits memory-access overlap and can lead to superlinear time, as illustrated with the classical merging algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Physical constraints on machines; pipelined hierarchical memory; speculative processors", } @Article{Kumar:2009:UAS, author = "V. S. Anil Kumar and Madhav V. Marathe and Srinivasan Parthasarathy and Aravind Srinivasan", title = "A unified approach to scheduling on unrelated parallel machines", journal = j-J-ACM, volume = "56", number = "5", pages = "28:1--28:31", month = aug, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1552285.1552289", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Aug 20 13:54:33 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. This algorithm leads to the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan {\em simultaneously\/} exhibit the current-best individual approximations for these criteria; (ii) better-than-two approximation guarantees for scheduling to minimize the {\em L$_p$ \/} norm of the vector of machine-loads, for all 1", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Approximation algorithms; randomized rounding; scheduling under multiple criteria", } @Article{Libkin:2009:IPS, author = "Leonid Libkin and Victor Vianu", title = "Introduction to {PODS 2007} special section", journal = j-J-ACM, volume = "56", number = "6", pages = "29:1--29:1", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568319", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2009:GHD, author = "Georg Gottlob and Zolt{\'a}n Mikl{\'o}s and Thomas Schwentick", title = "Generalized hypertree decompositions: {NP}-hardness and tractable variants", journal = j-J-ACM, volume = "56", number = "6", pages = "30:1--30:32", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568320", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The generalized hypertree width GHW($H$) of a hypergraph $H$ is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However, it has been an open problem for several years if for a fixed constant $k$ and input hypergraph $H$ it can be determined in polynomial time whether GHW($H$) $ \leq k$. Here, this problem is settled by proving that even for $ k = 3$ the problem is already NP-hard. On the way to this result, another long standing open problem, originally raised by Goodman and Shmueli [1984] in the context of join optimization is solved. It is proven that determining whether a hypergraph $H$ admits a tree projection with respect to a hypergraph $G$ is NP-complete. Our intractability results on generalized hypertree width motivate further research on more restrictive tractable hypergraph decomposition methods that approximate generalized hypertree decomposition (GHD). We show that each such method is dominated by a tractable decomposition method definable through a function that associates a set of partial edges to a hypergraph. By using one particular such function, we define the new Component Hypertree Decomposition method, which is tractable and strictly more general than other approximations to GHD published so far.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "acyclic; Conjunctive query; hypergraph; hypertree decomposition; NP-complete; tractable; TreeProjection Problem", } @Article{tenCate:2009:CQC, author = "Balder ten Cate and Carsten Lutz", title = "The complexity of query containment in expressive fragments of {XPath 2.0}", journal = j-J-ACM, volume = "56", number = "6", pages = "31:1--31:48", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568321", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "XPath is a prominent W3C standard for navigating XML documents that has stimulated a lot of research into query answering and static analysis. In particular, query containment has been studied extensively for fragments of the 1.0 version of this standard, whereas little is known about query containment in (fragments of) the richer language XPath 2.0. In this article, we consider extensions of CoreXPath, the navigational core of XPath 1.0, with operators that are part of or inspired by XPath 2.0: path intersection, path equality, path complementation, for-loops, and transitive closure. For each combination of these operators, we determine the complexity of query containment, both with and without DTDs. It turns out to range from ExpTime (for extensions with path equality) and 2-ExpTime (for extensions with path intersection) to non-elementary (for extensions with path complementation or for-loops). In almost all cases, adding transitive closure on top has no further impact on the complexity. We also investigate the effect of dropping the upward and/or sibling axes, and show that this sometimes leads to a reduction in complexity. Since the languages we study include negation and conjunction in filters, our complexity results can equivalently be stated in terms of satisfiability. We also analyze the above languages in terms of succinctness.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "complexity; containment; satisfiability; XML; XPath", } @Article{Kleinberg:2009:TEU, author = "Jon Kleinberg and Aleksandrs Slivkins and Tom Wexler", title = "Triangulation and embedding using small sets of beacons", journal = j-J-ACM, volume = "56", number = "6", pages = "32:1--32:37", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568322", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by node-to-node latencies in the Internet, resulting in a number of recent approaches that approximately embed this distance matrix into low-dimensional Euclidean space. There is a fundamental distinction, however, between the theoretical approaches to the embedding problem and this recent Internet-related work: in addition to computational limitations, Internet measurement algorithms operate under the constraint that it is only feasible to measure distances for a linear (or near-linear) number of node pairs, and typically in a highly structured way. Indeed, the most common framework for Internet measurements of this type is a {\em beacon-based approach\/} one chooses uniformly at random a constant number of nodes (``beacons'') in the network, each node measures its distance to all beacons, and one then has access to only these measurements for the remainder of the algorithm. Moreover, beacon-based algorithms are often designed not for embedding but for the more basic problem of {\em triangulation}, in which one uses the triangle inequality to infer the distances that have not been measured.\par Here we give algorithms with provable performance guarantees for beacon-based triangulation and embedding. We show that in addition to multiplicative error in the distances, performance guarantees for beacon-based algorithms typically must include a notion of {\em slack\/} --- a certain fraction of all distances may be arbitrarily distorted. For metric spaces of bounded doubling dimension (which have been proposed as a reasonable abstraction of Internet latencies), we show that triangulation-based distance reconstruction with a constant number of beacons can achieve multiplicative error $ 1 + \delta $ on a $ 1 - \epsilon $ fraction of distances, for arbitrarily small constants $ \delta $ and $ \epsilon $. For this same class of metric spaces, we give a beacon-based embedding algorithm that achieves constant distortion on a $ 1 - \epsilon $ fraction of distances; this provides some theoretical justification for the success of the recent Global Network Positioning algorithm of Ng and Zhang [2002], and it forms an interesting contrast with lower bounds showing that it is not possible to embed {\em all\/} distances in a doubling metric space with constant distortion. We also give results for other classes of metric spaces, as well as distributed algorithms that require only a sparse set of distances but do not place too much measurement load on any one node.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Distributed algorithms; doubling dimension; embeddings; metric spaces; triangulation", } @Article{Jain:2009:PQR, author = "Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen", title = "A property of quantum relative entropy with an application to privacy in quantum communication", journal = j-J-ACM, volume = "56", number = "6", pages = "33:1--33:32", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568323", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove the following information-theoretic property about quantum states.\par {\em Substate theorem:\/} Let $ \rho $ and $ \sigma $ be quantum states in the same Hilbert space with relative entropy $ S(\rho || \sigma) : T r \rho (\log \rho - \log \sigma) = c $. Then for all $ \epsilon > 0 $, there is a state $ \rho \prime $ such that the trace distance $ || \rho \prime - \rho ||_{\rm tr} : T r \sqrt (\rho \prime - \rho)^2 \leq \epsilon $, and $ \rho \prime / 2^{O(c / \epsilon 2)} \leq \sigma $.\par It states that if the relative entropy of $ \rho $ and $ \sigma $ is small, then there is a state $ \rho \prime $ close to $ \rho $, i.e. with small trace distance $ || \rho \prime - \rho ||_{\rm tr} $, that when scaled down by a factor $ 2^{O(c)} $ `sits inside', or becomes a `substate' of, $ \sigma $. This result has several applications in quantum communication complexity and cryptography. Using the substate theorem, we derive a privacy trade-off for the {\em set membership problem\/} in the two-party quantum communication model. Here Alice is given a subset $ A \subseteq [n] $, Bob an input $ i \in [n] $, and they need to determine if $ i \in A $.\par {\em Privacy trade-off for set membership:\/} In any two-party quantum communication protocol for the set membership problem, if Bob reveals only $k$ bits of information about his input, then Alice must reveal at least $ n / 2^{O(k)}$ bits of information about her input.\par We also discuss relationships between various information theoretic quantities that arise naturally in the context of the substate theorem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Privacy; quantum communication complexity; quantum information theory", } @Article{Regev:2009:LLE, author = "Oded Regev", title = "On lattices, learning with errors, random linear codes, and cryptography", journal = j-J-ACM, volume = "56", number = "6", pages = "34:1--34:40", month = sep, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1568318.1568324", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 4 13:33:31 MDT 2009", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Our main result is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ``learning from parity with error'' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a {\em quantum\/} algorithm for GapSVP and SIVP. A main open question is whether this reduction can be made classical (i.e., nonquantum).\par We also present a (classical) public-key cryptosystem whose security is based on the hardness of the learning problem. By the main result, its security is also based on the worst-case quantum hardness of GapSVP and SIVP. The new cryptosystem is much more efficient than previous lattice-based cryptosystems: the public key is of size $ \tilde {O}(n^2) $ and encrypting a message increases its size by a factor of $ \tilde {O}(n) $ (in previous cryptosystems these values are $ \tilde {O}(n^4) $ and $ \tilde {O}(n^2) $, respectively). In fact, under the assumption that all parties share a random bit string of length $ \tilde {O}(n^2) $, the size of the public key can be reduced to $ \tilde {O}(n) $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "average-case hardness; cryptography; Lattice; public key encryption; quantum computation", } @Article{Arya:2009:STT, author = "Sunil Arya and Theocharis Malamatos and David M. Mount", title = "Space-time tradeoffs for approximate nearest neighbor searching", journal = j-J-ACM, volume = "57", number = "1", pages = "1:1--1:54", month = nov, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1613676.1613677", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:08 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Nearest neighbor searching is the problem of preprocessing a set of $n$-point points in $d$-dimensional space so that, given any query point $q$, it is possible to report the closest point to $q$ rapidly. In approximate nearest neighbor searching, a parameter $ \epsilon > 0$ is given, and a multiplicative error of $ (1 + \epsilon)$ is allowed. We assume that the dimension $d$ is a constant and treat $n$ and $ \epsilon $ as asymptotic quantities. Numerous solutions have been proposed, ranging from low-space solutions having space $ O(n)$ and query time $ O(\log n + 1 / \epsilon^{d - 1})$ to high-space solutions having space roughly $ O(n \log n) / \epsilon^d$ and query time $ O(\log (n / \epsilon))$.\par We show that there is a single approach to this fundamental problem, which both improves upon existing results and spans the spectrum of space-time tradeoffs. Given a tradeoff parameter $ \gamma $, where $ 2 \leq \gamma \leq 1 / \epsilon $, we show that there exists a data structure of space $ O(n \gamma^{d - 1} \log (1 / \epsilon))$ that can answer queries in time $ O(\log (n \gamma) + 1 / (\epsilon \gamma)^{d - 1 / 2})$. When $ \gamma = 2$, this yields a data structure of space $ O(n \log (1 / \epsilon))$ that can answer queries in time $ O(\log (n + 1 / \epsilon^{(d - 1) / 2}))$. When $ \gamma = 1 / \epsilon $, it provides a data structure of space $ O((n / \epsilon^{(d - 1)}) \log (1 / \epsilon))$ that can answer queries in time $ O (\log (n / \epsilon))$.\par Our results are based on a data structure called a $ (t, \epsilon)$-AVD, which is a hierarchical quadtree-based subdivision of space into cells. Each cell stores up to $t$ representative points of the set, such that for any query point $q$ in the cell at least one of these points is an approximate nearest neighbor of $q$. We provide new algorithms for constructing AVDs and tools for analyzing their total space requirements. We also establish lower bounds on the space complexity of AVDs, and show that, up to a factor of $ O (\log (1 / \epsilon))$, our space bounds are asymptotically tight in the two extremes, $ \gamma = 2$ and $ \gamma = 1 / \epsilon $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Nearest neighbor searching; space-time tradeoffs", } @Article{Ezra:2009:UFT, author = "Esther Ezra and Micha Sharir", title = "On the union of fat tetrahedra in three dimensions", journal = j-J-ACM, volume = "57", number = "1", pages = "2:1--2:23", month = nov, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1613676.1613678", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:08 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that the combinatorial complexity of the union of $n$ ``fat'' tetrahedra in 3-space (i.e., tetrahedra all of whose solid angles are at least some fixed constant) of arbitrary sizes, is $ O(n^{2 + \epsilon })$, for any $ \epsilon > 0$;the bound is almost tight in the worst case, thus almost settling a conjecture of Pach et al. [2003]. Our result extends, in a significant way, the result of Pach et al. [2003] for the restricted case of {\em nearly congruent cubes}. The analysis uses cuttings, combined with the Dobkin-Kirkpatrick hierarchical decomposition of convex polytopes, in order to partition space into subcells, so that, on average, the overwhelming majority of the tetrahedra intersecting a subcell $ \Delta $ behave as fat {\em dihedral\/} wedges in $ \Delta $. As an immediate corollary, we obtain that the combinatorial complexity of the union of $n$ cubes in $ R^3$, having arbitrary side lengths, is $ O(n^{2 + \epsilon })$, for any $ \epsilon > 0$ (again, significantly extending the result of Pach et al. [2003]). Finally, our analysis can easily be extended to yield a nearly quadratic bound on the complexity of the union of arbitrarily oriented fat triangular prisms (whose cross-sections have arbitrary sizes) in $ R^3$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "(1 / r)-cuttings; curve-sensitive cuttings; hierarchical decomposition of convex polytopes; Union of simply-shaped bodies", } @Article{Katz:2009:ESA, author = "Jonathan Katz and Rafail Ostrovsky and Moti Yung", title = "Efficient and secure authenticated key exchange using weak passwords", journal = j-J-ACM, volume = "57", number = "1", pages = "3:1--3:39", month = nov, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1613676.1613679", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:08 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share {\em high-entropy\/} cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, {\em low-entropy\/} passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to {\em off-line dictionary attacks\/} in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one.\par We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie--Hellman assumption. The protocol assumes only public parameters --- specifically, a ``common reference string'' --- which can be ``hard-coded'' into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does {\em not\/} require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than ``classical'' Diffie--Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both {\em practical\/} and {\em provably-secure using standard cryptographic assumptions}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Authentication; cryptography; passwords", } @Article{Ferragina:2009:CIL, author = "Paolo Ferragina and Fabrizio Luccio and Giovanni Manzini and S. Muthukrishnan", title = "Compressing and indexing labeled trees, with applications", journal = j-J-ACM, volume = "57", number = "1", pages = "4:1--4:33", month = nov, year = "2009", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1613676.1613680", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:08 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Consider an ordered, static tree $T$ where each node has a label from alphabet $ \Sigma $. Tree $T$ may be of arbitrary degree and shape. Our goal is designing a compressed storage scheme of $T$ that supports basic {\em navigational\/} operations among the immediate neighbors of a node (i.e. parent, {\em i\/} th child, or any child with some label,\ldots{}) as well as more sophisticated {\em path\/}-based search operations over its labeled structure.\par We present a novel approach to this problem by designing what we call the XBW-transform of the tree in the spirit of the well-known Burrows--Wheeler transform for strings [1994]. The XBW-transform uses path-sorting to linearize the labeled tree $T$ into {\em two\/} coordinated arrays, one capturing the structure and the other the labels. For the first time, by using the properties of the XBW-transform, our compressed indexes go beyond the information-theoretic lower bound, and support navigational and path-search operations over labeled trees within (near-)optimal time bounds and entropy-bounded space.\par Our XBW-transform is simple and likely to spur new results in the theory of tree compression and indexing, as well as interesting application contexts. As an example, we use the XBW-transform to design and implement a compressed index for XML documents whose compression ratio is significantly better than the one achievable by state-of-the-art tools, and its query time performance is order of magnitudes faster.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Burrows--Wheeler transform; labeled tree compression; labeled tree indexing; path searching; tree navigation; XML compression; XML indexing", } @Article{Kumar:2010:LTA, author = "Amit Kumar and Yogish Sabharwal and Sandeep Sen", title = "Linear-time approximation schemes for clustering problems in any dimensions", journal = j-J-ACM, volume = "57", number = "2", pages = "5:1--5:32", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667054", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our approach leads to simple randomized algorithms for the $k$-means, $k$-median and discrete $k$-means problems that yield $ (1 + \epsilon)$ approximations with probability $ \geq 1 / 2$ and running times of $ O(2^{(k / \epsilon) O(1)} d n)$. These are the first algorithms for these problems whose running times are linear in the size of the input ($ n d$ for $n$ points in $d$ dimensions) assuming $k$ and $ \epsilon $ are fixed. Our method is general enough to be applicable to clustering problems satisfying certain simple properties and is likely to have further applications.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "$k$-means; $k$-medians; approximation; Clustering", } @Article{Gottlob:2010:SMD, author = "Georg Gottlob and Pierre Senellart", title = "Schema mapping discovery from data instances", journal = j-J-ACM, volume = "57", number = "2", pages = "6:1--6:37", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667055", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of {\em data exchange}. We formalize the problem of understanding the relationship between two instances as that of obtaining a schema mapping so that a {\em minimum repair\/} of this mapping provides a perfect description of the target instance given the source instance. We show that this definition yields ``intuitive'' results when applied on database instances derived from each other by basic operations. We study the complexity of decision problems related to this optimality notion in the context of different logical languages and show that, even in very restricted cases, the problem is of high complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "complexity; data exchange; instance; match; Schema mapping", } @Article{Blei:2010:NCR, author = "David M. Blei and Thomas L. Griffiths and Michael I. Jordan", title = "The nested {Chinese} restaurant process and {Bayesian} nonparametric inference of topic hierarchies", journal = j-J-ACM, volume = "57", number = "2", pages = "7:1--7:30", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667056", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present the nested Chinese restaurant process (nCRP), a stochastic process that assigns probability distributions to ensembles of infinitely deep, infinitely branching trees. We show how this stochastic process can be used as a prior distribution in a Bayesian nonparametric model of document collections. Specifically, we present an application to information retrieval in which documents are modeled as paths down a random tree, and the preferential attachment dynamics of the nCRP leads to clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a posterior distribution over trees, topics and allocations of words to levels of the tree. We demonstrate this algorithm on collections of scientific abstracts from several journals. This model exemplifies a recent trend in statistical machine learning --- the use of Bayesian nonparametric methods to infer distributions on flexible data structures.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Bayesian nonparametric statistics; unsupervised learning", } @Article{Lenzen:2010:TBC, author = "Christoph Lenzen and Thomas Locher and Roger Wattenhofer", title = "Tight bounds for clock synchronization", journal = j-J-ACM, volume = "57", number = "2", pages = "8:1--8:42", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667057", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a novel clock synchronization algorithm and prove tight upper and lower bounds on the worst-case clock skew that may occur between any two participants in any given distributed system. More importantly, the worst-case clock skew between neighboring nodes is (asymptotically) at most a factor of two larger than the best possible bound. While previous results solely focused on the dependency of the skew bounds on the network diameter, we prove that our techniques are optimal also with respect to the maximum clock drift, the uncertainty in message delays, and the imposed bounds on the clock rates. The presented results all hold in a general model where both the clock drifts and the message delays may vary arbitrarily within pre-specified bounds.\par Furthermore, our algorithm exhibits a number of other highly desirable properties. First, the algorithm ensures that the clock values remain in an affine linear envelope of real time. A better worst-case bound on the accuracy with respect to real time cannot be achieved in the absence of an external timer. Second, the algorithm minimizes the number and size of messages that need to be exchanged in a given time period. Moreover, only a small number of bits must be stored locally for each neighbor. Finally, our algorithm can easily be adapted for a variety of other prominent synchronization models.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Bounded rates; global skew; gradient property; local skew; variable clock drifts; worst-case analysis", } @Article{Bodirsky:2010:CTC, author = "Manuel Bodirsky and Jan K{\'a}ra", title = "The complexity of temporal constraint satisfaction problems", journal = j-J-ACM, volume = "57", number = "2", pages = "9:1--9:41", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667058", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A {\em temporal constraint language\/} is a set of relations that has a first-order definition in(Q;$<$), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint languages, then the CSP can be solved in polynomial time; otherwise, the CSP is NP-complete. Our proof combines model-theoretic concepts with techniques from universal algebra, and also applies the so-called product Ramsey theorem, which we believe will useful in similar contexts of constraint satisfaction complexity classification.\par An extended abstract of this article appeared in the proceedings of STOC'08.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "algorithms; complexity; constraints; Logic", } @Article{Fisher:2010:NDD, author = "Kathleen Fisher and Yitzhak Mandelbaum and David Walker", title = "The next 700 data description languages", journal = j-J-ACM, volume = "57", number = "2", pages = "10:1--10:51", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667059", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called {\em data description languages}. Such languages, which include pads, datascript, and packettypes, are designed to facilitate programming with {\em ad hoc data}, that is, data not in well-behaved relational or xml formats. In the calculus, each type describes the physical layout and semantic properties of a data source. In the semantics, we interpret types simultaneously as the in-memory representation of the data described and as parsers for the data source. The parsing functions are robust, automatically detecting and recording errors in the data stream without halting parsing. We show the parsers are type-correct, returning data whose type matches the simple-type interpretation of the specification. We also prove the parsers are ``error-correct,'' accurately reporting the number of physical and semantic errors that occur in the returned data. We use the calculus to describe the features of various data description languages, and we discuss how we have used the calculus to improve pads.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "ad hoc data formats; context-sensitive grammars; data description languages; data processing; data-dependent grammars; dependent types; domain-specific languages; PADS; Parsing", } @Article{Moser:2010:CPG, author = "Robin A. Moser and G{\'a}bor Tardos", title = "A constructive proof of the general {Lov{\'a}sz} local lemma", journal = j-J-ACM, volume = "57", number = "2", pages = "11:1--11:15", month = jan, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1667053.1667060", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Mar 15 11:20:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Lov{\'a}sz Local Lemma discovered by Erd{\H{o}}s and Lov{\'a}sz in 1975 is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In 1991, J{\'o}zsef Beck was the first to demonstrate that a constructive variant can be given under certain more restrictive conditions, starting a whole line of research aimed at improving his algorithm's performance and relaxing its restrictions. In the present article, we improve upon recent findings so as to provide a method for making almost all known applications of the general Local Lemma algorithmic.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Constructive proof; Lov{\'a} parallelization; sz local lemma", } @Article{Vianu:2010:EJS, author = "Victor Vianu", title = "Editorial: {JACM} at the start of a new decade", journal = j-J-ACM, volume = "57", number = "3", pages = "12:1--12:3", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706592", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Biswal:2010:EBS, author = "Punyashloka Biswal and James R. Lee and Satish Rao", title = "Eigenvalue bounds, spectral partitioning, and metrical deformations via flows", journal = j-J-ACM, volume = "57", number = "3", pages = "13:1--13:23", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706593", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a new method for upper bounding the second eigenvalue of the Laplacian of graphs. Our approach uses multi-commodity flows to deform the geometry of the graph; we embed the resulting metric into Euclidean space to recover a bound on the Rayleigh quotient. Using this, we show that every $n$-vertex graph of genus $g$ and maximum degree $D$ satisfies $ \lambda_2 (G) = O((g + 1)^3 D / n)$. This recovers the $ O(D / n)$ bound of Spielman and Teng for planar graphs, and compares to Kelner's bound of $ O((g + 1)p o l y(D) / n)$, but our proof does not make use of conformal mappings or circle packings. We are thus able to extend this to resolve positively a conjecture of Spielman and Teng, by proving that $ \lambda_2 (G) = O(D h^6 \log h / n)$ whenever $G$ is $ K_h$-minor free. This shows, in particular, that spectral partitioning can be used to recover $ O(\sqrt n)$-sized separators in bounded degree graphs that exclude a fixed minor. We extend this further by obtaining nearly optimal bounds on $ \lambda_2$ for graphs that exclude small-depth minors in the sense of Plotkin, Rao, and Smith. Consequently, we show that spectral algorithms find separators of sublinear size in a general class of geometric graphs.\par Moreover, while the standard ``sweep'' algorithm applied to the second eigenvector may fail to find good quotient cuts in graphs of unbounded degree, our approach produces a vector that works for {\em arbitrary\/} graphs. This yields an alternate proof of the well-known nonplanar separator theorem of Alon, Seymour, and Thomas that states that every excluded-minor family of graphs has $ O(\sqrt n)$-node balanced separators.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Metric embeddings; network flows; spectral graph theory", } @Article{Allender:2010:ALB, author = "Eric Allender and Michal Kouck{\'y}", title = "Amplifying lower bounds by means of self-reducibility", journal = j-J-ACM, volume = "57", number = "3", pages = "14:1--14:36", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706594", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We observe that many important computational problems in NC$^1$ share a simple self-reducibility property. We then show that, for any problem $A$ having this self-reducibility property, $A$ has polynomial-size TC$^0$ circuits if and only if it has TC$^0$ circuits of size $ n^{1 + \epsilon }$ for every $ \epsilon > 0$ (counting the number of wires in a circuit as the size of the circuit). As an example of what this observation yields, consider the Boolean Formula Evaluation problem (BFE), which is complete for NC$^1$ and has the self-reducibility property. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE requires depth $d$ TC$^0$ circuits of size $ n^{1 + \epsilon d}$. If one were able to improve this lower bound to show that there is some constant $ \epsilon > 0$ (independent of the depth $d$) such that every TC$^0$ circuit family recognizing BFE has size at least $ n^{1 + \epsilon }$, then it would follow that TC$^0 \neq $ NC$^1$. We show that proving lower bounds of the form $ n^{1 + \epsilon }$ is not ruled out by the Natural Proof framework of Razborov and Rudich and hence there is currently no known barrier for separating classes such as ACC$^0$, TC$^0$ and NC$^1$ via existing ``natural'' approaches to proving circuit lower bounds.\par We also show that problems with small uniform constant-depth circuits have algorithms that simultaneously have small space and time bounds. We then make use of known time-space tradeoff lower bounds to show that SAT requires uniform depth $d$ TC$^0$ and AC$^0$ [6] circuits of size $ n^{1 + c}$ for some constant $c$ depending on $d$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Circuit complexity; lower bounds; natural proofs; self-reducibility; time-space tradeoffs", } @Article{Shibuya:2010:GST, author = "Tetsuo Shibuya", title = "Geometric suffix tree: {Indexing} protein {$3$-D} structures", journal = j-J-ACM, volume = "57", number = "3", pages = "15:1--15:17", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706595", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate index data structures for such 3-D structures are highly desired for research on proteins. This article proposes a new data structure for indexing protein 3-D structures. For strings, there are many efficient indexing structures such as suffix trees, but it has been considered very difficult to design such sophisticated data structures against 3-D structures like proteins. Our index structure is based on the suffix tree and is called the geometric suffix tree. By using the geometric suffix tree for a set of protein structures, we can exactly search for all of their substructures whose RMSDs (root mean square deviations) or URMSDs (unit-vector root mean square deviations) to a given query 3-D structure are not larger than a given bound. Though there are $ O(N^2) $ substructures in a structure of size $N$, our data structure requires only $ O(N)$ space for indexing all the substructures. We propose an $ O(N^2)$ construction algorithm for it, while a naive algorithm would require $ O(N^3)$ time to construct it. Moreover we propose an efficient search algorithm. Experiments show that we can search for similar structures much faster than previous algorithms if the RMSD threshold is not larger than 1{\AA}. The experiments also show that the construction time of the geometric suffix tree is practically almost linear to the size of the database, when applied to a protein structure database.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "protein 3-D structure; root mean square deviation; Suffix tree", } @Article{Chan:2010:DDS, author = "Timothy M. Chan", title = "A dynamic data structure for {$3$-D} convex hulls and {$2$-D} nearest neighbor queries", journal = j-J-ACM, volume = "57", number = "3", pages = "16:1--16:15", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706596", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of $n$ points in three dimensions, where insertions take $ O(\log^3 n)$ expected amortized time, deletions take $ O(\log^6 n)$ expected amortized time, and extreme-point queries take $ O(\log^2 n)$ worst-case time. This is the first method that guarantees polylogarithmic update and query cost for arbitrary sequences of insertions and deletions, and improves the previous $ O(n^{\epsilon })$-time method by Agarwal and Matou{\v{s}}ek a decade ago. As a consequence, we obtain similar results for nearest neighbor queries in two dimensions and improved results for numerous fundamental geometric problems (such as levels in three dimensions and dynamic Euclidean minimum spanning trees in the plane).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Computational geometry; convex hulls; dynamic data structures; nearest neighbor search", } @Article{Nivasch:2010:IBN, author = "Gabriel Nivasch", title = "Improved bounds and new techniques for {Davenport--Schinzel} sequences and their generalizations", journal = j-J-ACM, volume = "57", number = "3", pages = "17:1--17:44", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706597", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present several new results regarding $ \lambda_s(n) $, the maximum length of a Davenport--Schinzel sequence of order $s$ on $n$ distinct symbols.\par First, we prove that $ \lambda_s(n) \leq n \cdot 2^{(1 / t!) \alpha (n) t} + O(\alpha (n)^{t - 1})$ for $ s \geq 4$ even, and $ \lambda_s(n) \leq n \cdot 2^{(1 / t!) \alpha (n) t} \log_2 \alpha (n) + O(\alpha (n)^t)$ for $ s \geq 3$ odd, where $ t = \lfloor (s - 2) / 2 \rfloor $, and $ \alpha (n)$ denotes the inverse Ackermann function. The previous upper bounds, by Agarwal et al. [1989], had a leading coefficient of $1$ instead of $ 1 / t!$ in the exponent. The bounds for even $s$ are now tight up to lower-order terms in the exponent. These new bounds result from a small improvement on the technique of Agarwal et al.\par More importantly, we also present a new technique for deriving upper bounds for $ \lambda_s(n)$. This new technique is very similar to the one we applied to the problem of stabbing interval chains [Alon et al. 2008]. With this new technique we: (1) re-derive the upper bound of $ \lambda_3 (n) \leq 2 n \alpha (n) + O(n \sqrt \alpha (n))$ (first shown by Klazar [1999]); (2) re-derive our own new upper bounds for general $s$ and (3) obtain improved upper bounds for the generalized Davenport--Schinzel sequences considered by Adamec et al. [1992].\par Regarding lower bounds, we show that $ \lambda_3 (n) \geq 2 n \alpha (n) - O(n)$ (the previous lower bound (Sharir and Agarwal, 1995) had a coefficient of $ 1 / 2$), so the coefficient $2$ is tight. We also present a simpler variant of the construction of Agarwal et al. [1989] that achieves the known lower bounds of $ \lambda_s(n) \geq n \cdot 2^{(1 / t!)} \alpha (n) t - O(\alpha (n)^{t - 1})$ for $ s \geq 4$ even.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Davenport--Schinzel sequence; inverse Ackermann function; lower envelope", } @Article{TenCate:2010:TCL, author = "Balder {Ten Cate} and Luc Segoufin", title = "Transitive closure logic, and nested tree walking automata, and {Xpath}", journal = j-J-ACM, volume = "57", number = "3", pages = "18:1--18:41", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706598", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study FO(MTC), first-order logic with monadic transitive closure, a logical formalism in between FO and MSO on trees. We characterize the expressive power of FO(MTC) in terms of nested tree-walking automata. Using the latter, we show that FO(MTC) is strictly less expressive than MSO, solving an open problem. We also present a temporal logic on trees that is expressively complete for FO(MTC), in the form of an extension of the XML document navigation language XPath with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operator, allowing one to restrict attention to a specific subtree while evaluating a subexpression. We show that the expressive power of this XPath dialect equals that of FO(MTC) for Boolean, unary and binary queries. We also investigate the complexity of the automata model as well as the XPath dialect. We show that query evaluation be done in polynomial time (combined complexity), but that emptiness (or, satisfiability) is 2ExpTime-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Transitive closure logic; tree automata; XPath", } @Article{Balcan:2010:DMS, author = "Maria-Florina Balcan and Avrim Blum", title = "A discriminative model for semi-supervised learning", journal = j-J-ACM, volume = "57", number = "3", pages = "19:1--19:46", month = mar, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1706591.1706599", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Mar 25 09:08:48 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Supervised learning --- that is, learning from labeled examples --- is an area of Machine Learning that has reached substantial maturity. It has generated general-purpose and practically successful algorithms and the foundations are quite well understood and captured by theoretical frameworks such as the PAC-learning model and the Statistical Learning theory framework. However, for many contemporary practical problems such as classifying web pages or detecting spam, there is often additional information available in the form of {\em unlabeled\/} data, which is often much cheaper and more plentiful than labeled data. As a consequence, there has recently been substantial interest in {\em semi-supervised\/} learning --- using unlabeled data together with labeled data --- since any useful information that reduces the amount of labeled data needed can be a significant benefit. Several techniques have been developed for doing this, along with experimental results on a variety of different learning problems. Unfortunately, the standard learning frameworks for reasoning about supervised learning do not capture the key aspects and the assumptions underlying these {\em semi\/}-supervised learning methods.\par In this article, we describe an augmented version of the PAC model designed for semi-supervised learning, that can be used to reason about many of the different approaches taken over the past decade in the Machine Learning community. This model provides a unified framework for analyzing when and why unlabeled data can help, in which one can analyze both sample-complexity and algorithmic issues. The model can be viewed as an extension of the standard PAC model where, in addition to a concept class $C$, one also proposes a compatibility notion: a type of compatibility that one believes the target concept should have with the underlying distribution of data. Unlabeled data is then potentially helpful in this setting because it allows one to estimate compatibility over the space of hypotheses, and to reduce the size of the search space from the whole set of hypotheses $C$ down to those that, according to one's assumptions, are a-priori reasonable with respect to the distribution. As we show, many of the assumptions underlying existing semi-supervised learning algorithms can be formulated in this framework.\par After proposing the model, we then analyze sample-complexity issues in this setting: that is, how much of each type of data one should expect to need in order to learn well, and what the key quantities are that these numbers depend on. We also consider the algorithmic question of how to efficiently optimize for natural classes and compatibility notions, and provide several algorithmic results including an improved bound for Co-Training with linear separators when the distribution satisfies independence given the label.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "co-training; cover bounds; data dependent SRM; efficient learning algorithms; Machine learning; multi-view classification; sample complexity; semi-supervised learning; structural risk minimization (SRM); uniform convergence bounds; value of unlabeled data", } @Article{Barak:2010:SIN, author = "B. Barak and G. Kindler and R. Shaltiel and B. Sudakov and A. Wigderson", title = "Simulating independence: {New} constructions of condensers, {Ramsey} graphs, dispersers, and extractors", journal = j-J-ACM, volume = "57", number = "4", pages = "20:1--20:52", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734214", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present new explicit constructions of {\em deterministic\/} randomness extractors, dispersers and related objects. We say that a distribution $X$ on binary strings of length $n$ is a $ \delta $-source if $X$ assigns probability at most $ 2^{- \delta n}$ to any string of length $n$. For every $ \delta > 0$, we construct the following $ \poly (n)$-time computable functions:\par {\em 2-source disperser:\/} $ D : (\{ 0, 1 \}^n)^2 \rightarrow \{ 0, 1 \} $ such that for any two independent $ \delta $-sources $ X_1$, $ X_2$ we have that the support of $ D(X_1, X_2)$ is $ \{ 0, 1 \} $.\par {\em Bipartite Ramsey graph:\/} Let $ n = 2^n$. A corollary is that the function $D$ is a 2-coloring of the edges of $ K_{N, N}$ (the complete bipartite graph over two sets of $n$ vertices) such that any induced subgraph of size $ n^\delta $ by $ N^\delta $ is not monochromatic.\par {\em 3-source extractor:\/} $ E : (\{ 0, 1 \}^n)^3 \rightarrow \{ 0, 1 \} $ such that for any three independent $ \delta $-sources $ X_1$, $ X_2$, $ X_3$ we have that $ E(X_1, X_2, X_3)$ is $ o(1)$-close to being an unbiased random bit.\par No previous explicit construction was known for either of these for any $ \delta $.\par A component in these results is a new construction of condensers that may be of independent interest: This is a function $ C : \{ 0, 1 \}^n \rightarrow (\{ 0, 1 \}^{n / c})^d$ (where $c$ and $d$ are constants that depend only on $ \delta $) such that for every $ \delta $-source $X$ one of the output blocks of $ C(X)$ is (exponentially close to) a 0.9-source. (This result was obtained independently by Ran Raz.)\par The constructions are quite involved and use as building blocks other new and known objects. A recurring theme in these constructions is that objects that were designed to work with independent inputs, sometimes perform well enough with correlated, high entropy inputs.\par The construction of the disperser is based on a new technique which we call ``the challenge-response mechanism'' that (in some sense) allows ``identifying high entropy regions'' in a given pair of sources using only one sample from the two sources.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Condensers; Dispersers; Explicit constructions; Extractors; Ramsey graphs", } @Article{Chan:2010:ULD, author = "T.-H. Hubert Chan and Anupam Gupta and Kunal Talwar", title = "Ultra-low-dimensional embeddings for doubling metrics", journal = j-J-ACM, volume = "57", number = "4", pages = "21:1--21:26", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734215", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on $n$ points embeds into an $ O(\log n)$-dimensional Euclidean space with $ O(\log n)$ distortion. Moreover, a simple ``volume'' argument shows that this bound is nearly tight: a uniform metric on $n$ points requires nearly logarithmic number of dimensions to embed with logarithmic distortion. It is natural to ask whether such a volume restriction is the only hurdle to low-dimensional embeddings. In other words, do {\em doubling\/} metrics, that do not have large uniform submetrics, and thus no volume hurdles to low dimensional embeddings, embed in low dimensional Euclidean spaces with small distortion?\par In this article, we give a positive answer to this question. We show how to embed any doubling metrics into $ O(\log \log n)$ dimensions with $ O(\log n)$ distortion. This is the first embedding for doubling metrics into fewer than logarithmic number of dimensions, even allowing for logarithmic distortion.\par This result is one extreme point of our general trade-off between distortion and dimension: given an $n$-point metric $ (V, d)$ with doubling dimension $ \dim_D$, and any target dimension $T$ in the range $ \Omega (\dim_D \log \log n) \leq T \leq O(\log n)$, we show that the metric embeds into Euclidean space $ \mathbb {R}^T$ with $ O(\log n \sqrt {\dim_D / T})$ distortion.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "dimension reduction; Euclidean embedding; Metric spaces", } @Article{Fauconnier:2010:TFD, author = "Carole Delporte-Gallet Hugues Fauconnier and Rachid Guerraoui", title = "Tight failure detection bounds on atomic object implementations", journal = j-J-ACM, volume = "57", number = "4", pages = "22:1--22:32", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734216", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Atomic objects; failure detection", } @Article{Pacholski:2010:SCP, author = "Witold Charatonik Leszek Pacholski", title = "Set constraints with projections", journal = j-J-ACM, volume = "57", number = "4", pages = "23:1--23:37", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734217", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Set constraints form a constraint system where variables range over the domain of sets of trees. They give a natural formalism for many problems in program analysis. Syntactically, set constraints are conjunctions of inclusions between expressions built over variables, constructors (constants and function symbols from a given signature) and a choice of set operators that defines the specific class of set constraints. In this article, we are interested in the class of {\em set constraints with projections}, which is the class with all Boolean operators (union, intersection and complement) and {\em projections\/} that in program analysis directly correspond to type destructors. We prove that the problem of existence of a solution of a system of set constraints with projections is in NEXPTIME, and thus that it is NEXPTIME-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Computational complexity; program analysis; set constraints", } @Article{Chebolu:2010:FMM, author = "Prasad Chebolu and Alan Frieze and P'all Melsted", title = "Finding a maximum matching in a sparse random graph in $ {O}(n) $ expected time", journal = j-J-ACM, volume = "57", number = "4", pages = "24:1--24:27", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734218", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "matching; Random graphs", } @Article{Dolev:2010:RBC, author = "Shlomi Dolev and Yuval Elovici and Rami Puzis", title = "Routing betweenness centrality", journal = j-J-ACM, volume = "57", number = "4", pages = "25:1--25:27", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734219", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Betweenness-Centrality measure is often used in social and computer communication networks to estimate the potential monitoring and control capabilities a vertex may have on data flowing in the network. In this article, we define the Routing Betweenness Centrality (RBC) measure that generalizes previously well known Betweenness measures such as the Shortest Path Betweenness, Flow Betweenness, and Traffic Load Centrality by considering network flows created by arbitrary loop-free routing strategies.\par We present algorithms for computing RBC of all the individual vertices in the network and algorithms for computing the RBC of a given group of vertices, where the RBC of a group of vertices represents their potential to collaboratively monitor and control data flows in the network. Two types of collaborations are considered: (i) conjunctive --- the group is a sequences of vertices controlling traffic where all members of the sequence process the traffic in the order defined by the sequence and (ii) disjunctive --- the group is a set of vertices controlling traffic where at least one member of the set processes the traffic. The algorithms presented in this paper also take into consideration different sampling rates of network monitors, accommodate arbitrary communication patterns between the vertices (traffic matrices), and can be applied to groups consisting of vertices and/or edges.\par For the cases of routing strategies that depend on both the source and the target of the message, we present algorithms with time complexity of $ O(n^2 m) $ where $n$ is the number of vertices in the network and $m$ is the number of edges in the routing tree (or the routing directed acyclic graph (DAG) for the cases of multi-path routing strategies). The time complexity can be reduced by an order of $n$ if we assume that the routing decisions depend solely on the target of the messages.\par Finally, we show that a preprocessing of $ O(n^2 m)$ time, supports computations of RBC of sequences in $ O(k n)$ time and computations of RBC of sets in $ O(n^3 n)$ time, where $k$ in the number of vertices in the sequence or the set.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Betwenness; centrality; communication networks; probabilistic routing", } @Article{Altman:2010:AAP, author = "Alon Altman and Moshe Tennenholtz", title = "An axiomatic approach to personalized ranking systems", journal = j-J-ACM, volume = "57", number = "4", pages = "26:1--26:35", month = apr, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1734213.1734220", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 29 13:26:36 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Personalized ranking systems and trust systems are an essential tool for collaboration in a multi-agent environment. In these systems, trust relations between many agents are aggregated to produce a personalized trust rating of the agents. In this article, we introduce the first extensive axiomatic study of this setting, and explore a wide array of well-known and new personalized ranking systems. We adapt several axioms (basic criteria) from the literature on global ranking systems to the context of personalized ranking systems, and fully classify the set of systems that satisfy all of these axioms. We further show that all these axioms are necessary for this result.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Axiomatic approach; manipulation; ranking systems; social networks", } @Article{Mandow:2010:MSC, author = "Lawrence Mandow and Jos{\'e} Luis {P{\'e}rez De La Cruz}", title = "Multiobjective {$ A^* $} search with consistent heuristics", journal = j-J-ACM, volume = "57", number = "5", pages = "27:1--27:25", month = jun, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1754399.1754400", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jun 23 14:39:04 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The article describes and analyzes NAMOA$^*$, an algorithm for multiobjective heuristic graph search problems. The algorithm is presented as an extension of A$^*$, an admissible scalar shortest path algorithm. Under consistent heuristics A$^*$ is known to improve its efficiency with more informed heuristics, and to be optimal over the class of admissible algorithms in terms of the set of expanded nodes and the number of node expansions. Equivalent beneficial properties are shown to prevail in the new algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Consistent heuristics; multiobjective search; optimality", } @Article{Braverman:2010:PIF, author = "Mark Braverman", title = "Polylogarithmic independence fools {$ A C^0 $} circuits", journal = j-J-ACM, volume = "57", number = "5", pages = "28:1--28:10", month = jun, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1754399.1754401", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jun 23 14:39:04 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that poly-sized $ A C^0 $ circuits cannot distinguish a polylogarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan [1990]. The only prior progress on the problem was by Bazzi [2007], who showed that $ O(\log^2 n)$-independent distributions fool poly-size DNF formulas. [Razborov 2008] has later given a much simpler proof for Bazzi's theorem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "circuit complexity; lower bounds; polynomial approximations; pseudorandomness", } @Article{Moshkovitz:2010:TQP, author = "Dana Moshkovitz and Ran Raz", title = "Two-query {PCP} with subconstant error", journal = j-J-ACM, volume = "57", number = "5", pages = "29:1--29:29", month = jun, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1754399.1754402", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jun 23 14:39:04 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that the NP-Complete language 3Sat has a PCP verifier that makes two queries to a proof of almost-linear size and achieves subconstant probability of error $ \epsilon = o(1) $. The verifier performs only projection tests, meaning that the answer to the first query determines at most one accepting answer to the second query. The number of bits representing a symbol in the proof depends only on the error $ \epsilon $. Previously, by the parallel repetition theorem, there were PCP Theorems with two-query projection tests, but only (arbitrarily small) {\em constant\/} error and {\em polynomial\/} size. There were also PCP Theorems with {\em subconstant\/} error and {\em almost-linear\/} size, but a constant number of queries that is {\em larger\/} than 2.\par As a corollary, we obtain a host of new results. In particular, our theorem improves many of the hardness of approximation results that are proved using the parallel repetition theorem. A partial list includes the following:\par (1) 3Sat cannot be efficiently approximated to within a factor of $ 7 / 8 + o(1) $, unless P = NP. This holds even under almost-linear reductions. Previously, the best known NP-hardness factor was $ 7 / 8 + \epsilon $ for any constant $ \epsilon > 0 $, under polynomial reductions (H{\aa}stad).\par (2) 3Lin cannot be efficiently approximated to within a factor of $ 1 / 2 + o(1) $, unless P = NP. This holds even under almost-linear reductions. Previously, the best known NP-hardness factor was $ 1 / 2 + \epsilon $ for any constant $ \epsilon > 0 $, under polynomial reductions (H{\aa}stad).\par (3) A PCP Theorem with amortized query complexity $ 1 + o(1) $ and amortized free bit complexity $ o(1) $. Previously, the best-known amortized query complexity and free bit complexity were $ 1 + \epsilon $ and $ \epsilon $, respectively, for any constant $ \epsilon > 0 $ (Samorodnitsky and Trevisan).\par One of the new ideas that we use is a new technique for doing the {\em composition\/} step in the (classical) proof of the PCP Theorem, without increasing the number of queries to the proof. We formalize this as a composition of new objects that we call {\em Locally Decode/Reject Codes\/} (LDRC). The notion of LDRC was implicit in several previous works, and we make it explicit in this work. We believe that the formulation of LDRCs and their construction are of independent interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "composition; label cover; locally decode/reject code (LDRC); probabilistically checkable proofs (PCP)", } @Article{Motik:2010:RDL, author = "Boris Motik and Riccardo Rosati", title = "Reconciling description logics and rules", journal = j-J-ACM, volume = "57", number = "5", pages = "30:1--30:62", month = jun, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1754399.1754403", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jun 23 14:39:04 MDT 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual knowledge, rules are focused on nonmonotonic inference. Many applications, however, require features of both DLs and rules. Developing a formalism that integrates DLs and rules would be a natural outcome of a large body of research in knowledge representation and reasoning of the last two decades; however, achieving this goal is very challenging and the approaches proposed thus far have not fully reached it. In this paper, we present a hybrid formalism of {\em MKNF$^+$ \/} {\em knowledge bases}, which integrates DLs and rules in a coherent semantic framework. Achieving seamless integration is nontrivial, since DLs use an open-world assumption, while the rules are based on a closed-world assumption. We overcome this discrepancy by basing the semantics of our formalism on the logic of minimal knowledge and negation as failure (MKNF) by Lifschitz. We present several algorithms for reasoning with MKNF$^+$ knowledge bases, each suitable to different kinds of rules, and establish tight complexity bounds.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "answer set programming; combined complexity; data complexity; description logics", } @Article{Fagin:2010:SIS, author = "Ronald Fagin and Alan Nash", title = "The structure of inverses in schema mappings", journal = j-J-ACM, volume = "57", number = "6", pages = "31:1--31:57", month = oct, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1857914.1857915", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 23 11:02:30 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). The notion of an inverse of a schema mapping is subtle, because a schema mapping may associate many target instances with each source instance, and many source instances with each target instance. In PODS 2006, Fagin defined a notion of the inverse of a schema mapping. This notion is tailored to the types of schema mappings that commonly arise in practice (those specified by ``source-to-target tuple-generating dependencies'', or s-t tgds).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vempala:2010:RSB, author = "Santosh S. Vempala", title = "A random-sampling-based algorithm for learning intersections of halfspaces", journal = j-J-ACM, volume = "57", number = "6", pages = "32:1--32:14", month = oct, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1857914.1857916", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 23 11:02:30 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give an algorithm to learn an intersection of $k$ halfspaces in $ R_n$ whose normals span an $l$-dimensional subspace. For any input distribution with a logconcave density such that the bounding hyperplanes of the $k$ halfspaces pass through its mean, the algorithm $ (\ldots {}, \Delta)$-learns with time and sample complexity bounded by $ (n k l / \ldots {}) O(l) \log 1 / \ldots {} \Delta $. The hypothesis found is an intersection of $ O(k \log (1 / \ldots {}))$ halfspaces. This improves on Blum and Kannan's algorithm for the uniform distribution over a ball, in the time and sample complexity (previously doubly exponential) and in the generality of the input distribution.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Esparza:2010:NPA, author = "Javier Esparza and Stefan Kiefer and Michael Luttenberger", title = "{Newtonian} program analysis", journal = j-J-ACM, volume = "57", number = "6", pages = "33:1--33:47", month = oct, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1857914.1857917", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 23 11:02:30 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents a novel generic technique for solving dataflow equations in interprocedural dataflow analysis. The technique is obtained by generalizing Newton's method for computing a zero of a differentiable function to $ \omega $-continuous semirings. Complete semilattices, the common program analysis framework, are a special class of $ \omega $-continuous semirings. We show that our generalized method always converges to the solution, and requires at most as many iterations as current methods based on Kleene's fixed-point theorem. We also show that, contrary to Kleene's method, Newton's method always terminates for arbitrary idempotent and commutative semirings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hallgren:2010:LQC, author = "Sean Hallgren and Cristopher Moore and Martin R{\"o}tteler and Alexander Russell and Pranab Sen", title = "Limitations of quantum coset states for graph isomorphism", journal = j-J-ACM, volume = "57", number = "6", pages = "34:1--34:33", month = oct, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1857914.1857918", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Nov 23 11:02:30 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore et al. [2005] that only an exponentially small amount of information is available from one, or a pair of coset states. A potential source of power to exploit are entangled quantum measurements that act jointly on many states at once.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2010:IAS, author = "Victor Vianu", title = "Invited articles section foreword", journal = j-J-ACM, volume = "58", number = "1", pages = "1:1--1:1", month = dec, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1870103.1870104", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 23 16:57:47 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Evfimievski:2010:EP, author = "Alexandre Evfimievski and Ronald Fagin and David Woodruff", title = "Epistemic privacy", journal = j-J-ACM, volume = "58", number = "1", pages = "2:1--2:45", month = dec, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1870103.1870105", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 23 16:57:47 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, and assumptions about users' prior knowledge, our goal is to determine if answering a past user's query could have led to a privacy breach. According to our definition, an audited property A is private, given the disclosure of property B, if no user can gain confidence in A by learning B, subject to prior knowledge constraints. Privacy is not violated if the disclosure of B causes a loss of confidence in A. The new notion of privacy is formalized using the well-known semantics for reasoning about knowledge, where logical properties correspond to sets of possible worlds (databases) that satisfy these properties.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Guha:2010:AAR, author = "Sudipto Guha and Kamesh Munagala and Peng Shi", title = "Approximation algorithms for restless bandit problems", journal = j-J-ACM, volume = "58", number = "1", pages = "3:1--3:50", month = dec, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1870103.1870106", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 23 16:57:47 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The restless bandit problem is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit (MAB) problem in decision theory. In its ultimate generality, the restless bandit problem is known to be PSPACE-Hard to approximate to any nontrivial factor, and little progress has been made on this problem despite its significance in modeling activity allocation under uncertainty. In this article, we consider the Feedback MAB problem, where the reward obtained by playing each of $n$ independent arms varies according to an underlying on/off Markov process whose exact state is only revealed when the arm is played. The goal is to design a policy for playing the arms in order to maximize the infinite horizon time average expected reward.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barcelo:2010:XII, author = "Pablo Barcel{\'o} and Leonid Libkin and Antonella Poggi and Cristina Sirangelo", title = "{XML} with incomplete information", journal = j-J-ACM, volume = "58", number = "1", pages = "4:1--4:62", month = dec, year = "2010", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1870103.1870107", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 23 16:57:47 MST 2010", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study models of incomplete information for XML, their computational properties, and query answering. While our approach is motivated by the study of relational incompleteness, incomplete information in XML documents may appear not only as null values but also as missing structural information. Our goal is to provide a classification of incomplete descriptions of XML documents, and separate features---or groups of features---that lead to hard computational problems from those that admit efficient algorithms. Our classification of incomplete information is based on the combination of null values with partial structural descriptions of documents. The key computational problems we consider are consistency of partial descriptions, representability of complete documents by incomplete ones, and query answering.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mulmuley:2011:PVN, author = "Ketan D. Mulmuley", title = "On {P} vs. {NP} and geometric complexity theory: Dedicated to {Sri Ramakrishna}", journal = j-J-ACM, volume = "58", number = "2", pages = "5:1--5:26", month = apr, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1944345.1944346", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Apr 6 16:33:20 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article gives an overview of the geometric complexity theory (GCT) approach towards the P vs. NP and related problems focusing on its main complexity theoretic results. These are: (1) two concrete lower bounds, which are currently the best known lower bounds in the context of the P vs. NC and permanent vs. determinant problems, (2) the Flip Theorem, which formalizes the self-referential paradox in the P vs. NP problem, and (3) the Decomposition Theorem, which decomposes the arithmetic P vs. NP and permanent vs. determinant problems into subproblems without self-referential difficulty, consisting of positivity hypotheses in algebraic geometry and representation theory and easier hardness hypotheses.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Buchin:2011:DTT, author = "Kevin Buchin and Wolfgang Mulzer", title = "{Delaunay} triangulations in {$ O(\mathrm {sort}(n)) $} time and more", journal = j-J-ACM, volume = "58", number = "2", pages = "6:1--6:27", month = apr, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1944345.1944347", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Apr 6 16:33:20 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present several results about Delaunay triangulations (DTs) and convex hulls in transdichotomous and hereditary settings: (i) the DT of a planar point set can be computed in expected time {$ O(\mathrm {sort}(n)) $} on a word RAM, where $ \mathrm {sort}(n) $ is the time to sort $n$ numbers. We assume that the word RAM supports the {\em shuffle\/} operation in constant time; (ii) if we know the ordering of a planar point set in $x$- and in $y$-direction, its DT can be found by a randomized algebraic computation tree of expected linear depth; (iii) given a universe {$U$} of points in the plane, we construct a data structure {$D$} for {\em Delaunay queries\/}: for any {$ P \subseteq U $}, {$D$} can find the DT of {$P$} in expected time {$ O(|P| \log \log |U|) $}; (iv) given a universe {$U$} of points in 3-space in general convex position, there is a data structure {$D$} for convex hull queries: for any {$ P \subseteq U $}, {$D$} can find the convex hull of {$P$} in expected time {$ O(|P| (\log \log |U|)^2) $}; (v) given a convex polytope in 3-space with $n$ vertices which are colored with $2$ colors, we can split it into the convex hulls of the individual color classes in expected time {$ O(n (\log \log n)^2) $}.\par The results (i)--(iii) generalize to higher dimensions, where the expected running time now also depends on the complexity of the resulting DT. We need a wide range of techniques. Most prominently, we describe a reduction from DTs to nearest-neighbor graphs that relies on a new variant of randomized incremental constructions using {\em dependent\/} sampling.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aguilera:2011:DAS, author = "Marcos K. Aguilera and Idit Keidar and Dahlia Malkhi and Alexander Shraer", title = "Dynamic atomic storage without consensus", journal = j-J-ACM, volume = "58", number = "2", pages = "7:1--7:32", month = apr, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1944345.1944348", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Apr 6 16:33:20 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storage can be implemented in a fault-tolerant manner even if the system is completely asynchronous, whereas consensus is not solvable. In contrast, all existing emulations of atomic storage in dynamic systems rely on consensus or stronger primitives, leading to a popular belief that dynamic R/W storage is unattainable without consensus. In this article, we specify the problem of dynamic atomic read/write storage in terms of the interface available to the users of such storage.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Avron:2011:RAE, author = "Haim Avron and Sivan Toledo", title = "Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix", journal = j-J-ACM, volume = "58", number = "2", pages = "8:1--8:17", month = apr, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1944345.1944349", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Apr 6 16:33:20 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by $ 1 / M \sum_{i = 1}^M z_i^T A z_i $, where the $ z_i $ are random vectors; different estimators use different distributions for the zis, all of which lead to $ E(1 / M \sum_{i = 1}^M z_i^T A z_i) = \mathrm {trace}(A) $. These algorithms are useful in applications in which there is no explicit representation of $A$ but rather an efficient method compute $ z^T A z$ given $z$. Existing results only analyze the variance of the different estimators. In contrast, we analyze the number of samples $M$ required to guarantee that with probability at least $ 1 - \delta $, the relative error in the estimate is at most $ \epsilon $. We argue that such bounds are much more useful in applications than the variance. We found that these bounds rank the estimators differently than the variance; this suggests that minimum-variance estimators may not be the best.\par We also make two additional contributions to this area. The first is a specialized bound for projection matrices, whose trace (rank) needs to be computed in electronic structure calculations. The second is a new estimator that uses less randomness than all the existing estimators.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cicalese:2011:CRE, author = "Ferdinando Cicalese and Eduardo Sany Laber", title = "On the competitive ratio of evaluating priced functions", journal = j-J-ACM, volume = "58", number = "3", pages = "9:1--9:40", month = may, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1970392.1970393", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 3 18:12:24 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $f$ be a function on a set of variables $V$. For each $ x \in V$, let $ c(x)$ be the cost of reading the value of $x$. An algorithm for evaluating $f$ is a strategy for adaptively identifying and reading a set of variables $ U \subseteq V$ whose values uniquely determine the value of $f$. We are interested in finding algorithms which minimize the cost incurred to evaluate $f$ in the above sense. Competitive analysis is employed to measure the performance of the algorithms. We address two variants of the above problem. We consider the basic model in which the evaluation algorithm knows the cost $ c(x)$, for each $ x \in V$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vazirani:2011:MEU, author = "Vijay V. Vazirani and Mihalis Yannakakis", title = "Market equilibrium under separable, piecewise-linear, concave utilities", journal = j-J-ACM, volume = "58", number = "3", pages = "10:1--10:25", month = may, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1970392.1970394", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 3 18:12:24 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider Fisher and Arrow--Debreu markets under additively separable, piecewise-linear, concave utility functions and obtain the following results. For both market models, if an equilibrium exists, there is one that is rational and can be written using polynomially many bits. There is no simple necessary and sufficient condition for the existence of an equilibrium: The problem of checking for existence of an equilibrium is NP-complete for both market models; the same holds for existence of an $ \epsilon $-approximate equilibrium, for $ \epsilon = O(n^{-5})$. Under standard (mild) sufficient conditions, the problem of finding an exact equilibrium is in PPAD for both market models.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Candes:2011:RPC, author = "Emmanuel J. Cand{\`e}s and Xiaodong Li and Yi Ma and John Wright", title = "Robust principal component analysis?", journal = j-J-ACM, volume = "58", number = "3", pages = "11:1--11:37", month = may, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1970392.1970395", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 3 18:12:24 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the $ \ell_1 $ norm. This suggests the possibility of a principled approach to robust principal component analysis since our methodology and results assert that one can recover the principal components of a data matrix even though a positive fraction of its entries are arbitrarily corrupted. This extends to the situation where a fraction of the entries are missing as well.We discuss an algorithm for solving this optimization problem, and present applications in the area of video surveillance, where our methodology allows for the detection of objects in a cluttered background, and in the area of face recognition, where it offers a principled way of removing shadows and specularities in images of faces.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2011:IJI, author = "Victor Vianu", title = "Introduction to {JACM} invited article", journal = j-J-ACM, volume = "58", number = "3", pages = "12:1--12:1", month = may, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1970392.1970396", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 3 18:12:24 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sarma:2011:EPG, author = "Atish Das Sarma and Sreenivas Gollapudi and Rina Panigrahy", title = "Estimating {PageRank} on graph streams", journal = j-J-ACM, volume = "58", number = "3", pages = "13:1--13:19", month = may, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1970392.1970397", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 3 18:12:24 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article focuses on computations on large graphs (e.g., the web-graph) where the edges of the graph are presented as a stream. The objective in the streaming model is to use small amount of memory (preferably sub-linear in the number of nodes $n$) and a smaller number of passes.\par In the streaming model, we show how to perform several graph computations including estimating the probability distribution after a random walk of length $l$, the mixing time $M$, and other related quantities such as the conductance of the graph. By applying our algorithm for computing probability distribution on the web-graph, we can estimate the PageRank $p$ of any node up to an additive error of $ \sqrt {\epsilon p} + \epsilon $ in $ \tilde {O}(\sqrt {M / \alpha })$ passes and $ \tilde {O}(\min (n \alpha + 1 / \epsilon \sqrt {M / \alpha } + (1 / \epsilon) M \alpha, \alpha n \sqrt {M \alpha } + (1 / \epsilon) \sqrt {M / \alpha }))$ space, for any $ \alpha \in (0, 1]$. Specifically, for $ \epsilon = M / n$, $ \alpha = M^{-1 / 2}$, we can compute the approximate PageRank values in $ \tilde {O}(n M^{-1 / 4})$ space and $ \tilde {O}(M^{3 / 4})$ passes. In comparison, a standard implementation of the PageRank algorithm will take $ O(n)$ space and $ O(M)$ passes. We also give an approach to approximate the PageRank values in just $ \tilde {O}(1)$ passes although this requires $ \tilde {O}(n M)$ space.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chazelle:2011:OGR, author = "Bernard Chazelle and C. Seshadhri", title = "Online geometric reconstruction", journal = j-J-ACM, volume = "58", number = "4", pages = "14:1--14:32", month = jul, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1989727.1989728", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 18 12:34:51 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; for example, the dataset could be a terrain and a query might ask for the coordinates of a particular vertex or for the edges incident to it. Suppose, in addition, that the dataset satisfies some known structural property P (for example, monotonicity or convexity) but that, because of errors and noise, the queries occasionally provide answers that violate P.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fagin:2011:PDE, author = "Ronald Fagin and Benny Kimelfeld and Phokion G. Kolaitis", title = "Probabilistic data exchange", journal = j-J-ACM, volume = "58", number = "4", pages = "15:1--15:55", month = jul, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1989727.1989729", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 18 12:34:51 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, such as solution, universal solution, and the certain answers of target queries. We develop a framework for data exchange over probabilistic databases, and make a case for its coherence and robustness. This framework applies to arbitrary schema mappings, and finite or countably infinite probability spaces on the source and target instances. After establishing this framework and formulating the key concepts, we study the application of the framework to a concrete and practical setting where probabilistic databases are compactly encoded by means of annotations formulated over random Boolean variables.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2011:IAFa, author = "Victor Vianu", title = "Invited articles foreword", journal = j-J-ACM, volume = "58", number = "4", pages = "16:1--16:1", month = jul, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1989727.1989730", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 18 12:34:51 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bojanczyk:2011:XEL, author = "Miko{\l}aj Boja{\'n}czyk and Pawe{\l} Parys", title = "{XPath} evaluation in linear time", journal = j-J-ACM, volume = "58", number = "4", pages = "17:1--17:33", month = jul, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1989727.1989731", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 18 12:34:51 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider a fragment of XPath 1.0, where attribute and text values may be compared. We show that for any unary query $ \varphi $ in this fragment, the set of nodes that satisfy the query in a document t can be calculated in time $ O(| \varphi |^3 |t|) $. We show that for a query in a bigger fragment with Kleene star allowed, the same can be done in time $ O(2^{O(| \varphi |)} |t|) $ or in time $ O(| \varphi |^3 |t| \log |t|) $. Finally, we present algorithms for binary queries of XPath, which do a precomputation on the document and then output the selected pairs with constant delay.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{King:2011:BBB, author = "Valerie King and Jared Saia", title = "Breaking the {$ O(n^2) $} bit barrier: {Scalable} {Byzantine} agreement with an adaptive adversary", journal = j-J-ACM, volume = "58", number = "4", pages = "18:1--18:24", month = jul, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/1989727.1989732", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 18 12:34:51 MDT 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends only $ \tilde {O}(\sqrt {n}) $ bits, where $n$ is the total number of processors. Our algorithm succeeds with high probability against an adaptive adversary, which can take over processors at any time during the protocol, up to the point of taking over arbitrarily close to a $ 1 / 3$ fraction. We assume synchronous communication but a rushing adversary. Moreover, our algorithm works in the presence of flooding: processors controlled by the adversary can send out any number of messages. We assume the existence of private channels between all pairs of processors but make no other cryptographic assumptions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arthur:2011:SAM, author = "David Arthur and Bodo Manthey and Heiko R{\"o}glin", title = "Smoothed Analysis of the $k$-Means Method", journal = j-J-ACM, volume = "58", number = "5", pages = "19:1--19:??", month = oct, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2027216.2027217", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Nov 6 06:23:00 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mastrolilli:2011:HAF, author = "Monaldo Mastrolilli and Ola Svensson", title = "Hardness of Approximating Flow and Job Shop Scheduling Problems", journal = j-J-ACM, volume = "58", number = "5", pages = "20:1--20:??", month = oct, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2027216.2027218", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Nov 6 06:23:00 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bateni:2011:ASS, author = "Mohammadhossein Bateni and Mohammadtaghi Hajiaghayi and D{\'a}niel Marx", title = "Approximation Schemes for {Steiner} Forest on Planar Graphs and Graphs of Bounded Treewidth", journal = j-J-ACM, volume = "58", number = "5", pages = "21:1--21:??", month = oct, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2027216.2027219", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Nov 6 06:23:00 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2011:IAFb, author = "Victor Vianu", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "58", number = "5", pages = "22:1--22:??", month = oct, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2027216.2027220", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Nov 6 06:23:00 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barenboim:2011:DDV, author = "Leonid Barenboim and Michael Elkin", title = "Deterministic Distributed Vertex Coloring in Polylogarithmic Time", journal = j-J-ACM, volume = "58", number = "5", pages = "23:1--23:??", month = oct, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2027216.2027221", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sun Nov 6 06:23:00 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gordon:2011:CFS, author = "S. Dov Gordon and Carmit Hazay and Jonathan Katz and Yehuda Lindell", title = "Complete Fairness in Secure {Two-Party} Computation", journal = j-J-ACM, volume = "58", number = "6", pages = "24:1--24:37", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049698", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness which guarantees, informally, that if one party receives its output, then the other party does too. Cleve [1986] showed that complete fairness cannot be achieved in general without an honest majority. Since then, the accepted folklore has been that nothing non-trivial can be computed with complete fairness in the two-party setting. We demonstrate that this folklore belief is false by showing completely fair protocols for various nontrivial functions in the two-party setting based on standard cryptographic assumptions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lavi:2011:TNO, author = "Ron Lavi and Chaitanya Swamy", title = "Truthful and Near-Optimal Mechanism Design via Linear Programming", journal = j-J-ACM, volume = "58", number = "6", pages = "25:1--25:24", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049699", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any $ \alpha $-approximation algorithm that also bounds the integrality gap of the LP relaxation of the problem by $ \alpha $ can be used to construct an $ \alpha $-approximation mechanism that is truthful in expectation. This immediately yields a variety of new and significantly improved results for various problem domains and furthermore, yields truthful (in expectation) mechanisms with guarantees that match the best-known approximation guarantees when truthfulness is not required. In particular, we obtain the first truthful mechanisms with approximation guarantees for a variety of multiparameter domains.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Calcagno:2011:CSA, author = "Cristiano Calcagno and Dino Distefano and Peter W. O'Hearn and Hongseok Yang", title = "Compositional Shape Analysis by Means of Bi-Abduction", journal = j-J-ACM, volume = "58", number = "6", pages = "26:1--26:66", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049700", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The accurate and efficient treatment of mutable data structures is one of the outstanding problem areas in automatic program verification and analysis. Shape analysis is a form of program analysis that attempts to infer descriptions of the data structures in a program, and to prove that these structures are not misused or corrupted. It is one of the more challenging and expensive forms of program analysis, due to the complexity of aliasing and the need to look arbitrarily deeply into the program heap. This article describes a method of boosting shape analyses by defining a compositional method, where each procedure is analyzed independently of its callers.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goodrich:2011:RSS, author = "Michael T. Goodrich", title = "Randomized {Shellsort}: a Simple Data-Oblivious Sorting Algorithm", journal = j-J-ACM, volume = "58", number = "6", pages = "27:1--27:26", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049701", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/jalg.bib", abstract = "In this article, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in $ O(n \log n) $ time and succeeds in sorting any given input permutation with very high probability. Taken together, these properties imply applications in the design of new efficient privacy-preserving computations based on the secure multiparty computation (SMC) paradigm. In addition, by a trivial conversion of this Monte Carlo algorithm to its Las Vegas equivalent, one gets the first version of Shellsort with a running time that is provably O$ (n \log n) $ with very high probability.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haeupler:2011:NCA, author = "Bernhard Haeupler and Barna Saha and Aravind Srinivasan", title = "New Constructive Aspects of the {Lov{\'a}sz Local Lemma}", journal = j-J-ACM, volume = "58", number = "6", pages = "28:1--28:28", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049702", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Lov{\'a}sz Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of ``bad'' events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser and Tardos [2010] for the full asymmetric LLL. We show that the output distribution of the Moser-Tardos algorithm well-approximates the conditional LLL-distribution, the distribution obtained by conditioning on all bad events being avoided. We show how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and nonconstructive results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2011:IAF, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "58", number = "6", pages = "29:1--29:1", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049703", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jain:2011:QP, author = "Rahul Jain and Zhengfeng Ji and Sarvagya Upadhyay and John Watrous", title = "{QIP $=$ PSPACE}", journal = j-J-ACM, volume = "58", number = "6", pages = "30:1--30:27", month = dec, year = "2011", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2049697.2049704", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 15 09:33:01 MST 2011", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This work considers the quantum interactive proof system model of computation, which is the (classical) interactive proof system model's natural quantum computational analogue. An exact characterization of the expressive power of quantum interactive proof systems is obtained: the collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable by deterministic Turing machines that use at most a polynomial amount of space (or, more succinctly, QIP = PSPACE). This characterization is proved through the use of a parallelized form of the matrix multiplicative weights update method, applied to a class of semidefinite programs that captures the computational power of quantum interactive proof systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Baier:2012:PA, author = "Christel Baier and Marcus Gr{\"o}sser and Nathalie Bertrand", title = "Probabilistic {$ \omega $}-automata", journal = j-J-ACM, volume = "59", number = "1", pages = "1:1--1:52", month = feb, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2108242.2108243", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 28 16:42:44 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Probabilistic $ \omega $-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions. Acceptance of a run for an infinite input word can be defined using traditional acceptance criteria for $ \omega $-automata, such as B{\"u}chi, Rabin or Streett conditions. The accepted language of a probabilistic $ \omega $-automata is then defined by imposing a constraint on the probability measure of the accepting runs. In this paper, we study a series of fundamental properties of probabilistic $ \omega $-automata with three different language-semantics: (1) the probable semantics that requires positive acceptance probability, (2) the almost-sure semantics that requires acceptance with probability $1$, and (3) the threshold semantics that relies on an additional parameter $ \lambda \in]0, 1 [$ that specifies a lower probability bound for the acceptance probability.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aspnes:2012:PCD, author = "James Aspnes and Hagit Attiya and Keren Censor-Hillel", title = "Polylogarithmic concurrent data structures from monotone circuits", journal = j-J-ACM, volume = "59", number = "1", pages = "2:1--2:24", month = feb, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2108242.2108244", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 28 16:42:44 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents constructions of useful concurrent data structures, including max registers and counters, with step complexity that is sublinear in the number of processes, $n$. This result avoids a well-known lower bound by having step complexity that is polylogarithmic in the number of values the object can take or the number of operations applied to it. The key step in these implementations is a method for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the largest value previously written. For fixed $m$, an $m$-valued max register is constructed from one-bit multi-writer multi-reader registers at a cost of at most $ \lceil \log m \rceil $ atomic register operations per write or read.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Castaneda:2012:NCT, author = "Armando Casta{\~n}eda and Sergio Rajsbaum", title = "New combinatorial topology bounds for renaming: The upper bound", journal = j-J-ACM, volume = "59", number = "1", pages = "3:1--3:49", month = feb, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2108242.2108245", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 28 16:42:44 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the renaming task, n+1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, $ 0, 1, \ldots, K $. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process ID. Attiya et al. [1990] showed that renaming has a wait-free solution when $ K \geq 2 n $. Several algebraic topology proofs of a lower bound stating that no such protocol exists when $ K < 2 n $ have been published. In a companion article, we present the first completely combinatorial renaming lower bound proof stating if $ n + 1 $ is a primer power, then renaming is not wait-free solvable when $ K < 2 n $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2012:IAFa, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "59", number = "1", pages = "4:1--4:1", month = feb, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2108242.2108246", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 28 16:42:44 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Otto:2012:HAG, author = "Martin Otto", title = "Highly acyclic groups, hypergraph covers, and the guarded fragment", journal = j-J-ACM, volume = "59", number = "1", pages = "5:1--5:40", month = feb, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2108242.2108247", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 28 16:42:44 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We construct finite groups whose Cayley graphs have large girth even with respect to a discounted distance measure that contracts arbitrarily long sequences of edges from the same color class (subgroup), and only counts transitions between color classes (cosets). These groups are shown to be useful in the construction of finite bisimilar hypergraph covers that avoid any small cyclic configurations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barak:2012:IPO, author = "Boaz Barak and Oded Goldreich and Russell Impagliazzo and Steven Rudich and Amit Sahai and Salil Vadhan and Ke Yang", title = "On the (im)possibility of obfuscating programs", journal = j-J-ACM, volume = "59", number = "2", pages = "6:1--6:48", month = apr, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2160158.2160159", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 27 16:20:34 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Informally, an obfuscator $O$ is an (efficient, probabilistic) ``compiler'' that takes as input a program (or circuit) $P$ and produces a new program $ O(P)$ that has the same functionality as $P$ yet is ``unintelligible'' in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic and complexity-theoretic applications, ranging from software protection to homomorphic encryption to complexity-theoretic analogues of Rice's theorem. Most of these applications are based on an interpretation of the ``unintelligibility'' condition in obfuscation as meaning that $ O(P)$ is a ``virtual black box,'' in the sense that anything one can efficiently compute given $ O(P)$, one could also efficiently compute given oracle access to $P$. In this work, we initiate a theoretical investigation of obfuscation. Our main result is that, even under very weak formalizations of the above intuition, obfuscation is impossible. We prove this by constructing a family of efficient programs $P$ that are unobfuscatable in the sense that (a) given any efficient program $ P'$ that computes the same function as a program $ P \in p$, the ``source code'' $P$ can be efficiently reconstructed, yet (b) given oracle access to a (randomly selected) program $ P \in p$, no efficient algorithm can reconstruct $P$ (or even distinguish a certain bit in the code from random) except with negligible probability. We extend our impossibility result in a number of ways, including even obfuscators that (a) are not necessarily computable in polynomial time, (b) only approximately preserve the functionality, and (c) only need to work for very restricted models of computation (TC$^0$). We also rule out several potential applications of obfuscators, by constructing ``unobfuscatable'' signature schemes, encryption schemes, and pseudorandom function families.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vazirani:2012:NRC, author = "Vijay V. Vazirani", title = "The notion of a rational convex program, and an algorithm for the {Arrow--Debreu Nash} bargaining game", journal = j-J-ACM, volume = "59", number = "2", pages = "7:1--7:36", month = apr, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2160158.2160160", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 27 16:20:34 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce the notion of a rational convex program (RCP) and we classify the known RCPs into two classes: quadratic and logarithmic. The importance of rationality is that it opens up the possibility of computing an optimal solution to the program via an algorithm that is either combinatorial or uses an LP-oracle. Next, we define a new Nash bargaining game, called ADNB, which is derived from the linear case of the Arrow--Debreu market model. We show that the convex program for ADNB is a logarithmic RCP, but unlike other known members of this class, it is nontotal. Our main result is a combinatorial, polynomial-time algorithm for ADNB. It turns out that the reason for infeasibility of logarithmic RCPs is quite different from that for LPs and quadratic RCPs. We believe that our ideas for surmounting the new difficulties will be useful for dealing with other nontotal RCPs as well. We give an application of our combinatorial algorithm for ADNB to an important ``fair'' throughput allocation problem on a wireless channel. Finally, we present a number of interesting questions that the new notion of RCP raises.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldreich:2012:TGO, author = "Oded Goldreich and Brendan Juba and Madhu Sudan", title = "A theory of goal-oriented communication", journal = j-J-ACM, volume = "59", number = "2", pages = "8:1--8:65", month = apr, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2160158.2160161", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 27 16:20:34 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We put forward a general theory of goal-oriented communication, where communication is not an end in itself, but rather a means to achieving some goals of the communicating parties. Focusing on goals provides a framework for addressing the problem of potential ``misunderstanding'' during communication, where the misunderstanding arises from lack of initial agreement on what protocol and/or language is being used in communication. In this context, ``reliable communication'' means overcoming any initial misunderstanding between parties towards achieving a given goal. Despite the enormous diversity among the goals of communication, we propose a simple model that captures all goals. In the simplest form of communication we consider, two parties, a user and a server, attempt to communicate with each other in order to achieve some goal of the user. We show that any goal of communication can be modeled mathematically by introducing a third party, which we call the referee, who hypothetically monitors the conversation between the user and the server and determines whether or not the goal has been achieved. Potential misunderstanding between the players is captured by allowing each player (the user/server) to come from a (potentially infinite) class of players such that each player is unaware which instantiation of the other it is talking to. We identify a main concept, which we call sensing, that allows goals to be achieved even under misunderstanding. Informally, sensing captures the user's ability (potentially using help from the server) to simulate the referee's assessment on whether the communication is achieving the goal. We show that when the user can sense progress, the goal of communication can be achieved despite initial misunderstanding. We also show that in certain settings sensing is necessary for overcoming such initial misunderstanding. Our results significantly extend the scope of the investigation started by Juba and Sudan (STOC 2008) who studied the foregoing phenomenon in the case of a single specific goal. Our study shows that their main suggestion, that misunderstanding can be detected and possibly corrected by focusing on the goal, can be proved in full generality.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2012:IAFb, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "59", number = "2", pages = "9:1--9:1", month = apr, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2160158.2160162", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 27 16:20:34 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this issue, the Invited Articles section is comprised of the article ``Continuous Sampling from Distributed Streams'' by Graham Cormode, Muthu Muthukrishnan, Ke Yi and Qin Zhang. This article was selected from the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, held in Indianapolis, Indiana, June 7--9, 2010. I thank the Program Committee of PODS 2010 and the PC Chair, Dirk Van Gucht, for their help in selecting this invited article. I am also grateful to JACM Associate Editor Phokion Kolaitis for his editorial work on this article.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cormode:2012:CSD, author = "Graham Cormode and S. Muthukrishnan and Ke Yi and Qin Zhang", title = "Continuous sampling from distributed streams", journal = j-J-ACM, volume = "59", number = "2", pages = "10:1--10:25", month = apr, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2160158.2160163", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 27 16:20:34 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streaming data sets, this problem becomes particularly difficult when the data is shared across multiple distributed sites. The main challenge is to ensure that a sample is drawn uniformly across the union of the data while minimizing the communication needed to run the protocol on the evolving data. At the same time, it is also necessary to make the protocol lightweight, by keeping the space and time costs low for each participant. In this article, we present communication-efficient protocols for continuously maintaining a sample (both with and without replacement) from $k$ distributed streams. These apply to the case when we want a sample from the full streams, and to the sliding window cases of only the W most recent elements, or arrivals within the last $w$ time units. We show that our protocols are optimal (up to logarithmic factors), not just in terms of the communication used, but also the time and space costs for each participant.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Groth:2012:NTN, author = "Jens Groth and Rafail Ostrovsky and Amit Sahai", title = "New Techniques for Noninteractive Zero-Knowledge", journal = j-J-ACM, volume = "59", number = "3", pages = "11:1--11:35", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220358", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Noninteractive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including public-key encryption secure against chosen ciphertext attack, digital signatures, and various other cryptographic protocols. We introduce new techniques for constructing NIZK proofs based on groups with a bilinear map. Compared to previous constructions of NIZK proofs, our techniques yield dramatic reduction in the length of the common reference string (proportional to security parameter) and the size of the proofs (proportional to security parameter times the circuit size). Our novel techniques allow us to answer several long-standing open questions in the theory of noninteractive proofs. We construct the first perfect NIZK argument system for all NP. We construct the first universally composable NIZK argument for all NP in the presence of an adaptive adversary. We construct a non-interactive zap for all NP, which is the first that is based on a standard cryptographic security assumption.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kirsch:2012:ERA, author = "Adam Kirsch and Michael Mitzenmacher and Andrea Pietracaprina and Geppino Pucci and Eli Upfal and Fabio Vandin", title = "An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets", journal = j-J-ACM, volume = "59", number = "3", pages = "12:1--12:22", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220359", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is becoming a major challenge in data mining applications. In this work, we address significance in the context of frequent itemset mining. Specifically, we develop a novel methodology to identify a meaningful support threshold $ s^* $ for a dataset, such that the number of itemsets with support at least $ s^* $ represents a substantial deviation from what would be expected in a random dataset with the same number of transactions and the same individual item frequencies. These itemsets can then be flagged as statistically significant with a small false discovery rate. We present extensive experimental results to substantiate the effectiveness of our methodology.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Volzer:2012:DFR, author = "Hagen V{\"o}lzer and Daniele Varacca", title = "Defining Fairness in Reactive and Concurrent Systems", journal = j-J-ACM, volume = "59", number = "3", pages = "13:1--13:37", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220360", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We define when a linear-time temporal property is a fairness property with respect to a given system. This captures the essence shared by most fairness assumptions that are used in the specification and verification of reactive and concurrent systems, such as weak fairness, strong fairness, $k$-fairness, and many others. We provide three characterizations of fairness: a language-theoretic, a game-theoretic, and a topological characterization. It turns out that the fairness properties are the sets that are ``large'' from a topological point of view, that is, they are the co-meager sets in the natural topology of runs of a given system. This insight provides a link to probability theory where a set is ``large'' when it has measure 1. While these two notions of largeness are similar, they do not coincide in general. However, we show that they coincide for $ \omega $-regular properties and bounded Borel measures. That is, an $ \omega $-regular temporal property of a finite-state system has measure 1 under a bounded Borel measure if and only if it is a fairness property with respect to that system. The definition of fairness leads to a generic relaxation of correctness of a system in linear-time semantics. We define a system to be fairly correct if there exists a fairness assumption under which it satisfies its specification. Equivalently, a system is fairly correct if the set of runs satisfying the specification is topologically large. We motivate this notion of correctness and show how it can be verified in a system.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Patrascu:2012:PST, author = "Mihai P{\u{a}}tra{\c{s}}cu and Mikkel Thorup", title = "The Power of Simple Tabulation Hashing", journal = j-J-ACM, volume = "59", number = "3", pages = "14:1--14:50", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220361", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here we show that the simplest possible tabulation hashing provides unexpectedly strong guarantees. The scheme itself dates back to Zobrist in 1970 who used it for game playing programs. Keys are viewed as consisting of $c$ characters. We initialize $c$ tables $ H_1, \ldots {}, H_c $ mapping characters to random hash codes. A key $ x = (x_1, \ldots, x_c) $ is hashed to $ H_1 [x_1] \oplus \cdot \cdot \cdot \oplus H_c[x_c] $, where $ \oplus $ denotes bit-wise exclusive-or. While this scheme is not even 4-independent, we show that it provides many of the guarantees that are normally obtained via higher independence, for example, Chernoff-type concentration, min-wise hashing for estimating set intersection, and cuckoo hashing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2012:IAFc, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "59", number = "3", pages = "15:1--15:1", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220362", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2012:STB, author = "Georg Gottlob and Stephanie Tien Lee and Gregory Valiant and Paul Valiant", title = "Size and Treewidth Bounds for Conjunctive Queries", journal = j-J-ACM, volume = "59", number = "3", pages = "16:1--16:35", month = jun, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2220357.2220363", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Jul 9 16:30:52 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article provides new worst-case bounds for the size and tree with of the result $ Q(D) $ of a conjunctive query $Q$ applied to a database D. We derive bounds for the result size $ |Q(D)|$ in terms of structural properties of $Q$, both in the absence and in the presence of keys and functional dependencies. These bounds are based on a novel ``coloring'' of the query variables that associates a coloring number $ C(Q)$ to each query $Q$. Intuitively, each color used represents some possible entropy of that variable. Using this coloring number, we derive tight bounds for the size of $ Q(D)$ in case (i) no functional dependencies or keys are specified, and (ii) simple functional dependencies (keys) are given. These results generalize recent size-bounds for join queries obtained by Atserias et al. [2008]. In the case of arbitrary (compound) functional dependencies, we use tools from information theory to provide lower and upper bounds, establishing a close connection between size bounds and a basic question in information theory. Our new coloring scheme also allows us to precisely characterize (both in the absence of keys and with simple keys) the treewidth-preserving queries --- the queries for which the treewidth of the output relation is bounded by a function of the treewidth of the input database. Finally, we give some results on the computational complexity of determining the size bounds, and of deciding whether the treewidth is preserved.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2012:AOA, author = "Yijia Chen and J{\"o}rg Flum", title = "From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem", journal = j-J-ACM, volume = "59", number = "4", pages = "17:1--17:34", month = aug, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2339123.2339124", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 4 13:21:54 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $C$ denote one of the complexity classes ``polynomial time,'' ``logspace,'' or ``nondeterministic logspace.'' We introduce a logic $ L(C)_{\rm inv}$ and show generalizations and variants of the equivalence $ L(C)_{\rm inv}$ captures $C$ if and only if there is an almost $C$-optimal algorithm in $C$ for the set Taut of tautologies of propositional logic. These statements are also equivalent to the existence of a listing of subsets in $C$ of Taut by corresponding Turing machines and equivalent to the fact that a certain parameterized halting problem is in the parameterized complexity class $ X C_{\rm uni}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Avin:2012:SDC, author = "Chen Avin and Yuval Emek and Erez Kantor and Zvi Lotker and David Peleg and Liam Roditty", title = "{SINR} Diagrams: Convexity and Its Applications in Wireless Networks", journal = j-J-ACM, volume = "59", number = "4", pages = "18:1--18:34", month = aug, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2339123.2339125", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 4 13:21:54 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference \& noise ratio (SINR) model. For a collection of simultaneously transmitting stations in the plane, it is possible to identify a reception zone for each station, consisting of the points where its transmission is received correctly. The resulting SINR diagram partitions the plane into a reception zone per station and the remaining plane where no station can be heard. SINR diagrams appear to be fundamental to understanding the behavior of wireless networks, and may play a key role in the development of suitable algorithms for such networks, analogous perhaps to the role played by Voronoi diagrams in the study of proximity queries and related issues in computational geometry. So far, however, the properties of SINR diagrams have not been studied systematically, and most algorithmic studies in wireless networking rely on simplified graph-based models such as the unit disk graph (UDG) model, which conveniently abstract away interference-related complications, and make it easier to handle algorithmic issues, but consequently fail to capture accurately some important aspects of wireless networks. This article focuses on obtaining some basic understanding of SINR diagrams, their properties and their usability in algorithmic applications. Specifically, we have shown that assuming uniform power transmissions, the reception zones are convex and relatively well-rounded. These results are then used to develop an efficient approximation algorithm for a fundamental point location problem in wireless networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bansal:2012:PDR, author = "Nikhil Bansal and Niv Buchbinder and Joseph (Seffi) Naor", title = "A Primal-Dual Randomized Algorithm for Weighted Paging", journal = j-J-ACM, volume = "59", number = "4", pages = "19:1--19:24", month = aug, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2339123.2339126", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 4 13:21:54 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the weighted version of the classic online paging problem where there is a weight (cost) for fetching each page into the cache. We design a randomized $ O(\log k)$-competitive online algorithm for this problem, where $k$ is the cache size. This is the first randomized $ o(k)$-competitive algorithm and its competitive ratio matches the known lower bound for the problem, up to constant factors. More generally, we design an $ O(\log (k / (k - h + 1)))$-competitive online algorithm for the version of the problem where the online algorithm has cache size $k$ and it is compared to an optimal offline solution with cache size $ h \leq k$. Our solution is based on a two-step approach. We first obtain an $ O(\log k)$-competitive fractional algorithm based on an online primal-dual approach. Next, we obtain a randomized algorithm by rounding in an online manner the fractional solution to a probability distribution on the possible cache states. We also give an online primal-dual randomized $ O(\log N)$-competitive algorithm for the Metrical Task System problem (MTS) on a weighted star metric on $N$ leaves.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2012:IAFd, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "59", number = "4", pages = "20:1--20:1", month = aug, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2339123.2339128", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 4 13:21:54 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Yi:2012:DIO, author = "Ke Yi", title = "Dynamic Indexability and the Optimality of {B}-Trees", journal = j-J-ACM, volume = "59", number = "4", pages = "21:1--21:19", month = aug, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2339123.2339129", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Sep 4 13:21:54 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "One-dimensional range queries, as one of the most basic type of queries in databases, have been studied extensively in the literature. For large databases, the goal is to build an external index that is optimized for disk block accesses (or I/Os). The problem is well understood in the static case. Theoretically, there exists an index of linear size that can answer a range query in $ O(1 + K B) $ I/Os, where $K$ is the output size and $B$ is the disk block size, but it is highly impractical. In practice, the standard solution is the B-tree, which answers a query in $ O(\log_B N M + K B)$ I/Os on a data set of size $N$, where $M$ is the main memory size. For typical values of $N$, $M$, and $B$, $ \log_B $N$ M$ can be considered a constant. However, the problem is still wide open in the dynamic setting, when insertions and deletions of records are to be supported. With smart buffering, it is possible to speed up updates significantly to $ o(1)$ I/Os amortized. Indeed, several dynamic B-trees have been proposed, but they all cause certain levels of degradation in the query performance, with the most interesting tradeoff point at $ O(1 B \log N M)$ I/Os for updates and $ O(\log N M + K B)$ I/Os for queries. In this article, we prove that the query-update tradeoffs of all the known dynamic B-trees are optimal, when $ \log_B N M$ is a constant. This implies that one should not hope for substantially better solutions for all practical values of the parameters. Our lower bounds hold in a dynamic version of the indexability model, which is of independent interests. Dynamic indexability is a clean yet powerful model for studying dynamic indexing problems, and can potentially lead to more interesting lower bound results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Badanidiyuru:2012:TBN, author = "Ashwinkumar Badanidiyuru and Arpita Patra and Ashish Choudhury and Kannan Srinathan and C. Pandu Rangan", title = "On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission", journal = j-J-ACM, volume = "59", number = "5", pages = "22:1--22:35", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371657", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Perfectly reliable message transmission (PRMT) is one of the fundamental problems in distributed computing. It allows a sender to reliably transmit a message to a receiver in an unreliable network, even in the presence of a computationally unbounded adversary. In this article, we study the inherent trade-off between the three important parameters of the PRMT protocols, namely, the network connectivity ($n$), the round complexity ($r$), and the communication complexity by considering the following generic question (which can be considered as the holy grail problem) in the context of the PRMT protocols. Given an $n$-connected network, a message of size $l$ (to be reliably communicated) and a limit $c$ for the total communication allowed between the sender and the receiver, what is the minimum number of communication rounds required by a PRMT protocol to send the message, such that the communication complexity of the protocol is $ O(c)$ ? We answer this interesting question by deriving a nontrivial lower bound on the round complexity. Moreover, we show that the lower bound is tight in the amortized sense, by designing a PRMT protocol whose round complexity matches the lower bound. The lower bound is the first of its kind, that simultaneously captures the inherent tradeoff between the three important parameters of a PRMT protocol.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Clarkson:2012:SOM, author = "Kenneth L. Clarkson and Elad Hazan and David P. Woodruff", title = "Sublinear optimization for machine learning", journal = j-J-ACM, volume = "59", number = "5", pages = "23:1--23:49", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371658", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article we describe and analyze sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls. Our algorithms can be extended to some kernelized versions of these problems, such as SVDD, hard margin SVM, and L$_2$-SVM, for which sublinear-time algorithms were not known before. These new algorithms use a combination of a novel sampling techniques and a new multiplicative update algorithm. We give lower bounds which show the running times of many of our algorithms to be nearly best possible in the unit-cost RAM model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ambainis:2012:QLL, author = "Andris Ambainis and Julia Kempe and Or Sattath", title = "A quantum {Lov{\'a}sz} local lemma", journal = j-J-ACM, volume = "59", number = "5", pages = "24:1--24:24", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371659", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Lov{\'a}sz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of ``weakly dependent'' criteria. We show that the LLL extends to a much more general geometric setting, where events are replaced with subspaces and probability is replaced with relative dimension, which allows to lower bound the dimension of the intersection of vector spaces under certain independence conditions. Our result immediately applies to the $k$-qsat problem (quantum analog of $k$-sat): For instance we show that any collection of rank-$1$ projectors, with the property that each qubit appears in at most $ 2^k / (e c k)$ of them, has a joint satisfiable state. We then apply our results to the recently studied model of random $k$-qsat. Recent works have shown that the satisfiable region extends up to a density of $1$ in the large $k$ limit, where the density is the ratio of projectors to qubits. Using a hybrid approach building on work by Laumann et al. [2009, 2010] we greatly extend the known satisfiable region for random $k$-qsat to a density of $ \Omega (2^k / k^2)$. Since our tool allows us to show the existence of joint satisfying states without the need to construct them, we are able to penetrate into regions where the satisfying states are conjectured to be entangled, avoiding the need to construct them, which has limited previous approaches to product states.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldberg:2012:APF, author = "Leslie Ann Goldberg and Mark Jerrum", title = "Approximating the partition function of the ferromagnetic {Potts} model", journal = j-J-ACM, volume = "59", number = "5", pages = "25:1--25:31", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371660", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic $q$-state Potts model when $ q > 2$. Specifically, we show that the partition function is hard for the complexity class \#RHPi under approximation-preserving reducibility. Thus, it is as hard to approximate the partition function as it is to find approximate solutions to a wide range of counting problems, including that of determining the number of independent sets in a bipartite graph. Our proof exploits the first-order phase transition of the ``random cluster'' model, which is a probability distribution on graphs that is closely related to the $q$-state Potts model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2012:IAF, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "59", number = "5", pages = "26:1--26:1", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371661", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2012:FPD, author = "Martin Grohe", title = "Fixed-point definability and polynomial time on graphs with excluded minors", journal = j-J-ACM, volume = "59", number = "5", pages = "27:1--27:64", month = oct, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2371656.2371662", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Nov 7 18:15:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a logical characterization of the polynomial-time properties of graphs embeddable in some surface. For every surface $S$, a property $P$ of graphs embeddable in $S$ is decidable in polynomial time if and only if it is definable in fixed-point logic with counting. It is a consequence of this result that for every surface $S$ there is a $k$ such that a simple combinatorial algorithm, namely ``the $k$-dimensional Weisfeiler-Lehman algorithm'', decides isomorphism of graphs embeddable in $S$ in polynomial time. We also present (without proof) generalizations of these results to arbitrary classes of graphs with excluded minors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ostrovsky:2012:ELT, author = "Rafail Ostrovsky and Yuval Rabani and Leonard J. Schulman and Chaitanya Swamy", title = "The effectiveness of {Lloyd}-type methods for the $k$-means problem", journal = j-J-ACM, volume = "59", number = "6", pages = "28:1--28:22", month = dec, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2395116.2395117", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 5 09:36:17 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Special issue text supplied by Joanne Pello.", abstract = "We investigate variants of Lloyd's heuristic for clustering high-dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitioners, and in order to suggest improvements in its application. We propose and justify a clusterability criterion for data sets. We present variants of Lloyd's heuristic that quickly lead to provably near-optimal clustering solutions when applied to well-clusterable instances. This is the first performance guarantee for a variant of Lloyd's heuristic. The provision of a guarantee on output quality does not come at the expense of speed: some of our algorithms are candidates for being faster in practice than currently used variants of Lloyd's method. In addition, our other algorithms are faster on well-clusterable instances than recently proposed approximation algorithms, while maintaining similar guarantees on clustering quality. Our main algorithmic contribution is a novel probabilistic seeding process for the starting configuration of a Lloyd-type iteration.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harsha:2012:IPP, author = "Prahladh Harsha and Adam Klivans and Raghu Meka", title = "An invariance principle for polytopes", journal = j-J-ACM, volume = "59", number = "6", pages = "29:1--29:25", month = dec, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2395116.2395118", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 5 09:36:17 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Special issue text supplied by Joanne Pello.", abstract = "Let $X$ be randomly chosen from $ \{ - 1, 1 \}^n$, and let $Y$ be randomly chosen from the standard spherical Gaussian on $ R^n$. For any (possibly unbounded) polytope $P$ formed by the intersection of $k$ halfspaces, we prove that $ |P r[X \in P] - P r[Y \in P]| \leq \log^{8 / 5} k \cdot \Delta $, where $ \Delta $ is a parameter that is small for polytopes formed by the intersection of ``regular'' halfspaces (i.e., halfspaces with low influence). The novelty of our invariance principle is the polylogarithmic dependence on $k$. Previously, only bounds that were at least linear in $k$ were known. The proof of the invariance principle is based on a generalization of the Lindeberg method for proving central limit theorems and could be of use elsewhere. We give two important applications of our invariance principle, one from learning theory and the other from pseudorandomness. (1) A bound of $ \log^{O(1)} k \cdot \epsilon^{1 / 6}$ on the Boolean noise sensitivity of intersections of $k$ ``regular'' halfspaces (previous work gave bounds linear in $k$). This gives a corresponding agnostic learning algorithm for intersections of regular halfspaces. (2) A pseudorandom generator (PRG) for estimating the Gaussian volume of polytopes with k faces within error $ \delta $ and seed-length $ O(\log n \poly (\log k, 1 / \delta))$. We also obtain PRGs with similar parameters that fool polytopes formed by intersection of regular halfspaces over the hypercube. Using our PRG constructions, we obtain the first deterministic quasi-polynomial time algorithms for approximately counting the number of solutions to a broad class of integer programs, including dense covering problems and contingency tables.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dalvi:2012:DPI, author = "Nilesh Dalvi and Dan Suciu", title = "The dichotomy of probabilistic inference for unions of conjunctive queries", journal = j-J-ACM, volume = "59", number = "6", pages = "30:1--30:87", month = dec, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2395116.2395119", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 5 09:36:17 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Special issue text supplied by Joanne Pello.", abstract = "We study the complexity of computing a query on a probabilistic database. We consider unions of conjunctive queries, UCQ, which are equivalent to positive, existential First Order Logic sentences, and also to nonrecursive datalog programs. The tuples in the database are independent random events. We prove the following dichotomy theorem. For every UCQ query, either its probability can be computed in polynomial time in the size of the database, or is \#P-hard. Our result also has applications to the problem of computing the probability of positive, Boolean expressions, and establishes a dichotomy for such classes based on their structure. For the tractable case, we give a very simple algorithm that alternates between two steps: applying the inclusion/exclusion formula, and removing one existential variable. A key and novel feature of this algorithm is that it avoids computing terms that cancel out in the inclusion/exclusion formula, in other words it only computes those terms whose M{\"o}bius function in an appropriate lattice is nonzero. We show that this simple feature is a key ingredient needed to ensure completeness. For the hardness proof, we give a reduction from the counting problem for positive, partitioned 2CNF, which is known to be \#P-complete. The hardness proof is nontrivial, and combines techniques from logic, classical algebra, and analysis.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cousot:2012:TSS, author = "Patrick Cousot and Radhia Cousot and Laurent Mauborgne", title = "Theories, solvers and static analysis by abstract interpretation", journal = j-J-ACM, volume = "59", number = "6", pages = "31:1--31:56", month = dec, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2395116.2395120", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 5 09:36:17 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Special issue text supplied by Joanne Pello.", abstract = "The algebraic/model theoretic design of static analyzers uses abstract domains based on representations of properties and pre-calculated property transformers. It is very efficient. The logical/proof theoretic approach uses SMT solvers/theorem provers and computation of property transformers on-the-fly. It is very expressive. We propose to unify both approaches, so that they can be combined to reach the sweet spot best adapted to a specific application domain in the precision/cost spectrum. We first give a new formalization of the proof theoretic approach in the abstract interpretation framework, introducing a semantics based on multiple interpretations to deal with the soundness of such approaches. Then we describe how to combine them with any other abstract interpretation-based analysis using an iterated reduction to combine abstractions. The key observation is that the Nelson-Oppen procedure, which decides satisfiability in a combination of logical theories by exchanging equalities and disequalities, computes a reduced product (after the state is enhanced with some new ``observations'' corresponding to alien terms). By abandoning restrictions ensuring completeness (such as disjointness, convexity, stably-infiniteness, or shininess, etc.), we can even broaden the application scope of logical abstractions for static analysis (which is incomplete anyway).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ballard:2012:GEC, author = "Grey Ballard and James Demmel and Olga Holtz and Oded Schwartz", title = "Graph expansion and communication costs of fast matrix multiplication", journal = j-J-ACM, volume = "59", number = "6", pages = "32:1--32:23", month = dec, year = "2012", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2395116.2395121", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 5 09:36:17 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", note = "Special issue text supplied by Joanne Pello.", abstract = "The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs. In the sequential case, where the processor has a fast memory of size $M$, too small to store three $ n \times n$ matrices, the lower bound on the number of words moved between fast and slow memory is, for a large class of matrix multiplication algorithms, $ \Omega ((n / \sqrt M)^{\omega_0} \cdot M)$, where $ \omega_0$ is the exponent in the arithmetic count (e.g., $ \omega_0 = \lg 7$ for Strassen, and $ \omega_0 = 3$ for conventional matrix multiplication). With $p$ parallel processors, each with fast memory of size $M$, the lower bound is asymptotically lower by a factor of $p$. These bounds are attainable both for sequential and for parallel algorithms and hence optimal.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hansen:2013:SIS, author = "Thomas Dueholm Hansen and Peter Bro Miltersen and Uri Zwick", title = "Strategy Iteration Is Strongly Polynomial for $2$-Player Turn-Based Stochastic Games with a Constant Discount Factor", journal = j-J-ACM, volume = "60", number = "1", pages = "1:1--1:16", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432623", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Ye [2011] showed recently that the simplex method with Dantzig's pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after at most {$ O(m n / (1 - \gamma) \log (n / (1 - \gamma))) $} iterations, where $n$ is the number of states, $m$ is the total number of actions in the MDP, and $ 0 < \gamma < 1 $ is the discount factor. We improve Ye's analysis in two respects. First, we improve the bound given by Ye and show that Howard's policy iteration algorithm actually terminates after at most {$ O(m / (1 - \gamma) \log (n / (1 - \gamma))) $} iterations. Second, and more importantly, we show that the same bound applies to the number of iterations performed by the strategy iteration (or strategy improvement) algorithm, a generalization of Howard's policy iteration algorithm used for solving $2$-player turn-based stochastic games with discounted zero-sum rewards. This provides the first strongly polynomial algorithm for solving these games, solving a long standing open problem. Combined with other recent results, this provides a complete characterization of the complexity the standard strategy iteration algorithm for $2$-player turn-based stochastic games; it is strongly polynomial for a fixed discount factor, and exponential otherwise.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sarma:2013:DRW, author = "Atish Das Sarma and Danupon Nanongkai and Gopal Pandurangan and Prasad Tetali", title = "Distributed Random Walks", journal = j-J-ACM, volume = "60", number = "1", pages = "2:1--2:31", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432624", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this article, we focus on the problem of sampling random walks efficiently in a distributed network and its applications. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain random walk samples. All previous algorithms that compute a random walk sample of length $ \ell $ as a subroutine always do so naively, that is, in {$ O(\ell) $} rounds. The main contribution of this article is a fast distributed algorithm for performing random walks. We present a sublinear time distributed algorithm for performing random walks whose time complexity is sublinear in the length of the walk. Our algorithm performs a random walk of length $ \ell $ in {$ \tilde {O}(\sqrt {\ell } D) $} rounds ({$ \tilde {O} $} hides $ \polylog n $ factors where $n$ is the number of nodes in the network) with high probability on an undirected network, where {$D$} is the diameter of the network. For small diameter graphs, this is a significant improvement over the naive {$ O(\ell) $} bound. Furthermore, our algorithm is optimal within a poly-logarithmic factor as there exists a matching lower bound [Nanongkai et al. 2011]. We further extend our algorithms to efficiently perform k independent random walks in {$ \tilde {O}(\sqrt {k \ell } D + k) $} rounds. We also show that our algorithm can be applied to speedup the more general Metropolis--Hastings sampling. Our random-walk algorithms can be used to speed up distributed algorithms in applications that use random walks as a subroutine. We present two main applications. First, we give a fast distributed algorithm for computing a random spanning tree (RST) in an arbitrary (undirected unweighted) network which runs in {$ \tilde {O}(\sqrt m D) $} rounds with high probability ($m$ is the number of edges). Our second application is a fast decentralized algorithm for estimating mixing time and related parameters of the underlying network. Our algorithm is fully decentralized and can serve as a building block in the design of topologically-aware networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harrow:2013:TPS, author = "Aram W. Harrow and Ashley Montanaro", title = "Testing Product States, Quantum {Merlin--Arthur} Games and Tensor Optimization", journal = j-J-ACM, volume = "60", number = "1", pages = "3:1--3:43", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432625", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a test that can distinguish efficiently between product states of n quantum systems and states that are far from product. If applied to a state $ | \psi > $ whose maximum overlap with a product state is $ 1 - \epsilon $, the test passes with probability {$ 1 - \Theta (\epsilon) $}, regardless of $n$ or the local dimensions of the individual systems. The test uses two copies of $ | \psi > $. We prove correctness of this test as a special case of a more general result regarding stability of maximum output purity of the depolarizing channel. A key application of the test is to quantum Merlin--Arthur games with multiple Merlins, where we obtain several structural results that had been previously conjectured, including the fact that efficient soundness amplification is possible and that two Merlins can simulate many Merlins: QMA(k) = QMA(2) for $ k \geq 2 $. Building on a previous result of Aaronson et al., this implies that there is an efficient quantum algorithm to verify $3$-SAT with constant soundness, given two unentangled proofs of {$ \tilde {O}(\sqrt n) $} qubits. We also show how QMA(2) with log-sized proofs is equivalent to a large number of problems, some related to quantum information (such as testing separability of mixed states) as well as problems without any apparent connection to quantum mechanics (such as computing injective tensor norms of $3$-index tensors). As a consequence, we obtain many hardness-of-approximation results, as well as potential algorithmic applications of methods for approximating QMA(2) acceptance probabilities. Finally, our test can also be used to construct an efficient test for determining whether a unitary operator is a tensor product, which is a generalization of classical linearity testing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Batu:2013:TCD, author = "Tugkan Batu and Lance Fortnow and Ronitt Rubinfeld and Warren D. Smith and Patrick White", title = "Testing Closeness of Discrete Distributions", journal = j-J-ACM, volume = "60", number = "1", pages = "4:1--4:25", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432626", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Given samples from two distributions over an $n$-element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in $n$, specifically, {$ O(n^{2 / 3} \epsilon^{ - 8 / 3} \log n) $}, independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small (less than $ \epsilon^{4 / 3} n^{ - 1 / 3} / 32, \epsilon n^{-1 / 2} / 4 $) or large (more than $ \epsilon $) in $ \ell_1 $ distance. This result can be compared to the lower bound of $ \Omega (n^{2 / 3} \epsilon^{ - 2 / 3}) $ for this problem given by Valiant [2008]. Our algorithm has applications to the problem of testing whether a given Markov process is rapidly mixing. We present sublinear algorithms for several variants of this problem as well.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:IAFa, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "60", number = "1", pages = "5:1--5:1", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432627", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Byrka:2013:STA, author = "Jaroslaw Byrka and Fabrizio Grandoni and Thomas Rothvoss and Laura Sanit{\`a}", title = "{Steiner} Tree Approximation via Iterative Randomized Rounding", journal = j-J-ACM, volume = "60", number = "1", pages = "6:1--6:33", month = feb, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2432622.2432628", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Mar 4 16:03:31 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Steiner tree problem is one of the most fundamental NP -hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to 1.55 [Robins and Zelikovsky 2005]. All these algorithms are purely combinatorial. A long-standing open problem is whether there is an LP relaxation of Steiner tree with integrality gap smaller than 2 [Rajagopalan and Vazirani 1999]. In this article we present an LP-based approximation algorithm for Steiner tree with an improved approximation factor. Our algorithm is based on a, seemingly novel, iterative randomized rounding technique. We consider an LP relaxation of the problem, which is based on the notion of directed components. We sample one component with probability proportional to the value of the associated variable in a fractional solution: the sampled component is contracted and the LP is updated consequently. We iterate this process until all terminals are connected. Our algorithm delivers a solution of cost at most $ \ln (4) + \epsilon < 1.39 $ times the cost of an optimal Steiner tree. The algorithm can be derandomized using the method of limited independence. As a by-product of our analysis, we show that the integrality gap of our LP is at most 1.55, hence answering the mentioned open question.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Angelopoulos:2013:PLU, author = "Spyros Angelopoulos and Pascal Schweitzer", title = "Paging and list update under bijective analysis", journal = j-J-ACM, volume = "60", number = "2", pages = "7:1--7:18", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It has long been known that for the paging problem in its standard form, competitive analysis cannot adequately distinguish algorithms based on their performance: there exists a vast class of algorithms that achieve the same competitive ratio, ranging from extremely naive and inefficient strategies (such as Flush-When-Full), to strategies of excellent performance in practice (such as Least-Recently-Used and some of its variants). A similar situation arises in the list update problem: in particular, under the cost formulation studied by Mart{\'\i}nez and Roura [2000] and Munro [2000] every list update algorithm has, asymptotically, the same competitive ratio. Several refinements of competitive analysis, as well as alternative performance measures have been introduced in the literature, with varying degrees of success in narrowing this disconnect between theoretical analysis and empirical evaluation. In this article, we study these two fundamental online problems under the framework of bijective analysis [Angelopoulos et al. 2007, 2008]. This is an intuitive technique that is based on pairwise comparison of the costs incurred by two algorithms on sets of request sequences of the same size. Coupled with a well-established model of locality of reference due to Albers et al. [2005], we show that Least-Recently-Used and Move-to-Front are the unique optimal algorithms for paging and list update, respectively. Prior to this work, only measures based on average-cost analysis have separated LRU and MTF from all other algorithms. Given that bijective analysis is a fairly stringent measure (and also subsumes average-cost analysis), we prove that in a strong sense LRU and MTF stand out as the best (deterministic) algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Balcan:2013:CUA, author = "Maria-Florina Balcan and Avrim Blum and Anupam Gupta", title = "Clustering under approximation stability", journal = j-J-ACM, volume = "60", number = "2", pages = "8:1--8:34", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A common approach to clustering data is to view data objects as points in a metric space, and then to optimize a natural distance-based objective such as the $k$-median, $k$-means, or min-sum score. For applications such as clustering proteins by function or clustering images by subject, the implicit hope in taking this approach is that the optimal solution for the chosen objective will closely match the desired ``target'' clustering (e.g., a correct clustering of proteins by function or of images by who is in them). However, most distance-based objectives, including those mentioned here, are NP-hard to optimize. So, this assumption by itself is not sufficient, assuming P $ \neq $ NP, to achieve clusterings of low-error via polynomial time algorithms. In this article, we show that we can bypass this barrier if we slightly extend this assumption to ask that for some small constant $c$, not only the optimal solution, but also all $c$-approximations to the optimal solution, differ from the target on at most some $ \epsilon $ fraction of points --- we call this $ (c, \epsilon) $-approximation-stability. We show that under this condition, it is possible to efficiently obtain low-error clusterings even if the property holds only for values $c$ for which the objective is known to be NP-hard to approximate. Specifically, for any constant $ c > 1 $, $ (c, \epsilon) $ approximation-stability of $k$-median or $k$-means objectives can be used to efficiently produce a clustering of error {$ O(\epsilon) $} with respect to the target clustering, as can stability of the min-sum objective if the target clusters are sufficiently large. Thus, we can perform nearly as well in terms of agreement with the target clustering as if we could approximate these objectives to this NP-hard value.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Levin:2013:FI, author = "Leonid A. Levin", title = "Forbidden information", journal = j-J-ACM, volume = "60", number = "2", pages = "9:1--9:9", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "G{\"o}del Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, G{\"o}del believed informal arguments can answer any math question.) Closing this loophole does not seem obvious and involves Kolmogorov complexity. (This is unrelated to, well studied before, complexity quantifications of the usual G{\"o}del effects.) I consider extensions {$U$} of the universal partial recursive predicate (or, say, Peano Arithmetic). I prove that any {$U$} either leaves an $n$-bit input (statement) unresolved or contains nearly all information about the $n$-bit prefix of any r.e. real $ \rho $ (which is $n$ bits for some $ \rho $). I argue that creating significant information about a specific math sequence is impossible regardless of the methods used. Similar problems and answers apply to other unsolvability results for tasks allowing multiple solutions, for example, nonrecursive tilings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kolmogorov:2013:CCV, author = "Vladimir Kolmogorov and Stanislav Zivn{\'y}", title = "The complexity of conservative valued {CSPs}", journal = j-J-ACM, volume = "60", number = "2", pages = "10:1--10:38", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the complexity of valued constraint satisfaction problems (VCSPs) parametrized by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimize the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well understood, see Raghavendra [2008]. However, there is no characterization of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimization perspective. We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only $ \{ 0, \infty \} $- valued cost functions (i.e., relations), such languages have been called conservative and studied by Bulatov [2003, 2011] and recently by Barto [2011]. Since we study valued languages, we call a language conservative if it contains all finite - valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [2006] for languages over Boolean domains, by Deineko et al. [2008] for $ \{ 0, 1 \} $ valued languages (a.k.a Max-CSP), and by Takhanov [2010a] for $ \{ 0, \infty \} $-valued languages containing all finite-valued unary cost functions (a.k.a. Min-Cost-Hom).\par We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of {\em STP and MJN multimorphisms\/}), then any instance can be solved in polynomial time (via a new algorithm developed in this article), otherwise the language is NP-hard. This is the first complete complexity classification of {\em general-valued constraint languages\/} over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains are significantly harder than the Boolean cases. The polynomial-time algorithm we present for the tractable cases is a generalization of the submodular minimization problem and a result of Cohen et al. [2008].\par Our results generalize previous results by Takhanov [2010a] and (a subset of results) by Cohen et al. [2006] and Deineko et al. [2008]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [2008], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Georgiou:2013:AG, author = "Chryssis Georgiou and Seth Gilbert and Rachid Guerraoui and Dariusz R. Kowalski", title = "Asynchronous gossip", journal = j-J-ACM, volume = "60", number = "2", pages = "11:1--11:42", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. The algorithmic techniques proposed in this article can be used for improving the message complexity of distributed algorithms that rely on an all-to-all message exchange paradigm and are designed for an asynchronous environment. As an example, we show how to improve the message complexity of asynchronous randomized consensus.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blum:2013:LTA, author = "Avrim Blum and Katrina Ligett and Aaron Roth", title = "A learning theory approach to noninteractive database privacy", journal = j-J-ACM, volume = "60", number = "2", pages = "12:1--12:25", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we demonstrate that, ignoring computational constraints, it is possible to release synthetic databases that are useful for accurately answering large classes of queries while preserving differential privacy. Specifically, we give a mechanism that privately releases synthetic data useful for answering a class of queries over a discrete domain with error that grows as a function of the size of the smallest net approximately representing the answers to that class of queries. We show that this in particular implies a mechanism for counting queries that gives error guarantees that grow only with the VC-dimension of the class of queries, which itself grows at most logarithmically with the size of the query class. We also show that it is not possible to release even simple classes of queries (such as intervals and their generalizations) over continuous domains with worst-case utility guarantees while preserving differential privacy. In response to this, we consider a relaxation of the utility guarantee and give a privacy preserving polynomial time algorithm that for any halfspace query will provide an answer that is accurate for some small perturbation of the query. This algorithm does not release synthetic data, but instead another data structure capable of representing an answer for each query. We also give an efficient algorithm for releasing synthetic data for the class of interval queries and axis-aligned rectangles of constant dimension over discrete domains.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Seshadhri:2013:DAS, author = "C. Seshadhri and Ali Pinar and Tamara G. Kolda", title = "An in-depth analysis of stochastic {Kronecker} graphs", journal = j-J-ACM, volume = "60", number = "2", pages = "13:1--13:32", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Graph analysis is playing an increasingly important role in science and industry. Due to numerous limitations in sharing real-world graphs, models for generating massive graphs are critical for developing better algorithms. In this article, we analyze the stochastic Kronecker graph model (SKG), which is the foundation of the Graph500 supercomputer benchmark due to its favorable properties and easy parallelization. Our goal is to provide a deeper understanding of the parameters and properties of this model so that its functionality as a benchmark is increased. We develop a rigorous mathematical analysis that shows this model cannot generate a power-law distribution or even a lognormal distribution. However, we formalize an enhanced version of the SKG model that uses random noise for smoothing. We prove both in theory and in practice that this enhancement leads to a lognormal distribution. Additionally, we provide a precise analysis of isolated vertices, showing that the graphs that are produced by SKG might be quite different than intended. For example, between 50\% and 75\% of the vertices in the Graph500 benchmarks will be isolated. Finally, we show that this model tends to produce extremely small core numbers (compared to most social networks and other real graphs) for common parameter choices.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:IAFb, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "60", number = "2", pages = "14:1--14:1", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ameloot:2013:RTD, author = "Tom J. Ameloot and Frank Neven and Jan {Van Den Bussche}", title = "Relational transducers for declarative networking", journal = j-J-ACM, volume = "60", number = "2", pages = "15:1--15:38", month = apr, year = "2013", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri May 24 16:19:11 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for ``eventually consistent'' distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class of ``oblivious'' transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Drmota:2013:MTD, author = "Michael Drmota and Wojciech Szpankowski", title = "A Master Theorem for Discrete Divide and Conquer Recurrences", journal = j-J-ACM, volume = "60", number = "3", pages = "16:1--16:49", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2487241.2487242", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Divide-and-conquer recurrences are one of the most studied equations in computer science. Yet, discrete versions of these recurrences, namely for some known sequence $ a_n $ and given $ b_j $, $ b_j $, $ p_j $ and $ \delta_j $, $ \delta_j $, present some challenges. The discrete nature of this recurrence (represented by the floor and ceiling functions) introduces certain oscillations not captured by the traditional Master Theorem, for example due to Akra and Bazzi [1998] who primary studied the continuous version of the recurrence. We apply powerful techniques such as Dirichlet series, Mellin-Perron formula, and (extended) Tauberian theorems of Wiener-Ikehara to provide a complete and precise solution to this basic computer science recurrence. We illustrate applicability of our results on several examples including a popular and fast arithmetic coding algorithm due to Boncelet for which we estimate its average redundancy and prove the Central Limit Theorem for the phrase length. To the best of our knowledge, discrete divide and conquer recurrences were not studied in this generality and such detail; in particular, this allows us to compare the redundancy of Boncelet's algorithm to the (asymptotically) optimal Tunstall scheme.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goyal:2013:VCT, author = "Navin Goyal and Neil Olver and F. Bruce Shepherd", title = "The {VPN} Conjecture Is True", journal = j-J-ACM, volume = "60", number = "3", pages = "17:1--17:17", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2487241.2487243", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the following network design problem. We are given an undirected graph $ G = (V, E) $ with edge costs $ c(e) $ and a set of terminal nodes $ W \subseteq V $. A hose demand matrix is any symmetric matrix $D$, indexed by the terminals, such that for each $ i \in W$, $ \sum_{j \neq i} D_{ij} \leq 1$. We must compute the minimum-cost edge capacities that are able to support the oblivious routing of every hose matrix in the network. An oblivious routing template, in this context, is a simple path $ P_{ij}$ for each pair $ i, j \in W$. Given such a template, if we are to route a demand matrix $D$, then for each $ i, j$, we send $ D_{ij}$ units of flow along each $ P_{ij}$. Fingerhut et al. [1997] and Gupta et al. [2001] obtained a 2-approximation for this problem, using a solution template in the form of a tree. It has been widely asked and subsequently conjectured [Italiano et al. 2006] that this solution actually results in the optimal capacity for the single-path VPN design problem; this has become known as the VPN Conjecture. The conjecture has previously been proven for some restricted classes of graphs [Fingerhut et al. 1997; Fiorini et al. 2007; Grandoni et al. 2008; Hurkens et al. 2007]. Our main theorem establishes that this conjecture is true in general graphs. This also has the implication that the single-path VPN problem is solvable in polynomial time. A natural fractional version of the conjecture had also been proposed [Hurkens et al. 2007]. In this version, the routing may split flow between many paths, in specified proportions. We demonstrate that this multipath version of the conjecture is in fact false. The multipath and single path versions of the VPN problem are essentially direct analogues of the randomized and nonrandomized versions of oblivious routing schemes for minimizing congestion for permutation routing [Borodin and Hopcroft 1982; Valiant 1982].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Banerjee:2013:LRGa, author = "Anindya Banerjee and David A. Naumann and Stan Rosenberg", title = "Local Reasoning for Global Invariants, {Part I}: Region Logic", journal = j-J-ACM, volume = "60", number = "3", pages = "18:1--18:56", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2485982", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Dedicated to the memory of Stephen L. Bloom (1940--2010). Shared mutable objects pose grave challenges in reasoning, especially for information hiding and modularity. This article presents a novel technique for reasoning about error-avoiding partial correctness of programs featuring shared mutable objects, and investigates the technique by formalizing a logic. Using a first-order assertion language, the logic provides heap-local reasoning about mutation and separation, via ghost fields and variables of type ``region'' (finite sets of object references). A new form of frame condition specifies write, read, and allocation effects using region expressions; this supports a frame rule that allows a command to read state on which the framed predicate depends. Soundness is proved using a standard program semantics. The logic facilitates heap-local reasoning about object invariants, as shown here by examples. Part II of this article extends the logic with second-order framing which formalizes the hiding of data invariants.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Banerjee:2013:LRGb, author = "Anindya Banerjee and David A. Naumann", title = "Local Reasoning for Global Invariants, {Part II}: Dynamic Boundaries", journal = j-J-ACM, volume = "60", number = "3", pages = "19:1--19:73", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2485981", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Dedicated to the memory of John C. Reynolds (1935--2013). The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. The mismatch is sound if the invariants depend only on encapsulated state, but encapsulation is problematic in contemporary software due to the many uses of shared mutable objects. The mismatch is formalized here in a proof rule that achieves flexibility via explicit restrictions on client effects, expressed using ghost state and ordinary first order assertions. The restrictions amount to a stateful frame condition that must be satisfied by any client; this dynamic encapsulation boundary complements conventional scope-based encapsulation. The technical development is based on a companion article, Part I, that presents Region Logic---a programming logic with stateful frame conditions for commands.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kobayashi:2013:MCH, author = "Naoki Kobayashi", title = "Model Checking Higher-Order Programs", journal = j-J-ACM, volume = "60", number = "3", pages = "20:1--20:62", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2487241.2487246", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We propose a novel verification method for higher-order functional programs based on higher-order model checking, or more precisely, model checking of higher-order recursion schemes (recursion schemes, for short). The most distinguishing feature of our verification method for higher-order programs is that it is sound, complete, and automatic for the simply typed $ \lambda $-calculus with recursion and finite base types, and for various program verification problems such as reachability, flow analysis, and resource usage verification. We first show that a variety of program verification problems can be reduced to model checking problems for recursion schemes, by transforming a program into a recursion scheme that generates a tree representing all the interesting possible event sequences of the program. We then develop a new type-based model-checking algorithm for recursion schemes and implement a prototype recursion scheme model checker. To our knowledge, this is the first implementation of a recursion scheme model checker. Experiments show that our model checker is reasonably fast, despite the worst-case time complexity of recursion scheme model checking being hyperexponential in general. Altogether, the results provide a new, promising approach to verification of higher-order functional programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:IAFc, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "60", number = "3", pages = "21:1--21:1", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2487241.2487247", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sevcik:2013:CVC, author = "Jaroslav Sevc{\'\i}k and Viktor Vafeiadis and Francesco Zappa Nardelli and Suresh Jagannathan and Peter Sewell", title = "{CompCertTSO}: a Verified Compiler for Relaxed-Memory Concurrency", journal = j-J-ACM, volume = "60", number = "3", pages = "22:1--22:50", month = jun, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2487241.2487248", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Jul 1 18:32:21 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation on x86 multiprocessors. The design of such a language is made surprisingly subtle by several factors: the relaxed-memory behavior of the hardware, the effects of compiler optimization on concurrent code, the need to support high-performance concurrent algorithms, and the desire for a reasonably simple programming model. In turn, this complexity makes verified compilation both essential and challenging. We describe ClightTSO, a concurrent extension of CompCert's Clight in which the TSO-based memory model of x86 multiprocessors is exposed for high-performance code, and CompCertTSO, a formally verified compiler from ClightTSO to x86 assembly language, building on CompCert. CompCertTSO is verified in Coq: for any well-behaved and successfully compiled ClightTSO source program, any permitted observable behavior of the generated assembly code (if it does not run out of memory) is also possible in the source semantics. We also describe some verified fence-elimination optimizations, integrated into CompCertTSO.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Godoy:2013:HPD, author = "Guillem Godoy and Omer Gim{\'e}nez", title = "The {HOM} problem is decidable", journal = j-J-ACM, volume = "60", number = "4", pages = "23:1--23:44", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2501600", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We close affirmatively a question that has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism {$H$} and a regular tree language {$L$} represented by a tree automaton, whether {$ H(L) $} is regular. In order to decide the HOM problem, we develop new constructions and techniques that are interesting by themselves, and provide several significant intermediate results. For example, we prove that the universality problem is decidable for languages represented by tree automata with equality constraints, and that the equivalence and inclusion problems are decidable for images of regular languages through tree homomorphisms. Our contributions are based on the following new constructions. We describe a simple transformation for converting a tree automaton with equality constraints into a tree automaton with disequality constraints recognizing the complementary language. We also define a new class of tree automata with arbitrary disequality constraints and a particular kind of equality constraints. An automaton of this new class essentially recognizes the intersection of a tree automaton with disequality constraints and the image of a regular language through a tree homomorphism. We prove decidability of emptiness and finiteness for this class by a pumping mechanism. We combine the above constructions adequately to provide an algorithm deciding the HOM problem. This is the journal version of a paper presented in the 42nd ACM Symposium on Theory of Computing (STOC 2010). Here, we provide all proofs and examples. Moreover, we obtain better complexity results via the modification of some proofs and a careful complexity analysis. In particular, the obtained time complexity for the decision of HOM is a tower of three exponentials.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2013:DCA, author = "Georg Gottlob and Gianluigi Greco", title = "Decomposing combinatorial auctions and set packing problems", journal = j-J-ACM, volume = "60", number = "4", pages = "24:1--24:39", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2505987", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Combinatorial auctions allow bidders to bid on bundles of items rather than just on single items. The winner determination problem in combinatorial auctions is the problem of determining the allocation of items to bidders such that the sum of the accepted bid prices is maximized. This problem is equivalent to the well-known maximum-weight set packing problem. Even though these problems are NP-hard in general, they can be solved in polynomial time on instances whose associated item graphs have bounded treewidth (called structured item graphs). However, the tractability of determining whether for a given problem instance a structured item graph of fixed treewidth exists (and if so, computing one efficiently) was an open problem. In this article, we solve this problem by proving that deciding the existence of structured item graphs is computationally intractable, even for treewidth 3. Motivated by this unfavorable complexity result, we investigate other structural restrictions, and we show that the notion of hypertree decomposition, a well-studied measure of hypergraph cyclicity, turns out to be most useful here. Indeed, we show that the winner determination problem is solvable in polynomial time on instances whose dual auction hypergraphs have bounded hypertree width. Our solution method is based on encoding winner determination via a constraint satisfaction optimization problem and on exhibiting an algorithm to solve this latter problem efficiently for such structurally restricted instances. The class of tractable instances identified by our approach, while being efficiently recognizable, properly contains the class of instances having a structured item graph. Moreover, on the larger class, our method solves winner determination with the same asymptotic complexity as the best algorithm proposed in the literature for the subclass of structured item graphs. Hypertree decompositions can equally profitably be applied to the maximum-weight independent set problem, which is the dual problem of maximum-weight set packing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alon:2013:MSN, author = "Noga Alon and Raphael Yuster", title = "Matrix sparsification and nested dissection over arbitrary fields", journal = j-J-ACM, volume = "60", number = "4", pages = "25:1--25:18", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2505989", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The generalized nested dissection method, developed by Lipton et al. [1979], is a seminal method for solving a linear system Ax = b where A is a symmetric positive definite matrix. The method runs extremely fast whenever A is a well-separable matrix (such as matrices whose underlying support is planar or avoids a fixed minor). In this work, we extend the nested dissection method to apply to any nonsingular well-separable matrix over any field. The running times we obtain essentially match those of the nested dissection method. An important tool is a novel method for matrix sparsification that preserves determinants and minors, and that guarantees that constant powers of the sparsified matrix remain sparse.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Peres:2013:APS, author = "Yuval Peres and Dmitry Sotnikov and Benny Sudakov and Uri Zwick", title = "All-pairs shortest paths in {$ O(n^2) $} time with high probability", journal = j-J-ACM, volume = "60", number = "4", pages = "26:1--26:25", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2505988", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present an all-pairs shortest path algorithm whose running time on a complete directed graph on n vertices whose edge weights are chosen independently and uniformly at random from $ [0, 1] $ is {$ O(n^2) $}, in expectation and with high probability. This resolves a long-standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano [2006]. The analysis relies on a proof that the number of locally shortest paths in such randomly weighted graphs is {$ O(n^2) $}, in expectation and with high probability. We also present a dynamic version of the algorithm that recomputes all shortest paths after a random edge update in {$ O(\log^2 n) $} expected time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:IAFd, author = "Victor Vianu", title = "Invited articles foreword", journal = j-J-ACM, volume = "60", number = "4", pages = "27:1--27:1", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2508028.2508032", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arenas:2013:DEB, author = "Marcelo Arenas and Jorge P{\'e}rez and Juan Reutter", title = "Data exchange beyond complete data", journal = j-J-ACM, volume = "60", number = "4", pages = "28:1--28:59", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2505985", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural for a typical database translation scenario, this restriction is gradually becoming an impediment to the development of a wide range of applications that need to exchange objects that admit several interpretations. In particular, we are motivated by two specific applications that go beyond the usual data exchange scenario: exchanging incomplete information and exchanging knowledge bases. In this article, we propose a general framework for data exchange that can deal with these two applications. More specifically, we address the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances. We make use of the classical semantics of mappings specified by sets of logical sentences to give a meaningful semantics to the notion of exchanging representatives, from which the standard notions of solution, space of solutions, and universal solution naturally arise. We also introduce the notion of strong representation system for a class of mappings, that resembles the concept of strong representation system for a query language. We show the robustness of our proposal by applying it to the two applications mentioned above: exchanging incomplete information and exchanging knowledge bases, which are both instantiations of the exchanging problem for representation systems. We study these two applications in detail, presenting results regarding expressiveness, query answering and complexity of computing solutions, and also algorithms to materialize solutions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Laird:2013:GSP, author = "J. Laird", title = "Game semantics for a polymorphic programming language", journal = j-J-ACM, volume = "60", number = "4", pages = "29:1--29:27", month = aug, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2505986", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Sep 19 18:01:04 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents a game semantics for higher-rank polymorphism, leading to a new model of the calculus System F, and a programming language which extends it with mutable variables. In contrast to previous game models of polymorphism, it is quite concrete, extending existing categories of games by a simple development of the notion of question/answer labelling and the associated bracketing condition to represent ``copycat links'' between positive and negative occurrences of type variables. Some well-known System F encodings of type constructors correspond in our model to simple constructions on games, such as the lifted sum. We characterize the generic types of our model (those for which instantiation reflects denotational equivalence), and show how to construct an interpretation in which all types are generic. We show how mutable variables ({\`a} la Scheme) may be interpreted in our model, allowing the definition of polymorphic objects with local state. By proving definability of finitary elements in this model using a decomposition argument, we establish a full abstraction result.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:EJR, author = "Victor Vianu", title = "Editorial: {JACM} redux", journal = j-J-ACM, volume = "60", number = "5", pages = "30:1--30:2", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528384.2528385", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cheung:2013:FMR, author = "Ho Yee Cheung and Tsz Chiu Kwok and Lap Chi Lau", title = "Fast matrix rank algorithms and applications", journal = j-J-ACM, volume = "60", number = "5", pages = "31:1--31:25", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528404", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the problem of computing the rank of an $ m \times n $ matrix {$A$} over a field. We present a randomized algorithm to find a set of {$ r = \rank (A) $} linearly independent columns in {$ {\~ O} (| A | + r^\omega) $} field operations, where {$ | A | $} denotes the number of nonzero entries in {$A$} and $ \omega < 2.38 $ is the matrix multiplication exponent. Previously the best known algorithm to find a set of $r$ linearly independent columns is by Gaussian elimination, with deterministic running time {$ O(m n r^{\omega - 2}) $}. Our algorithm is faster when $ r < \max \{ m, n \} $, for instance when the matrix is rectangular. We also consider the problem of computing the rank of a matrix dynamically, supporting the operations of rank one updates and additions and deletions of rows and columns. We present an algorithm that updates the rank in {$ {\~ O}(m n) $} field operations. We show that these algorithms can be used to obtain faster algorithms for various problems in exact linear algebra, combinatorial optimization and dynamic data structure.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bulatov:2013:EFB, author = "Andrei A. Bulatov and Martin Dyer and Leslie Ann Goldberg and Mark Jerrum and Colin Mcquillan", title = "The expressibility of functions on the {Boolean} domain, with applications to counting {CSPs}", journal = j-J-ACM, volume = "60", number = "5", pages = "32:1--32:36", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528401", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post's lattice gives a complete classification of all Boolean relational clones, and this has been used to classify the computational difficulty of CSPs. Motivated by a desire to understand the computational complexity of (weighted) counting CSPs, we develop an analogous notion of functional clones and study the landscape of these clones. One of these clones is the collection of log-supermodular (lsm) functions, which turns out to play a significant role in classifying counting CSPs. In the conservative case (where all nonnegative unary functions are available), we show that there are no functional clones lying strictly between the clone of lsm functions and the total clone (containing all functions). Thus, any counting CSP that contains a single nontrivial non-lsm function is computationally as hard to approximate as any problem in \#P. Furthermore, we show that any nontrivial functional clone (in a sense that will be made precise) contains the binary function ``implies''. As a consequence, in the conservative case, all nontrivial counting CSPs are as hard to approximate as \#BIS, the problem of counting independent sets in a bipartite graph. Given the complexity-theoretic results, it is natural to ask whether the ``implies'' clone is equivalent to the clone of lsm functions. We use the M{\"o}bius transform and the Fourier transform to show that these clones coincide precisely up to arity 3. It is an intriguing open question whether the lsm clone is finitely generated. Finally, we investigate functional clones in which only restricted classes of unary functions are available.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Saxena:2013:SGC, author = "Nitin Saxena and C. Seshadhri", title = "From {Sylvester--Gallai} configurations to rank bounds: Improved blackbox identity test for depth-$3$ circuits", journal = j-J-ACM, volume = "60", number = "5", pages = "33:1--33:33", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528403", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the problem of identity testing for depth-3 circuits of top fanin $k$ and degree $d$. We give a new structure theorem for such identities that improves the known deterministic {$ d^{k^{O(k)}} $}-time blackbox identity test over rationals [Kayal and Saraf, 2009] to one that takes {$ d^{O(k^2)} $}-time. Our structure theorem essentially says that the number of independent variables in a real depth-3 identity is very small. This theorem affirmatively settles the strong rank conjecture posed by Dvir and Shpilka [2006]. We devise various algebraic tools to study depth-3 identities, and use these tools to show that any depth-3 identity contains a much smaller nucleus identity that contains most of the ``complexity'' of the main identity. The special properties of this nucleus allow us to get near optimal rank bounds for depth-3 identities. The most important aspect of this work is relating a field-dependent quantity, the Sylvester-Gallai rank bound, to the rank of depth-3 identities. We also prove a high-dimensional Sylvester--Gallai theorem for all fields, and get a general depth-3 identity rank bound (slightly improving previous bounds).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bulatov:2013:CCC, author = "Andrei A. Bulatov", title = "The complexity of the counting constraint satisfaction problem", journal = j-J-ACM, volume = "60", number = "5", pages = "34:1--34:41", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528400", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Counting Constraint Satisfaction Problem (\#CSP($H$)) over a finite relational structure $H$ can be expressed as follows: given a relational structure $G$ over the same vocabulary, determine the number of homomorphisms from $G$ to $H$. In this article we characterize relational structures $H$ for which (\#CSP($H$)) can be solved in polynomial time and prove that for all other structures the problem is \#P-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fraigniaud:2013:TCT, author = "Pierre Fraigniaud and Amos Korman and David Peleg", title = "Towards a complexity theory for local distributed computing", journal = j-J-ACM, volume = "60", number = "5", pages = "35:1--35:26", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2499228", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A central theme in distributed network algorithms concerns understanding and coping with the issue of locality. Yet despite considerable progress, research efforts in this direction have not yet resulted in a solid basis in the form of a fundamental computational complexity theory for locality. Inspired by sequential complexity theory, we focus on a complexity theory for distributed decision problems. In the context of locality, solving a decision problem requires the processors to independently inspect their local neighborhoods and then collectively decide whether a given global input instance belongs to some specified language. We consider the standard LOCAL model of computation and define LD(t) (for local decision) as the class of decision problems that can be solved in t communication rounds. We first study the intriguing question of whether randomization helps in local distributed computing, and to what extent. Specifically, we define the corresponding randomized class BPLD(t, p, q), containing all languages for which there exists a randomized algorithm that runs in t rounds, accepts correct instances with probability at least $p$, and rejects incorrect ones with probability at least $q$. We show that $ p^2 + q = 1 $ is a threshold for the containment of LD(t) in BPLD(t, p, q). More precisely, we show that there exists a language that does not belong to LD(t) for any $ t = o (n) $ but does belong to BPLD(0, p, q) for any $ p, q \in (0, 1) $ such that $ p^2 + q \leq 1 $. On the other hand, we show that, restricted to hereditary languages, BPLD(t, p, q) = LD(O (t)), for any function $t$, and any $ p, q \in (0, 1) $ such that $ p^2 + q > 1 $. In addition, we investigate the impact of nondeterminism on local decision, and establish several structural results inspired by classical computational complexity theory. Specifically, we show that nondeterminism does help, but that this help is limited, as there exist languages that cannot be decided locally nondeterministically. Perhaps surprisingly, it turns out that it is the combination of randomization with nondeterminism that enables to decide all languages in constant time. Finally, we introduce the notion of local reduction, and establish a couple of completeness results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dvorak:2013:TFO, author = "Zdenek Dvor{\'a}k and Daniel Kr{\'a}l and Robin Thomas", title = "Testing first-order properties for subclasses of sparse graphs", journal = j-J-ACM, volume = "60", number = "5", pages = "36:1--36:24", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2499483", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nesetril and Ossona de Mendez. This generalizes several results from the literature, because many natural classes of graphs have bounded expansion: graphs of bounded tree-width, all proper minor-closed classes of graphs, graphs of bounded degree, graphs with no subgraph isomorphic to a subdivision of a fixed graph, and graphs that can be drawn in a fixed surface in such a way that each edge crosses at most a constant number of other edges. We deduce that there is an almost linear-time algorithm for deciding FO properties in classes of graphs with locally bounded expansion. More generally, we design a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion. After a linear-time initialization the data structure allows us to test an FO property in constant time, and the data structure can be updated in constant time after addition\slash deletion of an edge, provided the list of possible edges to be added is known in advance and their simultaneous addition results in a graph in the class. All our results also hold for relational structures and are based on the seminal result of Nesetril and Ossona de Mendez on the existence of low tree-depth colorings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kolaitis:2013:RGP, author = "Phokion G. Kolaitis and Swastik Kopparty", title = "Random graphs and the parity quantifier", journal = j-J-ACM, volume = "60", number = "5", pages = "37:1--37:34", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528402", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The classical zero-one law for first-order logic on random graphs says that for every first-order property $ \varphi $ in the theory of graphs and every $ p \in (0, 1) $, the probability that the random graph {$ G (n, p) $} satisfies $ \varphi $ approaches either $0$ or $1$ as $n$ approaches infinity. It is well known that this law fails to hold for any formalism that can express the parity quantifier: for certain properties, the probability that {$ G (n, p) $} satisfies the property need not converge, and for others the limit may be strictly between 0 and 1.\par In this work, we capture the limiting behavior of properties definable in first order logic augmented with the parity quantifier, FO[ \positionindicator ], over {$ G (n, p) $}, thus eluding the above hurdles. Specifically, we establish the following ``modular convergence law''.\par For every FO[ \positionindicator ] sentence $ \varphi $, there are two explicitly computable rational numbers $ a_0 $, $ a_1 $, such that for $ i \in \{ 0, 1 \} $, as $n$ approaches infinity, the probability that the random graph {$ G (2 n + i, p) $} satisfies $ \varphi $ approaches $ a_i $.\par Our results also extend appropriately to FO equipped with {$ {\rm Mod}_q $} quantifiers for prime $q$.\par In the process of deriving this theorem, we explore a new question that may be of interest in its own right. Specifically, we study the joint distribution of the subgraph statistics modulo $2$ of {$ G (n, p) $}: namely, the number of copies, mod 2, of a fixed number of graphs F$_1$, \ldots{}, F$_l$ of bounded size in G ( n, p). We first show that every FO[\positionindicator] property \varphi is almost surely determined by subgraph statistics modulo 2 of the above type. Next, we show that the limiting joint distribution of the subgraph statistics modulo 2 depends only on n mod 2, and we determine this limiting distribution completely. Interestingly, both these steps are based on a common technique using multivariate polynomials over finite fields and, in particular, on a new generalization of the Gowers norm.\par The first step is analogous to the Razborov--Smolensky method for lower bounds for AC$^0$ with parity gates, yet stronger in certain ways. For instance, it allows us to obtain examples of simple graph properties that are exponentially uncorrelated with every FO[ \positionindicator ] sentence, which is something that is not known for AC$^0$ [ \positionindicator ].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2013:IAFe, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "60", number = "5", pages = "38:1--38:1", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528384.2528386", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goos:2013:LBL, author = "Mika G{\"o}{\"o}s and Juho Hirvonen and Jukka Suomela", title = "Lower bounds for local approximation", journal = j-J-ACM, volume = "60", number = "5", pages = "39:1--39:23", month = oct, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2528405", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 30 15:06:57 MDT 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the study of deterministic distributed algorithms, it is commonly assumed that each node has a unique {$ O(\log n) $}-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and orientation is sufficient. Our result holds for so-called simple PO- checkable graph optimisation problems; this includes many classical packing and covering problems such as vertex covers, edge covers, matchings, independent sets, dominating sets, and edge dominating sets. We focus on the case of bounded-degree graphs and show that if a local algorithm finds a constant-factor approximation of a simple PO-checkable graph problem with the help of unique identifiers, then the same approximation ratio can be achieved on anonymous networks. As a corollary of our result, we derive a tight lower bound on the local approximability of the minimum edge dominating set problem. By prior work, there is a deterministic local algorithm that achieves the approximation factor of {$ 4 - 1 / \lfloor \Delta / 2 \rfloor $} in graphs of maximum degree {$ \Delta $} . This approximation ratio is known to be optimal in the port-numbering model-our main theorem implies that it is optimal also in the standard model in which each node has a unique identifier. Our main technical tool is an algebraic construction of homogeneously ordered graphs: We say that a graph is $ (\alpha, r) $-homogeneous if its nodes are linearly ordered so that an $ \alpha $ fraction of nodes have pairwise isomorphic radius-$r$ neighbourhoods. We show that there exists a finite $ (\alpha, r) $-homogeneous $ 2^k $ -regular graph of girth at least $g$ for any $ \alpha < 1 $ and any $r$, $k$, and $g$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raz:2013:TRL, author = "Ran Raz", title = "Tensor-Rank and Lower Bounds for Arithmetic Formulas", journal = j-J-ACM, volume = "60", number = "6", pages = "40:1--40:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2535928", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that any explicit example for a tensor A: [ n ]$^r$ - > F with tensor-rank \geq n$^{rc(1 - o(1))}$, where r = r (n) < = log n /log log n is super-constant, implies an explicit super-polynomial lower bound for the size of general arithmetic formulas over F. This shows that strong enough lower bounds for the size of arithmetic formulas of depth 3 imply super-polynomial lower bounds for the size of general arithmetic formulas. One component of our proof is a new approach for homogenization and multilinearization of arithmetic formulas, that gives the following results: We show that for any n -variate homogeneous polynomial f of degree r, if there exists a (fanin-2) formula of size s and depth d for f then there exists a homogeneous formula of size O ((d + r +1 r) c s) for f. In particular, for any r < = O (log n), if there exists a polynomial size formula for f then there exists a polynomial size homogeneous formula for f. This refutes a conjecture of Nisan and Wigderson [1996] and shows that super-polynomial lower bounds for homogeneous formulas for polynomials of small degree imply super-polynomial lower bounds for general formulas. We show that for any n -variate set-multilinear polynomial f of degree r, if there exists a (fanin-2) formula of size s and depth d for f, then there exists a set-multilinear formula of size O ((d + 2)$^r$ c s) for f. In particular, for any r < = O (log n /log log n), if there exists a polynomial size formula for f then there exists a polynomial size set-multilinear formula for f. This shows that super-polynomial lower bounds for set-multilinear formulas for polynomials of small degree imply super-polynomial lower bounds for general formulas.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chazal:2013:PBC, author = "Fr{\'e}d{\'e}ric Chazal and Leonidas J. Guibas and Steve Y. Oudot and Primoz Skraba", title = "Persistence-Based Clustering in {Riemannian} Manifolds", journal = j-J-ACM, volume = "60", number = "6", pages = "41:1--41:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2535927", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-based hill-climbing scheme, the novelty of our approach resides in its use of topological persistence to guide the merging of clusters. Our algorithm provides additional feedback in the form of a set of points in the plane, called a persistence diagram (PD), which provably reflects the prominences of the modes of the density. In practice, this feedback enables the user to choose relevant parameter values, so that under mild sampling conditions the algorithm will output the correct number of clusters, a notion that can be made formally sound within persistence theory. In addition, the output clusters have the property that their spatial locations are bound to the ones of the basins of attraction of the peaks of the density. The algorithm only requires rough estimates of the density at the data points, and knowledge of (approximate) pairwise distances between them. It is therefore applicable in any metric space. Meanwhile, its complexity remains practical: although the size of the input distance matrix may be up to quadratic in the number of data points, a careful implementation only uses a linear amount of memory and takes barely more time to run than to read through the input.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Marx:2013:THP, author = "D{\'a}niel Marx", title = "Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries", journal = j-J-ACM, volume = "60", number = "6", pages = "42:1--42:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2535926", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (that is, where each constraint involves only two variables), the situation is well understood: the complexity of the problem essentially depends on the treewidth of the graph of the constraints [Grohe 2007; Marx 2010b]. However, this is not the correct answer if constraints with unbounded number of variables are allowed, and in particular, for CSP instances arising from query evaluation problems in database theory. Formally, if H is a class of hypergraphs, then let CSP(H) be CSP restricted to instances whose hypergraph is in H. Our goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables. Note that in the applications related to database query evaluation, we usually assume that the number of variables is much smaller than the size of the instance, thus parameterization by the number of variables is a meaningful question. The most general known property of H that makes CSP(H) polynomial-time solvable is bounded fractional hypertree width. Here we introduce a new hypergraph measure called submodular width, and show that bounded submodular width of H (which is a strictly more general property than bounded fractional hypertree width) implies that CSP(H) is fixed-parameter tractable. In a matching hardness result, we show that if H has unbounded submodular width, then CSP(H) is not fixed-parameter tractable (and hence not polynomial-time solvable), unless the Exponential Time Hypothesis (ETH) fails. The algorithmic result uses tree decompositions in a novel way: instead of using a single decomposition depending on the hypergraph, the instance is split into a set of instances (all on the same set of variables as the original instance), and then the new instances are solved by choosing a different tree decomposition for each of them. The reason why this strategy works is that the splitting can be done in such a way that the new instances are ``uniform'' with respect to the number extensions of partial solutions, and therefore the number of partial solutions can be described by a submodular function. For the hardness result, we prove via a series of combinatorial results that if a hypergraph H has large submodular width, then a 3SAT instance can be efficiently simulated by a CSP instance whose hypergraph is H. To prove these combinatorial results, we need to develop a theory of (multicommodity) flows on hypergraphs and vertex separators in the case when the function b (S) defining the cost of separator S is submodular, which can be of independent interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lyubashevsky:2013:ILL, author = "Vadim Lyubashevsky and Chris Peikert and Oded Regev", title = "On Ideal Lattices and Learning with Errors over Rings", journal = j-J-ACM, volume = "60", number = "6", pages = "43:1--43:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2535925", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The ``learning with errors'' (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount of noise, from truly uniform ones. The problem has been shown to be as hard as worst-case lattice problems, and in recent years it has served as the foundation for a plethora of cryptographic applications. Unfortunately, these applications are rather inefficient due to an inherent quadratic overhead in the use of LWE. A main open question was whether LWE and its applications could be made truly efficient by exploiting extra algebraic structure, as was done for lattice-based hash functions (and related primitives). We resolve this question in the affirmative by introducing an algebraic variant of LWE called ring-LWE, and proving that it too enjoys very strong hardness guarantees. Specifically, we show that the ring-LWE distribution is pseudorandom, assuming that worst-case problems on ideal lattices are hard for polynomial-time quantum algorithms. Applications include the first truly practical lattice-based public-key cryptosystem with an efficient security reduction; moreover, many of the other applications of LWE can be made much more efficient through the use of ring-LWE.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fawzi:2013:LDN, author = "Omar Fawzi and Patrick Hayden and Pranab Sen", title = "From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking", journal = j-J-ACM, volume = "60", number = "6", pages = "44:1--44:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2518131", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The existence of quantum uncertainty relations is the essential reason that some classically unrealizable cryptographic primitives become realizable when quantum communication is allowed. One operational manifestation of these uncertainty relations is a purely quantum effect referred to as information locking [DiVincenzo et al. 2004]. A locking scheme can be viewed as a cryptographic protocol in which a uniformly random n -bit message is encoded in a quantum system using a classical key of size much smaller than n. Without the key, no measurement of this quantum state can extract more than a negligible amount of information about the message, in which case the message is said to be ``locked''. Furthermore, knowing the key, it is possible to recover, that is ``unlock'', the message. In this article, we make the following contributions by exploiting a connection between uncertainty relations and low-distortion embeddings of Euclidean spaces into slightly larger spaces endowed with the l$_1$ norm. We introduce the notion of a metric uncertainty relation and connect it to low-distortion embeddings of l$_2$ into l$_1$. A metric uncertainty relation also implies an entropic uncertainty relation. We prove that random bases satisfy uncertainty relations with a stronger definition and better parameters than previously known. Our proof is also considerably simpler than earlier proofs. We then apply this result to show the existence of locking schemes with key size independent of the message length. Moreover, we give efficient constructions of bases satisfying metric uncertainty relations. The bases defining these metric uncertainty relations are computable by quantum circuits of almost linear size. This leads to the first explicit construction of a strong information locking scheme. These constructions are obtained by adapting an explicit norm embedding due to Indyk [2007] and an extractor construction of Guruswami et al. [2009]. We apply our metric uncertainty relations to exhibit communication protocols that perform equality testing of n -qubit states. We prove that this task can be performed by a single message protocol using O (log$^2$ n) qubits and n bits of communication, where the computation of the sender is efficient.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hillar:2013:MTP, author = "Christopher J. Hillar and Lek-Heng Lim", title = "Most Tensor Problems Are {NP-Hard}", journal = j-J-ACM, volume = "60", number = "6", pages = "45:1--45:??", month = nov, year = "2013", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2512329", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Dec 3 18:36:06 MST 2013", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular vector, or the spectral norm; and determining the rank or best rank-1 approximation of a 3-tensor. Furthermore, we show that restricting these problems to symmetric tensors does not alleviate their NP-hardness. We also explain how deciding nonnegative definiteness of a symmetric 4-tensor is NP-hard and how computing the combinatorial hyperdeterminant is NP-, \#P-, and VNP-hard.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Duan:2014:LTA, author = "Ran Duan and Seth Pettie", title = "Linear-Time Approximation for Maximum Weight Matching", journal = j-J-ACM, volume = "61", number = "1", pages = "1:1--1:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2529989", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The maximum cardinality and maximum weight matching problems can be solved in $ {\~ O}(m \sqrt n) $ time, a bound that has resisted improvement despite decades of research. (Here $m$ and $n$ are the number of edges and vertices.) In this article, we demonstrate that this ``$ m \sqrt n $ barrier'' can be bypassed by approximation. For any $ \epsilon > 0 $, we give an algorithm that computes a $ (1 - \epsilon) $-approximate maximum weight matching in $ O(m \epsilon^{-1} \log \epsilon^{-1}) $ time, that is, optimal linear time for any fixed $ \epsilon $. Our algorithm is dramatically simpler than the best exact maximum weight matching algorithms on general graphs and should be appealing in all applications that can tolerate a negligible relative error.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Williams:2014:NAC, author = "Ryan Williams", title = "Nonuniform {ACC} Circuit Lower Bounds", journal = j-J-ACM, volume = "61", number = "1", pages = "2:1--2:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559903", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$_m$ gates, where $ m > 1 $ is an arbitrary constant. We prove the following:\par --- NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of polynomial size. The size lower bound can be slightly strengthened to quasipolynomials and other less natural functions.\par --- $ E^{\rm NP} $, the class of languages recognized in $ 2^{O(n)} $ time with an NP oracle, doesn't have nonuniform ACC circuits of $ 2^{n^{o(1)}} $ size.\par The lower bound gives an exponential size-depth tradeoff: for every $d$, $m$ there is a $ \delta > 0 $ such that $ E^{NP} $ doesn't have depth-$d$ ACC circuits of size $ 2^{n^\delta } $ with MOD$_m$ gates. Previously, it was not known whether EXP$^{NP}$ had depth-3 polynomial-size circuits made out of only MOD$_6$ gates. The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms entail these lower bounds. The algorithms combine known properties of ACC with fast rectangular matrix multiplication and dynamic programming, while the second step requires a strengthening of the author's prior work.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barto:2014:CSP, author = "Libor Barto and Marcin Kozik", title = "Constraint Satisfaction Problems Solvable by Local Consistency Methods", journal = j-J-ACM, volume = "61", number = "1", pages = "3:1--3:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2556646", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that constraint satisfaction problems without the ability to count are solvable by the local consistency checking algorithm. This settles three (equivalent) conjectures: Feder--Vardi [SICOMP'98], Bulatov [LICS'04] and Larose--Z{\'a}dori [AU'07].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kane:2014:SJL, author = "Daniel M. Kane and Jelani Nelson", title = "Sparser {Johnson--Lindenstrauss} Transforms", journal = j-J-ACM, volume = "61", number = "1", pages = "4:1--4:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559902", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give two different and simple constructions for dimensionality reduction in $ l_2 $ via linear mappings that are sparse: only an $ O(\epsilon) $-fraction of entries in each column of our embedding matrices are non-zero to achieve distortion $ 1 + \epsilon $ with high probability, while still achieving the asymptotically optimal number of rows. These are the first constructions to provide subconstant sparsity for all values of parameters, improving upon previous works of Achlioptas [2003] and Dasgupta et al. [2010]. Such distributions can be used to speed up applications where $ l_2 $ dimensionality reduction is used.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chaput:2014:AMP, author = "Philippe Chaput and Vincent Danos and Prakash Panangaden and Gordon Plotkin", title = "Approximating {Markov} Processes by Averaging", journal = j-J-ACM, volume = "61", number = "1", pages = "5:1--5:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2537948", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Normally, one thinks of probabilistic transition systems as taking an initial probability distribution over the state space into a new probability distribution representing the system after a transition. We, however, take a dual view of Markov processes as transformers of bounded measurable functions. This is very much in the same spirit as a ``predicate-transformer'' view, which is dual to the state-transformer view of transition systems. We redevelop the theory of labelled Markov processes from this viewpoint; in particular, we explore approximation theory. We obtain three main results. (i) It is possible to define bisimulation on general measure spaces and show that it is an equivalence relation. The logical characterization of bisimulation can be done straightforwardly and generally. (ii) A new and flexible approach to approximation based on averaging can be given. This vastly generalizes and streamlines the idea of using conditional expectations to compute approximations. (iii) We show that there is a minimal process bisimulation-equivalent to a given process, and this minimal process is obtained as the limit of the finite approximants.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2014:FIA, author = "Victor Vianu", title = "Foreword to Invited Articles Section", journal = j-J-ACM, volume = "61", number = "1", pages = "6:1--6:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559908", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Helmi:2014:SCL, author = "Maryam Helmi and Lisa Higham and Eduardo Pacheco and Philipp Woelfel", title = "The Space Complexity of Long-Lived and One-Shot Timestamp Implementations", journal = j-J-ACM, volume = "61", number = "1", pages = "7:1--7:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559904", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article is concerned with the problem of implementing an unbounded timestamp object from multiwriter atomic registers, in an asynchronous distributed system of n processes with distinct identifiers where timestamps are taken from an arbitrary universe. Ellen et al. [2008] showed that $ \sqrt {n} / 2 - O(1) $ registers are required for any obstruction-free implementation of long-lived timestamp systems from atomic registers (meaning processes can repeatedly get timestamps). We improve this existing lower bound in two ways. First we establish a lower bound of $ n / 6 - 1 $ registers for the obstruction-free long-lived timestamp problem. Previous such linear lower bounds were only known for constrained versions of the timestamp problem. This bound is asymptotically tight; Ellen et al. [2008] constructed a wait-free algorithm that uses $ n - 1 $ registers. Second we show that $ \sqrt {2 n} - \log n - O(1) $ registers are required for any obstruction-free implementation of one-shot timestamp systems (meaning each process can get a timestamp at most once). We show that this bound is also asymptotically tight by providing a wait-free one-shot timestamp system that uses at most $ \lceil 2 \sqrt n \rceil $ registers, thus establishing a space complexity gap between one-shot and long-lived timestamp systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barcelo:2014:QRG, author = "Pablo Barcel{\'o} and Leonid Libkin and Juan L. Reutter", title = "Querying Regular Graph Patterns", journal = j-J-ACM, volume = "61", number = "1", pages = "8:1--8:??", month = jan, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559905", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Feb 5 17:06:24 MST 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, that is, graph patterns. While queries need to be posed against such data, techniques for querying patterns are generally lacking, and properties of such queries are not well understood. Our goal is to study the basics of querying graph patterns. The key features of patterns we consider here are node and label variables and edges specified by regular expressions. We provide a classification of patterns, and study standard graph queries on graph patterns. We give precise characterizations of both data and combined complexity for each class of patterns. If complexity is high, we do further analysis of features that lead to intractability, as well as lower-complexity restrictions. Since our patterns are based on regular expressions, query answering for them can be captured by a new automata model. These automata have two modes of acceptance: one captures queries returning nodes, and the other queries returning paths. We study properties of such automata, and the key computational tasks associated with them. Finally, we provide additional restrictions for tractability, and show that some intractable cases can be naturally cast as instances of constraint satisfaction problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hon:2014:SEF, author = "Wing-Kai Hon and Rahul Shah and Sharma V. Thankachan and Jeffrey Scott Vitter", title = "Space-Efficient Frameworks for Top-$k$ String Retrieval", journal = j-J-ACM, volume = "61", number = "2", pages = "9:1--9:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2590774", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The inverted index is the backbone of modern web search engines. For each word in a collection of web documents, the index records the list of documents where this word occurs. Given a set of query words, the job of a search engine is to output a ranked list of the most relevant documents containing the query. However, if the query consists of an arbitrary string-which can be a partial word, multiword phrase, or more generally any sequence of characters-then word boundaries are no longer relevant and we need a different approach. In string retrieval settings, we are given a set $ D = \{ d_1, d_2, d_3, \ldots, d_D \} $ of $D$ strings with $n$ characters in total taken from an alphabet set $ \Sigma = [\sigma]$, and the task of the search engine, for a given query pattern $P$ of length $p$, is to report the ``most relevant'' strings in $D$ containing $P$. The query may also consist of two or more patterns. The notion of relevance can be captured by a function score $ (P, d_r)$, which indicates how relevant document $ d_r$ is to the pattern $P$. Some example score functions are the frequency of pattern occurrences, proximity between pattern occurrences, or pattern-independent PageRank of the document. The first formal framework to study such kinds of retrieval problems was given by Muthukrishnan [SODA 2002]. He considered two metrics for relevance: frequency and proximity. He took a threshold-based approach on these metrics and gave data structures that use $ O(n \log n)$ words of space. We study this problem in a somewhat more natural top-$k$ framework. Here, $k$ is a part of the query, and the top $k$ most relevant (highest-scoring) documents are to be reported in sorted order of score. We present the first linear-space framework (i.e., using $ O (n)$ words of space) that is capable of handling arbitrary score functions with near-optimal $ O (p + k \log k)$ query time. The query time can be made optimal $ O (p + k)$ if sorted order is not necessary. Further, we derive compact space and succinct space indexes (for some specific score functions). This space compression comes at the cost of higher query time. At last, we extend our framework to handle the case of multiple patterns. Apart from providing a robust framework, our results also improve many earlier results in index space or query time or both.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cassaigne:2014:ATC, author = "Julien Cassaigne and James D. Currie and Luke Schaeffer and Jeffrey Shallit", title = "Avoiding Three Consecutive Blocks of the Same Size and Same Sum", journal = j-J-ACM, volume = "61", number = "2", pages = "10:1--10:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2590775", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that there exists an infinite word over the alphabet {0, 1, 3, 4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from 1994.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{De:2014:NOS, author = "Anindya De and Ilias Diakonikolas and Vitaly Feldman and Rocco A. Servedio", title = "Nearly Optimal Solutions for the {Chow} Parameters Problem and Low-Weight Approximation of Halfspaces", journal = j-J-ACM, volume = "61", number = "2", pages = "11:1--11:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2590772", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Chow parameters of a Boolean function $ f \colon \{ - 1, 1 \}^n \to \{ - 1, 1 \} $ are its $ n + 1 $ degree-$0$ and degree-$1$ Fourier coefficients. It has been known since 1961 [Chow 1961; Tannenbaum 1961] that the (exact values of the) Chow parameters of any linear threshold function $f$ uniquely specify $f$ within the space of all Boolean functions, but until recently [O'Donnell and Servedio 2011] nothing was known about efficient algorithms for reconstructing $f$ (exactly or approximately) from exact or approximate values of its Chow parameters. We refer to this reconstruction problem as the Chow Parameters Problem. Our main result is a new algorithm for the Chow Parameters Problem which, given (sufficiently accurate approximations to) the Chow parameters of any linear threshold function $f$, runs in time $ {\~ O}(n^2) \cdot (1 / \epsilon)^{O(\log^2 (1 / \epsilon))}$ and with high probability outputs a representation of an LTF $ f'$ that is $ \epsilon $ close to $f$ in Hamming distance. The only previous algorithm [O'Donnell and Servedio 2011] had running time $ \poly (n) \cdot 2^{2 {\~ O}(1 / \epsilon 2)}$ . As a byproduct of our approach, we show that for any linear threshold function $f$ over $ \{ - 1, 1 \}^n$, there is a linear threshold function $ f'$ which is $ \epsilon $-close to $f$ and has all weights that are integers of magnitude at most $ \sqrt n \cdot (1 / \epsilon)^{O (\log^2 (1 / \epsilon))}$. This significantly improves the previous best result of Diakonikolas and Servedio [2009] which gave a $ \poly (n) \cdot 2^{\~ O(1 / \epsilon^{2 / 3})}$ weight bound, and is close to the known lower bound of $ \max \{ \sqrt n, (1 / \epsilon)^{ \Omega (\log \log (1 / \epsilon))} \} $ [Goldberg 2006; Servedio 2007]. Our techniques also yield improved algorithms for related problems in learning theory. In addition to being significantly stronger than previous work, our results are obtained using conceptually simpler proofs. The two main ingredients underlying our results are (1) a new structural result showing that for $f$ any linear threshold function and $g$ any bounded function, if the Chow parameters of $f$ are close to the Chow parameters of $g$ then $f$ is close to $g$; (2) a new boosting-like algorithm that given approximations to the Chow parameters of a linear threshold function outputs a bounded function whose Chow parameters are close to those of $f$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Amano:2014:XSM, author = "Shun'ichi Amano and Claire David and Leonid Libkin and Filip Murlak", title = "{XML} Schema Mappings: Data Exchange and Metadata Management", journal = j-J-ACM, volume = "61", number = "2", pages = "12:1--12:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2590773", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention. Our goal is to develop a theory of expressive XML schema mappings. Such mappings should be able to use various forms of navigation in a document, and specify conditions on data values. We develop a language for XML schema mappings, and study both data exchange with such mappings and metadata management problems. Specifically, we concentrate on four types of problems: complexity of mappings, query answering, consistency issues, and composition. We first analyze the complexity of mappings, that is, recognizing pairs of documents such that one can be mapped into the other, and provide a classification based on sets of features used in mappings. Next, we chart the tractability frontier for the query answering problem. We show that the problem is tractable for expressive schema mappings and simple queries, but not vice versa. Then, we move to static analysis. We study the complexity of the consistency problem, that is, deciding whether it is possible to map some document of a source schema into a document of the target schema. Finally, we look at composition of XML schema mappings. We analyze its complexity and show that it is harder to achieve closure under composition for XML than for relational mappings. Nevertheless, we find a robust class of XML schema mappings that, in addition to being closed under composition, have good complexity properties with respect to the main data management tasks. Due to its good properties, we suggest this class as the class to use in applications of XML schema mappings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Zvi:2014:BLH, author = "Ido Ben-Zvi", title = "Beyond {Lamport}'s Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems", journal = j-J-ACM, volume = "61", number = "2", pages = "13:1--13:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2542181", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The coordination of a sequence of actions, to be performed in a linear temporal order in a distributed system, is studied. While in asynchronous message-passing systems such ordering of events requires the construction of message chains based on Lamport's happened-before relation, this is no longer true in the presence of time bounds on message delivery. Given such bounds, the mere passage of time can provide information about the occurrence of events at remote sites, without the need for explicit confirmation. A new causal structure called the centipede is introduced, and it is shown that centipedes must exist in every execution where linear ordering of actions is ensured. Centipedes capture the subtle interplay between the explicit information obtained via message chains, and the indirectly derived information gained by the passage of time, given the time bounds. Centipedes are defined using two relations. One is called syncausality, a slight generalisation of the happened-before relation. The other is a novel bound guarantee relation among events, that is based on the bounds on message transmission. In a precise sense, centipedes play a role in the synchronous setting analogous to that played by message chains in asynchronous systems. Our study is based on a knowledge-based analysis of distributed coordination. Temporally linear coordination is reduced to nested knowledge (knowledge about knowledge). Obtaining nested knowledge of a spontaneous event is, in turn, shown to require the existence of an appropriate centipede.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brotherston:2014:UPS, author = "James Brotherston and Max Kanovich", title = "Undecidability of Propositional Separation Logic and Its Neighbours", journal = j-J-ACM, volume = "61", number = "2", pages = "14:1--14:??", month = apr, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2542667", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Apr 17 18:20:38 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we investigate the logical structure of memory models of theoretical and practical interest. Our main interest is in ``the logic behind a fixed memory model'', rather than in ``a model of any kind behind a given logical system''. As an effective language for reasoning about such memory models, we use the formalism of separation logic. Our main result is that for any concrete choice of heap-like memory model, validity in that model is undecidable even for purely propositional formulas in this language. The main novelty of our approach to the problem is that we focus on validity in specific, concrete memory models, as opposed to validity in general classes of models. Besides its intrinsic technical interest, this result also provides new insights into the nature of their decidable fragments. In particular, we show that, in order to obtain such decidable fragments, either the formula language must be severely restricted or the valuations of propositional variables must be constrained. In addition, we show that a number of propositional systems that approximate separation logic are undecidable as well. In particular, this resolves the open problems of decidability for Boolean BI and Classical BI. Moreover, we provide one of the simplest undecidable propositional systems currently known in the literature, called ``Minimal Boolean BI'', by combining the purely positive implication-conjunction fragment of Boolean logic with the laws of multiplicative *-conjunction, its unit and its adjoint implication, originally provided by intuitionistic multiplicative linear logic. Each of these two components is individually decidable: the implication-conjunction fragment of Boolean logic is co-NP-complete, and intuitionistic multiplicative linear logic is NP-complete. All of our undecidability results are obtained by means of a direct encoding of Minsky machines.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chatterjee:2014:EDA, author = "Krishnendu Chatterjee and Monika Henzinger", title = "Efficient and Dynamic Algorithms for Alternating {B{\"u}chi} Games and Maximal End-Component Decomposition", journal = j-J-ACM, volume = "61", number = "3", pages = "15:1--15:??", month = may, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2597631", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 27 16:58:10 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The computation of the winning set for B{\"u}chi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is $ {\~ O} (n \cdot m) $, where $n$ is the number of vertices and $m$ is the number of edges in the graph. We are the first to break the $ {\~ O}(n \cdot m)$ boundary by presenting a new technique that reduces the running time to $ O(n^2)$. This bound also leads to $ O(n^2)$-time algorithms for computing the set of almost-sure winning vertices for B{\"u}chi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of $ {\O }(n \cdot m)$), (2) in concurrent graph games with constant actions (improving an earlier bound of $ O (n^3)$), and (3) in Markov decision processes (improving for $ m > n^{4 / 3}$ an earlier bound of $ O (m \cdot \sqrt m)$). We then show how to maintain the winning set for B{\"u}chi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in $ O (n)$ amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an $ O (m \cdot \sqrt m)$-time algorithm, and our second algorithm is an $ O (n^2)$-time algorithm which is obtained using the same technique as for alternating B{\"u}chi games. Thus, we obtain an $ O (\min \lcu m \cdot \sqrt m, n^2)$-time algorithm improving the long-standing $ O(n \cdot m)$ time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in $ O (n)$ amortized time per edge deletion, and $ O (m)$ worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Helmert:2014:MSA, author = "Malte Helmert and Patrik Haslum and J{\"o}rg Hoffmann and Raz Nissim", title = "Merge-and-Shrink Abstraction: a Method for Generating Lower Bounds in Factored State Spaces", journal = j-J-ACM, volume = "61", number = "3", pages = "16:1--16:??", month = may, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2559951", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 27 16:58:10 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Many areas of computer science require answering questions about reachability in compactly described discrete transition systems. Answering such questions effectively requires techniques to be able to do so without building the entire system. In particular, heuristic search uses lower-bounding (``admissible'') heuristic functions to prune parts of the system known to not contain an optimal solution. A prominent technique for deriving such bounds is to consider abstract transition systems that aggregate groups of states into one. The key question is how to design and represent such abstractions. The most successful answer to this question are pattern databases, which aggregate states if and only if they agree on a subset of the state variables. Merge-and-shrink abstraction is a new paradigm that, as we show, allows to compactly represent a more general class of abstractions, strictly dominating pattern databases in theory. We identify the maximal class of transition systems, which we call factored transition systems, to which merge-and-shrink applies naturally, and we show that the well-known notion of bisimilarity can be adapted to this framework in a way that still guarantees perfect heuristic functions, while potentially reducing abstraction size exponentially. Applying these ideas to planning, one of the foundational subareas of artificial intelligence, we show that in some benchmarks this size reduction leads to the computation of perfect heuristic functions in polynomial time and that more approximate merge-and-shrink strategies yield heuristic functions competitive with the state of the art.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cadek:2014:CAM, author = "Martin Cadek and Marek Krc{\'a}l and Jir{\'\i} Matousek and Francis Sergeraert and Luk{\'a}s Vokr{\'\i}nek and Uli Wagner", title = "Computing All Maps into a Sphere", journal = j-J-ACM, volume = "61", number = "3", pages = "17:1--17:??", month = may, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2597629", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 27 16:58:10 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Given topological spaces $X$, $Y$, a fundamental problem of algebraic topology is understanding the structure of all continuous maps $ X \to Y$. We consider a computational version, where $X$, $Y$ are given as finite simplicial complexes, and the goal is to compute $ [X, Y]$, that is, all homotopy classes of such maps. We solve this problem in the stable range, where for some $ d \geq 2$, we have $ \dim X \leq 2 d - 2$ and $Y$ is $ (d - 1)$-connected; in particular, $Y$ can be the $d$-dimensional sphere $ S^d$. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, $ [X, Y]$ is known to be uncomputable for general $X$, $Y$, since for $ X = S^1$ it includes a well known undecidable problem: testing triviality of the fundamental group of $Y$. In follow-up papers, the algorithm is shown to run in polynomial time for $d$ fixed, and extended to other problems, such as the extension problem, where we are given a subspace $ A \subset X$ and a map $ A \to Y$ and ask whether it extends to a map $ X \to Y$, or computing the $ Z_2$-index --- everything in the stable range. Outside the stable range, the extension problem is undecidable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alistarh:2014:TBA, author = "Dan Alistarh and James Aspnes and Keren Censor-Hillel and Seth Gilbert and Rachid Guerraoui", title = "Tight Bounds for Asynchronous Renaming", journal = j-J-ACM, volume = "61", number = "3", pages = "18:1--18:??", month = may, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2597630", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 27 16:58:10 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual lower bound of $ \Omega (k) $ process steps for deterministic renaming into any namespace of size subexponential in $k$, where $k$ is the number of participants. The bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic concurrent fetch-and-increment counters, queues, and stacks. The proof is based on a new reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement this individual bound with a global lower bound of $ \Omega (k \log (k / c))$ on the total step complexity of renaming into a namespace of size $ c k$, for any $ c \geq 1$. This result applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter implementations, that are tight within logarithmic factors. On the algorithmic side, we give a protocol that transforms any sorting network into a randomized strong adaptive renaming algorithm, with expected cost equal to the depth of the sorting network. This gives a tight adaptive renaming algorithm with expected step complexity $ O (\log k)$, where $k$ is the contention in the current execution. This algorithm is the first to achieve sublinear time, and it is time-optimal as per our randomized lower bound. Finally, we use this renaming protocol to build monotone-consistent counters with logarithmic step complexity and linearizable fetch-and-increment registers with polylogarithmic cost.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2014:CFT, author = "Binbin Chen and Haifeng Yu and Yuda Zhao and Phillip B. Gibbons", title = "The Cost of Fault Tolerance in Multi-Party Communication Complexity", journal = j-J-ACM, volume = "61", number = "3", pages = "19:1--19:??", month = may, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2597633", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 27 16:58:10 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research, since the very beginning, has been to tolerate failures. It is thus natural to ask ``If we want to compute a certain function in a fault-tolerant way, what will the communication complexity be?'' For this question, this article will focus specifically on (i) tolerating node crash failures, and (ii) computing the function over general topologies (instead of, e.g., just cliques). One way to approach this question is to first develop results in a simpler failure-free setting, and then ``amend'' the results to take into account failures' impact. Whether this approach is effective largely depends on how big a difference failures can make. This article proves that the impact of failures is significant, at least for the Sum aggregate function in general topologies: As our central contribution, we prove that there exists (at least) an exponential gap between the non-fault-tolerant and fault-tolerant communication complexity of Sum. This gap attests that fault-tolerant communication complexity needs to be studied separately from non-fault-tolerant communication complexity, instead of being considered as an ``amended'' version of the latter. Such exponential gap is not obvious: For some other functions such as the Max aggregate function, the gap is only logarithmic. Part of our results are obtained via a novel reduction from a new two-party problem UnionSizeCP that we introduce. UnionSizeCP comes with a novel cycle promise, which is the key enabler of our reduction. We further prove that this cycle promise and UnionSizeCP likely play a fundamental role in reasoning about fault-tolerant communication complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Faenza:2014:SWS, author = "Yuri Faenza and Gianpaolo Oriolo and Gautier Stauffer", title = "Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition", journal = j-J-ACM, volume = "61", number = "4", pages = "20:1--20:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629600", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in $ O(| V |(| E | + | V | l o g| V |))$-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present article. Despite being weaker than the structural results for claw-free graphs given by Chudnovsky and Seymour [2005, 2008a, 2008b] our decomposition theorem is, on the other hand, algorithmic, that is, it is coupled with an $ O(| V | | E |)$-time algorithm that actually produces the decomposition.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chazelle:2014:CBF, author = "Bernard Chazelle", title = "The Convergence of Bird Flocking", journal = j-J-ACM, volume = "61", number = "4", pages = "21:1--21:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629613", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We bound the time it takes for a group of birds to stabilize in a standard flocking model. Each bird averages its velocity with its neighbors lying within a fixed radius. We resolve the worst-case complexity of this natural algorithm by providing asymptotically tight bounds on the time to equilibrium. We reduce the problem to two distinct questions in computational geometry and circuit complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Sasson:2014:ACA, author = "Eli Ben-Sasson and Shachar Lovett and Noga Ron-Zewi", title = "An Additive Combinatorics Approach Relating Rank to Communication Complexity", journal = j-J-ACM, volume = "61", number = "4", pages = "22:1--22:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629598", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Identifying complexity measures that bound the communication complexity of a $ \{ 0, 1 \} $-valued matrix $M$ is one the most fundamental problems in communication complexity. Mehlhorn and Schmidt [1982] were the first to suggest matrix-rank as one such measure. Among other things, they showed $$ \log \rank_{\mathbb {F}}(M) \leq C C(M) \leq \rank_{\mathbb {F}_2}(M) $$, where $ C C(M)$ denotes the (deterministic) communication complexity of the function associated with $M$, and the rank on the left-hand side is over any field $ \mathbb {F}$ and on the right-hand side it is over the two-element field $ \mathbb {F}_2$. For certain matrices $M$, communication complexity equals the right-hand side, and this completely settles the question of ``communication complexity vs. $ \mathbb {F}_2$-rank''. Here we reopen this question by pointing out that, when $M$ has an additional natural combinatorial property---high discrepancy with respect to distributions which are uniform over submatrices---then communication complexity can be sublinear in $ \mathbb {F}_2$-rank. Assuming the Polynomial Freiman-Ruzsa (PFR) conjecture in additive combinatorics, we show that $$ C C(M) O(\rank \mathbb {F}_2 (M) / \log \rank \mathbb {F}_2 (M)) $$ for any matrix $M$ which satisfies this combinatorial property. We also observe that if $M$ has low rank over the reals, then it has low rank over $ \mathbb {F}$ 2 and it additionally satisfies this combinatorial property. As a corollary, our results also give the first (conditional) sublinear bound on communication complexity in terms of rank over the reals, a result improved later by Lovett [2014]. Our proof is based on the study of the ``approximate duality conjecture'' which was suggested by Ben-Sasson and Zewi [2011] and studied there in connection to the PFR conjecture. First, we improve the bounds on approximate duality assuming the PFR conjecture. Then, we use the approximate duality conjecture (with improved bounds) to get our upper bound on the communication complexity of low-rank matrices.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dell:2014:SAN, author = "Holger Dell and Dieter {Van Melkebeek}", title = "Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses", journal = j-J-ACM, volume = "61", number = "4", pages = "23:1--23:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629620", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded but does not know any part of x; their goal is to decide cooperatively whether x belongs to L at small cost, where the cost measure is the number of bits of communication from the first player to the second player. For any integer $ d \geq 3 $ and positive real $ \epsilon $, we show that, if satisfiability for n variable $d$-CNF formulas has a protocol of cost $ O(n d \epsilon)$, then coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level. The result even holds when the first player is conondeterministic, and is tight as there exists a trivial protocol for $ \epsilon = 0$. Under the hypothesis that coNP is not in NP/poly, our result implies tight lower bounds for parameters of interest in several areas, namely sparsification, kernelization in parameterized complexity, lossy compression, and probabilistically checkable proofs. By reduction, similar results hold for other NP-complete problems. For the vertex cover problem on $n$-vertex $d$ uniform hypergraphs, this statement holds for any integer $ d \geq 2$. The case $ d = 2$ implies that no NP-hard vertex deletion problem based on a graph property that is inherited by subgraphs can have kernels consisting of $ f (k^2 - \epsilon)$ edges unless coNP is in NP/poly, where $k$ denotes the size of the deletion set. Kernels consisting of $ O(k^2)$ edges are known for several problems in the class, including vertex cover, feedback vertex set, and bounded-degree deletion.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Baldan:2014:LTC, author = "Paolo Baldan and Silvia Crafa", title = "A Logic for True Concurrency", journal = j-J-ACM, volume = "61", number = "4", pages = "24:1--24:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629638", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history-preserving bisimilarity, and fragments of the logic can be identified which correspond to other true concurrent behavioural equivalences in the literature: step, pomset and history-preserving bisimilarity. Standard Hennessy--Milner logic, and thus (interleaving) bisimilarity, is also recovered as a fragment. We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. This work contributes to a rational presentation of the true concurrent spectrum and to a deeper understanding of the relations between the involved behavioural equivalences.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2014:IAFa, author = "Victor Vianu", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "61", number = "4", pages = "25:1--25:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2632167", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Amram:2014:RFL, author = "Amir M. Ben-Amram and Samir Genaim", title = "Ranking Functions for Linear-Constraint Loops", journal = j-J-ACM, volume = "61", number = "4", pages = "26:1--26:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629488", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such functions implies termination, these problems are not equivalent to termination. When the variables range over the rationals (or reals), it is known that both problems are PTIME decidable. However, when they range over the integers, whether for single-path or multipath loops, the complexity has not yet been determined. We show that both problems are coNP-complete. However, we point out some special cases of importance of PTIME complexity. We also present complete algorithms for synthesizing linear and lexicographical-linear ranking functions, both for the general case and the special PTIME cases. Moreover, in the rational setting, our algorithm for synthesizing lexicographical-linear ranking functions extends existing ones, because our definition for such functions is more general, yet it has PTIME complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Losch:2014:DSN, author = "Steffen L{\"o}sch and Andrew M. Pitts", title = "Denotational Semantics with Nominal {Scott} Domains", journal = j-J-ACM, volume = "61", number = "4", pages = "27:1--27:??", month = jul, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629529", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 8 10:55:13 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "When defining computations over syntax as data, one often runs into tedious issues concerning $ \alpha $-equivalence and semantically correct manipulations of binding constructs. Here we study a semantic framework in which these issues can be dealt with automatically by the programming language. We take the user-friendly ``nominal'' approach in which bound objects are named. In particular, we develop a version of Scott domains within nominal sets and define two programming languages whose denotational semantics are based on those domains. The first language, $ \lambda \nu $-PCF, is an extension of Plotkin's PCF with names that can be swapped, tested for equality and locally scoped; although simple, it already exposes most of the semantic subtleties of our approach. The second language, PNA, extends the first with name abstraction and concretion so that it can be used for metaprogramming over syntax with binders. For both languages, we prove a full abstraction result for nominal Scott domains analogous to Plotkin's classic result about PCF and conventional Scott domains: two program phrases have the same observable operational behaviour in all contexts if and only if they denote equal elements of the nominal Scott domain model. This is the first full abstraction result we know of for languages combining higher-order functions with some form of locally scoped names which uses a domain theory based on ordinary extensional functions, rather than using the more intensional approach of game semantics. To obtain full abstraction, we need to add two functionals, one for existential quantification over names and one for ``definite description'' over names. Only adding one of them is not enough, as we give counter-examples to full abstraction in both cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kopparty:2014:HRC, author = "Swastik Kopparty and Shubhangi Saraf and Sergey Yekhanin", title = "High-rate codes with sublinear-time decoding", journal = j-J-ACM, volume = "61", number = "5", pages = "28:1--28:??", month = aug, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629416", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 8 18:59:32 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of locations of a corrupted codeword. The tradeoff between the rate of a code and the locality\slash efficiency of its decoding algorithms has been well studied, and it has widely been suspected that nontrivial locality must come at the price of low rate. A particular setting of potential interest in practice is codes of constant rate. For such codes, decoding algorithms with locality $ O(k \epislon) $ were known only for codes of rate $ \epsilon \Omega (1 / \epsilon) $, where $k$ is the length of the message. Furthermore, for codes of rate $ > 1 / 2$, no nontrivial locality had been achieved. In this article, we construct a new family of locally decodable codes that have very efficient local decoding algorithms, and at the same time have rate approaching $1$. We show that for every $ \epsilon > 0$ and $ \alpha > 0$, for infinitely many $k$, there exists a code $C$ which encodes messages of length $k$ with rate $ 1 - \alpha $, and is locally decodable from a constant fraction of errors using $ O (k \epsilon)$ queries and time. These codes, which we call multiplicity codes, are based on evaluating multivariate polynomials and their derivatives. Multiplicity codes extend traditional multivariate polynomial codes; they inherit the local-decodability of these codes, and at the same time achieve better tradeoffs and flexibility in the rate and minimum distance.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chandran:2014:PAA, author = "Nishanth Chandran and Bhavana Kanukurthi and Rafail Ostrovsky and Leonid Reyzin", title = "Privacy amplification with asymptotically optimal entropy loss", journal = j-J-ACM, volume = "61", number = "5", pages = "29:1--29:??", month = aug, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2630064", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 8 18:59:32 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the problem of ``privacy amplification'': key agreement between two parties who both know a weak secret $w$, such as a password. (Such a setting is ubiquitous on the internet, where passwords are the most commonly used security device.) We assume that the key agreement protocol is taking place in the presence of an active computationally unbounded adversary Eve. The adversary may have partial knowledge about $w$, so we assume only that w has some entropy from Eve's point of view. Thus, the goal of the protocol is to convert this nonuniform secret $w$ into a uniformly distributed string $R$ that is fully secret from Eve. R may then be used as a key for running symmetric cryptographic protocols (such as encryption, authentication, etc.). Because we make no computational assumptions, the entropy in $R$ can come only from $w$. Thus, such a protocol must minimize the entropy loss during its execution, so that $R$ is as long as possible. The best previous results have entropy loss of $ \Theta (\kappa^2)$, where $ \kappa $ is the security parameter, thus requiring the password to be very long even for small values of $ \kappa $ . In this work, we present the first protocol for information-theoretic key agreement that has entropy loss linear in the security parameter. The result is optimal up to constant factors. We achieve our improvement through a somewhat surprising application of error-correcting codes for the edit distance. The protocol can be extended to provide also ``information reconciliation,'' that is, to work even when the two parties have slightly different versions of $w$ (e.g., when biometrics are involved).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dolev:2014:FTA, author = "Danny Dolev and Matthias F{\"u}gger and Ulrich Schmid and Christoph Lenzen", title = "Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation", journal = j-J-ACM, volume = "61", number = "5", pages = "30:1--30:??", month = aug, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2560561", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 8 18:59:32 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Today's hardware technology presents a new challenge in designing robust systems. Deep submicron VLSI technology introduces transient and permanent faults that were never considered in low-level system designs in the past. Still, robustness of that part of the system is crucial and needs to be guaranteed for any successful product. Distributed systems, on the other hand, have been dealing with similar issues for decades. However, neither the basic abstractions nor the complexity of contemporary fault-tolerant distributed algorithms match the peculiarities of hardware implementations. This article is intended to be part of an attempt striving to bridge over this gap between theory and practice for the clock synchronization problem. Solving this task sufficiently well will allow to build an ultra-robust high-precision clocking system for hardware designs like systems-on-chips in critical applications. As our first building block, we describe and prove correct a novel distributed, Byzantine fault-tolerant, probabilistically self-stabilizing pulse synchronization protocol, called FATAL, that can be implemented using standard asynchronous digital logic: Correct FATAL nodes are guaranteed to generate pulses (i.e., unnumbered clock ticks) in a synchronized way, despite a certain fraction of nodes being faulty. FATAL uses randomization only during stabilization and, despite the strict limitations introduced by hardware designs, offers optimal resilience and smaller complexity than all existing protocols. Finally, we show how to leverage FATAL to efficiently generate synchronized, self-stabilizing, high-frequency clocks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2014:IAFb, author = "Victor Vianu", title = "Invited article foreword", journal = j-J-ACM, volume = "61", number = "5", pages = "31:1--31:??", month = aug, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2656280", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 8 18:59:32 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kimelfeld:2014:TMS, author = "Benny Kimelfeld and Christopher R{\'e}", title = "Transducing {Markov} sequences", journal = j-J-ACM, volume = "61", number = "5", pages = "32:1--32:??", month = aug, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2630065", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 8 18:59:32 MDT 2014", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A Markov sequence is a basic statistical model representing uncertain sequential data, and it is used within a plethora of applications, including speech recognition, image processing, computational biology, radio-frequency identification (RFID), and information extraction. The problem of querying a Markov sequence is studied under the conventional semantics of querying a probabilistic database, where queries are formulated as finite-state transducers. Specifically, the complexity of two main problems is analyzed. The first problem is that of computing the confidence (probability) of an answer. The second is the enumeration of the answers in the order of decreasing confidence (with the generation of the top- $k$ answers as a special case), or in an approximate order thereof. In particular, it is shown that enumeration in any subexponential-approximate order is generally intractable (even for some fixed transducers), and a matching upper bound is obtained through a proposed heuristic. Due to this hardness, a special consideration is given to restricted (yet common) classes of transducers that extract matches of a regular expression (subject to prefix and suffix constraints), and it is shown that these classes are, indeed, significantly more tractable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gupta:2014:ACD, author = "Ankit Gupta and Pritish Kamath and Neeraj Kayal and Ramprasad Saptharishi", title = "Approaching the Chasm at Depth Four", journal = j-J-ACM, volume = "61", number = "6", pages = "33:1--33:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629541", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Agrawal and Vinay [2008], Koiran [2012], and Tavenas [2013] have recently shown that an $ \exp (\omega (\sqrt {n \log n})) $ lower bound for depth four homogeneous circuits computing the permanent with bottom layer of $ \times $ gates having fanin bounded by $ \sqrt n $ translates to a superpolynomial lower bound for general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via such homogeneous depth four circuits with bounded bottom fanin. We show here that any homogeneous depth four arithmetic circuit with bottom fanin bounded by $ \sqrt n $ computing the permanent (or the determinant) must be of size $ \exp (\Omega (\sqrt {n})) $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sherstov:2014:CLB, author = "Alexander A. Sherstov", title = "Communication Lower Bounds Using Directional Derivatives", journal = j-J-ACM, volume = "61", number = "6", pages = "34:1--34:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629334", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the set disjointness problem in the most powerful model of bounded-error communication, the $k$ party randomized number-on-the-forehead model. We show that set disjointness requires $ \Omega (\sqrt {n / 2^k k})$ bits of communication, where $n$ is the size of the universe. Our lower bound generalizes to quantum communication, where it is essentially optimal. Proving this bound was a longstanding open problem even in restricted settings, such as one-way classical protocols with $ k = 4$ parties [Wigderson 1997]. The proof contributes a novel technique for lower bounds on multiparty communication, based on directional derivatives of protocols over the reals.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brakerski:2014:FIC, author = "Zvika Brakerski and Yael Tauman Kalai and Moni Naor", title = "Fast Interactive Coding against Adversarial Noise", journal = j-J-ACM, volume = "61", number = "6", pages = "35:1--35:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2661628", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Consider two parties who wish to communicate in order to execute some interactive protocol $ \pi $ . However, the communication channel between them is noisy: An adversary sees everything that is transmitted over the channel and can change a constant fraction of the bits arbitrarily, thus interrupting the execution of $ \pi $ (which was designed for an error-free channel). If $ \pi $ only contains a single long message, then a good error correcting code would overcome the noise with only a constant overhead in communication. However, this solution is not applicable to interactive protocols consisting of many short messages. Schulman [1992, 1993] introduced the notion of interactive coding: A simulator that, given any protocol $ \pi $, is able to simulate it (i.e., produce its intended transcript) even in the presence of constant rate adversarial channel errors, and with only constant (multiplicative) communication overhead. However, the running time of Schulman's simulator, and of all simulators that followed, has been exponential (or subexponential) in the communication complexity of $ \pi $ (which we denote by $N$). In this work, we present three efficient simulators, all of which are randomized and have a certain failure probability (over the choice of coins). The first runs in time $ \poly (N)$, has failure probability roughly $ 2^{-N}$, and is resilient to $ 1 / 32$-fraction of adversarial error. The second runs in time $ O(N \log N)$, has failure probability roughly $ 2^{-N}$, and is resilient to some constant fraction of adversarial error. The third runs in time $ O(N)$, has failure probability $ 1 / \poly (N)$, and is resilient to some constant fraction of adversarial error. (Computational complexity is measured in the RAM model.) The first two simulators can be made deterministic if they are a priori given a random string (which may be known to the adversary ahead of time). In particular, the simulators can be made to be nonuniform and deterministic (with equivalent performance).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jacob:2014:SSS, author = "Riko Jacob and Andrea Richa and Christian Scheideler and Stefan Schmid and Hanjo T{\"a}ubig", title = "{SKIP} +: a Self-Stabilizing Skip Graph", journal = j-J-ACM, volume = "61", number = "6", pages = "36:1--36:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629695", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Peer-to-peer systems rely on a scalable overlay network that enables efficient routing between its members. Hypercubic topologies facilitate such operations while each node only needs to connect to a small number of other nodes. In contrast to static communication networks, peer-to-peer networks allow nodes to adapt their neighbor set over time in order to react to join and leave events and failures. This article shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (slightly extended) skip graph, SKIP$^+$, in polylogarithmic time from any given initial state in which the overlay network is still weakly connected. This is an exponential improvement compared to previously known self-stabilizing algorithms for overlay networks. In addition, our algorithm handles individual joins and leaves locally and efficiently.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lee:2014:MSP, author = "James R. Lee and Shayan Oveis Gharan and Luca Trevisan", title = "Multiway Spectral Partitioning and Higher-Order {Cheeger} Inequalities", journal = j-J-ACM, volume = "61", number = "6", pages = "37:1--37:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2665063", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if and only if there are at least two eigenvalues equal to zero. Cheeger's inequality and its variants provide an approximate version of the latter fact; they state that a graph has a sparse cut if and only if there are at least two eigenvalues that are close to zero. It has been conjectured that an analogous characterization holds for higher multiplicities: There are $k$ eigenvalues close to zero if and only if the vertex set can be partitioned into k subsets, each defining a sparse cut. We resolve this conjecture positively. Our result provides a theoretical justification for clustering algorithms that use the bottom $k$ eigenvectors to embed the vertices into $ R^k$, and then apply geometric considerations to the embedding. We also show that these techniques yield a nearly optimal quantitative connection between the expansion of sets of size $ \approx n / k$ and $ \lambda_k$, the $k$ th smallest eigenvalue of the normalized Laplacian, where $n$ is the number of vertices. In particular, we show that in every graph there are at least $ k / 2$ disjoint sets (one of which will have size at most $ 2 n / k$), each having expansion at most $ O(\sqrt {\lambda_k \log k})$. Louis, Raghavendra, Tetali, and Vempala have independently proved a slightly weaker version of this last result. The $ \sqrt {\log k}$ bound is tight, up to constant factors, for the ``noisy hypercube'' graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Duchi:2014:PAL, author = "John C. Duchi and Michael I. Jordan and Martin J. Wainwright", title = "Privacy Aware Learning", journal = j-J-ACM, volume = "61", number = "6", pages = "38:1--38:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2666468", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study statistical risk minimization problems under a privacy model in which the data is kept confidential even from the learner. In this local privacy framework, we establish sharp upper and lower bounds on the convergence rates of statistical estimation procedures. As a consequence, we exhibit a precise tradeoff between the amount of privacy the data preserves and the utility, as measured by convergence rate, of any statistical estimator or learning procedure.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wang:2014:NAI, author = "Xiaojing Wang and Qizhao Yuan and Hongliang Cai and Jiajia Fang", title = "A New Approach to Image Sharing with High-Security Threshold Structure", journal = j-J-ACM, volume = "61", number = "6", pages = "39:1--39:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2666470", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Image sharing is an attractive research subject in computer image techniques and in the information security field. This article presents a novel scheme of image sharing with a $ (t, n) $ high-security threshold structure. The scheme can encode secret images into n shadow images in such a way that all the shadow images are in a perfect and ideal $ (t, n) $ threshold structure, while each shadow image has its own visual content assigned at random. The most common method to implement image sharing is based on interpolation polynomial over the field $ F_p $ = \{0, 1, 2,\ldots{}, p 1\} [Shamir 1979]. In this article, the authors present a new approach to image sharing and its computation based on algebraic-geometry code over the pixel value field GF($ 2^m$).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2014:IAF, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "61", number = "6", pages = "40:1--40:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2684458", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brazdil:2014:EAP, author = "Tom{\'a}s Br{\'a}zdil and Stefan Kiefer and Anton{\'\i}n Kucera", title = "Efficient Analysis of Probabilistic Programs with an Unbounded Counter", journal = j-J-ACM, volume = "61", number = "6", pages = "41:1--41:??", month = nov, year = "2014", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629599", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 7 15:12:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. We start by establishing a powerful link between pOC and martingale theory, which leads to fundamental observations about quantitative properties of runs in pOC. In particular, we provide a ``divergence gap theorem'', which bounds a positive non-termination probability in pOC away from zero. Using these observations, we show that the expected termination time can be approximated up to an arbitrarily small relative error in polynomial time, and the same holds for the probability of all runs that satisfy a given $ \omega $-regular property encoded by a deterministic Rabin automaton.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Singh:2015:AMB, author = "Mohit Singh and Lap Chi Lau", title = "Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal", journal = j-J-ACM, volume = "62", number = "1", pages = "1:1--1:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629366", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the Minimum Bounded Degree Spanning Tree problem, we are given an undirected graph $ G = (V, E) $ with a degree upper bound $ B_v $ on each vertex $ v \in V $, and the task is to find a spanning tree of minimum cost that satisfies all the degree bounds. Let OPT be the cost of an optimal solution to this problem. In this article we present a polynomial-time algorithm which returns a spanning tree $T$ of cost at most OPT and $ d_T (v) \leq B_v + 1$ for all $v$, where $ d_T(v)$ denotes the degree of $v$ in $T$. This generalizes a result of F{\"u}rer and Raghavachari [1994] to weighted graphs, and settles a conjecture of Goemans [2006] affirmatively. The algorithm generalizes when each vertex $v$ has a degree lower bound $ A_v$ and a degree upper bound $ B_v$, and returns a spanning tree with cost at most OPT and $ A_v - 1 \leq d_T(v) \leq B_v + 1$ for all $ v \in V$. This is essentially the best possible. The main technique used is an extension of the iterative rounding method introduced by Jain [2001] for the design of approximation algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Agrawal:2015:AVS, author = "Manindra Agrawal and S. Akshay and Blaise Genest and P. S. Thiagarajan", title = "Approximate Verification of the Symbolic Dynamics of {Markov} Chains", journal = j-J-ACM, volume = "62", number = "1", pages = "2:1--2:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629417", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A finite-state Markov chain $M$ can be regarded as a linear transform operating on the set of probability distributions over its node set. The iterative applications of $M$ to an initial probability distribution $ \mu_0$ will generate a trajectory of probability distributions. Thus, a set of initial distributions will induce a set of trajectories. It is an interesting and useful task to analyze the dynamics of $M$ as defined by this set of trajectories. The novel idea here is to carry out this task in a symbolic framework. Specifically, we discretize the probability value space [0,1] into a finite set of intervals $ I = \{ I_1, I_2, \ldots {}, I_m \} $. A concrete probability distribution $ \mu $ over the node set $ \{ 1, 2, \ldots {}, n \} $ of $M$ is then symbolically represented as $D$, a tuple of intervals drawn from $I$ where the $i$ th component of $D$ will be the interval in which $ \mu (i)$ falls. The set of discretized distributions $D$ is a finite alphabet. Hence, the trajectory, generated by repeated applications of $M$ to an initial distribution, will induce an infinite string over this alphabet. Given a set of initial distributions, the symbolic dynamics of $M$ will then consist of a language of infinite strings $L$ over the alphabet $D$. Our main goal is to verify whether $L$ meets a specification given as a linear-time temporal logic formula $ \varphi $. In our logic, an atomic proposition will assert that the current probability of a node falls in the interval $I$ from $I$. If $L$ is an $ \omega $-regular language, one can hope to solve our model-checking problem (whether $ L + \varphi $ ?) using standard techniques. However, we show that, in general, this is not the case. Consequently, we develop the notion of an $ \epsilon $-approximation, based on the transient and long-term behaviors of the Markov chain $M$. Briefly, the symbolic trajectory $ \xi '$ is an $ \epsilon $ -approximation of the symbolic trajectory $ \xi $ iff (1) $ \xi '$ agrees with $ \xi $ during its transient phase; and (2) both $ \xi $ and $ \xi '$ are within an $ \epsilon $-neighborhood at all times after the transient phase. Our main results are that one can effectively check whether (i) for each infinite word in $L$, at least one of its $ \epsilon $ -approximations satisfies the given specification; (ii) for each infinite word in $L$, all its $ \epsilon $-approximations satisfy the specification. These verification results are strong in that they apply to all finite state Markov chains.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aspnes:2015:LUA, author = "James Aspnes and Hagit Attiya and Keren Censor-Hillel and Faith Ellen", title = "Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity", journal = j-J-ACM, volume = "62", number = "1", pages = "3:1--3:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2732263", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article presents a novel implementation of a snapshot object for n processes, with $ O(\log^2 b \log n) $ step complexity for update operations and $ O (\log b) $ step complexity for scan operations, where b is the number of updates. The algorithm uses only reads and writes. For polynomially many updates, this is an exponential improvement on previous snapshot algorithms, which have linear step complexity. It overcomes the existing $ \Omega (n) $ lower bound on step complexity by having the step complexity depend on the number of updates. The key to this implementation is the construction of a new object consisting of a pair of max registers that supports a scan operation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brunsch:2015:ISA, author = "Tobias Brunsch and Heiko R{\"o}glin", title = "Improved Smoothed Analysis of Multiobjective Optimization", journal = j-J-ACM, volume = "62", number = "1", pages = "4:1--4:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699445", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, this line of research has gained a lot of attention in the last decade. We consider problems in which d linear and one arbitrary objective function are to be optimized over a set $ S \subseteq \{ 0, 1 \}^n $ of feasible solutions. We improve the previously best known bound for the smoothed number of Pareto-optimal solutions to $ O(n^{2 d} \phi^d) $, where $ \phi $ denotes the perturbation parameter. Additionally, we show that for any constant $c$ the $c$ th moment of the smoothed number of Pareto-optimal solutions is bounded by $ O((n^{2 d} \phi^d)^c)$. This improves the previously best known bounds significantly. Furthermore, we address the criticism that the perturbations in smoothed analysis destroy the zero-structure of problems by showing that the smoothed number of Pareto-optimal solutions remains polynomially bounded even for zero-preserving perturbations. This broadens the class of problems captured by smoothed analysis and it has consequences for nonlinear objective functions. One corollary of our result is that the smoothed number of Pareto-optimal solutions is polynomially bounded for polynomial objective functions. Our results also extend to integer optimization problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lin:2015:CRN, author = "Huijia Lin and Rafael Pass", title = "Constant-Round Nonmalleable Commitments from Any One-Way Function", journal = j-J-ACM, volume = "62", number = "1", pages = "5:1--5:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699446", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show unconditionally that the existence of commitment schemes implies the existence of constant-round nonmalleable commitments; earlier protocols required additional assumptions such as collision-resistant hash functions or subexponential one-way functions. Our protocol also satisfies the stronger notions of concurrent nonmalleability and robustness. As a corollary, we establish that constant-round nonmalleable zero-knowledge arguments for NP can be based on one-way functions and constant-round secure multiparty computation can be based on enhanced trapdoor permutations; also here, earlier protocols additionally required either collision-resistant hash functions or subexponential one-way functions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2015:IAFa, author = "Victor Vianu", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "62", number = "1", pages = "6:1--6:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2734885", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kutten:2015:CUL, author = "Shay Kutten and Gopal Pandurangan and David Peleg and Peter Robinson and Amitabh Trehan", title = "On the Complexity of Universal Leader Election", journal = j-J-ACM, volume = "62", number = "1", pages = "7:1--7:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699440", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most ``obvious'' complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of $ \Omega (m) $ messages, where $m$ is the number of edges in the network, and $ \Omega (D)$ time, where $D$ is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even $ \Omega (n)$, where $n$ is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that $D$ and $n$ were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every $D$, $m$, and $n$, and hold even if $D$, $m$, and $n$ are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O (m) messages algorithm. An $ O (D)$ time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an $ \Omega (m)$ message lower bound for randomized broadcast algorithms. An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Khot:2015:UGC, author = "Subhash A. Khot and Nisheeth K. Vishnoi", title = "The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into $ l_1 $", journal = j-J-ACM, volume = "62", number = "1", pages = "8:1--8:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629614", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into $ l_1 $ with constant distortion. We show that for an arbitrarily small constant $ \delta > 0 $, for all large enough n, there is an n -point negative type metric which requires distortion at least $ (\log \log n)^{1 / 6 - \delta } $ to embed into $ l_1 $. Surprisingly, our construction is inspired by the Unique Games Conjecture (UGC), establishing a previously unsuspected connection between probabilistically checkable proof systems (PCPs) and the theory of metric embeddings. We first prove that the UGC implies a super-constant hardness result for the (nonuniform) S PARSESTCUT problem. Though this hardness result relies on the UGC, we demonstrate, nevertheless, that the corresponding PCP reduction can be used to construct an ``integrality gap instance'' for SPARSESTCUT. Towards this, we first construct an integrality gap instance for a natural SDP relaxation of UNIQUEGAMES. Then we ``simulate'' the PCP reduction and ``translate'' the integrality gap instance of UNIQUEGAMES to an integrality gap instance of SPARSESTCUT. This enables us to prove a $ (\log \log n)^{1 / 6 - \delta } $ integrality gap for SPARSESTCUT, which is known to be equivalent to the metric embedding lower bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chatterjee:2015:MSS, author = "Krishnendu Chatterjee and Thomas A. Henzinger and Barbara Jobstmann and Rohit Singh", title = "Measuring and Synthesizing Systems in Probabilistic Environments", journal = j-J-ACM, volume = "62", number = "1", pages = "9:1--9:??", month = feb, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699430", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Mar 3 12:47:00 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an $ \epsilon $-optimal strategy with a bounded counter, for all $ \epsilon > 0$. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Babaioff:2015:TMI, author = "Moshe Babaioff and Robert D. Kleinberg and Aleksandrs Slivkins", title = "Truthful Mechanisms with Implicit Payment Computation", journal = j-J-ACM, volume = "62", number = "2", pages = "10:1--10:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2724705", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true: creating a randomized truthful mechanism is essentially as easy as a single call to a monotone allocation rule. Our main result is a general procedure to take a monotone allocation rule for a single-parameter domain and transform it (via a black-box reduction) into a randomized mechanism that is truthful in expectation and individually rational for every realization. The mechanism implements the same outcome as the original allocation rule with probability arbitrarily close to 1, and requires evaluating that allocation rule only once. We also provide an extension of this result to multiparameter domains and cycle-monotone allocation rules, under mild star-convexity and nonnegativity hypotheses on the type space and allocation rule, respectively. Because our reduction is simple, versatile, and general, it has many applications to mechanism design problems in which re-evaluating the allocation rule is either burdensome or informationally impossible. Applying our result to the multiarmed bandit problem, we obtain truthful randomized mechanisms whose regret matches the information-theoretic lower bound up to logarithmic factors, even though prior work showed this is impossible for truthful deterministic mechanisms. We also present applications to offline mechanism design, showing that randomization can circumvent a communication complexity lower bound for deterministic payments computation, and that it can also be used to create truthful shortest path auctions that approximate the welfare of the VCG allocation arbitrarily well, while having the same running time complexity as Dijkstra's algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Etessami:2015:RMD, author = "Kousha Etessami and Mihalis Yannakakis", title = "Recursive {Markov} Decision Processes and Recursive Stochastic Games", journal = j-J-ACM, volume = "62", number = "2", pages = "11:1--11:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699431", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-sum turn-based (perfect information) stochastic games. They extend standard finite-state MDPs and stochastic games with a recursion feature. We study the decidability and computational complexity of these games under termination objectives for the two players: one player's goal is to maximize the probability of termination at a given exit, while the other player's goal is to minimize this probability. In the quantitative termination problems, given an RMDP (or RSSG) and probability p, we wish to decide whether the value of such a termination game is at least $p$ (or at most $p$); in the qualitative termination problem we wish to decide whether the value is 1. The important 1-exit subclasses of these models, 1-RMDPs and 1-RSSGs, correspond in a precise sense to controlled and game versions of classic stochastic models, including multitype Branching Processes and Stochastic Context-Free Grammars, where the objective of the players is to maximize or minimize the probability of termination (extinction). We provide a number of upper and lower bounds for qualitative and quantitative termination problems for RMDPs and RSSGs. We show both problems are undecidable for multi-exit RMDPs, but are decidable for 1-RMDPs and 1-RSSGs. Specifically, the quantitative termination problem is decidable in PSPACE for both 1-RMDPs and 1-RSSGs, and is at least as hard as the square root sum problem, a well-known open problem in numerical computation. We show that the qualitative termination problem for 1-RMDPs (i.e., a controlled version of branching processes) can be solved in polynomial time both for maximizing and minimizing 1-RMDPs. The qualitative problem for 1-RSSGs is in NP $ \cap $ coNP, and is at least as hard as the quantitative termination problem for Condon's finite-state simple stochastic games, whose complexity remains a well known open problem. Finally, we show that even for 1-RMDPs, more general (qualitative and quantitative) model-checking problems with respect to linear-time temporal properties are undecidable even for a fixed property.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fagin:2015:DSF, author = "Ronald Fagin and Benny Kimelfeld and Frederick Reiss and Stijn Vansummeren", title = "Document Spanners: a Formal Approach to Information Extraction", journal = j-J-ACM, volume = "62", number = "2", pages = "12:1--12:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699442", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", 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", abstract = "An intrinsic part of information extraction is the creation and manipulation of relations extracted from text. In this article, we develop a foundational framework where the central construct is what we call a document spanner (or just spanner for short). A spanner maps an input string into a relation over the spans (intervals specified by bounding indices) of the string. The focus of this article is on the representation of spanners. Conceptually, there are two kinds of such representations. Spanners defined in a primitive representation extract relations directly from the input string; those defined in an algebra apply algebraic operations to the primitively represented spanners. This framework is driven by SystemT, an IBM commercial product for text analysis, where the primitive representation is that of regular expressions with capture variables. We define additional types of primitive spanner representations by means of two kinds of automata that assign spans to variables. We prove that the first kind has the same expressive power as regular expressions with capture variables; the second kind expresses precisely the algebra of the regular spanners-the closure of the first kind under standard relational operators. The core spanners extend the regular ones by string-equality selection (an extension used in SystemT). We give some fundamental results on the expressiveness of regular and core spanners. As an example, we prove that regular spanners are closed under difference (and complement), but core spanners are not. Finally, we establish connections with related notions in the literature.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Valiant:2015:FCS, author = "Gregory Valiant", title = "Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem", journal = j-J-ACM, volume = "62", number = "2", pages = "13:1--13:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2728167", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Given a set of $n$ $d$-dimensional Boolean vectors with the promise that the vectors are chosen uniformly at random with the exception of two vectors that have Pearson correlation coefficient $ \rho $ (Hamming distance $ d \cdot (1 - \rho) / 2$), how quickly can one find the two correlated vectors? We present an algorithm which, for any constant $ \epsilon > 0$, and constant $ \rho > 0$, runs in expected time $ O(n^{(5 - \omega) / (4 - \omega) + \epsilon } + n d) < O(n^{1.62} + n d)$, where $ \omega < 2.4$ is the exponent of matrix multiplication. This is the first subquadratic-time algorithm for this problem for which $ \rho $ does not appear in the exponent of $n$, and improves upon $ O(n^{2 - O(\rho)})$, given by Paturi et al. [1989], the Locality Sensitive Hashing approach of Motwani [1998] and the Bucketing Codes approach of Dubiner [2008]. Applications and extensions of this basic algorithm yield significantly improved algorithms for several other problems.\par {\em Approximate Closest Pair}. For any sufficiently small constant $ \epsilon > 0$, given $n$ $d$-dimensional vectors, there exists an algorithm that returns a pair of vectors whose Euclidean (or Hamming) distance differs from that of the closest pair by a factor of at most $ 1 + \epsilon $, and runs in time $ O(n^{2 - \Theta \sqrt {\epsilon }})$. The best previous algorithms (including Locality Sensitive Hashing) have runtime $ O(n^{2 - O(\epsilon)})$.\par {\em Learning Sparse Parities with Noise}. Given samples from an instance of the learning parities with noise problem where each example has length $n$, the true parity set has size at most $ k \ll n$, and the noise rate is $ \eta $, there exists an algorithm that identifies the set of $k$ indices in time $ n^{((\omega + \epsilon) / 3) k} {\rm poly}(1 / (1 - 2 \eta)) < n^{0.8k} {\rm poly}(1 / (1 - 2 \eta))$. This is the first algorithm with no dependence on $ \eta $ in the exponent of $n$, aside from the trivial $ O(n \choose k) \approx O(n^k)$ brute-force algorithm, and for large noise rates $ (\eta > 0.4)$, improves upon the results of Grigorescu et al. [2011] that give a runtime of $ n^{(1 + (2 \eta)^2 + o(1)) (k / 2)} {\rm poly}(1 / (1 - 2 \eta))$.\par {\em Learning $k$-Juntas with Noise}. Given uniformly random length $n$ Boolean vectors, together with a label, which is some function of just $ k \ll n$ of the bits, perturbed by noise rate $ \eta $, return the set of relevant indices. Leveraging the reduction of Feldman et al. [2009], our result for learning $k$-parities implies an algorithm for this problem with runtime $ n^{((\omega + \epsilon) / 3) k} {\rm poly} (1 / (1 - 2 \eta)) < n^{0.8k} {\rm poly} (1 / (1 - 2 \eta))$, which is the first runtime for this problem of the form $ n^{ck}$ with an absolute constant $ c < 1$.\par {\em Learning $k$ Juntas without Noise}. Given uniformly random length $n$ Boolean vectors, together with a label, which is some function of $ k \ll n$ of the bits, return the set of relevant indices. Using a modification of the algorithm of Mossel et al. [2004], and employing our algorithm for learning sparse parities with noise via the reduction of Feldman et al. [2009], we obtain an algorithm for this problem with runtime $ n^{((\omega + \epsilon) / 4) k} {\rm poly}(n) < n^{0.6k} {\rm poly}(n)$, which improves on the previous best of $ n^{((\omega + 1) / \omega) k} \approx n^{0.7k} {\rm poly}(n)$ of Mossel et al. [2004].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Baruah:2015:PUS, author = "Sanjoy Baruah and Vincenzo Bonifaci and Gianlorenzo D'Angelo and Haohan Li and Alberto Marchetti-Spaccamela and Suzanne {Van Der Ster} and Leen Stougie", title = "Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems", journal = j-J-ACM, volume = "62", number = "2", pages = "14:1--14:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699435", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Systems in many safety-critical application domains are subject to certification requirements. For any given system, however, it may be the case that only a subset of its functionality is safety-critical and hence subject to certification; the rest of the functionality is non-safety-critical and does not need to be certified, or is certified to lower levels of assurance. The certification-cognizant runtime scheduling of such mixed-criticality systems is considered. An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is presented: this algorithm can schedule systems for which any number of criticality levels are defined. Efficient implementations of EDF-VD, as well as associated schedulability tests for determining whether a task system can be correctly scheduled using EDF-VD, are presented. For up to 13 criticality levels, analyses of EDF-VD, based on metrics such as processor speedup factor and utilization bounds, are derived, and conditions under which EDF-VD is optimal with respect to these metrics are identified. Finally, two extensions of EDF-VD are discussed that enhance its applicability. The extensions are aimed at scheduling a wider range of task sets, while preserving the favorable worst-case resource usage guarantees of the basic algorithm.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Basin:2015:MMF, author = "David Basin and Felix Klaedtke and Samuel M{\"u}ller and Eugen Zalinescu", title = "Monitoring Metric First-Order Temporal Properties", journal = j-J-ACM, volume = "62", number = "2", pages = "15:1--15:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699444", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Runtime monitoring is a general approach to verifying system properties at runtime by comparing system events against a specification formalizing which event sequences are allowed. We present a runtime monitoring algorithm for a safety fragment of metric first-order temporal logic that overcomes the limitations of prior monitoring algorithms with respect to the expressiveness of their property specification languages. Our approach, based on automatic structures, allows the unrestricted use of negation, universal and existential quantification over infinite domains, and the arbitrary nesting of both past and bounded future operators. Furthermore, we show how to use and optimize our approach for the common case where structures consist of only finite relations, over possibly infinite domains. We also report on case studies from the domain of security and compliance in which we empirically evaluate the presented algorithms. Taken together, our results show that metric first-order temporal logic can serve as an effective specification language for expressing and monitoring a wide variety of practically relevant system properties.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2015:IAFb, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "62", number = "2", pages = "16:1--16:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2754309", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fiorini:2015:ELB, author = "Samuel Fiorini and Serge Massar and Sebastian Pokutta and Hans Raj Tiwary and Ronald {De Wolf}", title = "Exponential Lower Bounds for Polytopes in Combinatorial Optimization", journal = j-J-ACM, volume = "62", number = "2", pages = "17:1--17:??", month = may, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2716307", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue May 12 06:16:04 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the stable set polytope. These results were discovered through a new connection that we make between one-way quantum communication protocols and semidefinite programming reformulations of LPs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goel:2015:PCA, author = "Gagan Goel and Vahab Mirrokni and Renato Paes Leme", title = "Polyhedral Clinching Auctions and the {AdWords} Polytope", journal = j-J-ACM, volume = "62", number = "3", pages = "18:1--18:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2757277", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A central issue in applying auction theory in practice is the problem of dealing with budget-constrained agents. A desirable goal in practice is to design incentive compatible, individually rational, and Pareto optimal auctions while respecting the budget constraints. Achieving this goal is particularly challenging in the presence of nontrivial combinatorial constraints over the set of feasible allocations. Toward this goal and motivated by AdWords auctions, we present an auction for polymatroidal environments satisfying these properties. Our auction employs a novel clinching technique with a clean geometric description and only needs an oracle access to the submodular function defining the polymatroid. As a result, this auction not only simplifies and generalizes all previous results, it applies to several new applications including AdWords Auctions, bandwidth markets, and video on demand. In particular, our characterization of the AdWords auction as polymatroidal constraints might be of independent interest. This allows us to design the first mechanism for Ad Auctions taking into account simultaneously budgets, multiple keywords and multiple slots. We show that it is impossible to extend this result to generic polyhedral constraints. This also implies an impossibility result for multiunit auctions with decreasing marginal utilities in the presence of budget constraints.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bodirsky:2015:STG, author = "Manuel Bodirsky and Michael Pinsker", title = "{Schaefer}'s Theorem for Graphs", journal = j-J-ACM, volume = "62", number = "3", pages = "19:1--19:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2764899", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in polynomial time, or is NP-complete. We present an analog of this dichotomy result for the propositional logic of graphs instead of Boolean logic. In this generalization of Schaefer's result, the input consists of a set W of variables and a conjunction \Phi of statements (``constraints'') about these variables in the language of graphs, where each statement is taken from a fixed finite set \Psi of allowed quantifier-free first-order formulas; the question is whether \Phi is satisfiable in a graph. We prove that either \Psi is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete. This is achieved by a universal-algebraic approach, which in turn allows us to use structural Ramsey theory. To apply the universal-algebraic approach, we formulate the computational problems under consideration as constraint satisfaction problems (CSPs) whose templates are first-order definable in the countably infinite random graph. Our method for classifying the computational complexity of those CSPs is based on a Ramsey-theoretic analysis of functions acting on the random graph, and we develop general tools suitable for such an analysis which are of independent mathematical interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jain:2015:NSD, author = "Rahul Jain", title = "New Strong Direct Product Results in Communication Complexity", journal = j-J-ACM, volume = "62", number = "3", pages = "20:1--20:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699432", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show two new direct product results in two different models of communication complexity. Our first result is in the one-way public-coin model. Let $ f \subseteq X \times Y \times Z $ be a relation and $ \epsilon > 0 $ be a constant. Let $ R^{1, pub}_\epsilon (f) $ represent the communication complexity of $f$, with worst-case error $ \epsilon $ in this model. We show that if for computing $ f^k(k {\rm independent copies of } f)$ in this model, $ o(k c R^{1, pub}_{1 / 3} (f))$ communication is used, then the success is exponentially small in $k$. We show a new tight characterization of communication complexity in this model which strengthens the tight characterization shown in Jain et al. [2008]. We use this new characterization to show our direct product result and this characterization may also be of independent interest. Our second direct product result is in the model of two-way public-coin communication complexity. We show a direct product result for all relations in this model in terms of a new complexity measure that we define. Our new measure is a generalization to nonproduct distributions, of the two-way product subdistribution bound of Jain et al. [2008]. Our direct product result therefore generalizes to nonproduct distributions, their direct product result in terms of the two-way product subdistribution bound. As an application of our new direct product result, we reproduce (via completely different arguments) strong direct product result for the set-disjointness problem which was previously shown by Klauck [2010]. We show this by proving that our new complexity measure gives a tight lower bound of $ \Omega (n)$ for the set-disjointness problem on $n$-bit inputs (this strengthens the linear lower bound on the rectangle\slash corruption bound for set-disjointness shown by Razborov [1992]). In addition, we show that many previously known direct product results in this model are uniformly implied and often strengthened by our result.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mendelson:2015:LC, author = "Shahar Mendelson", title = "Learning without Concentration", journal = j-J-ACM, volume = "62", number = "3", pages = "21:1--21:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699439", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We obtain sharp bounds on the estimation error of the Empirical Risk Minimization procedure, performed in a convex class and with respect to the squared loss, without assuming that class members and the target are bounded functions or have rapidly decaying tails. Rather than resorting to a concentration-based argument, the method used here relies on a ``small-ball'' assumption and thus holds for classes consisting of heavy-tailed functions and for heavy-tailed targets. The resulting estimates scale correctly with the ``noise level'' of the problem, and when applied to the classical, bounded scenario, always improve the known bounds.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barany:2015:GN, author = "Vince B{\'a}r{\'a}ny and Balder {Ten Cate} and Luc Segoufin", title = "Guarded Negation", journal = j-J-ACM, volume = "62", number = "3", pages = "22:1--22:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2701414", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded fragment of first-order logic and the guarded least fixpoint logic, respectively. They also extend the recently introduced unary negation fragments of first-order logic and of least fixpoint logic. We show that the satisfiability problem for GNFO and for GNFP is 2ExpTime-complete, both on arbitrary structures and on finite structures. We also study the complexity of the associated model checking problems. Finally, we show that GNFO and GNFP are not only computationally well behaved, but also model theoretically: we show that GNFO and GNFP have the tree-like model property and that GNFO has the finite model property, and we characterize the expressive power of GNFO in terms of invariance for an appropriate notion of bisimulation. Our complexity upper bounds for GNFO and GNFP hold true even for their ``clique-guarded'' extensions CGNFO and CGNFP, in which clique guards are allowed in the place of guards.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bonacina:2015:FSC, author = "Ilario Bonacina and Nicola Galesi", title = "A Framework for Space Complexity in Algebraic Proof Systems", journal = j-J-ACM, volume = "62", number = "3", pages = "23:1--23:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699438", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (PCR), refute contradictions using polynomials. Space complexity for such systems measures the number of distinct monomials to be kept in memory while verifying a proof. We introduce a new combinatorial framework for proving space lower bounds in algebraic proof systems. As an immediate application, we obtain the space lower bounds previously provided for PC/PCR [Alekhnovich et al. 2002; Filmus et al. 2012]. More importantly, using our approach in its full potential, we prove $ \Omega (n) $ space lower bounds in PC/PCR for random $k$-CNFs ($ k \geq 4$) in $n$ variables, thus solving an open problem posed in Alekhnovich et al. [2002] and Filmus et al. [2012]. Our method also applies to the Graph Pigeonhole Principle, which is a variant of the Pigeonhole Principle defined over a constant (left) degree expander graph.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vianu:2015:IAF, author = "Victor Vianu", title = "Invited Article Foreword", journal = j-J-ACM, volume = "62", number = "3", pages = "24:1--24:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2786600", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rubin:2015:KDT, author = "Natan Rubin", title = "On Kinetic {Delaunay} Triangulations: a Near-Quadratic Bound for Unit Speed Motions", journal = j-J-ACM, volume = "62", number = "3", pages = "25:1--25:??", month = jun, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2746228", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Aug 7 10:12:49 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $P$ be a collection of $n$ points in the plane, each moving along some straight line at unit speed. We obtain an almost tight upper bound of $ O(n^{2 + \epsilon })$, for any $ \epsilon > 0$, on the maximum number of discrete changes that the Delaunay triangulation DT($P$) of $P$ experiences during this motion. Our analysis is cast in a purely topological setting, where we only assume that (i) any four points can be co-circular at most three times, and (ii) no triple of points can be collinear more than twice; these assumptions hold for unit speed motions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Franek:2015:RSS, author = "Peter Franek and Marek Krc{\'a}l", title = "Robust Satisfiability of Systems of Equations", journal = j-J-ACM, volume = "62", number = "4", pages = "26:1--26:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2751524", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function $ f : K \to R^n $ on a finite simplicial complex $K$ and $ \alpha > 0$, it holds that each function $ g : K \to R^n$ such that $ || g - f ||_\infty \leq \alpha $, has a root in $K$. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed $n$, assuming $ \dim K \leq 2 n - 3$. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when $ \dim K \geq 2 n - 2$, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when $f$ is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldwasser:2015:DCI, author = "Shafi Goldwasser and Yael Tauman Kalai and Guy N. Rothblum", title = "Delegating Computation: Interactive Proofs for Muggles", journal = j-J-ACM, volume = "62", number = "4", pages = "27:1--27:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2699436", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time or, in other words, a ``muggle''.1 The verifier should be super-efficient and run in nearly linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result's correctness in nearly linear time (instead of running the entire computation itself). Previously, related questions were considered in the holographic proof setting by Babai et al. [1991b] in the argument setting under computational assumptions by Kilian, and in the random oracle model by Micali [1994]. Our focus, however, is on the original interactive proof model where no assumptions are made on the computational power or adaptiveness of dishonest provers. Our main technical theorem gives a public coin interactive proof for any language computable by a log-space uniform boolean circuit with depth $d$ and input length $n$. The verifier runs in time $ n \cdot \poly (d, \log (n)) $ and space $ O(\log (n)) $, the communication complexity is $ \poly (d, \log (n)) $, and the prover runs in time $ \poly (n) $. In particular, for languages computable by log-space uniform NC (circuits of $ \polylog (n) $ depth), the prover is efficient, the verifier runs in time $ n \cdot \polylog (n) $ and space $ O(\log (n)) $, and the communication complexity is $ \polylog (n) $. Using this theorem we make progress on several questions. --- We show how to construct 1-round computationally sound arguments with polylog communication for any log-space uniform NC computation. The verifier runs in quasi-linear time. This result uses a recent transformation of Kalai and Raz from public coin interactive proofs to 1-round arguments. The soundness of the argument system is based on the existence of a PIR scheme with polylog communication. --- We construct interactive proofs with public coin, log-space, poly-time verifiers for all of P are given. This settles an open question regarding the expressive power of proof systems with such verifiers. --- We construct zero-knowledge interactive proofs are given with communication complexity quasi-linear in the witness length for any NP language verifiable in NC, based on the existence of 1-way functions. --- We construct probabilistically checkable arguments (a model due to Kalai and Raz) of size polynomial in the witness length (rather than instance length) for any NP language verifiable in NC, under computational assumptions, are provided.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cygan:2015:AAB, author = "Marek Cygan and Harold N. Gabow and Piotr Sankowski", title = "Algorithmic Applications of {Baur--Strassen's Theorem}: Shortest Cycles, Diameter, and Matchings", journal = j-J-ACM, volume = "62", number = "4", pages = "28:1--28:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2736283", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this article, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems: Finding Shortest Cycles. We give a simple {\~O} (Wn \omega) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs (and undirected graphs with nonnegative weights), this matches the time bounds obtained in 2011 by Roditty and Williams. On the other hand, no algorithm working in {\~O} (Wn \omega) time was previously known for undirected graphs with negative weights. Furthermore, our algorithm for a given directed or undirected graph detects whether it contains a negative weight cycle within the same running time. Computing Diameter and Radius. We give a simple {\~O} (Wn \omega) time algorithm for computing a diameter and radius of an undirected or directed graphs. To the best of our knowledge, no algorithm with this running time was known for undirected graphs with negative weights. Finding Minimum-Weight Perfect Matchings. We present an {\~O} (Wn \omega) time algorithm for finding minimum-weight perfect matchings in undirected graphs. This resolves an open problem posted by Sankowski [2009] who presented such an algorithm but only in the case of bipartite graphs. These three problems that are solved in the full generality demonstrate the utility of this framework. Hence, we believe that it can find applications for solving larger spectra of related problems. As an illustrative example, we apply it to the problem of computing a set of vertices that lie on cycles of length at most $t$, for some given $t$. We give a simple $ {\~ O}(W^n \omega)$ time algorithm for this problem that improves over the $ {\~ O}(W^n \omega t)$ time algorithm given by Yuster in 2011. Besides giving this flexible framework, the other main contribution of this article is the development of a novel combinatorial interpretation of the dual solution for the minimum-weight perfect matching problem. Despite the long history of the matching problem, such a combinatorial interpretation was not known previously. This result sheds a new light on the problem, as there exist many structural theorems about unweighted matchings, but almost no results that could cope with the weighted case.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Anonymous:2015:IAF, author = "Anonymous", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "62", number = "4", pages = "29:1--29:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2809927", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stewart:2015:UBN, author = "Alistair Stewart and Kousha Etessami and Mihalis Yannakakis", title = "Upper Bounds for {Newton}'s Method on Monotone Polynomial Systems, and {P}-Time Model Checking of Probabilistic One-Counter Automata", journal = j-J-ACM, volume = "62", number = "4", pages = "30:1--30:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2789208", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multitype branching processes, stochastic context-free grammars, probabilistic pushdown automata and recursive Markov chains) is the computation of termination probabilities, and computing these probabilities in turn boils down to computing the least fixed point (LFP) solution of a corresponding monotone polynomial system (MPS) of equations, denoted $ x = P(x) $. It was shown in Etessami and Yannakakis [2009] that a decomposed variant of Newton's method converges monotonically to the LFP solution for any MPS that has a nonnegative solution. Subsequently, Esparza et al. [2010] obtained upper bounds on the convergence rate of Newton's method for certain classes of MPSs. More recently, better upper bounds have been obtained for special classes of MPSs [Etessami et al. 2010, 2012]. However, prior to this article, for arbitrary (not necessarily strongly connected) MPSs, no upper bounds at all were known on the convergence rate of Newton's method as a function of the encoding size $ |P| $ of the input MPS, $ x = P(x) $. In this article, we provide worst-case upper bounds, as a function of both the input encoding size |P|, and \epsilon > 0, on the number of iterations required for decomposed Newton's method (even with rounding) to converge to within additive error $ \epsilon > 0 $ of $ q* $, for an arbitrary MPS with LFP solution $ q* $. Our upper bounds are essentially optimal in terms of several important parameters of the problem. Using our upper bounds, and building on prior work, we obtain the first P-time algorithm (in the standard Turing model of computation) for quantitative model checking, to within arbitrary desired precision, of discrete-time QBDs and (equivalently) probabilistic 1-counter automata, with respect to any (fixed) $ \omega $-regular or LTL property.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mostefaoui:2015:SFA, author = "Achour Most{\'e}faoui and Hamouma Moumen and Michel Raynal", title = "Signature-Free Asynchronous Binary {Byzantine} Consensus with $ t < n / 3 $, {$ O(n^2) $} Messages, and {$ O(1) $} Expected Time", journal = j-J-ACM, volume = "62", number = "4", pages = "31:1--31:??", month = aug, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2785953", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Sep 14 10:00:22 MDT 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article is on broadcast and agreement in asynchronous message-passing systems made up of $n$ processes, and where up to $t$ processes may have a Byzantine Behavior. Its first contribution is a powerful, yet simple, all-to-all broadcast communication abstraction suited to binary values. This abstraction, which copes with up to $ t < n / 3$ Byzantine processes, allows each process to broadcast a binary value, and obtain a set of values such that (1) no value broadcast only by Byzantine processes can belong to the set of a correct process, and (2) if the set obtained by a correct process contains a single value $v$, then the set obtained by any correct process contains $v$. The second contribution of this article is a new round-based asynchronous consensus algorithm that copes with up to $ t < n / 3$ Byzantine processes. This algorithm is based on the previous binary broadcast abstraction and a weak common coin. In addition to being signature-free and optimal with respect to the value of $t$, this consensus algorithm has several noteworthy properties: the expected number of rounds to decide is constant; each round is composed of a constant number of communication steps and involves $ O(n^2)$ messages; each message is composed of a round number plus a constant number of bits. Moreover, the algorithm tolerates message reordering by the adversary (i.e., the Byzantine processes).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Roughgarden:2015:IRP, author = "Tim Roughgarden", title = "Intrinsic Robustness of the Price of Anarchy", journal = j-J-ACM, volume = "62", number = "5", pages = "32:1--32:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2806883", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The price of anarchy, defined as the ratio of the worst-case objective function value of a Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of selfish behavior. Remarkably good bounds on this measure are known for a wide range of application domains. However, such bounds are meaningful only if a game's participants successfully reach a Nash equilibrium. This drawback motivates inefficiency bounds that apply more generally to weaker notions of equilibria, such as mixed Nash equilibria and correlated equilibria, and to sequences of outcomes generated by natural experimentation strategies, such as successive best responses and simultaneous regret-minimization. We establish a general and fundamental connection between the price of anarchy and its seemingly more general relatives. First, we identify a ``canonical sufficient condition'' for an upper bound on the price of anarchy of pure Nash equilibria, which we call a smoothness argument. Second, we prove an ``extension theorem'': every bound on the price of anarchy that is derived via a smoothness argument extends automatically, with no quantitative degradation in the bound, to mixed Nash equilibria, correlated equilibria, and the average objective function value of every outcome sequence generated by no-regret learners. Smoothness arguments also have automatic implications for the inefficiency of approximate equilibria, for bicriteria bounds, and, under additional assumptions, for polynomial-length best-response sequences. Third, we prove that in congestion games, smoothness arguments are ``complete'' in a proof-theoretic sense: despite their automatic generality, they are guaranteed to produce optimal worst-case upper bounds on the price of anarchy.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chierichetti:2015:LPF, author = "Flavio Chierichetti and Ravi Kumar", title = "{LSH}-Preserving Functions and Their Applications", journal = j-J-ACM, volume = "62", number = "5", pages = "33:1--33:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2816813", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Locality sensitive hashing (LSH) is a key algorithmic tool that is widely used both in theory and practice. An important goal in the study of LSH is to understand which similarity functions admit an LSH, that is, are LSHable. In this article, we focus on the class of transformations such that given any similarity that is LSHable, the transformed similarity will continue to be LSHable. We show a tight characterization of all such LSH-preserving transformations: they are precisely the probability generating functions, up to scaling. As a concrete application of this result, we study which set similarity measures are LSHable. We obtain a complete characterization of similarity measures between two sets $A$ and $B$ that are ratios of two linear functions of $ | A \cap B |$, $ | A \triangle B |$, $ | A \cup B |$: such a measure is LSHable if and only if its corresponding distance is a metric. This result generalizes the well-known LSH for the Jaccard set similarity, namely, the minwise-independent permutations, and obtains LSHs for many set similarity measures that are used in practice. Using our main result, we obtain a similar characterization for set similarities involving radicals.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{An:2015:ICA, author = "Hyung-Chan An and Robert Kleinberg and David B. Shmoys", title = "Improving {Christofides}' Algorithm for the $s$-$t$ Path {TSP}", journal = j-J-ACM, volume = "62", number = "5", pages = "34:1--34:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2818310", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a deterministic $ (1 + \sqrt {5} / 2)$-approximation algorithm for the $s$-$t$ path TSP for an arbitrary metric. Given a symmetric metric cost on $n$ vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the two endpoints; Hoogeveen showed that the natural variant of Christofides' algorithm is a $ 5 / 3$-approximation algorithm for this problem, and this asymptotically tight bound in fact has been the best approximation ratio known until now. We modify this algorithm so that it chooses the initial spanning tree based on an optimal solution to the Held--Karp relaxation rather than a minimum spanning tree; we prove this simple but crucial modification leads to an improved approximation ratio, surpassing the 20-year-old ratio set by the natural Christofides' algorithm variant. Our algorithm also proves an upper bound of $ 1 + \sqrt {5} / 2$ on the integrality gap of the path-variant Held--Karp relaxation. The techniques devised in this article can be applied to other optimization problems as well: these applications include improved approximation algorithms and improved LP integrality gap upper bounds for the prize-collecting $s$-$t$ path problem and the unit-weight graphical metric $s$-$t$ path TSP.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Elkin:2015:OES, author = "Michael Elkin and Shay Solomon", title = "Optimal {Euclidean} Spanners: Really Short, Thin, and Lanky", journal = j-J-ACM, volume = "62", number = "5", pages = "35:1--35:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2819008", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geometric spanners. In a seminal STOC'95 paper, titled ``Euclidean spanners: short, thin and lanky'', Arya et al. [1995] devised a construction of Euclidean (1 + \epsilon)-spanners that achieves constant degree, diameter $ O (\log n) $, weight $ O(\log^2 n) \cdot \omega ({\rm MST}) $, and has running time $ O(n \cdot \log n) $. This construction applies to $n$-point constant-dimensional Euclidean spaces. Moreover, Arya et al. conjectured that the weight bound can be improved by a logarithmic factor, without increasing the degree and the diameter of the spanner, and within the same running time. This conjecture of Arya et al. became one of the most central open problems in the area of Euclidean spanners. Nevertheless, the only progress since 1995 towards its resolution was achieved in the lower bounds front: Any spanner with diameter $ O (\log n)$ must incur weight $ \Omega (\log n) \cdot \omega ({\rm MST})$, and this lower bound holds regardless of the stretch or the degree of the spanner [Dinitz et al. 2008; Agarwal et al. 2005]. In this article we resolve the long-standing conjecture of Arya et al. in the affirmative. We present a spanner construction with the same stretch, degree, diameter, and running time, as in Arya et al.'s result, but with optimal weight $ O (\log n) \cdot \omega ({\rm MST})$. So our spanners are as thin and lanky as those of Arya et al., but they are really short! Moreover, our result is more general in three ways. First, we demonstrate that the conjecture holds true not only in constant-dimensional Euclidean spaces, but also in doubling metrics. Second, we provide a general trade-off between the three involved parameters, which is tight in the entire range. Third, we devise a transformation that decreases the lightness of spanners in general metrics, while keeping all their other parameters in check. Our main result is obtained as a corollary of this transformation.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Pettie:2015:SBD, author = "Seth Pettie", title = "Sharp Bounds on {Davenport--Schinzel} Sequences of Every Order", journal = j-J-ACM, volume = "62", number = "5", pages = "36:1--36:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2794075", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of $n$ univariate functions, each pair of which crosses at most $s$ times, for some fixed $s$. This problem is known to be equivalent to bounding the length of an order-$s$ Davenport--Schinzel sequence, namely, a sequence over an $n$-letter alphabet that avoids alternating subsequences of the form $ a \cdots b \cdots a \cdots b \cdots $ with length $ s + 2$. These sequences were introduced by Davenport and Schinzel in 1965 to model a certain problem in differential equations and have since been applied to bound the running times of geometric algorithms, data structures, and the combinatorial complexity of geometric arrangements. Let $ \delta_s(n)$ be the maximum length of an order-$s$ DS sequence over n letters. What is $ \delta_s$ asymptotically? This question has been answered satisfactorily [Hart and Sharir 1986; Agarwal et al. 1989; Klazar 1999; Nivasch 2010], when $s$ is even or $ s \leq 3$. However, since the work of Agarwal et al. in the mid-1980s, there has been a persistent gap in our understanding of the odd orders. In this work, we effectively close the problem by establishing sharp bounds on Davenport--Schinzel sequences of every order $s$. Our results reveal that, contrary to one's intuition, $ \delta_s(n)$ behaves essentially like $ \delta_{s - 1} (n)$ when $s$ is odd. This refutes conjectures by Alon et al. [2008] and Nivasch [2010].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kantor:2015:TWC, author = "Erez Kantor and Zvi Lotker and Merav Parter and David Peleg", title = "The Topology of Wireless Communication", journal = j-J-ACM, volume = "62", number = "5", pages = "37:1--37:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2807693", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article studies the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths of other interfering signals plus background noise. To describe the behavior of a multistation network, we use the convenient representation of a reception map, which partitions the plane into reception zones, one per station, and the complementary region of the plane where no station can be heard. SINR diagrams have been studied in Avin et al. [2009] for the specific case where all stations use the same power. It was shown that the reception zones are convex (hence connected) and fat, and this was used to devise an efficient algorithm for the fundamental problem of point location. Here we consider the more general (and common) case where transmission energies are arbitrary (or nonuniform). Under that setting, the reception zones are not necessarily convex or even connected. This poses the algorithmic challenge of designing efficient point location techniques for the nonuniform setting, as well as the theoretical challenge of understanding the geometry of SINR diagrams (e.g., the maximal number of connected components they might have). Our key result exhibits a striking contrast between $d$ --- and $ (d + 1)$-dimensional maps for a network embedded in $d$-dimensional space. Specifically, it is shown that whereas the $d$-dimensional map might be highly fractured, drawing the map in one dimension higher ``heals'' the zones, which become connected (in fact, hyperbolically connected). We also provide bounds for the fatness of reception zones. Subsequently, we consider algorithmic applications and propose a new variant of approximate point location.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lotker:2015:IDA, author = "Zvi Lotker and Boaz Patt-Shamir and Seth Pettie", title = "Improved Distributed Approximate Matching", journal = j-J-ACM, volume = "62", number = "5", pages = "38:1--38:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2786753", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times. The computational model is a network of processors exchanging $ O (\log n)$-bit messages (the CONGEST model). For unweighted graphs, we give an algorithm providing $ (1 - \epsilon)$-approximation in $ O (\log n)$ time for any constant $ \epsilon > 0$, improving on the classical $ \frac {1}{2}$-approximation in $ O(\log n)$ time of Israeli and Itai [1986]. The time complexity of the algorithm depends on $ 1 \cdot \epsilon $ exponentially in the general case, and polynomially in bipartite graphs. For weighted graphs, we present another algorithm which provides $ (\frac {1}{2} - \epsilon)$ approximation in general graphs in $ O (\log \epsilon^{-1} \log n)$ time, improving on the previously known algorithms which attain $ (\frac {1}{4} - \epsilon)$-approximation in $ O (\log n)$ time or $ \frac {1}{2}$-approximation in $ O (n)$ time. All our algorithms are randomized: the complexity bounds hold both with high probability and for the expected running time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Diekert:2015:RLC, author = "Volker Diekert and Manfred Kufleitner and Klaus Reinhardt and Tobias Walter", title = "Regular Languages Are {Church--Rosser} Congruential", journal = j-J-ACM, volume = "62", number = "5", pages = "39:1--39:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2808227", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article shows a general result about finite monoids and weight reducing string rewriting systems. As a consequence it proves a long standing conjecture in formal language theory: All regular languages are Church--Rosser congruential. The class of Church--Rosser congruential languages was introduced by McNaughton, Narendran, and Otto in 1988. A language $L$ is Church--Rosser congruential if there exists a finite, confluent, and length-reducing semi-Thue system $S$ such that $L$ is a finite union of congruence classes modulo $S$. It was known that there are deterministic linear context-free languages which are not Church--Rosser congruential, but the conjecture was that all regular languages are of this form. The article offers a stronger statement: A language is regular if and only if it is strongly Church--Rosser congruential. It is the journal version of the conference abstract which was presented at ICALP 2012.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bansal:2015:PCA, author = "Nikhil Bansal and Niv Buchbinder and Aleksander Madry and Joseph (Seffi) Naor", title = "A Polylogarithmic-Competitive Algorithm for the $k$-Server Problem", journal = j-J-ACM, volume = "62", number = "5", pages = "40:1--40:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2783434", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of $ {\~ O}(\log^3 n \log^2 k)$ for any metric space on $n$ points. Our algorithm improves upon the deterministic $ (2 k - 1)$-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of $n$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wigderson:2015:IAF, author = "Avi Wigderson and Phokion Kolaitis", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "62", number = "5", pages = "41:1--41:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2831493", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arora:2015:SAU, author = "Sanjeev Arora and Boaz Barak and David Steurer", title = "Subexponential Algorithms for Unique Games and Related Problems", journal = j-J-ACM, volume = "62", number = "5", pages = "42:1--42:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2775105", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Subexponential time approximation algorithms are presented for the Unique Games and Small-Set Expansion problems. Specifically, for some absolute constant $c$, the following two algorithms are presented. (1) An $ \exp (k n^\epsilon)$-time algorithm that, given as input a $k$-alphabet unique game on $n$ variables that has an assignment satisfying $ 1 - \epsilon^c$ fraction of its constraints, outputs an assignment satisfying $ 1 \epsilon $ fraction of the constraints. (2) An $ \exp (n^\epsilon / \delta)$-time algorithm that, given as input an $n$-vertex regular graph that has a set $S$ of $ \delta n$ vertices with edge expansion at most $ \epsilon^c$, outputs a set $ S'$ of at most $ \delta n$ vertices with edge expansion at most $ \epsilon $. Subexponential algorithm is also presented with improved approximation to Max Cut, Sparsest Cut, and Vertex Cover on some interesting subclasses of instances. These instances are graphs with low threshold rank, an interesting new graph parameter highlighted by this work. Khot's Unique Games Conjecture (UGC) states that it is NP-hard to achieve approximation guarantees such as ours for Unique Games. While the results here stop short of refuting the UGC, they do suggest that Unique Games are significantly easier than NP-hard problems such as Max 3-Sat, Max 3-Lin, Label Cover, and more, which are believed not to have a subexponential algorithm achieving a nontrivial approximation ratio. Of special interest in these algorithms is a new notion of graph decomposition that may have other applications. Namely, it is shown for every $ \epsilon > 0$ and every regular $n$-vertex graph G, by changing at most {\delta} fraction of $G$'s edges, one can break $G$ into disjoint parts so that the stochastic adjacency matrix of the induced graph on each part has at most $ n^\epsilon $ eigenvalues larger than $ 1 - \eta $, where $ \eta $ depends polynomially on $ \epsilon $. The subexponential algorithm combines this decomposition with previous algorithms for Unique Games on graphs with few large eigenvalues [Kolla and Tulsiani 2007; Kolla 2010].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Koutris:2015:QBD, author = "Paraschos Koutris and Prasang Upadhyaya and Magdalena Balazinska and Bill Howe and Dan Suciu", title = "Query-Based Data Pricing", journal = j-J-ACM, volume = "62", number = "5", pages = "43:1--43:??", month = nov, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2770870", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Tue Nov 3 07:37:35 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Data is increasingly being bought and sold online, and Web-based marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price. In this article, we propose a framework for pricing data on the Internet that, given the price of a few views, allows the price of any query to be derived automatically. We call this capability query-based pricing. We first identify two important properties that the pricing function must satisfy, the arbitrage-free and discount-free properties. Then, we prove that there exists a unique function that satisfies these properties and extends the seller's explicit prices to all queries. Central to our framework is the notion of query determinacy, and in particular instance-based determinacy: we present several results regarding the complexity and properties of it. When both the views and the query are unions of conjunctive queries or conjunctive queries, we show that the complexity of computing the price is high. To ensure tractability, we restrict the explicit prices to be defined only on selection views (which is the common practice today). We give algorithms with polynomial time data complexity for computing the price of two classes of queries: chain queries (by reducing the problem to network flow), and cyclic queries. Furthermore, we completely characterize the class of conjunctive queries without self-joins that have PTIME data complexity, and prove that pricing all other queries is NP-complete, thus establishing a dichotomy on the complexity of the pricing problem when all views are selection queries.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Har-Peled:2015:NPL, author = "Sariel Har-Peled and Benjamin Raichel", title = "Net and Prune: a Linear Time Algorithm for {Euclidean} Distance Problems", journal = j-J-ACM, volume = "62", number = "6", pages = "44:1--44:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2831230", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTAS's) to several well known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor. The new approach is robust to variations in the input problem, and yet it is simple, elegant, and practical. In particular, many of these well studied problems which fit easily into our framework, either previously had no linear time approximation algorithm, or required rather involved algorithms and analysis. A short list of the problems we consider include farthest nearest neighbor, $k$-center clustering, smallest disk enclosing $k$ points, $k$ th largest distance, $k$ th smallest $m$-nearest neighbor distance, $k$ th heaviest edge in the MST and other spanning forest type problems, problems involving upward closed set systems, and more. Finally, we show how to extend our framework such that the linear running time bound holds with high probability.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gorbunov:2015:ABE, author = "Sergey Gorbunov and Vinod Vaikuntanathan and Hoeteck Wee", title = "Attribute-Based Encryption for Circuits", journal = j-J-ACM, volume = "62", number = "6", pages = "45:1--45:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2824233", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an $l$-bit public index ind and a message $m$, and a secret key is associated with a Boolean predicate $P$. The secret key allows decrypting the ciphertext and learning $m$ if and only if $ P({\rm ind}) = 1$. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext. We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit. Our construction is secure under the standard learning with errors (LWE) assumption. Previous constructions of attribute-based encryption were for Boolean formulas, captured by the complexity class NC$^1$. In the course of our construction, we present a new framework for constructing ABE schemes. As a by-product of our framework, we obtain ABE schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Miles:2015:SPN, author = "Eric Miles and Emanuele Viola", title = "Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs", journal = j-J-ACM, volume = "62", number = "6", pages = "46:1--46:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2792978", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article takes a new step towards closing the gap between pseudorandom functions (PRF) and their popular, bounded-input-length counterparts. This gap is both quantitative, because these counterparts are more efficient than PRF in various ways, and methodological, because these counterparts usually fit in the substitution-permutation network paradigm (SPN), which has not been used to construct PRF. We give several candidate PRF $ F_i $ that are inspired by the SPN paradigm. Most of our candidates are more efficient than previous ones. Our main candidates are as follows. --- $ F_1 : \{ 0, 1 \}^n \to \{ 0, 1 \}^n $ is an SPN whose S-box is a random function on $b$ bits given as part of the seed. We prove that $ F_1$ resists attacks that run in time $ \leq 2^{\epsilon b}$. --- $ F_2 : \{ 0, 1 \}^n \to \{ 0, 1 \}^n$ is an SPN where the S-box is (patched) field inversion, a common choice in practical constructions. We show that $ F_2$ is computable with boolean circuits of size $ n \cdot \log^{O(1)} n$ and that it has exponential security $ 2^{\Omega (n)}$ against linear and differential cryptanalysis. --- $ F_3 : \{ 0, 1 \}^n \to \{ 0, 1 \} $ is a nonstandard variant on the SPN paradigm, where ``states'' grow in length. We show that $ F_3$ is computable with TC$^0$ circuits of size $ n^{1 + \epsilon }$, for any $ \epsilon > 0$, and that it is almost 3-wise independent. --- $ F_4 : \{ 0, 1 \}^n \to \{ 0, 1 \} $ uses an extreme setting of the SPN parameters (one round, one S-box, no diffusion matrix). The S-box is again (patched) field inversion. We show that $ F_4$ is computable by circuits of size $ n \cdot \log^{O(1)}$ n and that it fools all parity tests on $ \leq 2^{0.9 n}$ outputs. Assuming the security of our candidates, our work narrows the gap between the Natural Proofs barrier and existing lower bounds in three models: circuits, TC$^0$ circuits, and Turing machines.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "46", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haeupler:2015:SFD, author = "Bernhard Haeupler", title = "Simple, Fast and Deterministic Gossip and Rumor Spreading", journal = j-J-ACM, volume = "62", number = "6", pages = "47:1--47:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2767126", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study gossip algorithms for the rumor spreading problem, which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call one neighbor per round and have recently attracted attention as message efficient, simple, and robust solutions to the rumor spreading problem. A long series of papers analyzed the performance of uniform random gossip in which nodes repeatedly call a random neighbor to exchange all rumors with. A main result of this investigation was that uniform gossip completes in $ O(\log n / \Phi) $ rounds where $ \Phi $ is the conductance of the network. Nonuniform random gossip schemes were devised to allow efficient rumor spreading in networks with bottlenecks. In particular, [Censor-Hillel et al., STOC\&12] gave an $ O(\log^3 n) $ algorithm to solve the $1$-local broadcast problem in which each node wants to exchange rumors locally with its $1$-neighborhood. By repeatedly applying this protocol, one can solve the global rumor spreading quickly for all networks with small diameter, independently of the conductance. All these algorithms are inherently randomized in their design and analysis. A parallel research direction has been to reduce and determine the amount of randomness needed for efficient rumor spreading. This has been done via lower bounds for restricted models and by designing gossip algorithms with a reduced need for randomness, for instance, by using pseudorandom generators with short random seeds. The general intuition and consensus of these results has been that randomization plays a important role in effectively spreading rumors and that at least a polylogarithmic number of random bit are crucially needed. In this article improves over the state of the art in several ways by presenting a deterministic gossip algorithm that solves the the $k$-local broadcast problem in $ 2 (k + \log_2 n) \log_2 n$ rounds. Besides being the first efficient deterministic solution to the rumor spreading problem this algorithm is interesting in many aspects: It is simpler, more natural, more robust, and faster than its randomized pendant and guarantees success with certainty instead of with high probability. Its analysis is furthermore simple, self-contained, and fundamentally different from prior works.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "47", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Anderson:2015:SLP, author = "Matthew Anderson and Anuj Dawar and Bjarki Holm", title = "Solving Linear Programs without Breaking Abstractions", journal = j-J-ACM, volume = "62", number = "6", pages = "48:1--48:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2822890", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that the ellipsoid method for solving linear programs can be implemented in a way that respects the symmetry of the program being solved. That is to say, there is an algorithmic implementation of the method that does not distinguish, or make choices, between variables or constraints in the program unless they are distinguished by properties definable from the program. In particular, we demonstrate that the solvability of linear programs can be expressed in fixed-point logic with counting (FPC) as long as the program is given by a separation oracle that is itself definable in FPC. We use this to show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah [Blass et al. 1999]. On the way to defining a suitable separation oracle for the maximum matching program, we provide FPC formulas defining canonical maximum flows and minimum cuts in undirected capacitated graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "48", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Unruh:2015:RQT, author = "Dominique Unruh", title = "Revocable Quantum Timed-Release Encryption", journal = j-J-ACM, volume = "62", number = "6", pages = "49:1--49:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2817206", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Timed-release encryption is a kind of encryption scheme in which a recipient can decrypt only after a specified amount of time T (assuming that we have a moderately precise estimate of his computing power). A revocable timed-release encryption is one where, before the time T is over, the sender can ``give back'' the timed-release encryption, provably loosing all access to the data. We show that revocable timed-release encryption without trusted parties is possible using quantum cryptography (while trivially impossible classically). Along the way, we develop two proof techniques in the quantum random oracle model that we believe may have applications also for other protocols. Finally, we also develop another new primitive, unknown recipient encryption, which allows us to send a message to an unknown/unspecified recipient over an insecure network in such a way that at most one recipient will get the message.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "49", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Galanis:2015:IAS, author = "Andreas Galanis and Daniel Stefankovic and Eric Vigoda", title = "Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region", journal = j-J-ACM, volume = "62", number = "6", pages = "50:1--50:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2785964", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree \Delta undergoes a phase transition that coincides with the statistical physics uniqueness/nonuniqueness phase transition on the infinite \Delta -regular tree. Despite this clear picture for 2-spin systems, there is little known for multispin systems. We present the first analog of this in approximability results for multispin systems. The main difficulty in previous inapproximability results was analyzing the behavior of the model on random \Delta -regular bipartite graphs, which served as the gadget in the reduction. To this end, one needs to understand the moments of the partition function. Our key contribution is connecting: (i) induced matrix norms, (ii) maxima of the expectation of the partition function, and (iii) attractive fixed points of the associated tree recursions (belief propagation). The view through matrix norms allows a simple and generic analysis of the second moment for any spin system on random \Delta -regular bipartite graphs. This yields concentration results for any spin system in which one can analyze the maxima of the first moment. The connection to fixed points of the tree recursions enables an analysis of the maxima of the first moment for specific models of interest. For $k$-colorings we prove that for even $k$, in a tree nonuniqueness region (which corresponds to $ k < \Delta $) there is no FPRAS, unless NP = RP, to approximate the number of colorings for triangle-free $ \Delta $-regular graphs. Our proof extends to the antiferromagnetic Potts model, and, in fact, to every antiferromagnetic model under a mild condition.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "50", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Avron:2015:RAL, author = "Haim Avron and Alex Druinsky and Anshul Gupta", title = "Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization", journal = j-J-ACM, volume = "62", number = "6", pages = "51:1--51:??", month = dec, year = "2015", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2814566", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Dec 21 17:57:46 MST 2015", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Asynchronous methods for solving systems of linear equations have been researched since Chazan and Miranker's [1969] pioneering paper on chaotic relaxation. The underlying idea of asynchronous methods is to avoid processor idle time by allowing the processors to continue to make progress even if not all progress made by other processors has been communicated to them. Historically, the applicability of asynchronous methods for solving linear equations has been limited to certain restricted classes of matrices, such as diagonally dominant matrices. Furthermore, analysis of these methods focused on proving convergence in the limit. Comparison of the asynchronous convergence rate with its synchronous counterpart and its scaling with the number of processors have seldom been studied and are still not well understood. In this article, we propose a randomized shared-memory asynchronous method for general symmetric positive definite matrices. We rigorously analyze the convergence rate and prove that it is linear and is close to that of the method's synchronous counterpart if the processor count is not excessive relative to the size and sparsity of the matrix. We also present an algorithm for unsymmetric systems and overdetermined least-squares. Our work presents a significant improvement in the applicability of asynchronous linear solvers as well as in their convergence analysis, and suggests randomization as a key paradigm to serve as a foundation for asynchronous methods.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "51", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lovett:2016:CBR, author = "Shachar Lovett", title = "Communication is Bounded by Root of Rank", journal = j-J-ACM, volume = "63", number = "1", pages = "1:1--1:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2724704", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that any total boolean function of rank r can be computed by a deterministic communication protocol of complexity $ O (\sqrt {c \log (r)}) $. Equivalently, any graph whose adjacency matrix has rank r has chromatic number at most $ 2^{O (\sqrt {r c \log (r)})} $. This gives a nearly quadratic improvement in the dependence on the rank over previous results.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Momke:2016:RAE, author = "Tobias M{\"o}mke and Ola Svensson", title = "Removing and Adding Edges for the Traveling Salesman Problem", journal = j-J-ACM, volume = "63", number = "1", pages = "2:1--2:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2739008", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), we show that the approach gives a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted either to half-integral solutions to the Held-Karp relaxation or to a class of graphs that contains subcubic and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework also allows for generalizations in a natural way and leads to analogous results for the s, t -path traveling salesman problem on graphic metrics where the start and end vertices are prespecified.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bilardi:2016:NOA, author = "Gianfranco Bilardi and Andrea Pietracaprina and Geppino Pucci and Michele Scquizzato and Francesco Silvestri", title = "Network-Oblivious Algorithms", journal = j-J-ACM, volume = "63", number = "1", pages = "3:1--3:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2812804", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem's input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jez:2016:RSP, author = "Artur Jez", title = "Recompression: a Simple and Powerful Technique for Word Equations", journal = j-J-ACM, volume = "63", number = "1", pages = "4:1--4:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2743014", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", 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", abstract = "In this article, we present an application of a simple technique of local recompression, previously developed by the author in the context algorithms for compressed strings [Jez 2014a, 2015b, 2015a], to word equations. The technique is based on local modification of variables (replacing $X$ by $ a X$ or $ X a$) and iterative replacement of pairs of letters occurring in the equation by a ``fresh'' letter, which can be seen as a bottom-up compression of the solution of the given word equation, or, to be more specific, building a Straight-Line Programme for the solution of the word equation. Using this technique, we give new, independent, and self-contained proofs of many known results for word equations. To be more specific, the presented (nondeterministic) algorithm runs in $ O (n \log n)$ space and in time polynomial in $n$ and $ \log N$, where $n$ is the size of the input equation and $N$ the size of the length-minimal solution of the word equation. Furthermore, for $ O (1)$ variables, the bound on the space consumption is in fact linear, that is, $ O (m)$, where $m$ is the size of the space used by the input. This yields that for each $k$ the set of satisfiable word equations with $k$ variables is context sensitive. The presented algorithm can be easily generalised to a generator of all solutions of the given word equation (without increasing the space usage). Furthermore, a further analysis of the algorithm yields an independent proof of doubly exponential upper bound on the size of the length-minimal solution. The presented algorithm does not use exponential bound on the exponent of periodicity. Conversely, the analysis of the algorithm yields an independent proof of the exponential bound on exponent of periodicity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dobzinski:2016:IRT, author = "Shahar Dobzinski and Jan Vondr{\'a}k", title = "Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations", journal = j-J-ACM, volume = "63", number = "1", pages = "5:1--5:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2786754", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A long-standing open question in algorithmic mechanism design is whether there exist computationally efficient truthful mechanisms for combinatorial auctions, with performance guarantees close to those possible without considerations of truthfulness. In this article, we answer this question negatively: the requirement of truthfulness can impact dramatically the ability of a mechanism to achieve a good approximation ratio for combinatorial auctions. More precisely, we show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that approximates optimal social welfare within a factor of m$^{1 / 2 - \epsilon }$ must use exponentially many value queries, where m is the number of items. Furthermore, we show that there exists a class of succinctly represented submodular valuation functions, for which the existence of a universally truthful polynomial-time mechanism that provides an m$^{1 / 2 - \epsilon }$ -approximation would imply NP = RP. In contrast, ignoring truthfulness, there exist constant-factor approximation algorithms for this problem, and ignoring computational efficiency, the VCG mechanism is truthful and provides optimal social welfare. These are the first hardness results for truthful polynomial-time mechanisms for any type of combinatorial auctions, even for deterministic mechanisms. Our approach is based on a novel direct hardness technique that completely skips the notoriously hard step of characterizing truthful mechanisms. The characterization step was the main obstacle for proving impossibility results in algorithmic mechanism design so far.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fraigniaud:2016:OAL, author = "Pierre Fraigniaud and Amos Korman", title = "An Optimal Ancestry Labeling Scheme with Applications to {XML} Trees and Universal Posets", journal = j-J-ACM, volume = "63", number = "1", pages = "6:1--6:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2794076", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we solve the ancestry-labeling scheme problem, which aims at assigning the shortest possible labels (bit strings) to nodes of rooted trees, so ancestry queries between any two nodes can be answered by inspecting their assigned labels only. This problem was introduced more than 20 years ago by Kannan et al. [1988] and is among the most well-studied problems in the field of informative labeling schemes. We construct an ancestry-labeling scheme for n node trees with label size $ \log_2 n + O (\log \log n) $ bits, thus matching the $ \log_2 n + \Omega (\log \log n) $ bits lower bound given by Alstrup et al. [2003]. Our scheme is based on a simplified ancestry scheme that operates extremely well on a restricted set of trees. In particular, for the set of $n$-node trees with a depth of at most $d$, the simplified ancestry scheme enjoys label size of $ \log_2 n + 2 \log_2 d + O (1)$ bits. Since the depth of most XML trees is at most some small constant, such an ancestry scheme may be of practical use. In addition, we also obtain an adjacency labeling scheme that labels $n$-node trees of depth $d$ with labels of size $ \log_2 n + 3 \log_2 d + O (1)$ bits. All our schemes assign the labels in linear time, and guarantee that any query can be answered in constant time. Finally, our ancestry scheme finds applications to the construction of small universal partially ordered sets (posets). Specifically, for any fixed integer $k$, it enables the construction of a universal poset of size $ {\~ O}(n^k)$ for the family of $n$-element posets with a tree dimension of at most $k$. Up to lower-order terms, this bound is tight thanks to a lower bound of $ n^{k - o(1)}$ by to Alon and Scheinerman [1988].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Geerts:2016:ASC, author = "Floris Geerts and Thomas Unger and Grigoris Karvounarakis and Irini Fundulaki and Vassilis Christophides", title = "Algebraic Structures for Capturing the Provenance of {SPARQL} Queries", journal = j-J-ACM, volume = "63", number = "1", pages = "7:1--7:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2810037", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The evaluation of SPARQL algebra queries on various kinds of annotated RDF graphs can be seen as a particular case of the evaluation of these queries on RDF graphs annotated with elements of so-called spm-semirings. Spm-semirings extend semirings, used for representing the provenance of positive relational algebra queries on annotated relational data, with a new operator to capture the semantics of the non-monotone SPARQL operators. Furthermore, spm-semiring-based annotations ensure that desired SPARQL query equivalences hold when querying annotated RDF. In this work, in addition to introducing spm-semirings, we study their properties and provide an alternative characterization of these structures in terms of semirings with an embedded boolean algebra (or seba-structure for short). This characterization allows us to construct spm-semirings and identify a universal object in the class of spm-semirings. Finally, we show that this universal object provides a provenance representation of poly-sized overhead and can be used to evaluate SPARQL queries on arbitrary spm-semiring-annotated RDF graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2016:IAFa, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "63", number = "1", pages = "8:1--8:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2875947", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Honda:2016:MAS, author = "Kohei Honda and Nobuko Yoshida and Marco Carbone", title = "Multiparty Asynchronous Session Types", journal = j-J-ACM, volume = "63", number = "1", pages = "9:1--9:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2827695", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Communication is a central elements in software development. As a potential typed foundation for structured communication-centered programming, session types have been studied over the past decade for a wide range of process calculi and programming languages, focusing on binary (two-party) sessions. This work extends the foregoing theories of binary session types to multiparty, asynchronous sessions, which often arise in practical communication-centered applications. Presented as a typed calculus for mobile processes, the theory introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario. Global types retain the friendly type syntax of binary session types while specifying dependencies and capturing complex causal chains of multiparty asynchronous interactions. A global type plays the role of a shared agreement among communication peers and is used as a basis of efficient type-checking through its projection onto individual peers. The fundamental properties of the session type discipline, such as communication safety, progress, and session fidelity, are established for general n-party asynchronous interactions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Esparza:2016:PVA, author = "Javier Esparza and Pierre Ganty and Rupak Majumdar", title = "Parameterized Verification of Asynchronous Shared-Memory Systems", journal = j-J-ACM, volume = "63", number = "1", pages = "10:1--10:??", month = mar, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2842603", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:31 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We characterize the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the complexity of the safety verification problem when processes are modeled by finite-state machines, pushdown machines, and Turing machines. The problem is coNP-complete when all processes are finite-state machines, and is PSPACE-complete when they are pushdown machines. The complexity remains coNP-complete when each Turing machine is allowed boundedly many interactions with the register. Our proofs use combinatorial characterizations of computations in the model, and in the case of pushdown systems, some language-theoretic constructions of independent interest. Our results are surprising, because parameterized verification problems on slight variations of our model are known to be undecidable. For example, the problem is undecidable for finite-state machines operating with synchronization primitives, and already for two communicating pushdown machines. Thus, our results show that a robust, decidable class can be obtained under the assumptions of anonymity and asynchrony.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Christodoulou:2016:BCA, author = "George Christodoulou and Annam{\'a}ria Kov{\'a}cs and Michael Schapira", title = "{Bayesian} Combinatorial Auctions", journal = j-J-ACM, volume = "63", number = "2", pages = "11:1--11:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2835172", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the following simple Bayesian auction setting: m items are sold to n selfish bidders in m independent second-price auctions. Each bidder has a private valuation function that specifies his or her complex preferences over all subsets of items. Bidders only have beliefs about the valuation functions of the other bidders, in the form of probability distributions. The objective is to allocate the items to the bidders in a way that provides a good approximation to the optimal social welfare value. We show that if bidders have submodular or, more generally, fractionally subadditive (aka XOS) valuation functions, every Bayes-Nash equilibrium of the resulting game provides a 2-approximation to the optimal social welfare. Moreover, we show that in the full-information game, a pure Nash always exists and can be found in time that is polynomial in both m and n.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arora:2016:CPD, author = "Sanjeev Arora and Satyen Kale", title = "A Combinatorial, Primal-Dual Approach to Semidefinite Programs", journal = j-J-ACM, volume = "63", number = "2", pages = "12:1--12:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2837020", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Semidefinite programs (SDPs) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-known multiplicative weights update rule to symmetric matrices. For a number of problems, such as Sparsest Cut and Balanced Separator in undirected and directed weighted graphs, Min UnCut and Min 2CNF Deletion, this yields combinatorial approximation algorithms that are significantly more efficient than interior point methods. The design of our primal-dual algorithms is guided by a robust analysis of rounding algorithms used to obtain integer solutions from fractional ones. Our ideas have proved useful in quantum computing, especially the recent result of Jain et al. [2011] that QIP = PSPACE.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{King:2016:BAE, author = "Valerie King and Jared Saia", title = "{Byzantine} Agreement in Expected Polynomial Time", journal = j-J-ACM, volume = "63", number = "2", pages = "13:1--13:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2837019", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We address the problem of Byzantine agreement, to bring processors to agreement on a bit in the presence of a strong adversary. This adversary has full information of the state of all processors, the ability to control message scheduling in an asynchronous model, and the ability to control the behavior of a constant fraction of processors that it may choose to corrupt adaptively. In 1983, Ben-Or proposed an algorithm for solving this problem with expected exponential communication time. In this article, we improve that result to require expected polynomial communication time and computation time. Like Ben-Or's algorithm, our algorithm uses coinflips from individual processors to repeatedly try to generate a fair global coin. We introduce a method that uses spectral analysis to identify processors that have thwarted this goal by flipping biased coins.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Libkin:2016:QGD, author = "Leonid Libkin and Wim Martens and Domagoj Vrgoc", title = "Querying Graphs with Data", journal = j-J-ACM, volume = "63", number = "2", pages = "14:1--14:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2850413", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Graph databases have received much attention as of late due to numerous applications in which data is naturally viewed as a graph; these include social networks, RDF and the Semantic Web, biological databases, and many others. There are many proposals for query languages for graph databases that mainly fall into two categories. One views graphs as a particular kind of relational data and uses traditional relational mechanisms for querying. The other concentrates on querying the topology of the graph. These approaches, however, lack the ability to combine data and topology, which would allow queries asking how data changes along paths and patterns enveloping it. In this article, we present a comprehensive study of languages that enable such combination of data and topology querying. These languages come in two flavors. The first follows the standard approach of path queries, which specify how labels of edges change along a path, but now we extend them with ways of specifying how both labels and data change. From the complexity point of view, the right type of formalisms are subclasses of register automata. These, however, are not well suited for querying. To overcome this, we develop several types of extended regular expressions to specify paths with data and study their querying power and complexity. The second approach adopts the popular XML language XPath and extends it from XML documents to graphs. Depending on the exact set of allowed features, we have a family of languages, and our study shows that it includes efficient and highly expressive formalisms for querying both the structure of the data and the data itself.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Andersen:2016:AOL, author = "Reid Andersen and Shayan Oveis Gharan and Yuval Peres and Luca Trevisan", title = "Almost Optimal Local Graph Clustering Using Evolving Sets", journal = j-J-ACM, volume = "63", number = "2", pages = "15:1--15:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2856030", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Spectral partitioning is a simple, nearly linear time algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee for the quality of the approximation found by the algorithm. A local graph partitioning algorithm finds a set of vertices with small conductance (i.e., a sparse cut) by adaptively exploring part of a large graph G, starting from a specified vertex. For the algorithm to be local, its complexity must be bounded in terms of the size of the set that it outputs, with at most a weak dependence on the number n of vertices in G. Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank [Spielman and Teng 2013; Andersen et al. 2006]. In this article, we introduce a simple randomized local partitioning algorithm that finds a sparse cut by simulating the volume-biased evolving set process, which is a Markov chain on sets of vertices. We prove that for any $ \epsilon > 0 $, and any set of vertices A that has conductance at most $ \phi $, for at least half of the starting vertices in $A$ our algorithm will output (with constant probability) a set of conductance $ O (\sqrt \phi / \epsilon)$. We prove that for a given run of the algorithm, the expected ratio between its computational complexity and the volume of the set that it outputs is $ \vol (A)^\epsilon \phi^{- 1 / 2} \polylog (n)$, where $ \vol (A) = \sum_{v \in A} d (v)$ is the volume of the set $A$. This gives an algorithm with the same guarantee (up to a constant factor) as the Cheeger's inequality that runs in time slightly superlinear in the size of the output. This is the first sublinear (in the size of the input) time algorithm with almost the same guarantee as the Cheeger's inequality. In comparison, the best previous local partitioning algorithm, by Andersen et al. [2006], has a worse approximation guarantee of $ O (\sqrt \phi \log n)$ and a larger ratio of $ \phi^{- 1} \polylog (n)$ between the complexity and output volume. As a by-product of our results, we prove a bicriteria approximation algorithm for the expansion profile of any graph. For $ 0 < k \leq v o l(V) / 2$, let $ \phi (k) := \min_{S : \vol (S) \leq k} \phi (S)$. There is a polynomial time algorithm that, for any $k$, $ \epsilon > 0$, finds a set $S$ of volume $ \vol (S) \leq O(k^{1 + \epsilon })$ and expansion $ \phi (S) \leq O(\sqrt \phi (k) / \epsilon)$. As a new technical tool, we show that for any set $S$ of vertices of a graph, a lazy $t$-step random walk started from a randomly chosen vertex of $S$ will remain entirely inside $S$ with probability at least $ (1 \phi (S) / 2)^t$. This itself provides a new lower bound to the uniform mixing time of any finite state reversible Markov chain.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Razborov:2016:NKT, author = "Alexander Razborov", title = "A New Kind of Tradeoffs in Propositional Proof Complexity", journal = j-J-ACM, volume = "63", number = "2", pages = "16:1--16:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2858790", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We exhibit an unusually strong tradeoff in propositional proof complexity that significantly deviates from the established pattern of almost all results of this kind. Namely, restrictions on one resource (width, in our case) imply an increase in another resource (tree-like size) that is exponential not only with respect to the complexity of the original problem, but also to the whole class of all problems of the same bit size. More specifically, we show that for any parameter $ k = k (n) $, there are unsatisfiable $k$-CNFs that possess refutations of width $ O(k)$, but such that any tree-like refutation of width $ n^{1 - \epsilon } / k$ must necessarily have doubly exponential size $ \exp (n^{\Omega (k)})$. This means that there exist contradictions that allow narrow refutations, but in order to keep the size of such a refutation even within a single exponent, it must necessarily use a high degree of parallelism. Our construction and proof methods combine, in a non-trivial way, two previously known techniques: the hardness escalation method based on substitution formulas and expansion. This combination results in a hardness compression approach that strives to preserve hardness of a contradiction while significantly decreasing the number of its variables.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kuhn:2016:LCL, author = "Fabian Kuhn and Thomas Moscibroda and Roger Wattenhofer", title = "Local Computation: Lower and Upper Bounds", journal = j-J-ACM, volume = "63", number = "2", pages = "17:1--17:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2742012", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The question of what can be computed, and how efficiently, is at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a distributed fashion. More precisely, if nodes of a network must base their decision on information in their local neighborhood only, how well can they compute or approximate a global (optimization) problem? In this paper we give the first polylogarithmic lower bound on such local computation for (optimization) problems including minimum vertex cover, minimum (connected) dominating set, maximum matching, maximal independent set, and maximal matching. In addition, we present a new distributed algorithm for solving general covering and packing linear programs. For some problems this algorithm is tight with the lower bounds, whereas for others it is a distributed approximation scheme. Together, our lower and upper bounds establish the local computability and approximability of a large class of problems, characterizing how much local information is required to solve these tasks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2016:IAFb, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "63", number = "2", pages = "18:1--18:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2896919", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Herrmann:2016:CCQ, author = "Christian Herrmann and Martin Ziegler", title = "Computational Complexity of Quantum Satisfiability", journal = j-J-ACM, volume = "63", number = "2", pages = "19:1--19:??", month = may, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2869073", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed May 4 17:20:32 MDT 2016", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We connect both discrete and algebraic complexity theory with the satisfiability problem in certain non-Boolean lattices. Specifically, quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the logical peculiarities of quantum observables: in the 1D case it coincides with Boolean propositional logic but, starting with dimension two, violates the distributive law. We introduce the weak and strong satisfiability problem for quantum logic propositional formulae. It turns out that in dimension two, both are also NP complete. For higher-dimensional spaces $ R^d $ and $ C^d $ with $ d \geq 3 $ fixed, on the other hand, we show both problems to be complete for the nondeterministic Blum-Shub-Smale (BSS) model of real computation. This provides a unified view on both Turing and real BSS complexity theory, and extends the (still relatively scarce) list of problems established NP$_R$ --complete with one, perhaps, closest in spirit to the classical Cook-Levin Theorem. More precisely, strong satisfiability of $ \vee \wedge \vee $-terms is complete, while that of $ \wedge \vee $-terms (i.e., those in conjunctive form) can be decided in polynomial time in dimensions $ d \geq 2$. The decidability of the infinite-dimensional case being still open, we proceed to investigate the case of indefinite finite dimensions. Here, weak satisfiability still belongs to NP$_R$ and strong satisfiability is still hard; the latter, in fact, turns out as polynomial-time equivalent to the feasibility of noncommutative integer polynomial equations over matrix rings.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barenboim:2016:LDS, author = "Leonid Barenboim and Michael Elkin and Seth Pettie and Johannes Schneider", title = "The Locality of Distributed Symmetry Breaking", journal = j-J-ACM, volume = "63", number = "3", pages = "20:1--20:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2903137", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Symmetry-breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this article we work in the LOCAL model (where the input graph and underlying distributed network are identical) and study the randomized complexity of four fundamental symmetry-breaking problems on graphs: computing MISs (maximal independent sets), maximal matchings, vertex colorings, and ruling sets. A small sample of our results includes the following: --- An MIS algorithm running in $ O(\log^2 \Delta + 2^{o(\sqrt \log \log n)}) $ time, where \Delta is the maximum degree. This is the first MIS algorithm to improve on the 1986 algorithms of Luby and Alon, Babai, and Itai, when $ \log n \ll \Delta \ll 2 \sqrt \log n $, and comes close to the $ \Omega (\frac {\log \Delta }{\log \log \Delta }) $ lower bound of Kuhn, Moscibroda, and Wattenhofer. --- A maximal matching algorithm running in $ O(\log \Delta + \log^4 \log n) $ time. This is the first significant improvement to the 1986 algorithm of Israeli and Itai. Moreover, its dependence on $ \Delta $ is nearly optimal. --- A $ (\Delta + 1)$-coloring algorithm requiring $ O(\log \Delta + 2^{o(\sqrt \log \log n)})$ time, improving on an $ O(\log \Delta + \sqrt \log n)$-time algorithm of Schneider and Wattenhofer. --- A method for reducing symmetry-breaking problems in low arboricity/degeneracy graphs to low-degree graphs. (Roughly speaking, the arboricity or degeneracy of a graph bounds the density of any subgraph.) Corollaries of this reduction include an $ O(\sqrt \log n)$-time maximal matching algorithm for graphs with arboricity up to $ 2 \sqrt \log n$ and an $ O(\log^{2 / 3}n)$-time MIS algorithm for graphs with arboricity up to $ 2^{(\log n)1 / 3}$. Each of our algorithms is based on a simple but powerful technique for reducing a randomized symmetry-breaking task to a corresponding deterministic one on a poly($ \log n$)-size graph.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Moran:2016:SCS, author = "Shay Moran and Amir Yehudayoff", title = "Sample Compression Schemes for {VC} Classes", journal = j-J-ACM, volume = "63", number = "3", pages = "21:1--21:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2890490", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", 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", abstract = "Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many learning algorithms. Roughly speaking, a sample compression scheme of size $k$ means that given an arbitrary list of labeled examples, one can retain only $k$ of them in a way that allows us to recover the labels of all other examples in the list. They showed that compression implies probably approximately correct learnability for binary-labeled classes and asked whether the other direction holds. We answer their question and show that every concept class C with VC dimension $d$ has a sample compression scheme of size exponential in d.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Achlioptas:2016:RWF, author = "Dimitris Achlioptas and Fotis Iliopoulos", title = "Random Walks That Find Perfect Objects and the {Lov{\'a}sz} Local Lemma", journal = j-J-ACM, volume = "63", number = "3", pages = "22:1--22:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2818352", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly. Our work is inspired by Moser's entropic method proof of the Lov{\'a}sz Local Lemma (LLL) for satisfiability and completely bypasses the Probabilistic Method formulation of the LLL. In particular, our method works when the underlying state space is entirely unstructured. Similarly to Moser's argument, the key point is that the inevitability of reaching a sink is established by bounding the entropy of the walk as a function of time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chonev:2016:COP, author = "Ventsislav Chonev and Jo{\"e}l Ouaknine and James Worrell", title = "On the Complexity of the Orbit Problem", journal = j-J-ACM, volume = "63", number = "3", pages = "23:1--23:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2857050", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem-determining whether a target vector space $ \nu $ may be reached from a starting point $x$ under repeated applications of a linear transformation $A$. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when $ \nu $ has dimension one, this problem is solvable in polynomial time, and when \nu has dimension two or three, the problem is in NP$^{RP}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Almagor:2016:FRA, author = "Shaull Almagor and Udi Boker and Orna Kupferman", title = "Formally Reasoning About Quality", journal = j-J-ACM, volume = "63", number = "3", pages = "24:1--24:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2875421", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In recent years, there has been a growing need and interest in formally reasoning about the quality of software and hardware systems. As opposed to traditional verification, in which one considers the question of whether a system satisfies a given specification or not, reasoning about quality addresses the question of how well the system satisfies the specification. We distinguish between two approaches to specifying quality. The first, propositional quality, extends the specification formalism with propositional quality operators, which prioritize and weight different satisfaction possibilities. The second, temporal quality, refines the ``eventually'' operators of the specification formalism with discounting operators, whose semantics takes into an account the delay incurred in their satisfaction. In this article, we introduce two quantitative extensions of Linear Temporal Logic (LTL), one by propositional quality operators and one by discounting operators. In both logics, the satisfaction value of a specification is a number in [0, 1], which describes the quality of the satisfaction. We demonstrate the usefulness of both extensions and study the decidability and complexity of the decision and search problems for them as well as for extensions of LTL that combine both types of operators.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gabbay:2016:SCN, author = "Murdoch J. Gabbay", title = "Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation", journal = j-J-ACM, volume = "63", number = "3", pages = "25:1--25:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2700819", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of lattice-based, sets-based, and algebraic absolute semantics to first-order logic. Possibly open predicates are directly interpreted as lattice elements/sets/algebra elements, subject to suitable interpretations of the connectives and quantifiers. In particular, universal quantification $ \forall a . \phis $ is interpreted using a new notion of ``fresh-finite'' limit $ \bigwedge $ [math] and using a novel dual to substitution. The interest in this semantics is partly in the nontrivial and beautiful technical details, which also offer certain advantages over existing semantics. Also, the fact that such semantics exist at all suggests a new way of looking at variables and the foundations of logic and computation, which may be well suited to the demands of modern computer science.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haeupler:2016:ANC, author = "Bernhard Haeupler", title = "Analyzing Network Coding (Gossip) Made Easy", journal = j-J-ACM, volume = "63", number = "3", pages = "26:1--26:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2629696", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce projection analysis --- a new technique to analyze the stopping time of protocols that are based on random linear network coding (RLNC). Projection analysis drastically simplifies, extends, and strengthens previous results on RLNC gossip protocols. We analyze RLNC gossip in a general framework for network and communication models that encompasses and unifies the models used previously in this context. We show, in most settings for the first time, that the RLNC gossip converges with high probability in optimal time. Most stopping times are of the form $ O(k + T) $, where $k$ is the number of messages to be distributed and T is the time it takes to disseminate one message. This means RLNC gossip achieves ``perfect pipelining.'' Our analysis directly extends to highly dynamic networks in which the topology can change completely at any time. This remains true, even if the network dynamics are controlled by a fully adaptive adversary that knows the complete network state. Virtually nothing besides simple $ O(k T)$ sequential flooding protocols was previously known for such a setting. While RLNC gossip works in this wide variety of networks our analysis remains the same and extremely simple. This contrasts with more complex proofs that were put forward to give less strong results for various special cases.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chan:2016:ARP, author = "Siu On Chan", title = "Approximation Resistance from Pairwise-Independent Subgroups", journal = j-J-ACM, volume = "63", number = "3", pages = "27:1--27:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2873054", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show optimal (up to a constant factor) NP-hardness for a maximum constraint satisfaction problem with k variables per constraint (Max- $k$ CSP) whenever $k$ is larger than the domain size. This follows from our main result concerning CSPs given by a predicate: A CSP is approximation resistant if its predicate contains a subgroup that is balanced pairwise independent. Our main result is analogous to Austrin and Mossel's, bypassing their Unique-Games Conjecture assumption whenever the predicate is an abelian subgroup. Our main ingredient is a new gap-amplification technique inspired by XOR lemmas. Using this technique, we also improve the NP-hardness of approximating Independent-Set on bounded-degree graphs, Almost-Coloring, Label-Cover, and various other problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2016:IAFc, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "63", number = "3", pages = "27:1--27:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2940319", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jansson:2016:IAC, author = "Jesper Jansson and Chuanqi Shen and Wing-Kin Sung", title = "Improved Algorithms for Constructing Consensus Trees", journal = j-J-ACM, volume = "63", number = "3", pages = "28:1--28:??", month = sep, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2925985", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given set of conflicting phylogenetic trees. Many different types of consensus trees have been proposed in the literature; three of the most well-known and widely used ones are the majority rule consensus tree, the loose consensus tree, and the greedy consensus tree. This article presents new deterministic algorithms for constructing them that are faster than all the previously known ones. Given $k$ phylogenetic trees with $n$ leaves each and with identical leaf label sets, our algorithms run in $ O(n k)$ time (majority rule consensus tree), $ O(n k)$ time (loose consensus tree), and $ O(n^2 k)$ time (greedy consensus tree). Our algorithms for the majority rule consensus and the loose consensus trees are optimal since the input size is $ \Omega (n k)$. Experimental results show that the algorithms are fast in practice.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fomin:2016:ECR, author = "Fedor V. Fomin and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh", title = "Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms", journal = j-J-ACM, volume = "63", number = "4", pages = "29:1--29:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2886094", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $ M = (E, I) $ be a matroid and let $ S = \{ S_1, c, S_t \} $ be a family of subsets of $E$ of size $p$. A subfamily $^S \subseteq S$ is $q$-representative for $S$ if for every set $ Y \subseteq E$ of size at most $q$, if there is a set $ X \in S$ disjoint from $Y$ with $ X \cup Y \in I$, then there is a set $ X^\circ \in^S$ disjoint from $Y$ with $ X^\circ \cup Y \in I$. By the classic result of Bollob{\'a}s, in a uniform matroid, every family of sets of size $p$ has a $q$-representative family with at most $ (^{p + q}_p)$ sets. In his famous ``two families theorem'' from 1977, Lov{\'a}sz proved that the same bound also holds for any matroid representable over a field $F$. We give an efficient construction of a $q$-representative family of size at most $ (^{p + q}_p)$ in time bounded by a polynomial in $ (^{p + q}_p)$, $t$, and the time required for field operations. We demonstrate how the efficient construction of representative families can be a powerful tool for designing single-exponential parameterized and exact exponential time algorithms. The applications of our approach include the following: --- In the Long Directed Cycle problem, the input is a directed $n$-vertex graph $G$ and the positive integer $k$. The task is to find a directed cycle of length at least $k$ in $G$, if such a cycle exists. As a consequence of our $ 6.75^{k + o (k)} n^{O(1)}$ time algorithm, we have that a directed cycle of length at least $ \log n$, if such a cycle exists, can be found in polynomial time. --- In the Minimum Equivalent Graph (MEG) problem, we are seeking a spanning subdigraph $ D'$ of a given $n$-vertex digraph $D$ with as few arcs as possible in which the reachability relation is the same as in the original digraph $D$. --- We provide an alternative proof of the recent results for algorithms on graphs of bounded treewidth showing that many ``connectivity'' problems such as H amiltonian Cycle or Steiner Tree can be solved in time $ 2^{O(t)} n$ on $n$-vertex graphs of treewidth at most $t$. For the special case of uniform matroids on $n$ elements, we give a faster algorithm to compute a representative family. We use this algorithm to provide the fastest known deterministic parameterized algorithms for $k$-Path, $k$-Tree, and, more generally, $k$-Subgraph Isomorphism, where the $k$ vertex pattern graph is of constant treewidth.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dughmi:2016:OMC, author = "Shaddin Dughmi and Tim Roughgarden and Qiqi Yan", title = "Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding", journal = j-J-ACM, volume = "63", number = "4", pages = "30:1--30:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2908735", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We design the first truthful-in-expectation, constant-factor approximation mechanisms for NP -hard cases of the welfare maximization problem in combinatorial auctions with nonidentical items and in combinatorial public projects. Our results apply to bidders with valuations that are nonnegative linear combinations of gross-substitute valuations, a class that encompasses many of the most well-studied subclasses of submodular functions, including coverage functions and weighted matroid rank functions. Our mechanisms have an expected polynomial runtime and achieve an approximation factor of $ 1 - 1 / e $. This approximation factor is the best possible for both problems, even for known and explicitly given coverage valuations, assuming P /= NP. Recent impossibility results suggest that our results cannot be extended to a significantly larger valuation class. Both of our mechanisms are instantiations of a new framework for designing approximation mechanisms based on randomized rounding algorithms. The high-level idea of this framework is to optimize directly over the (random) output of the rounding algorithm, rather than the usual (and rarely truthful) approach of optimizing over the input to the rounding algorithm. This framework yields truthful-in-expectation mechanisms, which can be implemented efficiently when the corresponding objective function is concave. For bidders with valuations in the cone generated by gross-substitute valuations, we give novel randomized rounding algorithms that lead to both a concave objective function and a $ (1 - 1 / e)$-approximation of the optimal welfare.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alistarh:2016:LFC, author = "Dan Alistarh and Keren Censor-Hillel and Nir Shavit", title = "Are Lock-Free Concurrent Algorithms Practically Wait-Free?", journal = j-J-ACM, volume = "63", number = "4", pages = "31:1--31:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2903136", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. To the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Sasson:2016:CRP, author = "Eli Ben-Sasson and Yohay Kaplan and Swastik Kopparty and Or Meir and Henning Stichtenoth", title = "Constant Rate {PCPs} for Circuit-{SAT} with Sublinear Query Complexity", journal = j-J-ACM, volume = "63", number = "4", pages = "32:1--32:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2901294", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The PCP theorem [Arora et al. 1998; Arora and Safra 1998] says that every NP-proof can be encoded to another proof, namely, a probabilistically checkable proof (PCP), which can be tested by a verifier that queries only a small part of the PCP. A natural question is how large is the blow-up incurred by this encoding, that is, how long is the PCP compared to the original NP-proof? The state-of-the-art work of Ben-Sasson and Sudan [2008] and Dinur [2007] shows that one can encode proofs of length $n$ by PCPs of length $ n \cdot \poly \log n $ that can be verified using a constant number of queries. In this work, we show that if the query complexity is relaxed to $ n^\epsilon $, then one can construct PCPs of length $ O(n) $ for circuit-SAT, and PCPs of length $ O(t \log t) $ for any language in NTIME(t). More specifically, for any $ \epsilon > 0 $, we present (nonuniform) probabilistically checkable proofs (PCPs) of length 2$^{O(1 / \epsilon)} \cdot n$ that can be checked using $ n^\epsilon $ queries for circuit-SAT instances of size $n$. Our PCPs have perfect completeness and constant soundness. This is the first constant-rate PCP construction that achieves constant soundness with nontrivial query complexity $ (o(n))$. Our proof replaces the low-degree polynomials in algebraic PCP constructions with tensors of transitive algebraic geometry (AG) codes. We show that the automorphisms of an AG code can be used to simulate the role of affine transformations that are crucial in earlier high-rate algebraic PCP constructions. Using this observation, we conclude that any asymptotically good family of transitive AG codes over a constant-sized alphabet leads to a family of constant-rate PCPs with polynomially small query complexity. Such codes are constructed in the appendix to this article for the first time for every message length, building on an earlier construction for infinitely many message lengths by Stichtenoth [2006].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Miller:2016:RPS, author = "Carl A. Miller and Yaoyun Shi", title = "Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices", journal = j-J-ACM, volume = "63", number = "4", pages = "33:1--33:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2885493", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Randomness is a vital resource for modern-day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high-quality random numbers generated securely. Here, we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic level of security, tolerating a constant level of imprecision in devices, requiring only unit size quantum memory (for each device component) in an honest implementation, and allowing a large natural class of constructions for the protocol. In conjunction with a recent work by Chung et al. [2014], it also leads to robust unbounded expansion using just 2 multipart devices. When adapted for distributing cryptographic keys, our method achieves, for the first time, exponential expansion combined with cryptographic security and noise tolerance. The proof proceeds by showing that the R{\'e}nyi divergence of the outputs of the protocol (for a specific bounding operator) decreases linearly as the protocol iterates. At the heart of the proof are a new uncertainty principle on quantum measurements and a method for simulating trusted measurements with untrusted devices.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chan:2016:ACS, author = "Siu On Chan and James R. Lee and Prasad Raghavendra and David Steurer", title = "Approximate Constraint Satisfaction Requires Large {LP} Relaxations", journal = j-J-ACM, volume = "63", number = "4", pages = "34:1--34:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2811255", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are no more powerful than programs arising from a constant number of rounds of the Sherali--Adams hierarchy. In particular, any polynomial-sized linear program for M ax Cut has an integrality gap of $ 1 / 2 $ and any such linear program for Max 3-Sat has an integrality gap of 7/8 .", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Guruswami:2016:ORC, author = "Venkatesan Guruswami and Adam Smith", title = "Optimal Rate Code Constructions for Computationally Simple Channels", journal = j-J-ACM, volume = "63", number = "4", pages = "35:1--35:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2936015", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process that adds the errors can be described by a sufficiently ``simple'' circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. For two classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only in efficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. The encoders are randomized, and probabilities are taken over the (local, unknown to the decoder) coins of the encoder and those of the channel. Unique decoding for additive errors: We give the first construction of a polynomial-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity $ 1 - H(p)$. These are channels that add an arbitrary error vector $ e \in \{ 0, 1 \}^N$ of weight at most pN to the transmitted word; the vector $e$ can depend on the code but not on the randomness of the encoder or the particular transmitted word. Such channels capture binary symmetric errors and burst errors as special cases. List decoding for polynomial-time channels: For every constant $ c > 0$, we construct codes with optimal rate (arbitrarily close to $ 1 - H(p)$) that efficiently recover a short list containing the correct message with high probability for channels describable by circuits of size at most N$^c$. Our construction is not fully explicit but rather Monte Carlo (we give an algorithm that, with high probability, produces an encoder/decoder pair that works for all time N$^c$ channels). We are not aware of any channel models considered in the information theory literature other than purely adversarial channels, which require more than linear-size circuits to implement. We justify the relaxation to list decoding with an impossibility result showing that, in a large range of parameters (p > 1/4), codes that are uniquely decodable for a modest class of channels (online, memoryless, nonuniform channels) cannot have positive rate.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Babichenko:2016:QCA, author = "Yakov Babichenko", title = "Query Complexity of Approximate {Nash} Equilibria", journal = j-J-ACM, volume = "63", number = "4", pages = "36:1--36:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2908734", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n. Our main result states that for $n$-player binary-action games and for constant \epsilon, the query complexity of an \epsilon -well-supported Nash equilibrium is exponential in n. As a consequence of this result, we get an exponential lower bound on the rate of convergence of adaptive dynamics to approximate Nash equilibria.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Thapper:2016:CFV, author = "Johan Thapper and Stanislav Zivn{\'y}", title = "The Complexity of Finite-Valued {CSPs}", journal = j-J-ACM, volume = "63", number = "4", pages = "37:1--37:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2974019", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the computational complexity of exact minimization of rational-valued discrete functions. Let \Gamma be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, VCSP(\Gamma), is the problem of minimizing a function given as a sum of functions from \Gamma . We establish a dichotomy theorem with respect to exact solvability for all finite-valued constraint languages defined on domains of arbitrary finite size. We show that every constraint language \Gamma either admits a binary symmetric fractional polymorphism, in which case the basic linear programming relaxation solves any instance of VCSP(\Gamma) exactly, or \Gamma satisfies a simple hardness condition that allows for a polynomial-time reduction from Max-Cut to VCSP(\Gamma ).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Foreword:2016:IPF, author = "Foreword", title = "Invited Paper Foreword", journal = j-J-ACM, volume = "63", number = "4", pages = "38:1--38:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2989249", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dvir:2016:SPS, author = "Zeev Dvir and Sivakanth Gopi", title = "$2$-Server {PIR} with Subpolynomial Communication", journal = j-J-ACM, volume = "63", number = "4", pages = "39:1--39:??", month = nov, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2968443", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:48 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the $i$ th bit of an $n$-bit database replicated among two noncommunicating servers, while not revealing any information about $i$ to either server. In this work, we construct a 2-server PIR scheme with total communication cost $ n^O(\sqrt \frac {log \log n}{\log n})$. This improves over current 2-server protocols, which all require $ \Omega (n^{1 / 3})$ communication. Our construction circumvents the $ n^{1 / 3}$ barrier of Razborov and Yekhanin [2007], which holds for the restricted model of bilinear group-based schemes (covering all previous 2-server schemes). The improvement comes from reducing the number of servers in existing protocols, based on Matching Vector Codes, from 3 or 4 servers to 2. This is achieved by viewing these protocols in an algebraic way (using polynomial interpolation) and extending them using partial derivatives.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chekuri:2016:PBG, author = "Chandra Chekuri and Julia Chuzhoy", title = "Polynomial Bounds for the Grid-Minor Theorem", journal = j-J-ACM, volume = "63", number = "5", pages = "40:1--40:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2820609", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "One of the key results in Robertson and Seymour's seminal work on graph minors is the grid-minor theorem (also called the excluded grid theorem). The theorem states that for every grid H, every graph whose treewidth is large enough relative to | V (H)| contains H as a minor. This theorem has found many applications in graph theory and algorithms. Let $ f(k) $ denote the largest value such that every graph of treewidth $k$ contains a grid minor of size $ (f(k) \times f(k))$. The best previous quantitative bound, due to recent work of Kawarabayashi and Kobayashi, and Leaf and Seymour, shows that $ f(k) = \Omega (\sqrt \log k / \log \log k)$. In contrast, the best known upper bound implies that $ f(k) = O(\sqrt k / \log k)$. In this article, we obtain the first polynomial relationship between treewidth and grid minor size by showing that $ f(k) = \Omega (k^\delta)$ for some fixed constant $ \delta > 0$, and describe a randomized algorithm, whose running time is polynomial in $ | V (G) |$ and $k$, that with high probability finds a model of such a grid minor in $G$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abraham:2016:HDP, author = "Ittai Abraham and Daniel Delling and Amos Fiat and Andrew V. Goldberg and Renato F. Werneck", title = "Highway Dimension and Provably Efficient Shortest Path Algorithms", journal = j-J-ACM, volume = "63", number = "5", pages = "41:1--41:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2985473", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Computing driving directions has motivated many shortest path algorithms based on preprocessing. Given a graph, the preprocessing stage computes a modest amount of auxiliary data, which is then used to speed up online queries. In practice, the best algorithms have storage overhead comparable to the graph size and answer queries very fast, while examining a small fraction of the graph. In this article, we complement the experimental evidence with the first rigorous proofs of efficiency for some of the speedup techniques developed over the past decade or variations thereof. We define highway dimension, which strengthens the notion of doubling dimension. Under the assumption that the highway dimension is low (at most polylogarithmic in the graph size), we show that, for some algorithms or their variants, preprocessing can be implemented in polynomial time, the resulting auxiliary data increases the storage requirements by a polylogarithmic factor, and queries run in polylogarithmic time. This gives a unified explanation for the performance of several seemingly different approaches. Our best bounds are based on a result that may be of independent interest: we show that unique shortest paths induce set systems of low VC-dimension, which makes them combinatorially simple.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Doerr:2016:PMM, author = "Benjamin Doerr and Carola Doerr and Reto Sp{\"o}hel and Henning Thomas", title = "Playing {Mastermind} With Many Colors", journal = j-J-ACM, volume = "63", number = "5", pages = "42:1--42:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2987372", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We analyze the general version of the classic guessing game Mastermind with $n$ positions and $k$ colors. Since the case $ k \leq n^{1 - \epsilon } $, $ \epsilon > 0 $ a constant, is well understood, we concentrate on larger numbers of colors. For the most prominent case $ k = n$, our results imply that Codebreaker can find the secret code with $ O(n \log \log n) $ guesses. This bound is valid also when only black answer pegs are used. It improves the $ O(n \log n) $ bound first proven by Chv{\'a}tal. We also show that if both black and white answer pegs are used, then the $ O(n \log \log n) $ bound holds for up to $ n^2 \log \log n $ colors. These bounds are almost tight, as the known lower bound of $ \Omega (n) $ shows. Unlike for $ k \leq n^{1 - \epsilon } $, simply guessing at random until the secret code is determined is not sufficient. In fact, we show that an optimal nonadaptive strategy (deterministic or randomized) needs $ \Theta (n \log n) $ guesses.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gebauer:2016:LLA, author = "Heidi Gebauer and Tibor Szab{\'o} and G{\'a}bor Tardos", title = "The Local Lemma Is Asymptotically Tight for {SAT}", journal = j-J-ACM, volume = "63", number = "5", pages = "43:1--43:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2975386", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptotically tight answer. The main theme of our article is to identify several of these problems, among them a couple of widely studied extremal functions related to certain restricted versions of the $k$-SAT problem, where the Local Lemma does give essentially optimal answers. As our main contribution, we construct unsatisfiable $k$-CNF formulas where every clause has $k$ distinct literals and every variable appears in at most $ 2 / (e + o (1))^{2 k} /_k$ clauses. The Lopsided Local Lemma, applied with an assignment of random values according to counterintuitive probabilities, shows that this is asymptotically best possible. The determination of this extremal function is particularly important, as it represents the value where the corresponding $k$-SAT problem exhibits a complexity hardness jump: From having every instance being a YES-instance it becomes NP-hard just by allowing each variable to occur in one more clause. The construction of our unsatisfiable CNF formulas is based on the binary tree approach of Gebauer [2012], and thus the constructed formulas are in the class MU(1) of minimal unsatisfiable formulas having one more clause than variables. The main novelty of our approach here comes in setting up an appropriate continuous approximation of the problem. This leads us to a differential equation, the solution of which we are able to estimate. The asymptotically optimal binary trees are then obtained through a discretization of this solution. The importance of the binary trees constructed is also underlined by their appearance in many other scenarios. In particular, they give asymptotically precise answers for seemingly unrelated problems like the European Tenure Game introduced by Doerr [2004] and a search problem allowing a limited number of consecutive lies. As yet another consequence, we slightly improve the best-known bounds on the maximum degree and maximum edge-degree of a $k$-uniform Maker's win hypergraph in the Neighborhood Conjecture of Beck.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bodlaender:2016:MK, author = "Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos", title = "(Meta) Kernelization", journal = j-J-ACM, volume = "63", number = "5", pages = "44:1--44:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2973749", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k while preserving the answer. In this work, we give two meta-theorems on kernelization. The first theorem says that all problems expressible in counting monadic second-order logic and satisfying a coverability property admit a polynomial kernel on graphs of bounded genus. Our second result is that all problems that have finite integer index and satisfy a weaker coverability property admit a linear kernel on graphs of bounded genus. These theorems unify and extend all previously known kernelization results for planar graph problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chuzhoy:2016:PAA, author = "Julia Chuzhoy and Shi Li", title = "A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion $2$", journal = j-J-ACM, volume = "63", number = "5", pages = "45:1--45:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2893472", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected $n$-vertex graph $G$, a collection $ M = \{ (s_1, t_1), \ldots, (s_k, t_k) \} $ of pairs of vertices called demand pairs, and an integer $c$. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion --- the number of paths sharing any edge --- is bounded by $c$. When the maximum allowed congestion is $ c = 1$, this is the classical Edge-Disjoint Paths problem (EDP). The best current approximation algorithm for EDP achieves an $ O(\sqrt n)$-approximation by rounding the standard multi-commodity flow relaxation of the problem. This matches the $ \Omega (\sqrt n)$ lower bound on the integrality gap of this relaxation. We show an $ O(\poly \log k)$-approximation algorithm for EDPwC with congestion $ c = 2$ by rounding the same multi-commodity flow relaxation. This gives the best possible congestion for a sub-polynomial approximation of EDPwC via this relaxation. Our results are also close to optimal in terms of the number of pairs routed, since EDPwC is known to be hard to approximate to within a factor of $ {\~ \Omega }((\log n)^{1 / (c + 1)})$ for any constant congestion $c$. Prior to our work, the best approximation factor for EDPwC with congestion 2 was $ {\~ O}(n^{3 / 7})$, and the best algorithm achieving a polylogarithmic approximation required congestion 14.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2016:IAFd, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "63", number = "5", pages = "45:1--45:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3018097", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ganor:2016:ESI, author = "Anat Ganor and Gillat Kol and Ran Raz", title = "Exponential Separation of Information and Communication for {Boolean} Functions", journal = j-J-ACM, volume = "63", number = "5", pages = "46:1--46:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2907939", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show an exponential gap between communication complexity and information complexity by giving an explicit example of a partial boolean function with information complexity $ \leq O(k) $, and distributional communication complexity $ \geq 2^k $. This shows that a communication protocol cannot always be compressed to its internal information. By a result of Braverman [2015], our gap is the largest possible. By a result of Braverman and Rao [2014], our example shows a gap between communication complexity and amortized communication complexity, implying that a tight direct sum result for distributional communication complexity cannot hold, answering a long-standing open problem. Another (conceptual) contribution of our work is the relative discrepancy method, a new rectangle-based method for proving communication complexity lower bounds for boolean functions, powerful enough to separate information complexity and communication complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "46", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barenboim:2016:DCS, author = "Leonid Barenboim", title = "Deterministic {$ (\Delta + 1) $}-Coloring in Sublinear (in {$ \Delta $}) Time in Static, Dynamic, and Faulty Networks", journal = j-J-ACM, volume = "63", number = "5", pages = "47:1--47:??", month = dec, year = "2016", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2979675", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the distributed (\Delta + 1)-vertex-coloring and (2 \Delta - 1)-edge-coloring problems. These problems are among the most important and intensively studied problems in distributed computing. Despite very intensive research in the last 30 years, no deterministic algorithms for these problems with sublinear (in \Delta) time have been known so far. Moreover, for more restricted scenarios and some related problems there are lower bounds of $ \Omega (\Delta) $ [G{\"o}{\"o}s et al. 2014; Hirvonen and Suomela 2012; Kuhn and Wattenhofer 2006; Szegedy and Vishwanathan 1993]. The question of the possibility to devise algorithms that overcome this challenging barrier is one of the most fundamental questions in distributed symmetry breaking [Barenboim and Elkin 2009, 2011; G{\"o}{\"o}s et al. 2014; Hirvonen and Suomela 2012; Kuhn 2009; Panconesi and Rizzi 2001]. In this article, we settle this question for (\Delta + 1)-vertex-coloring and (2 \Delta - 1)-edge-coloring by devising deterministic algorithms that require O( \Delta $^{3 / 4}$ \log \Delta + log$^*$ n) time in the static, dynamic, and faulty settings. (The term log$^*$ n is unavoidable in view of the lower bound of Linial [1987].) Moreover, for (1 + o (1)) \Delta vertex-coloring and (2 + o (1)) \Delta -edge-coloring we devise algorithms with {\~O}(\sqrt \Delta + log$^*$ n) deterministic time. This is roughly a quadratic improvement comparing to the state-of-the-art that requires $ O(\Delta + \log^*n)$ time [Barenboim and Elkin 2009; Kuhn 2009; Panconesi and Rizzi 2001]. Our results are actually more general than that since they apply also to a variant of the list-coloring problem that generalizes ordinary coloring. Our results are obtained using a novel technique for coloring partially colored graphs (also known as fixing). We partition the uncolored parts into a small number of subgraphs with certain helpful properties. Then we color these subgraphs gradually using a technique that employs constructions of polynomials in a novel way. Our construction is inspired by the algorithm of Linial [1987] for ordinary $ O(\Delta^2)$-coloring. However, it is a more sophisticated construction that differs from that of Linial [1987] in several important respects. These new insights in using systems of polynomials allow us to significantly speed up the $ O(\Delta)$-coloring algorithms. Moreover, they allow us to devise algorithms with the same running time also in the more complicated settings of dynamic and faulty networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "47", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{ElDin:2017:NOA, author = "Mohab Safey {El Din} and {\'E}ric Schost", title = "A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets", journal = j-J-ACM, volume = "63", number = "6", pages = "48:1--48:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2996450", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A roadmap for a semi-algebraic set S is a curve which has a non-empty and connected intersection with all connected components of S. Hence, this kind of object, introduced by Canny, can be used to answer connectivity queries (with applications, for instance, to motion planning) but has also become of central importance in effective real algebraic geometry, since it is used in higher-level algorithms. In this article, we provide a probabilistic algorithm which computes roadmaps for smooth and bounded real algebraic sets. Its output size and running time are polynomial in (nD)$^{n log (d)}$, where D is the maximum of the degrees of the input polynomials, $d$ is the dimension of the set under consideration and n is the number of variables. More precisely, the running time of the algorithm is essentially subquadratic in the output size. Even under our assumptions, it is the first roadmap algorithm with output size and running time polynomial in (nD)$^{n \log (d)}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "48", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Coja-Oghlan:2017:BPG, author = "Amin Coja-Oghlan", title = "Belief Propagation Guided Decimation Fails on Random Formulas", journal = j-J-ACM, volume = "63", number = "6", pages = "49:1--49:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3005398", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Let $ \Phi $ be a uniformly distributed random $k$-SAT formula with $n$ variables and $m$ clauses. Nonconstructive arguments show that $ \Phi $ is satisfiable for clause/variable ratios $ m / n \leq r_k$-SAT $ \approx 2^k \ln 2$ with high probability. Yet no efficient algorithm is known to find a satisfying assignment beyond $ m / n ~ 2^k = l n (k) / k$ with a nonvanishing probability. On the basis of deep but nonrigorous statistical mechanics ideas, a message passing algorithm called Belief Propagation Guided Decimation has been put forward (M{\'e}zard, Parisi, Zecchina: Science 2002; Braunstein, M{\'e}zard, Zecchina: Random Struc. Algorithm 2005). Experiments suggested that the algorithm might succeed for densities very close to r$_k$-SAT for $ k = 3, 4, 5$ (Kroc, Sabharwal, Selman: SAC 2009). Furnishing the first rigorous analysis of this algorithm on a nontrivial input distribution, in the present article we show that Belief Propagation Guided Decimation fails to solve random $k$-SAT formulas already for $ m / n = O(2^k / k)$, almost a factor of k below the satisfiability threshold $ r_k$-SAT. Indeed, the proof refutes a key hypothesis on which Belief Propagation Guided Decimation hinges for such $ m / n$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "49", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Awasthi:2017:PLE, author = "Pranjal Awasthi and Maria Florina Balcan and Philip M. Long", title = "The Power of Localization for Efficiently Learning Linear Separators with Noise", journal = j-J-ACM, volume = "63", number = "6", pages = "50:1--50:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3006384", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and we demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators. We consider both the malicious noise model of Valiant [1985] and Kearns and Li [1988] and the adversarial label noise model of Kearns, Schapire, and Sellie [1994]. For malicious noise, where the adversary can corrupt both the label and the features, we provide a polynomial-time algorithm for learning linear separators in R$^d$ under isotropic log-concave distributions that can tolerate a nearly information-theoretically optimal noise rate of $ \eta = \Omega (\epsilon)$, improving on the $ \Omega (\frac \epsilon^3 / = \log^2 (d / \epsilon))$ noise-tolerance of Klivans et al. [2009a]. In the case that the distribution is uniform over the unit ball, this improves on the $ \Omega (\frac \epsilon / d^{1 / 4})$ noise-tolerance of Kalai et al. [2005] and the $ \Omega (\frac \epsilon^2 / \log (d / \epsilon))$ of Klivans et al. [2009a]. For the adversarial label noise model, where the distribution over the feature vectors is unchanged and the overall probability of a noisy label is constrained to be at most $ \eta $, we also give a polynomial-time algorithm for learning linear separators in R$^d$ under isotropic log-concave distributions that can handle a noise rate of $ \eta = \Omega (\epsilon)$. In the case of uniform distribution, this improves over the results of Kalai et al. [2005], which either required runtime super-exponential in $ 1 / \epsilon $ (ours is polynomial in $ 1 / \epsilon $) or tolerated less noise. Our algorithms are also efficient in the active learning setting, where learning algorithms only receive the classifications of examples when they ask for them. We show that, in this model, our algorithms achieve a label complexity whose dependence on the error parameter $ \epsilon $ is polylogarithmic (and thus exponentially better than that of any passive algorithm). This provides the first polynomial-time active learning algorithm for learning linear separators in the presence of malicious noise or adversarial label noise. Our algorithms and analysis combine several ingredients including aggressive localization, minimization of a progressively rescaled hinge loss, and a novel localized and soft outlier removal procedure. We use localization techniques (previously used for obtaining better sample complexity results) to obtain better noise-tolerant polynomial-time algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "50", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Awodey:2017:HIA, author = "Steve Awodey and Nicola Gambino and Kristina Sojakova", title = "Homotopy-Initial Algebras in Type Theory", journal = j-J-ACM, volume = "63", number = "6", pages = "51:1--51:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3006383", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a purely type-theoretic contractibility condition that replaces the standard, category-theoretic universal property involving the existence and uniqueness of appropriate morphisms. Our main result characterizes the types that are equivalent to W-types as homotopy-initial algebras.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "51", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harvey:2017:FPM, author = "David Harvey and Joris {Van Der Hoeven} and Gr{\'e}goire Lecerf", title = "Faster Polynomial Multiplication over Finite Fields", journal = j-J-ACM, volume = "63", number = "6", pages = "52:1--52:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3005344", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Polynomials over finite fields play a central role in algorithms for cryptography, error correcting codes, and computer algebra. The complexity of multiplying such polynomials is still a major open problem. Let $p$ be a prime, and let $ M_p(n)$ denote the bit complexity of multiplying two polynomials in $ F_p[X]$ of degree less than $n$. For $n$ large compared to $p$, we establish the bound $ M_p(n) = O(n \log n {8^{\log *}}^n \log p)$, where $ \log^* n = \{ \min k \epsilon N : \log \ldots {}^k \times \ldots \log n \leq 1 \} $ stands for the iterated logarithm. This improves on the previously best known bound $ M_p(n) = O(n \log n \log \log n \log p)$, which essentially goes back to the 1970s.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "52", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFa, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "63", number = "6", pages = "53:1--53:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3018099", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "53", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Clarkson:2017:LRA, author = "Kenneth L. Clarkson and David P. Woodruff", title = "Low-Rank Approximation and Regression in Input Sparsity Time", journal = j-J-ACM, volume = "63", number = "6", pages = "54:1--54:??", month = feb, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3019134", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We design a new distribution over $ m \times n $ matrices $S$ so that, for any fixed $ n \times d$ matrix $A$ of rank $r$, with probability at least $ 9 / 10$, $ || S A x ||_2 = (1 \pm \epsilon) || A x ||_2$ simultaneously for all $ x \in R^d$. Here, $m$ is bounded by a polynomial in $ r \epsilon^{-1}$, and the parameter $ \epsilon \in (0, 1]$. Such a matrix $S$ is called a subspace embedding. Furthermore, SA can be computed in $ O(n n z(A))$ time, where $ n n z(A)$ is the number of nonzero entries of $A$. This improves over all previous subspace embeddings, for which computing SA required at least $ \Omega (n d \log d)$ time. We call these $S$ sparse embedding matrices. Using our sparse embedding matrices, we obtain the fastest known algorithms for overconstrained least-squares regression, low-rank approximation, approximating all leverage scores, and $ l_p$ regression. More specifically, let $b$ be an $ n \times 1$ vector, $ \epsilon > 0$ a small enough value, and integers $k$, $ p \geq 1$. Our results include the following. --- Regression: The regression problem is to find $ d \times 1$ vector $ x'$ for which $ || A x' - b||_p \leq (1 + \epsilon) \min_x || A x - b ||_p$. For the Euclidean case $ p = 2$, we obtain an algorithm running in $ O(n n z(A)) + {\~ O} (d^3 \epsilon^{-2})$ time, and another in $ O(n n z(A) \log (1 / \epsilon)) + {\~ O}(d^3 \log (1 / \epsilon))$ time. (Here, $ {\~ O}(f) = f \dot {c} \log^{O (1)}(f)$.) For $ p \in [1, \infty)$, more generally, we obtain an algorithm running in $ O(n n z(A) \log n) + O(r \backslash \epsilon^{-1})^C$ time, for a fixed $C$. --- Low-rank approximation: We give an algorithm to obtain a rank-$k$ matrix $ {\^ A}_k$ such that || A --- {\^A}_k$ ||_F \leq (1 + \epsilon) || A - A_k ||_F$, where $ A_k$ is the best rank-$k$ approximation to $A$. (That is, $ A_k$ is the output of principal components analysis, produced by a truncated singular value decomposition, useful for latent semantic indexing and many other statistical problems.) Our algorithm runs in $ O(n n z(A)) + {\~ O}(n k^2 \epsilon^{-4} + k^3 \epsilon^{-5})$ time. --- Leverage scores: We give an algorithm to estimate the leverage scores of $A$, up to a constant factor, in $ O(n n z(A) \log n) + {\~ O}(r^3)$ time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "54", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Davies:2017:TLA, author = "Rowan Davies", title = "A Temporal Logic Approach to Binding-Time Analysis", journal = j-J-ACM, volume = "64", number = "1", pages = "1:1--1:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3011069", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "This article demonstrates that there is a fundamental relationship between temporal logic and languages that involve multiple stages, such as those used to analyze binding times in the context of partial evaluation. This relationship is based on an extension of the Curry--Howard isomorphism, which identifies proofs with programs, and propositions with types. Our extension involves the ``next time'' ($ \circ $) operator from linear-time temporal logic and yields a $ \lambda $-calculus $ \lambda^\circ $ with types of the form $ \circ A$ for expressions in the subsequent stage, with appropriate introduction and elimination forms. We demonstrate that $ \lambda^\circ $ is equivalent to the core of a previously studied multilevel binding-time analysis. This is similar to work by Davies and Pfenning on staged computation based on the necessity ($ \square $) operator of modal logic, but $ \square $ only allows closed code, and naturally supports a code evaluation construct, whereas $ \circ $ captures open code, thus is more flexible, but is incompatible with such a construct. Instead, code evaluation is an external global operation that is validated by the proof theory regarding closed proofs of $ \circ $ formulas. We demonstrate the relevance of $ \lambda^\circ $ to staged computation directly by showing that that normalization can be done in an order strictly following the times of the logic. We also extend $ \lambda^\circ $ to small functional language and show that it would serve as a suitable basis for directly programming with multiple stages by presenting some example programs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Danna:2017:UMM, author = "Emilie Danna and Avinatan Hassidim and Haim Kaplan and Alok Kumar and Yishay Mansour and Danny Raz and Michal Segalov", title = "Upward Max-Min Fairness", journal = j-J-ACM, volume = "64", number = "1", pages = "2:1--2:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3011282", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Often one would like to allocate shared resources in a fair way. A common and well-studied notion of fairness is Max-Min Fairness, where we first maximize the smallest allocation, and subject to that the second smallest, and so on. We consider a networking application where multiple commodities compete over the capacity of a network. In our setting, each commodity has multiple possible paths to route its demand (for example, a network using Multiprotocol Label Switching (MPLS) tunneling). In this setting, the only known way of finding a max-min fair allocation requires an iterative solution of multiple linear programs. Such an approach, although polynomial time, scales badly with the size of the network, the number of demands, and the number of paths, and is hard to implement in a distributed environment. More importantly, a network operator has limited control and understanding of the inner working of the algorithm. In this article we introduce Upward Max-Min Fairness, a novel relaxation of Max-Min Fairness, and present a family of simple dynamics that converge to it. These dynamics can be implemented in a distributed manner. Moreover, we present an efficient combinatorial algorithm for finding an upward max-min fair allocation. This algorithm is a natural extension of the well-known Water Filling Algorithm for a multiple path setting. We test the expected behavior of this new algorithm and show that on realistic networks upward max-min fair allocations are comparable to the max-min fair allocations both in fairness and in network utilization.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Afshani:2017:IOG, author = "Peyman Afshani and J{\'e}r{\'e}my Barbay and Timothy M. Chan", title = "Instance-Optimal Geometric Algorithms", journal = j-J-ACM, volume = "64", number = "1", pages = "3:1--3:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3046673", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove the existence of an algorithm A for computing 2D or 3D convex hulls that is optimal for every point set in the following sense: for every sequence \sigma of n points and for every algorithm A ' in a certain class A, the running time of A on input \sigma is at most a constant factor times the running time of A ' on the worst possible permutation of \sigma for A '. In fact, we can establish a stronger property: for every sequence \sigma of points and every algorithm A ', the running time of A on \sigma is at most a constant factor times the average running time of A ' over all permutations of \sigma . We call algorithms satisfying these properties instance optimal in the order-oblivious and random-order setting. Such instance-optimal algorithms simultaneously subsume output-sensitive algorithms and distribution-dependent average-case algorithms, and all algorithms that do not take advantage of the order of the input or that assume the input are given in a random order. The class A under consideration consists of all algorithms in a decision tree model where the tests involve only multilinear functions with a constant number of arguments. To establish an instance-specific lower bound, we deviate from traditional Ben-Or-style proofs and adopt a new adversary argument. For 2D convex hulls, we prove that a version of the well-known algorithm by Kirkpatrick and Seidel [1986] or Chan, Snoeyink, and Yap [1995] already attains this lower bound. For 3D convex hulls, we propose a new algorithm. We further obtain instance-optimal results for a few other standard problems in computational geometry, such as maxima in 2D and 3D, orthogonal line segment intersection in 2D, finding bichromatic L$_{ \infty }$ -close pairs in 2D, offline orthogonal range searching in 2D, offline dominance reporting in 2D and 3D, offline half-space range reporting in 2D and 3D, and offline point location in 2D. Our framework also reveals a connection to distribution-sensitive data structures and yields new results as a byproduct, for example, on online orthogonal range searching in 2D and online half-space range reporting in 2D and 3D.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kawarabayashi:2017:CCG, author = "Ken-Ichi Kawarabayashi and Mikkel Thorup", title = "Coloring $3$-Colorable Graphs with Less than $ n^{1 / 5}$ Colors", journal = j-J-ACM, volume = "64", number = "1", pages = "4:1--4:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3001582", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. We first present a new combinatorial algorithm using {\~O} (n$^{4 / 11}$) colors. This is the first combinatorial improvement since Blum's {\~O} (n$^{3 / 8}$) bound from FOCS'90. Like Blum's algorithm, our new algorithm composes immediately with recent semi-definite programming approaches, and improves the best bound for the polynomial time algorithm for the coloring of 3-colorable graphs from O (n$^{0.2072}$) colors by Chlamtac from FOCS'07 to O( n$^{0.2049}$) colors. Next, we develop a new recursion tailored for combination with semi-definite approaches, bringing us further down to O(n$^{0.19996}$) colors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Galanis:2017:AMP, author = "Andreas Galanis and Andreas G{\"o}bel and Leslie Ann Goldberg and John Lapinskas and David Richerby", title = "Amplifiers for the {Moran} Process", journal = j-J-ACM, volume = "64", number = "1", pages = "5:1--5:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3019609", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The Moran process, as studied by Lieberman, Hauert, and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlying graph where individuals correspond to vertices. Initially, one vertex (chosen uniformly at random) possesses a mutation, with fitness r > 1. All other individuals have fitness 1. During each step of the algorithm, an individual is chosen with probability proportional to its fitness, and its state (mutant or nonmutant) is passed on to an out-neighbour which is chosen uniformly at random. If the underlying graph is strongly connected, then the algorithm will eventually reach fixation, in which all individuals are mutants, or extinction, in which no individuals are mutants. An infinite family of directed graphs is said to be strongly amplifying if, for every r > 1, the extinction probability tends to 0 as the number of vertices increases. A formal definition is provided in the article. Strong amplification is a rather surprising property-it means that in such graphs, the fixation probability of a uniformly placed initial mutant tends to 1 even though the initial mutant only has a fixed selective advantage of r > 1 (independently of n). The name ``strongly amplifying'' comes from the fact that this selective advantage is ``amplified.'' Strong amplifiers have received quite a bit of attention, and Lieberman et al. proposed two potentially strongly amplifying families-superstars and metafunnels. Heuristic arguments have been published, arguing that there are infinite families of superstars that are strongly amplifying. The same has been claimed for metafunnels. In this article, we give the first rigorous proof that there is an infinite family of directed graphs that is strongly amplifying. We call the graphs in the family ``megastars.'' When the algorithm is run on an n -vertex graph in this family, starting with a uniformly chosen mutant, the extinction probability is roughly n$^{- 1 / 2}$ (up to logarithmic factors). We prove that all infinite families of superstars and metafunnels have larger extinction probabilities (as a function of n). Finally, we prove that our analysis of megastars is fairly tight-there is no infinite family of megastars such that the Moran algorithm gives a smaller extinction probability (up to logarithmic factors). Also, we provide a counterexample which clarifies the literature concerning the isothermal theorem of Lieberman et al.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFb, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "64", number = "1", pages = "6:1--6:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3055358", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Karbyshev:2017:PDI, author = "Aleksandr Karbyshev and Nikolaj Bj{\o}rner and Shachar Itzhaky and Noam Rinetzky and Sharon Shoham", title = "Property-Directed Inference of Universal Invariants or Proving Their Absence", journal = j-J-ACM, volume = "64", number = "1", pages = "7:1--7:??", month = mar, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3022187", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Mon Apr 3 09:29:49 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present Universal Property Directed Reachability (PDR$^{ \forall }$), a property-directed semi-algorithm for automatic inference of invariants in a universal fragment of first-order logic. PDR$^{ \forall }$ is an extension of Bradley's PDR/IC3 algorithm for inference of propositional invariants. PDR$^{ \forall }$ terminates when it discovers a concrete counterexample, infers an inductive universal invariant strong enough to establish the desired safety property, or finds a proof that such an invariant does not exist. PDR$^{ \forall }$ is not guaranteed to terminate. However, we prove that under certain conditions, for example, when reasoning about programs manipulating singly linked lists, it does. We implemented an analyzer based on PDR$^{ \forall }$ and applied it to a collection of list-manipulating programs. Our analyzer was able to automatically infer universal invariants strong enough to establish memory safety and certain functional correctness properties, show the absence of such invariants for certain natural programs and specifications, and detect bugs. All this without the need for user-supplied abstraction predicates.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Feldman:2017:SAL, author = "Vitaly Feldman and Elena Grigorescu and Lev Reyzin and Santosh S. Vempala and Ying Xiao", title = "Statistical Algorithms and a Lower Bound for Detecting Planted Cliques", journal = j-J-ACM, volume = "64", number = "2", pages = "8:1--8:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3046674", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle. For such algorithms, access to the input distribution is limited to obtaining an estimate of the expectation of any given function on a sample drawn randomly from the input distribution rather than directly accessing samples. Most natural algorithms of interest in theory and in practice, for example, moments-based methods, local search, standard iterative methods for convex optimization, MCMC, and simulated annealing, can be implemented in this framework. Our framework is based on, and generalizes, the statistical query model in learning theory [Kearns 1998]. Our main application is a nearly optimal lower bound on the complexity of any statistical query algorithm for detecting planted bipartite clique distributions (or planted dense subgraph distributions) when the planted clique has size $ O(n^{1 / 2 - \delta }) $ for any constant $ \delta > 0 $. The assumed hardness of variants of these problems has been used to prove hardness of several other problems and as a guarantee for security in cryptographic applications. Our lower bounds provide concrete evidence of hardness, thus supporting these assumptions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Schulman:2017:ACM, author = "Leonard J. Schulman and Alistair Sinclair", title = "Analysis of a Classical Matrix Preconditioning Algorithm", journal = j-J-ACM, volume = "64", number = "2", pages = "9:1--9:23", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2988227", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study a classical iterative algorithm for balancing matrices in the $ L_\infty $ norm via a scaling transformation. This algorithm, which goes back to Osborne and Parlett 8 Reinsch in the 1960s, is implemented as a standard preconditioner in many numerical linear algebra packages. Surprisingly, despite its widespread use over several decades, no bounds were known on its rate of convergence. In this article, we prove that, for any irreducible $ n \times n $ (real or complex) input matrix $A$, a natural variant of the algorithm converges in $ O(n^3 \log (n \rho / \epsilon))$ elementary balancing operations, where $ \rho $ measures the initial imbalance of $A$ and $ \epsilon $ is the target imbalance of the output matrix. (The imbalance of $A$ is $ | \log (a_i^{\rm out} / a_i^{\rm in})|$, where $ a_i^{\rm out}$, $ a_i^{\rm in}$ are the maximum entries in magnitude in the $i$ th row and column, respectively.) This bound is tight up to the $ \log n$ factor. A balancing operation scales the $i$ th row and column so that their maximum entries are equal, and requires $ O(m / n)$ arithmetic operations on average, where $m$ is the number of nonzero elements in $A$. Thus, the running time of the iterative algorithm is $ {\tilde {O}}(n^2 m)$. This is the first time bound of any kind on any variant of the Osborne--Parlett--Reinsch algorithm. We also prove a conjecture of Chen that characterizes those matrices for which the limit of the balancing process is independent of the order in which balancing operations are performed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Applebaum:2017:AC, author = "Benny Applebaum and Jonathan Avron and Chris Brzuska", title = "Arithmetic Cryptography", journal = j-J-ACM, volume = "64", number = "2", pages = "10:1--10:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3046675", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the possibility of computing cryptographic primitives in a fully black-box arithmetic model over a finite field $F$. In this model, the input to a cryptographic primitive (e.g., encryption scheme) is given as a sequence of field elements, the honest parties are implemented by arithmetic circuits that make only a black-box use of the underlying field, and the adversary has a full (non-black-box) access to the field. This model captures many standard information-theoretic constructions. We prove several positive and negative results in this model for various cryptographic tasks. On the positive side, we show that, under coding-related intractability assumptions, computational primitives like commitment schemes, public-key encryption, oblivious transfer, and general secure two-party computation can be implemented in this model. On the negative side, we prove that garbled circuits, additively homomorphic encryption, and secure computation with low online complexity cannot be achieved in this model. Our results reveal a qualitative difference between the standard Boolean model and the arithmetic model, and explain, in retrospect, some of the limitations of previous constructions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kopparty:2017:HRL, author = "Swastik Kopparty and Or Meir and Noga Ron-Zewi and Shubhangi Saraf", title = "High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity", journal = j-J-ACM, volume = "64", number = "2", pages = "11:1--11:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3051093", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Locally correctable codes (LCCs) and locally testable codes (LTCs) are error-correcting codes that admit local algorithms for correction and detection of errors. Those algorithms are local in the sense that they only query a small number of entries of the corrupted codeword. The fundamental question about LCCs and LTCs is to determine the optimal tradeoff among their rate, distance, and query complexity. In this work, we construct the first LCCs and LTCs with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist LCCs and LTCs with block length n, constant rate (which can even be taken arbitrarily close to 1), and constant relative distance, whose query complexity is $ \exp (\tilde {O}(\sqrt {\log n})) $ (for LCCs) and $ (\log n)^{O(\log \log n)} $ (for LTCs). In addition to having small query complexity, our codes also achieve better tradeoffs between the rate and the relative distance than were previously known to be achievable by LCCs or LTCs. Specifically, over large (but constant size) alphabet, our codes approach the Singleton bound, that is, they have almost the best-possible relationship between their rate and distance. Over the binary alphabet, our codes meet the Zyablov bound. Such tradeoffs between the rate and the relative distance were previously not known for any $ o(n) $ query complexity. Our results on LCCs also immediately give locally decodable codes with the same parameters.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dyer:2017:SMC, author = "Martin Dyer and Mark Jerrum and Haiko M{\"u}ller", title = "On the Switch {Markov} Chain for Perfect Matchings", journal = j-J-ACM, volume = "64", number = "2", pages = "12:1--12:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2822322", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We ask: for which hereditary classes of graphs is the Markov chain ergodic and for which is it rapidly mixing? We provide a precise answer to the ergodicity question and close bounds on the mixing question. We show for the first time that the mixing time of the switch chain is polynomial in the case of monotone graphs, a class that includes examples of interest in the statistical setting.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFc, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "64", number = "2", pages = "13:1--13:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3090997", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Veanes:2017:MD, author = "Margus Veanes and Nikolaj Bj{\o}rner and Lev Nachmanson and Sergey Bereg", title = "Monadic Decomposition", journal = j-J-ACM, volume = "64", number = "2", pages = "14:1--14:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3040488", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas whose satisfiability is decidable, such as linear arithmetic. Here we develop a semidecision procedure for extracting a monadic decomposition of a formula when it exists.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cook:2017:VIE, author = "Byron Cook and Heidy Khlaaf and Nir Piterman", title = "Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems", journal = j-J-ACM, volume = "64", number = "2", pages = "15:1--15:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3060257", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:18 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Temporal logic is a formal system for specifying and reasoning about propositions qualified in terms of time. It offers a unified approach to program verification as it applies to both sequential and parallel programs and provides a uniform framework for describing a system at any level of abstraction. Thus, a number of automated systems have been proposed to exclusively reason about either Computation-Tree Logic (CTL) or Linear Temporal Logic (LTL) in the infinite-state setting. Unfortunately, these logics have significantly reduced expressiveness as they restrict the interplay between temporal operators and path quantifiers, thus disallowing the expression of many practical properties, for example, ``along some future an event occurs infinitely often.'' Contrarily, CTL$^*$, a superset of both CTL and LTL, can facilitate the interplay between path-based and state-based reasoning. CTL$^*$ thus exclusively allows for the expressiveness of properties involving existential system stabilization and ``possibility'' properties. Until now, there have not existed automated systems that allow for the verification of such expressive CTL$^*$ properties over infinite-state systems. This article proposes a method capable of such a task, thus introducing the first known fully automated tool for symbolically proving CTL$^*$ properties of (infinite-state) integer programs. The method uses an internal encoding that admits reasoning about the subtle interplay between the nesting of temporal operators and path quantifiers that occurs within CTL$^*$ proofs. A program transformation is first employed that trades nondeterminism in the transition relation for nondeterminism explicit in variables predicting future outcomes when necessary. We then synthesize and quantify preconditions over the transformed program that represent program states that satisfy a CTL$^*$ formula. This article demonstrates the viability of our approach in practice, thus leading to a new class of fully-automated tools capable of proving crucial properties that no tool could previously prove. Additionally, we consider the linear-past extension to CTL$^*$ for infinite-state systems in which the past is linear and each moment in time has a unique past. We discuss the practice of this extension and how it is further supported through the use of history variables. We have implemented our approach and report our benchmarks carried out on case studies ranging from smaller programs to demonstrate the expressiveness of CTL$^*$ specifications, to larger code bases drawn from device drivers and various industrial examples.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Yamauchi:2017:PFS, author = "Yukiko Yamauchi and Taichi Uehara and Shuji Kijima and Masafumi Yamashita", title = "Plane Formation by Synchronous Mobile Robots in the Three-Dimensional {Euclidean} Space", journal = j-J-ACM, volume = "64", number = "3", pages = "16:1--16:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3060272", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Creating a swarm of mobile computing entities, frequently called robots, agents, or sensor nodes, with self-organization ability is a contemporary challenge in distributed computing. Motivated by this, we investigate the plane formation problem that requires a swarm of robots moving in the three-dimensional Euclidean space to land on a common plane. The robots are fully synchronous and endowed with visual perception. But they do not have identifiers, nor access to the global coordinate system, nor any means of explicit communication with each other. Though there are plenty of results on the agreement problem for robots in the two-dimensional plane, for example, the point formation problem, the pattern formation problem, and so on, this is the first result for robots in the three-dimensional space. This article presents a necessary and sufficient condition for fully synchronous robots to solve the plane formation problem that does not depend on obliviousness, i.e., the availability of local memory at robots. An implication of the result is somewhat counter-intuitive: The robots cannot form a plane from most of the semi-regular polyhedra, while they can form a plane from every regular polyhedron (except a regular icosahedron), whose symmetry is usually considered to be higher than any semi-regular polyhedron.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2017:DFO, author = "Martin Grohe and Stephan Kreutzer and Sebastian Siebertz", title = "Deciding First-Order Properties of Nowhere Dense Graphs", journal = j-J-ACM, volume = "64", number = "3", pages = "17:1--17:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3051095", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez [2010, 2011], form a large variety of classes of ``sparse graphs'' including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes of bounded expansion. We show that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes (parameterized by the length of the input formula). At least for graph classes closed under taking subgraphs, this result is optimal: it was known before that for all classes C of graphs closed under taking subgraphs, if deciding first-order properties of graphs in C is fixed-parameter tractable, then C must be nowhere dense (under a reasonable complexity theoretic assumption). As a by-product, we give an algorithmic construction of sparse neighborhood covers for nowhere dense graphs. This extends and improves previous constructions of neighborhood covers for graph classes with excluded minors. At the same time, our construction is considerably simpler than those. Our proofs are based on a new game-theoretic characterization of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes. On the logical side, we prove a ``rank-preserving'' version of Gaifman's locality theorem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cygan:2017:TLB, author = "Marek Cygan and Fedor V. Fomin and Alexander Golovnev and Alexander S. Kulikov and Ivan Mihajlin and Jakub Pachocki and Arkadiusz Socala", title = "Tight Lower Bounds on Graph Embedding Problems", journal = j-J-ACM, volume = "64", number = "3", pages = "18:1--18:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3051094", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time | V (H )|$^{o (| V (G)|)}$. We also show an exponential-time reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibility of | V (H)|$^{o (| V (H)|)}$ -time algorithm deciding if graph G is a subgraph of H. For both problems our lower bounds asymptotically match the running time of brute-force algorithms trying all possible mappings of one graph into another. Thus, our work closes the gap in the known complexity of these fundamental problems. Moreover, as a consequence of our reductions, conditional lower bounds follow for other related problems such as Locally Injective Homomorphism, Graph Minors, Topological Graph Minors, Minimum Distortion Embedding and Quadratic Assignment Problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cai:2017:CCC, author = "Jin-Yi Cai and Xi Chen", title = "Complexity of Counting {CSP} with Complex Weights", journal = j-J-ACM, volume = "64", number = "3", pages = "19:1--19:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2822891", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a complexity dichotomy theorem for the counting constraint satisfaction problem (\#CSP in short) with algebraic complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of algebraic complex-valued functions defined on an arbitrary finite domain. We show that \#CSP(F) is solvable in polynomial time if all three conditions are satisfied and is \#P-hard otherwise. Our dichotomy theorem generalizes a long series of important results on counting problems and reaches a natural culmination: (a) the problem of counting graph homomorphisms is the special case when F has a single symmetric binary function [Dyer and Greenhill 2000; Bulatov and Grohe 2005; Goldberg et al. 2010; Cai et al. 2013]; (b) the problem of counting directed graph homomorphisms is the special case when F has a single but not necessarily symmetric binary function [Dyer et al. 2007; Cai and Chen 2010]; (c) the unweighted form of \#CSP is when all functions in F take values in {0, 1} [Bulatov 2008; Dyer and Richerby 2013].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2017:CNM, author = "Xi Chen and Dimitris Paparas and Mihalis Yannakakis", title = "The Complexity of Non-Monotone Markets", journal = j-J-ACM, volume = "64", number = "3", pages = "20:1--20:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3064810", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce the notion of non-monotone utilities, which covers a wide variety of utility functions in economic theory. We then prove that it is PPAD-hard to compute an approximate Arrow--Debreu market equilibrium in markets with linear and non-monotone utilities. Building on this result, we settle the long-standing open problem regarding the computation of an approximate Arrow--Debreu market equilibrium in markets with CES utility functions, by proving that it is PPAD-complete when the Constant Elasticity of Substitution parameter $ \rho $ is any constant less than $ - 1 $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goldreich:2017:LTD, author = "Oded Goldreich and Dana Ron", title = "On Learning and Testing Dynamic Environments", journal = j-J-ACM, volume = "64", number = "3", pages = "21:1--21:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3088509", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We initiate a study of learning and testing dynamic environments, focusing on environments that evolve according to a fixed local rule. The (proper) learning task consists of obtaining the initial configuration of the environment, whereas for nonproper learning it suffices to predict its future values. The testing task consists of checking whether the environment has indeed evolved from some initial configuration according to the known evolution rule. We focus on the temporal aspect of these computational problems, which is reflected in two requirements: (1) it is not possible to ``go back to the past'' and make a query concerning the environment at time t after having made a query concerning time $ t' > t $, and (2) only a small portion of the environment is inspected in each time unit. We present several general results, extensive studies of two special cases, and a host of open problems. The general results illustrate the significance of the temporal aspect of the current model (i.e., the difference between the current model and the standard model) as well as the preservation of some relations that hold in the standard model. The two special cases that we study are linear rules of evolution and rules of evolution that represent simple movement of objects. Specifically, we show that evolution according to any linear rule can be tested within a total number of queries that is sublinear in the size of the environment, and that evolution according to a simple one-dimensional movement rule can be tested within a total number of queries that is independent of the size of the environment.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFd, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "64", number = "3", pages = "22:1--22:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3090999", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bar-Yehuda:2017:DAV, author = "Reuven Bar-Yehuda and Keren Censor-Hillel and Gregory Schwartzman", title = "A Distributed $ (2 + \epsilon)$-Approximation for Vertex Cover in {$ O(\log \Delta / \epsilon \log \log \Delta)$} Rounds", journal = j-J-ACM, volume = "64", number = "3", pages = "23:1--23:??", month = jun, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3060294", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a simple deterministic distributed $ (2 + \epsilon)$-approximation algorithm for minimum-weight vertex cover, which completes in $ O ( = l o g \Delta / \epsilon \log \log \Delta)$ rounds, where $ \Delta $ is the maximum degree in the graph, for any $ \epsilon > 0$ that is at most $ O(1)$. For a constant $ \epsilon $, this implies a constant approximation in $ O(\log \Delta / \log \log \Delta)$ rounds, which contradicts the lower bound of [KMW10].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zheng:2017:RNG, author = "Yu Zheng and Louxin Zhang", title = "Reconciliation With Nonbinary Gene Trees Revisited", journal = j-J-ACM, volume = "64", number = "4", pages = "24:1--24:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3088512", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "By reconciling the phylogenetic tree of a gene family with the corresponding species tree, it is possible to infer lineage-specific duplications and losses with high confidence and hence to annotate orthologs and paralogs. The currently available reconciliation methods for nonbinary gene trees are computationally expensive for genome-scale applications. We present four $ O(| G | + | S |) $ algorithms to reconcile an arbitrary gene tree $G$ with a binary species tree $S$ in the duplication, loss, duploss (also known as mutation), and deep coalescence cost models, where $ | \cdot |$ denotes the number of nodes in a tree. The improvement is achieved through two innovations: a linear-time computation of compressed child-image subtrees and efficient reconstruction of irreducible duplication histories. Our technique for child-image subtree compression also results in an order of magnitude speedup in runtime for the dynamic programming and Wagner parsimony--based methods for tree reconciliation in the affine cost model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abdulla:2017:SSF, author = "Parosh Aziz Abdulla and Stavros Aronis and Bengt Jonsson and Konstantinos Sagonas", title = "Source Sets: a Foundation for Optimal Dynamic Partial Order Reduction", journal = j-J-ACM, volume = "64", number = "4", pages = "25:1--25:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3073408", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in 2005 and since then not only used as a point of reference but also extended by various researchers. In this article, we present a new DPOR algorithm, which is the first to be provably optimal in that it always explores the minimal number of executions. It is based on a novel class of sets, called source sets, that replace the role of persistent sets in previous algorithms. We begin by showing how to modify the original DPOR algorithm to work with source sets, resulting in an efficient and simple-to-implement algorithm, called source-DPOR. Subsequently, we enhance this algorithm with a novel mechanism, called wakeup trees, that allows the resulting algorithm, called optimal-DPOR, to achieve optimality. Both algorithms are then extended to computational models where processes may disable each other, for example, via locks. Finally, we discuss tradeoffs of the source- and optimal-DPOR algorithm and present programs that illustrate significant time and space performance differences between them. We have implemented both algorithms in a publicly available stateless model checking tool for Erlang programs, while the source-DPOR algorithm is at the core of a publicly available stateless model checking tool for C/pthread programs running on machines with relaxed memory models. Experiments show that source sets significantly increase the performance of stateless model checking compared to using the original DPOR algorithm and that wakeup trees incur only a small overhead in both time and space in practice.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2017:TFG, author = "Hubie Chen", title = "The Tractability Frontier of Graph-Like First-Order Query Sets", journal = j-J-ACM, volume = "64", number = "4", pages = "26:1--26:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3073409", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The focus of this work is first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this problem is tractable, in the sense of parameterized complexity theory. To this end, we define the notion of a graph-like sentence set; the definition is inspired by previous work on first-order model checking wherein the permitted connectives and quantifiers were restricted. Our main theorem is the complete tractability classification of such graph-like sentence sets, which is (to our knowledge) the first complexity classification theorem concerning a class of sentences that has no restriction on the connectives and quantifiers. To present and prove our classification, we introduce and develop a novel complexity-theoretic framework that is built on parameterized complexity and includes new notions of reduction.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alstrup:2017:OIU, author = "Stephen Alstrup and S{\o}ren Dahlgaard and Mathias B{\ae}k Tejs Knudsen", title = "Optimal Induced Universal Graphs and Adjacency Labeling for Trees", journal = j-J-ACM, volume = "64", number = "4", pages = "27:1--27:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3088513", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we show that there exists a graph $G$ with $ O(n)$ nodes such that any forest of n nodes is an induced subgraph of $G$. Furthermore, for constant arboricity $k$, the result implies the existence of a graph with $ O(n^k)$ nodes that contains all $n$-node graphs of arboricity $k$ as node-induced subgraphs, matching a $ \Omega (n^k)$ lower bound of Alstrup and Rauhe. Our upper bounds are obtained through a $ \log_2 n + O(1)$ labeling scheme for adjacency queries in forests. We hereby solve an open problem being raised repeatedly over decades by authors such as Kannan et al., Chung, and Fraigniaud and Korman.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abboud:2017:ASE, author = "Amir Abboud and Greg Bodwin", title = "The $ 4 / 3 $ Additive Spanner Exponent Is Tight", journal = j-J-ACM, volume = "64", number = "4", pages = "28:1--28:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3088511", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tradeoff between the sparsity of a spanner and the quality of its approximation, so long as distance error is measured multiplicatively. A central open question in the field is to prove or disprove whether such a tradeoff exists also in the regime of additive error. That is, is it true that for all $ \epsilon > 0 $, there is a constant $ k_\epsilon $ such that every graph has a spanner on $ O(n^{1 + \epsilon }) $ edges that preserves its pairwise distances up to $ + k_\epsilon $ ? Previous lower bounds are consistent with a positive resolution to this question, while previous upper bounds exhibit the beginning of a tradeoff curve: All graphs have $ + 2 $ spanners on $ O(n^{3 / 2}) $ edges, $ + 4 $ spanners on $ \tilde {O}(n^{7 / 5}) $ edges, and $ + 6 $ spanners on $ O(n^{4 / 3}) $ edges. However, progress has mysteriously halted at the $ n^{4 / 3} $ bound, and despite significant effort from the community, the question has remained open for all $ 0 < \epsilon < 1 / 3 $. Our main result is a surprising negative resolution of the open question, even in a highly generalized setting. We show a new information theoretic incompressibility bound: There is no function that compresses graphs into $ O(n^{4 / 3 - \epsilon }) $ bits so distance information can be recovered within $ + n^{o(1)} $ error. As a special case of our theorem, we get a tight lower bound on the sparsity of additive spanners: the $ + 6 $ spanner on $ O(n^{4 / 3}) $ edges cannot be improved in the exponent, even if any subpolynomial amount of additive error is allowed. Our theorem implies new lower bounds for related objects as well; for example, the 20-year-old $ + 4 $ emulator on $ O(n^{4 / 3}) $ edges also cannot be improved in the exponent unless the error allowance is polynomial. Central to our construction is a new type of graph product, which we call the Obstacle Product. Intuitively, it takes two graphs $G$, $H$ and produces a new graph $ G \otimes H$ whose shortest paths structure looks locally like $H$ but globally like $G$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Potechin:2017:BMS, author = "Aaron Potechin", title = "Bounds on Monotone Switching Networks for Directed Connectivity", journal = j-J-ACM, volume = "64", number = "4", pages = "29:1--29:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3080520", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on $n$ vertices must have size at least $ n^{ \Omega (lg n)}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFe, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "64", number = "4", pages = "29:1--29:??", month = sep, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3119408", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Fri Sep 8 08:45:19 MDT 2017", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Agrawal:2017:NOR, author = "Shipra Agrawal and Navin Goyal", title = "Near-Optimal Regret Bounds for {Thompson} Sampling", journal = j-J-ACM, volume = "64", number = "5", pages = "30:1--30:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3088510", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Thompson Sampling (TS) is one of the oldest heuristics for multiarmed bandit problems. It is a randomized algorithm based on Bayesian ideas and has recently generated significant interest after several studies demonstrated that it has favorable empirical performance compared to the state-of-the-art methods. In this article, a novel and almost tight martingale-based regret analysis for Thompson Sampling is presented. Our technique simultaneously yields both problem-dependent and problem-independent bounds: (1) the first near-optimal problem-independent bound of O ( \sqrt NT ln T) on the expected regret and (2) the optimal problem-dependent bound of (1 + \epsilon) \Sigma $_i$ \frac ln T d (\mu $_i$, \mu $_1$) + O ( \frac N \epsilon $^2$) on the expected regret (this bound was first proven by Kaufmann et al. (2012b)). Our technique is conceptually simple and easily extends to distributions other than the Beta distribution used in the original TS algorithm. For the version of TS that uses Gaussian priors, we prove a problem-independent bound of O (\sqrt NT ln N) on the expected regret and show the optimality of this bound by providing a matching lower bound. This is the first lower bound on the performance of a natural version of Thompson Sampling that is away from the general lower bound of \Omega (\sqrt NT) for the multiarmed bandit problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alur:2017:STT, author = "Rajeev Alur and Loris D'Antoni", title = "Streaming Tree Transducers", journal = j-J-ACM, volume = "64", number = "5", pages = "31:1--31:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3092842", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass through the input, and computes the output in linear time using a finite-state control, a visibly pushdown stack, and a finite number of variables that store output chunks that can be combined using the operations of string-concatenation and tree-insertion. We prove that the expressiveness of the model coincides with transductions definable using monadic second-order logic (MSO). Existing models of tree transducers either cannot implement all MSO-definable transformations, or require regular look-ahead that prohibits single-pass implementation. We show a variety of analysis problems such as type-checking and checking functional equivalence are decidable for our model.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ambainis:2017:SQC, author = "Andris Ambainis and Kaspars Balodis and Aleksandrs Belovs and Troy Lee and Miklos Santha and Juris Smotrovs", title = "Separations in Query Complexity Based on Pointer Functions", journal = j-J-ACM, volume = "64", number = "5", pages = "32:1--32:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3106234", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total Boolean function is given by the function f on n = 2 $^k$ bits defined by a complete binary tree of NAND gates of depth k, which achieves R$_0$ (f) = O (D (f )$^{0.7537 \ldots {}}$). We show that this is false by giving an example of a total Boolean function f on n bits whose deterministic query complexity is \Omega (n ) while its zero-error randomized query complexity is {\~O}(\sqrt n). We further show that the quantum query complexity of the same function is {\~O}(n$^{ \frac 14}$), giving the first example of a total function with a super-quadratic gap between its quantum and deterministic query complexities. We also construct a total Boolean function g on n variables that has zero-error randomized query complexity \Omega (n / \log (n)) and bounded-error randomized query complexity R (g) = {\~O}(\sqrt n). This is the first super-linear separation between these two complexity measures. The exact quantum query complexity of the same function is Q$_E$ (g) = {\~O}(\sqrt n). These functions show that the relations D (f) = O ( R$_1$ (f)$^2$) and R$_0$ (f) = {\~O}(R (f)$^2$ ) are optimal, up to polylogarithmic factors. Further variations of these functions give additional separations between other query complexity measures: a cubic separation between Q and R$_0$, a \frac 32-power separation between Q$_E$ and R, and a 4th-power separation between approximate degree and bounded-error randomized query complexity. All of these examples are variants of a function recently introduced by G{\"o}{\"o}s, Pitassi, and Watson, which they used to separate the unambiguous 1-certificate complexity from deterministic query complexity and to resolve the famous Clique versus Independent Set problem in communication complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bertrand:2017:QDD, author = "Nathalie Bertrand and Blaise Genest and Hugo Gimbert", title = "Qualitative Determinacy and Decidability of Stochastic Games with Signals", journal = j-J-ACM, volume = "64", number = "5", pages = "33:1--33:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3107926", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider two-person zero-sum stochastic games with signals, a standard model of stochastic games with imperfect information. The only source of information for the players consists of the signals they receive; they cannot directly observe the state of the game, nor the actions played by their opponent, nor their own actions. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, B{\"u}chi, or co-B{\"u}chi winning objectives, and the computation of these strategies when the game has finitely many states and actions. We prove two qualitative determinacy results. First, in a reachability game, either player 1 can achieve almost surely the reachability objective, or player 2 can achieve surely the dual safety objective, or both players have positively winning strategies. Second, in a B{\"u}chi game, if player 1 cannot achieve almost surely the B{\"u}chi objective, then player 2 can ensure positively the dual co-B{\"u}chi objective. We prove that players only need strategies with finite memory. The number of memory states needed to win with finite-memory strategies ranges from one (corresponding to memoryless strategies) to doubly exponential, with matching upper and lower bounds. Together with the qualitative determinacy results, we also provide fix-point algorithms for deciding which player has an almost-surely winning or a positively winning strategy and for computing an associated finite-memory strategy. Complexity ranges from EXPTIME to 2EXPTIME, with matching lower bounds. Our fix-point algorithms also enjoy a better complexity in the cases where one of the players is better informed than their opponent. Our results hold even when players do not necessarily observe their own actions. The adequate class of strategies, in this case, is mixed or general strategies (they are equivalent). Behavioral strategies are too restrictive to guarantee determinacy: it may happen that one of the players has a winning general strategy but none of them has a winning behavioral strategy. On the other hand, if a player can observe their actions, then general, mixed, and behavioral strategies are equivalent. Finite-memory strategies are sufficient for determinacy to hold, provided that randomized memory updates are allowed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chatterjee:2017:CMP, author = "Krishnendu Chatterjee and Yaron Velner", title = "The Complexity of Mean-Payoff Pushdown Games", journal = j-J-ACM, volume = "64", number = "5", pages = "34:1--34:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3121408", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Two-player games on graphs are central in many problems in formal verification and program analysis, such as synthesis and verification of open systems. In this work, we consider solving recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives-such as reachability and \omega -regular objectives-in this work, we study for the first time such games with the most well-studied quantitative objective, the mean-payoff objective. In pushdown games, two types of strategies are relevant: (1) global strategies, which depend on the entire global history; and (2) modular strategies, which have only local memory and thus do not depend on the context of invocation but rather only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity by showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games and memoryless modular strategies are sufficient in two-player pushdown games. Finally, we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haastad:2017:ACD, author = "Johan H{\aa}stad and Benjamin Rossman and Rocco A. Servedio and Li-Yang Tan", title = "An Average-Case Depth Hierarchy Theorem for {Boolean} Circuits", journal = j-J-ACM, volume = "64", number = "5", pages = "35:1--35:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3095799", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of AND, OR, and NOT gates. Our hierarchy theorem says that for every d \geq 2, there is an explicit n -variable Boolean function f, computed by a linear-size depth- d formula, which is such that any depth-(d -1) circuit that agrees with f on (1/2 + o$_n$ (1)) fraction of all inputs must have size exp(n$^{ \Omega (1 / d)}$). This answers an open question posed by H{\aa}stad in his Ph.D. thesis (H{\aa}stad 1986b). Our average-case depth hierarchy theorem implies that the polynomial hierarchy is infinite relative to a random oracle with probability 1, confirming a conjecture of H{\aa}stad (1986a), Cai (1986), and Babai (1987). We also use our result to show that there is no ``approximate converse'' to the results of Linial, Mansour, Nisan (Linial et al. 1993) and (Boppana 1997) on the total influence of bounded-depth circuits. A key ingredient in our proof is a notion of random projections which generalize random restrictions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFf, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "64", number = "5", pages = "35:1--35:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3140539", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ameloot:2017:PCT, author = "Tom J. Ameloot and Gaetano Geck and Bas Ketsman and Frank Neven and Thomas Schwentick", title = "Parallel-Correctness and Transferability for Conjunctive Queries", journal = j-J-ACM, volume = "64", number = "5", pages = "36:1--36:??", month = oct, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3106412", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data are first reshuffled over many servers and then evaluated in a parallel but communication-free way. The reshuffling itself is specified as a distribution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel-correctness for conjunctive queries as well as transferability of parallel-correctness between queries. We also investigate the complexity of transferability for certain families of distribution policies, including the Hypercube distribution policies.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Valiant:2017:EUI, author = "Gregory Valiant and Paul Valiant", title = "Estimating the Unseen: Improved Estimators for Entropy and Other Properties", journal = j-J-ACM, volume = "64", number = "6", pages = "37:1--37:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3125643", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that a class of statistical properties of distributions, which includes such practically relevant properties as entropy, the number of distinct elements, and distance metrics between pairs of distributions, can be estimated given a sublinear sized sample. Specifically, given a sample consisting of independent draws from any distribution over at most k distinct elements, these properties can be estimated accurately using a sample of size O (k \log k). For these estimation tasks, this performance is optimal, to constant factors. Complementing these theoretical results, we also demonstrate that our estimators perform exceptionally well, in practice, for a variety of estimation tasks, on a variety of natural distributions, for a wide range of parameters. The key step in our approach is to first use the sample to characterize the ``unseen'' portion of the distribution-effectively reconstructing this portion of the distribution as accurately as if one had a logarithmic factor larger sample. This goes beyond such tools as the Good-Turing frequency estimation scheme, which estimates the total probability mass of the unobserved portion of the distribution: We seek to estimate the shape of the unobserved portion of the distribution. This work can be seen as introducing a robust, general, and theoretically principled framework that, for many practical applications, essentially amplifies the sample size by a logarithmic factor; we expect that it may be fruitfully used as a component within larger machine learning and statistical analysis systems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bournez:2017:PTC, author = "Olivier Bournez and Daniel S. Gra{\c{c}}a and Amaury Pouly", title = "Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length", journal = j-J-ACM, volume = "64", number = "6", pages = "38:1--38:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3127496", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous elegant and simple characterization of P. We believe it is the first time complexity classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of Computable Analysis. Our results may provide a new perspective on classical complexity, by giving a way to define complexity classes, like P, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations. Continuous-Time Models of Computation. Our results can also be interpreted in terms of analog computers or analog models of computation: As a side effect, we get that the 1941 General Purpose Analog Computer (GPAC) of Claude Shannon is provably equivalent to Turing machines both in terms of computability and complexity, a fact that has never been established before. This result provides arguments in favour of a generalised form of the Church--Turing Hypothesis, which states that any physically realistic (macroscopic) computer is equivalent to Turing machines both in terms of computability and complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gal:2017:WFR, author = "Ya'akov (Kobi) Gal and Moshe Mash and Ariel D. Procaccia and Yair Zick", title = "Which Is the Fairest (Rent Division) of Them All?", journal = j-J-ACM, volume = "64", number = "6", pages = "39:1--39:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3131361", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "``Mirror, mirror, on the wall, who is the fairest of them all?'' The Evil Queen What is a fair way to assign rooms to several housemates and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions to rent division instances. But envy freeness, in and of itself, is insufficient to guarantee outcomes that people view as intuitive and acceptable. We therefore focus on solutions that optimize a criterion of social justice, subject to the envy-freeness constraint, in order to pinpoint the ``fairest'' solutions. We develop a general algorithmic framework that enables the computation of such solutions in polynomial time. We then study the relations between natural optimization objectives and identify the maximin solution, which maximizes the minimum utility subject to envy freeness, as the most attractive. We demonstrate, in theory and using experiments on real data from Spliddit, that the maximin solution gives rise to significant gains in terms of our optimization objectives. Finally, a user study with Spliddit users as subjects demonstrates that people find the maximin solution to be significantly fairer than arbitrary envy-free solutions; this user study is unprecedented in that it asks people about their real-world rent division instances. Based on these results, the maximin solution has been deployed on Spliddit since April 2015.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beame:2017:CSP, author = "Paul Beame and Paraschos Koutris and Dan Suciu", title = "Communication Steps for Parallel Query Processing", journal = j-J-ACM, volume = "64", number = "6", pages = "40:1--40:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3125644", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the problem of computing conjunctive queries over large databases on parallel architectures without shared storage. Using the structure of such a query q and the skew in the data, we study tradeoffs between the number of processors, the number of rounds of communication, and the per-processor load -the number of bits each processor can send or can receive in a single round-that are required to compute q. Since each processor must store its received bits, the load is at most the number of bits of storage per processor. When the data are free of skew, we obtain essentially tight upper and lower bounds for one round algorithms, and we show how the bounds degrade when there is skew in the data. In the case of skewed data, we show how to improve the algorithms when approximate degrees of the (necessarily small number of) heavy-hitter elements are available, obtaining essentially optimal algorithms for queries such as skewed simple joins and skewed triangle join queries. For queries that we identify as treelike, we also prove nearly matching upper and lower bounds for multi-round algorithms for a natural class of skew-free databases. One consequence of these latter lower bounds is that for any \epsilon > 0, using p processors to compute the connected components of a graph, or to output the path, if any, between a specified pair of vertices of a graph with m edges and per-processor load that is O (m / p$^{1 - \epsilon }$ ) requires \Omega (log p) rounds of communication. Our upper bounds are given by simple structured algorithms using MapReduce. Our one-round lower bounds are proved in a very general model, which we call the Massively Parallel Communication (MPC) model, that allows processors to communicate arbitrary bits. Our multi-round lower bounds apply in a restricted version of the MPC model in which processors in subsequent rounds after the first communication round are only allowed to send tuples.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFg, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "64", number = "6", pages = "40:1--40:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3151720", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rothvoss:2017:MPE, author = "Thomas Rothvoss", title = "The Matching Polytope has Exponential Extension Complexity", journal = j-J-ACM, volume = "64", number = "6", pages = "41:1--41:??", month = nov, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3127497", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:02 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so-called extension complexity, which for a polytope P denotes the smallest number of inequalities necessary to describe a higher-dimensional polytope Q that can be linearly projected on P. However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints? We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n -node graph is 2$^{ \Omega (n)}$. By a known reduction, this also improves the lower bound on the extension complexity for the TSP polytope from 2$^{ \Omega (\sqrt n)}$ to 2$^{ \Omega (n)}$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abadi:2017:APC, author = "Mart{\'\i}n Abadi and Bruno Blanchet and C{\'e}dric Fournet", title = "The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication", journal = j-J-ACM, volume = "65", number = "1", pages = "1:1--1:??", month = dec, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3127586", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:03 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study the interaction of the programming construct ``new,'' which generates statically scoped names, with communication via messages on channels. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programming-language contexts. We define the applied pi calculus, a simple, general extension of the pi calculus in which values can be formed from names via the application of built-in functions, subject to equations, and be sent as messages. (In contrast, the pure pi calculus lacks built-in functions; its only messages are atomic names.) We develop semantics and proof techniques for this extended language and apply them in reasoning about security protocols. This article essentially subsumes the conference paper that introduced the applied pi calculus in 2001. It fills gaps, incorporates improvements, and further explains and studies the applied pi calculus. Since 2001, the applied pi calculus has been the basis for much further work, described in many research publications and sometimes embodied in useful software, such as the tool ProVerif, which relies on the applied pi calculus to support the specification and automatic analysis of security protocols. Although this article does not aim to be a complete review of the subject, it benefits from that further work and provides better foundations for some of it. In particular, the applied pi calculus has evolved through its implementation in ProVerif, and the present definition reflects that evolution.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Attiya:2017:CTM, author = "Hagit Attiya and Alexey Gotsman and Sandeep Hans and Noam Rinetzky", title = "Characterizing Transactional Memory Consistency Conditions Using Observational Refinement", journal = j-J-ACM, volume = "65", number = "1", pages = "2:1--2:??", month = dec, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3131360", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:03 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Transactional memory (TM) facilitates the development of concurrent applications by letting a programmer designate certain code blocks as atomic. The common approach to stating TM correctness is through a consistency condition that restricts the possible TM executions. Unfortunately, existing consistency conditions fall short of formalizing the intuitive semantics of atomic blocks through which programmers use a TM. To close this gap, we formalize programmer expectations as observational refinement between TM implementations. This states that properties of a program using a concrete TM implementation can be established by analyzing its behavior with an abstract TM, serving as a specification of the concrete one. We show that a variant of Transactional Memory Specification (TMS), a TM consistency condition, is equivalent to observational refinement for a programming language where local variables are rolled back upon a transaction abort. We thereby establish that TMS is the weakest acceptable condition for this case. We then propose a new consistency condition, called Strong Transactional Memory Specification (STMS), and show that it is equivalent to observational refinement for a language where local variables are not rolled back upon aborts. Finally, we show that under certain natural assumptions on TM implementations, STMS is equivalent to a variant of a well-known condition of opacity. Our results suggest a new approach to evaluating TM consistency conditions and enable TM implementors and language designers to make better-informed decisions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Im:2017:CAC, author = "Sungjin Im and Janardhan Kulkarni and Kamesh Munagala", title = "Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints", journal = j-J-ACM, volume = "65", number = "1", pages = "3:1--3:??", month = dec, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3136754", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:03 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce and study a general scheduling problem that we term the Polytope Scheduling problem (PSP). In this problem, jobs can have different arrival times and sizes, and the rates assigned by the scheduler to the jobs are subject to arbitrary packing constraints. The PSP framework captures a variety of scheduling problems, including the classical problems of unrelated machines scheduling, broadcast scheduling, and scheduling jobs of different parallelizability. It also captures scheduling constraints arising in diverse modern environments ranging from individual computer architectures to data centers. More concretely, PSP models multidimensional resource requirements and parallelizability, as well as network bandwidth requirements found in data center scheduling. We show a surprising result-there is a single algorithm that is O (1) competitive for all PSP instances when the objective is total completion time, and O (1) competitive for a large sub-class of PSP instances when the objective is total flow time. This algorithm simply uses the well-known Proportional Fairness (PF) algorithm to perform allocations each time instant. Though P F has been extensively studied in the context of maximizing fairness in resource allocation, we present the first analysis in adversarial and general settings for optimizing job latency. Further, PF is non-clairvoyant, meaning that the algorithm doesn't need to know jobs sizes until their completion. We establish our positive results by making novel connections with Economics, in particular, the notions of market clearing, Gross Substitutes, and Eisenberg-Gale markets. We complement these positive results with a negative result: We show that for the total flow time objective, any non-clairvoyant algorithm for general PSP has a strong lower bound on the competitive ratio unless given a poly-logarithmic speed augmentation. This motivates the need to consider sub-classes of PSP when studying flow time. The sub-class for which we obtain positive results not only captures several well-studied models, such as scheduling with speedup curves and related machine scheduling, but also captures as special cases hitherto unstudied scheduling problems, such as single source flow routing, routing multicast (video-on-demand) trees, and resource allocation with substitute resources.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Braverman:2017:CRC, author = "Mark Braverman and Klim Efremenko and Ran Gelles and Bernhard Haeupler", title = "Constant-Rate Coding for Multiparty Interactive Communication Is Impossible", journal = j-J-ACM, volume = "65", number = "1", pages = "4:1--4:??", month = dec, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3050218", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:03 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We study coding schemes for multiparty interactive communication over synchronous networks that suffer from stochastic noise, where each bit is independently flipped with probability \epsilon . We analyze the minimal overhead that must be added by the coding scheme to succeed in performing the computation despite the noise. Our main result is a lower bound on the communication of any noise-resilient protocol over a synchronous star network with n parties (where all parties communicate in every round). Specifically, we show a task that can be solved by communicating T bits over the noise-free network, but for which any protocol with success probability of 1- o (1) must communicate at least \Omega (T \frac \log n \log log n) bits when the channels are noisy. By a 1994 result of Rajagopalan and Schulman, the slowdown we prove is the highest one can obtain on any topology, up to a \log log n factor. We complete our lower bound with a matching coding scheme that achieves the same overhead; thus, the capacity of (synchronous) star networks is \Theta (log \log n / \log n). Our bounds prove that, despite several previous coding schemes with rate \Omega (1) for certain topologies, no coding scheme with constant rate \Omega (1) exists for arbitrary n -party noisy networks.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2017:IAFh, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "65", number = "1", pages = "5:1--5:??", month = dec, year = "2017", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3159447", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jan 3 11:39:03 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brandl:2018:PIE, author = "Florian Brandl and Felix Brandt and Manuel Eberl and Christian Geist", title = "Proving the Incompatibility of Efficiency and Strategyproofness via {SMT} Solving", journal = j-J-ACM, volume = "65", number = "2", pages = "6:1--6:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3125642", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable. In this article, we provide a computer-aided proof of a sweeping impossibility using these two conditions for randomized aggregation mechanisms. More precisely, we show that every efficient aggregation mechanism can be manipulated for all expected utility representations of the agents' preferences. This settles an open problem and strengthens several existing theorems, including statements that were shown within the special domain of assignment. Our proof is obtained by formulating the claim as a satisfiability problem over predicates from real-valued arithmetic, which is then checked using a satisfiability modulo theories (SMT) solver. To verify the correctness of the result, a minimal unsatisfiable set of constraints returned by the SMT solver was translated back into a proof in higher-order logic, which was automatically verified by an interactive theorem prover. To the best of our knowledge, this is the first application of SMT solvers in computational social choice.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Molloy:2018:FTC, author = "Michael Molloy", title = "The Freezing Threshold for $k$-Colourings of a Random Graph", journal = j-J-ACM, volume = "65", number = "2", pages = "7:1--7:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3034781", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We determine the exact value of the freezing threshold, r$^f_k$, for k -colourings of a random graph when k \geq 14. We prove that for random graphs with density above r$^f_k$, almost every colouring is such that a linear number of vertices are frozen, meaning that their colour cannot be changed by a sequence of alterations whereby we change the colours of o (n) vertices at a time, always obtaining another proper colouring. When the density is below r$^f_k$, then almost every colouring is such that every vertex can be changed by a sequence of alterations where we change O (log n) vertices at a time. Frozen vertices are a key part of the clustering phenomena discovered using methods from statistical physics. The value of the freezing threshold was previously determined by the nonrigorous cavity method.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kurokawa:2018:FEG, author = "David Kurokawa and Ariel D. Procaccia and Junxing Wang", title = "Fair Enough: Guaranteeing Approximate Maximin Shares", journal = j-J-ACM, volume = "65", number = "2", pages = "8:1--8:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3140756", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We consider the problem of fairly allocating indivisible goods, focusing on a recently introduced notion of fairness called maximin share guarantee: each player's value for his allocation should be at least as high as what he can guarantee by dividing the items into as many bundles as there are players and receiving his least desirable bundle. Assuming additive valuation functions, we show that such allocations may not exist, but allocations guaranteeing each player 2/3 of the above value always exist. These theoretical results have direct practical implications.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bodirsky:2018:DTC, author = "Manuel Bodirsky and Barnaby Martin and Antoine Mottet", title = "Discrete Temporal Constraint Satisfaction Problems", journal = j-J-ACM, volume = "65", number = "2", pages = "9:1--9:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3154832", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) over the set of integers whose constraint language consists of relations that are first-order definable over the order of the integers. We prove that every discrete temporal CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP, in which case the computational complexity is not known in general.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fomin:2018:EGM, author = "Fedorr V. Fomin and Daniel Lokshtanov and Saket Saurabh", title = "Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes", journal = j-J-ACM, volume = "65", number = "2", pages = "10:1--10:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3154833", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Two of the most widely used approaches to obtain polynomial-time approximation schemes (PTASs) on planar graphs are the Lipton-Tarjan separator-based approach and Baker's approach. In 2005, Demaine and Hajiaghayi strengthened both approaches using bidimensionality and obtained efficient polynomial-time approximation schemes (EPTASs) for several problems, including Connected Dominating Set and Feedback Vertex Set. In this work, we unify the two strengthened approaches to combine the best of both worlds. We develop a framework allowing the design of EPTAS on classes of graphs with the subquadratic grid minor (SQGM) property. Roughly speaking, a class of graphs has the SQGM property if, for every graph G from the class, the fact that G contains no $ t \times t $ grid as a minor guarantees that the treewidth of G is subquadratic in t. For example, the class of planar graphs and, more generally, classes of graphs excluding some fixed graph as a minor, have the SQGM property. At the heart of our framework is a decomposition lemma stating that for ``most'' bidimensional problems on a graph class G with the SQGM property, there is a polynomial-time algorithm that, given a graph $ G \epsilon G $ as input and an $ \epsilon > 0 $, outputs a vertex set $X$ of size $ \epsilon c_{\rm OPT}$ such that the treewidth of $ G - X$ is $ f(\epsilon)$. Here, OPT is the objective function value of the problem in question and $f$ is a function depending only on $ \epsilon $. This allows us to obtain EPTASs on (apex)-minor-free graphs for all problems covered by the previous framework as well as for a wide range of packing problems, partial covering problems and problems that are neither closed under taking minors nor contractions. To the best of our knowledge, for many of these problems-including Cycle Packing, $F$-Packing, $F$-Deletion, Max Leaf Spanning Tree, or Partial $r$-Dominating Set --- no EPTASs, even on planar graphs, were previously known. We also prove novel excluded grid theorems in unit disk and map graphs without large cliques. Using these theorems, we show that these classes of graphs have the SQGM property. Based on the developed framework, we design EPTASs and subexponential time parameterized algorithms for various classes of problems on unit disk and map graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cerone:2018:ASI, author = "Andrea Cerone and Alexey Gotsman", title = "Analysing Snapshot Isolation", journal = j-J-ACM, volume = "65", number = "2", pages = "11:1--11:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3152396", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Snapshot isolation (SI) is a widely used consistency model for transaction processing, implemented by most major databases and some of transactional memory systems. Unfortunately, its classical definition is given in a low-level operational way, by an idealised concurrency-control algorithm, and this complicates reasoning about the behaviour of applications running under SI. We give an alternative specification to SI that characterises it in terms of transactional dependency graphs of Adya et al., generalising serialisation graphs. Unlike previous work, our characterisation does not require adding additional information to dependency graphs about start and commit points of transactions. We then exploit our specification to obtain two kinds of static analyses. The first one checks when a set of transactions running under SI can be chopped into smaller pieces without introducing new behaviours, to improve performance. The other analysis checks whether a set of transactions running under a weakening of SI behaves the same as when running under SI.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2018:IAFa, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "65", number = "2", pages = "11:1--11:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3186890", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:10 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cygan:2018:FHC, author = "Marek Cygan and Stefan Kratsch and Jesper Nederlof", title = "Fast {Hamiltonicity} Checking Via Bases of Perfect Matchings", journal = j-J-ACM, volume = "65", number = "3", pages = "12:1--12:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3148227", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "For an even integer $ t >= 2 $, the Matching Connectivity matrix $ H_t $ is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph on $t$ vertices; an entry $ H_t[M_1, M_2]$ is $1$ if $ M_1$ and $ M_2$ form a Hamiltonian cycle and $0$ otherwise. Motivated by applications for the Hamiltonicity problem, we show that H$_t$ has rank exactly 2$^{t / 2 - 1}$ over GF(2). The upper bound is established by an explicit factorization of H$_t$ as the product of two submatrices; the matchings labeling columns and rows, respectively, of the submatrices therefore form a basis $ X_t$ of $ H_t$. The lower bound follows because the $ 2^{t / 2 - 1} \times 2^{t / 2 - 1}$ submatrix with rows and columns labeled by $ X_t$ can be seen to have full rank. We obtain several algorithmic results based on the rank of $ H_t$ and the particular structure of the matchings in $ X_t$. First, we present a $ 1.888^n n^{O (1)}$ time Monte Carlo algorithm that solves the Hamiltonicity problem in directed bipartite graphs. Second, we give a Monte Carlo algorithm that solves the problem in $ (2 + \sqrt 2)^{\rm pw} n^{O (1)}$ time when provided with a path decomposition of width pw for the input graph. Moreover, we show that this algorithm is best possible under the Strong Exponential Time Hypothesis, in the sense that an algorithm with running time $ (2 + \sqrt 2 - \epsilon)^{\rm pw} n^{O (1)}$, for any $ \epsilon > 0$, would imply the breakthrough result of a $ (2 - \epsilon^')^n$-time algorithm for CNF-Sat for some $ \epsilon^' > 0$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Badanidiyuru:2018:BK, author = "Ashwinkumar Badanidiyuru and Robert Kleinberg and Aleksandrs Slivkins", title = "Bandits with Knapsacks", journal = j-J-ACM, volume = "65", number = "3", pages = "13:1--13:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3164539", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trials, to communication networks, to Web search and advertising. In many of these application domains, the learner may be constrained by one or more supply (or budget) limits, in addition to the customary limitation on the time horizon. The literature lacks a general model encompassing these sorts of problems. We introduce such a model, called bandits with knapsacks, that combines bandit learning with aspects of stochastic integer programming. In particular, a bandit algorithm needs to solve a stochastic version of the well-known knapsack problem, which is concerned with packing items into a limited-size knapsack. A distinctive feature of our problem, in comparison to the existing regret-minimization literature, is that the optimal policy for a given latent distribution may significantly outperform the policy that plays the optimal fixed arm. Consequently, achieving sublinear regret in the bandits-with-knapsacks problem is significantly more challenging than in conventional bandit problems. We present two algorithms whose reward is close to the information-theoretic optimum: one is based on a novel ``balanced exploration'' paradigm, while the other is a primal-dual algorithm that uses multiplicative updates. Further, we prove that the regret achieved by both algorithms is optimal up to polylogarithmic factors. We illustrate the generality of the problem by presenting applications in a number of different domains, including electronic commerce, routing, and scheduling. As one example of a concrete application, we consider the problem of dynamic posted pricing with limited supply and obtain the first algorithm whose regret, with respect to the optimal dynamic policy, is sublinear in the supply.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Berman:2018:CFC, author = "Itay Berman and Iftach Haitner and Aris Tentes", title = "Coin Flipping of Any Constant Bias Implies One-Way Functions", journal = j-J-ACM, volume = "65", number = "3", pages = "14:1--14:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/2979676", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We show that the existence of a coin-flipping protocol safe against any nontrivial constant bias (e.g., .499) implies the existence of one-way functions. This improves upon a result of Haitner and Omri (FOCS'11), who proved this implication for protocols with bias $ \sqrt 2 - 1 / 2 - o (1) \approx .207 $. Unlike the result of Haitner and Omri, our result also holds for weak coin-flipping protocols.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chan:2018:SPH, author = "T.-H. Hubert Chan and Anand Louis and Zhihao Gavin Tang and Chenzi Zhang", title = "Spectral Properties of Hypergraph {Laplacian} and Approximation Algorithms", journal = j-J-ACM, volume = "65", number = "3", pages = "15:1--15:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3178123", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency matrix (and other related matrices) of graphs. It has remained open to define a suitable spectral model for hypergraphs whose spectra can be used to estimate various combinatorial properties of the hypergraph. In this article, we introduce a new hypergraph Laplacian operator generalizing the Laplacian matrix of graphs. In particular, the operator is induced by a diffusion process on the hypergraph, such that within each hyperedge, measure flows from vertices having maximum weighted measure to those having minimum. Since the operator is nonlinear, we have to exploit other properties of the diffusion process to recover the Cheeger's Inequality that relates hyperedge expansion with the ``second eigenvalue'' of the resulting Laplacian. However, we show that higher-order spectral properties cannot hold in general using the current framework. Since higher-order spectral properties do not hold for the Laplacian operator, we instead use the concept of procedural minimizers to consider higher-order Cheeger-like inequalities. For any $ k \in N $, we give a polynomial-time algorithm to compute an $ O (l o g r)$-approximation to the $k$ th procedural minimizer, where $r$ is the maximum cardinality of a hyperedge. We show that this approximation factor is optimal under the SSE hypothesis (introduced by Raghavendra and Steurer (2010)) for constant values of $k$. Moreover, using the factor-preserving reduction from vertex expansion in graphs to hypergraph expansion, we show that all our results for hypergraphs extend to vertex expansion in graphs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ngo:2018:WCO, author = "Hung Q. Ngo and Ely Porat and Christopher R{\'e} and Atri Rudra", title = "Worst-case Optimal Join Algorithms", journal = j-J-ACM, volume = "65", number = "3", pages = "16:1--16:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3180143", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a new algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a natural join query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality, which is information-theoretic. Thus, the previous results leave open the question of whether there exist algorithms whose runtimes achieve these optimal bounds. An answer to this question may be interesting to database practice, as we show in this article that any project-join style plans, such as ones typically employed in a relational database management system, are asymptotically slower than the optimal for some queries. We present an algorithm whose runtime is worst-case optimal for all natural join queries. Our result may be of independent interest, as our algorithm also yields a constructive proof of the general fractional cover bound by Atserias, Grohe, and Marx without using Shearer's inequality. This bound implies two famous inequalities in geometry: the Loomis-Whitney inequality and its generalization, the Bollob{\'a}s--Thomason inequality. Hence, our results algorithmically prove these inequalities as well. Finally, we discuss how our algorithm can be used to evaluate full conjunctive queries optimally, to compute a relaxed notion of joins and to optimally (in the worst-case) enumerate all induced copies of a fixed subgraph inside of a given large graph.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2018:IAFb, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "65", number = "3", pages = "16:1--16:??", month = mar, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3186892", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jul 25 16:08:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chierichetti:2018:RSC, author = "Flavio Chierichetti and George Giakkoupis and Silvio Lattanzi and Alessandro Panconesi", title = "Rumor Spreading and Conductance", journal = j-J-ACM, volume = "65", number = "4", pages = "17:1--17:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3173043", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance $ \phi $ then, with high probability, PUSH-PULL will deliver the message to all nodes in the graph within $ O(\log n / \phi) $ many communication rounds. This bound is best possible. We also give an alternative proof that the completion time of PUSH-PULL is bounded by a polynomial in $ \log n / \phi $, based on graph sparsification. Although the resulting asymptotic bound is not optimal, this proof shows an interesting and, at the outset, unexpected connection between rumor spreading and graph sparsification. Finally, we show that if the degrees of the two endpoints of each edge in the network differ by at most a constant factor, then both PUSH and PULL alone attain the optimal completion time of $ O(\log n / \phi) $, with high probability.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Stefanov:2018:POE, author = "Emil Stefanov and Marten Van Dijk and Elaine Shi and T.-H. Hubert Chan and Christopher Fletcher and Ling Ren and Xiangyao Yu and Srinivas Devadas", title = "Path {ORAM}: an Extremely Simple Oblivious {RAM} Protocol", journal = j-J-ACM, volume = "65", number = "4", pages = "18:1--18:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3177872", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a $ O (\log N) $ bandwidth cost for blocks of size $ B = \Omega (\log^2 N) $ bits. For such block sizes, Path ORAM is asymptotically better than the best-known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Harris:2018:DCS, author = "David G. Harris and Johannes Schneider and Hsin-Hao Su", title = "Distributed {$ (\Delta + 1) $}-Coloring in Sublogarithmic Rounds", journal = j-J-ACM, volume = "65", number = "4", pages = "19:1--19:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3178120", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We give a new randomized distributed algorithm for $ (\Delta + 1)$-coloring in the LOCAL model, running in $ O(\sqrt \log \Delta) + 2^{O(\sqrt \log \log n)}$ rounds in a graph of maximum degree $ \Delta $. This implies that the $ (\Delta + 1)$-coloring problem is easier than the maximal independent set problem and the maximal matching problem, due to their lower bounds of $ \Omega (\min (\sqrt / \log n \log \log n, / \log \Delta \log \log \Delta))$ by Kuhn, Moscibroda, and Wattenhofer [PODC'04]. Our algorithm also extends to list-coloring where the palette of each node contains $ \Delta + 1$ colors. We extend the set of distributed symmetry-breaking techniques by performing a decomposition of graphs into dense and sparse parts.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Dziembowski:2018:NMC, author = "Stefan Dziembowski and Krzysztof Pietrzak and Daniel Wichs", title = "Non-Malleable Codes", journal = j-J-ACM, volume = "65", number = "4", pages = "20:1--20:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3178432", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce the notion of ``non-malleable codes'' which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every ``small enough'' family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions-e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99\% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against ``tampering attacks.'' In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name ``algorithmic tamper proof security'' (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Seidl:2018:EDT, author = "Helmut Seidl and Sebastian Maneth and Gregor Kemper", title = "Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable", journal = j-J-ACM, volume = "65", number = "4", pages = "21:1--21:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3182653", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long-standing open problem in formal language theory. We also present efficient algorithms for subclasses: for linear transducers or total transducers with unary output alphabet (over a given top-down regular domain language), as well as for transducers with the single-use restriction. These results are obtained using techniques from multi-linear algebra. For our main result, we introduce polynomial transducers and prove that for these, validity of a polynomial invariant can be certified by means of an inductive invariant of polynomial ideals. This allows us to construct two semi-algorithms, one searching for a certificate of the invariant and one searching for a witness of its violation. Via a translation into polynomial transducers, we thus obtain that equivalence of general y dt transducers is decidable. In fact, our translation also shows that equivalence is decidable when the output is not in a free monoid but in a free group.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Gronlund:2018:TDL, author = "Allan Gr{\o}nlund and Seth Pettie", title = "Threesomes, Degenerates, and Love Triangles", journal = j-J-ACM, volume = "65", number = "4", pages = "22:1--22:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3185378", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The 3SUM problem is to decide, given a set of n real numbers, whether any three sum to zero. It is widely conjectured that a trivial $ O(n^2)$-time algorithm is optimal on the Real RAM, and optimal even in the nonuniform linear decision tree model. Over the years the consequences of this conjecture have been revealed. This 3SUM conjecture implies $ \Omega (n^2)$ lower bounds on numerous problems in computational geometry, and a variant of the conjecture for integer inputs implies strong lower bounds on triangle enumeration, dynamic graph algorithms, and string matching data structures. In this article, we refute the conjecture that 3SUM requires $ \Omega (n^2)$ in the Real RAM and refute more forcefully the conjecture that its complexity is $ \Omega (n^2)$ in the linear decision tree model. In particular, we prove that the decision tree complexity of 3SUM is $ O(n^{3 / 2} \sqrt \log n)$ and give two subquadratic 3SUM algorithms, a deterministic one running in $ O(n^2 / (\log n / \log \log n)^{2 / 3})$ time and a randomized one running in $ O(n^2 (\log \log n)^2 / \log n)$ time with high probability. Our results lead directly to improved bounds on the decision tree complexity of $k$ -variate linear degeneracy testing for all odd $ k \geq 3$. Finally, we give a subcubic algorithm for a generalization of the (min, +)-product over real-valued matrices and apply it to the problem of finding zero-weight triangles in edge-weighted graphs. We give a depth-$ O(n^{5 / 2} \sqrt \log n)$ decision tree for this problem, as well as a deterministic algorithm running in time $ O(n^3 (\log \log n)^2 / \log n)$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Ehrhard:2018:FAP, author = "Thomas Ehrhard and Michele Pagani and Christine Tasson", title = "Full Abstraction for Probabilistic {PCF}", journal = j-J-ACM, volume = "65", number = "4", pages = "23:1--23:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3164540", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a call-by-value evaluation for ground-type arguments to provide the language with a suitable algorithmic expressiveness. We describe a denotational semantics based on probabilistic coherence spaces, a model of classical Linear Logic developed in previous works. We prove an adequacy and an equational full abstraction theorem showing that equality in the model coincides with a natural notion of observational equivalence.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Schreiber:2018:OMW, author = "Ethan L. Schreiber and Richard E. Korf and Michael D. Moffitt", title = "Optimal Multi-Way Number Partitioning", journal = j-J-ACM, volume = "65", number = "4", pages = "24:1--24:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3184400", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The NP-hard number-partitioning problem is to separate a multiset S of n positive integers into k subsets such that the largest sum of the integers assigned to any subset is minimized. The classic application is scheduling a set of n jobs with different runtimes on k identical machines such that the makespan, the elapsed time to complete the schedule, is minimized. The two-way number-partitioning decision problem is one of the original 21 problems that Richard Karp proved NP-complete. It is also one of Garey and Johnson's six fundamental NP-complete problems and the only one based on numbers. This article explores algorithms for solving multi-way number-partitioning problems optimally. We explore previous algorithms as well as our own algorithms, which fall into three categories: sequential number partitioning (SNP), a branch-and-bound algorithm; binary-search improved bin completion (BSIBC), a bin-packing algorithm; and cached iterative weakening (CIW), an iterative weakening algorithm. We show experimentally that, for large random numbers, SNP and CIW are state-of-the-art algorithms depending on the values of n and k. Both algorithms outperform the previous state of the art by up to seven orders of magnitude in terms of runtime.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Tardos:2018:IAFc, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "65", number = "4", pages = "25:1--25:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3231052", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Czerwinski:2018:MTP, author = "Wojciech Czerwi{\'n}ski and Wim Martens and Matthias Niewerth and Pawel Parys", title = "Minimization of Tree Patterns", journal = j-J-ACM, volume = "65", number = "4", pages = "26:1--26:??", month = aug, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3180281", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Many of today's graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were originally studied for querying tree-structured data, where they can perform child, descendant, node label, and wildcard tests. The minimization problem aims at reducing the number of nodes in patterns and goes back to the early 2000s. We provide an example showing that, in contrast to earlier claims, tree patterns cannot be minimized by deleting nodes only. The example resolves the M $ =^? $ NR problem, which asks if a tree pattern is minimal if and only if it is nonredundant. The example can be adapted to prove that minimization is $ \Sigma^P_2$-complete, which resolves another question that was open since the early research on the problem. The latter result shows that, unless NP = $ \Pi^P_2$, more general approaches for minimizing tree patterns are also bound to fail in general.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", remark = "Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases.", } @Article{Williams:2018:SEB, author = "Virginia Vassilevska Williams and R. Ryan Williams", title = "Subcubic Equivalences Between Path, Matrix, and Triangle Problems", journal = j-J-ACM, volume = "65", number = "5", pages = "27:1--27:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3186893", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3186893", abstract = "We say an algorithm on $ n \times n $ matrices with integer entries in $ [ - M, M] $ (or $n$ -node graphs with edge weights from $ [ - M, M]$) is truly subcubic if it runs in $ O(n^{3 - \delta } c \poly (\log M))$ time for some $ \delta > 0$. We define a notion of subcubic reducibility and show that many important problems on graphs and matrices solvable in $ O(n^3)$ time are equivalent under subcubic reductions. Namely, the following weighted problems either all have truly subcubic algorithms, or none of them do: * The all-pairs shortest paths problem on weighted digraphs (APSP). * Detecting if a weighted graph has a triangle of negative total edge weight. * Listing up to $ n^{2.99}$ negative triangles in an edge-weighted graph. * Finding a minimum weight cycle in a graph of non-negative edge weights. * The replacement paths problem on weighted digraphs. * Finding the second shortest simple path between two nodes in a weighted digraph. * Checking whether a given matrix defines a metric. * Verifying the correctness of a matrix product over the $ (\min, +)$-semiring. * Finding a maximum subarray in a given matrix. Therefore, if APSP cannot be solved in $ n^{3 - \epsilon }$ time for any $ \epsilon > 0$, then many other problems also need essentially cubic time. In fact, we show generic equivalences between matrix products over a large class of algebraic structures used in optimization, verifying a matrix product over the same structure, and corresponding triangle detection problems over the structure. These equivalences simplify prior work on subcubic algorithms for all-pairs path problems, since it now suffices to give appropriate subcubic triangle detection algorithms. Other consequences of our work are new combinatorial approaches to Boolean matrix multiplication over the (OR,AND)-semiring (abbreviated as BMM). We show that practical advances in triangle detection would imply practical BMM algorithms, among other results. Building on our techniques, we give two improved BMM algorithms: a derandomization of the combinatorial BMM algorithm of Bansal and Williams (FOCS'09), and an improved quantum algorithm for BMM.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bienvenu:2018:OMQ, author = "Meghyn Bienvenu and Stanislav Kikot and Roman Kontchakov and Vladimir V. Podolskii and Michael Zakharyaschev", title = "Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity", journal = j-J-ACM, volume = "65", number = "5", pages = "28:1--28:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3191832", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3191832", abstract = "We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs) and the complexity problem for OMQ answering. We classify OMQs according to the shape of their conjunctive queries (treewidth, the number of leaves) and the existential depth of their ontologies. For each of these classes, we determine the combined complexity of OMQ answering and whether all OMQs in the class have polynomial-size first-order, positive existential, and nonrecursive datalog rewritings. We obtain the succinctness results using hypergraph programs, a new computational model for Boolean functions, which makes it possible to connect the size of OMQ rewritings and circuit complexity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Delgrande:2018:GBR, author = "James P. Delgrande and Pavlos Peppas and Stefan Woltran", title = "General Belief Revision", journal = j-J-ACM, volume = "65", number = "5", pages = "29:1--29:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3203409", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3203409", abstract = "In artificial intelligence, a key question concerns how an agent may rationally revise its beliefs in light of new information. The standard (AGM) approach to belief revision assumes that the underlying logic contains classical propositional logic. This is a significant limitation, since many representation schemes in AI don't subsume propositional logic. In this article, we consider the question of what the minimal requirements are on a logic, such that the AGM approach to revision may be formulated. We show that AGM-style revision can be obtained even when extremely little is assumed of the underlying language and its semantics; in fact, one requires little more than a language with sentences that are satisfied at models, or possible worlds. The classical AGM postulates are expressed in this framework and a representation result is established between the postulate set and certain preorders on possible worlds. To obtain the representation result, we add a new postulate to the AGM postulates, and we add a constraint to preorders on worlds. Crucially, both of these additions are redundant in the original AGM framework, and so we extend, rather than modify, the AGM approach. As well, iterated revision is addressed and the Darwiche/Pearl postulates are shown to be compatible with our approach. Various examples are given to illustrate the approach, including Horn clause revision, revision in extended logic programs, and belief revision in a very basic logic called literal revision.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kaminski:2018:WPR, author = "Benjamin Lucien Kaminski and Joost-Pieter Katoen and Christoph Matheja and Federico Olmedo", title = "Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms", journal = j-J-ACM, volume = "65", number = "5", pages = "30:1--30:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3208102", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3208102", abstract = "This article presents a wp--style calculus for obtaining bounds on the expected runtime of randomized algorithms. Its application includes determining the (possibly infinite) expected termination time of a randomized algorithm and proving positive almost--sure termination-does a program terminate with probability one in finite expected time? We provide several proof rules for bounding the runtime of loops, and prove the soundness of the approach with respect to a simple operational model. We show that our approach is a conservative extension of Nielson's approach for reasoning about the runtime of deterministic programs. We analyze the expected runtime of some example programs including the coupon collector's problem, a one--dimensional random walk and a randomized binary search.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Yu:2018:CUD, author = "Haifeng Yu and Yuda Zhao and Irvan Jahja", title = "The Cost of Unknown Diameter in Dynamic Networks", journal = j-J-ACM, volume = "65", number = "5", pages = "31:1--31:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3209665", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3209665", abstract = "For dynamic networks with unknown diameter, we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together with trivial upper bounds under dynamic networks with known diameter for these problems, our lower bounds show that the complexities of all these problems are sensitive to whether the diameter is known to the protocol beforehand: Not knowing the diameter increases the time complexities by a large poly(N) factor as compared to when the diameter is known, resulting in an exponential gap. Our lower bounds are obtained via communication complexity arguments and by reducing from the two-party D isjointnessCP problem. We further prove that sometimes this large poly(N) cost can be completely avoided if the protocol is given a good estimate on N. In other words, having such an estimate makes some problems no longer sensitive to unknown diameter.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bringmann:2018:ABP, author = "Karl Bringmann and Christian Ikenmeyer and Jeroen Zuiddam", title = "On Algebraic Branching Programs of Small Width", journal = j-J-ACM, volume = "65", number = "5", pages = "32:1--32:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3209663", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3209663", abstract = "In 1979, Valiant showed that the complexity class VP$_e$ of families with polynomially bounded formula size is contained in the class VP$_s$ of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes, we study the topological closure VP$_e$, i.e., the class of polynomials that can be approximated arbitrarily closely by polynomials in VP$_e$. We describe VP$_e$ using the well-known continuant polynomial (in characteristic different from 2). Further understanding this polynomial seems to be a promising route to new formula size lower bounds. Our methods are rooted in the study of ABPs of small constant width. In 1992, Ben-Or and Cleve showed that formula size is polynomially equivalent to width-3 ABP size. We extend their result (in characteristic different from 2) by showing that approximate formula size is polynomially equivalent to approximate width-2 ABP size. This is surprising because in 2011 Allender and Wang gave explicit polynomials that cannot be computed by width-2 ABPs at all! The details of our construction lead to the aforementioned characterization of VP$_e$. As a natural continuation of this work, we prove that the class VPN can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of polynomially many affine linear forms. This gives the first separations of algebraic complexity classes from their nondeterministic analogs.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Datta:2018:RD, author = "Samir Datta and Raghav Kulkarni and Anish Mukherjee and Thomas Schwentick and Thomas Zeume", title = "Reachability Is in {DynFO}", journal = j-J-ACM, volume = "65", number = "5", pages = "33:1--33:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3212685", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3212685", abstract = "Patnaik and Immerman introduced the dynamic complexity class DynFO of database queries that can be maintained by first-order dynamic programs with the help of auxiliary relations under insertions and deletions of edges. This article confirms their conjecture that the reachability query is in DynFO. As a byproduct, it is shown that the rank of a matrix with small values can be maintained in DynFO. It is further shown that the (size of the) maximum matching of a graph can be maintained in non-uniform DynFO, an extension of DynFO, with non-uniform initialisation of the auxiliary relations.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lin:2018:PCB, author = "Bingkai Lin", title = "The Parameterized Complexity of the $k$-Biclique Problem", journal = j-J-ACM, volume = "65", number = "5", pages = "34:1--34:??", month = sep, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3212622", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3212622", abstract = "Given a graph G and an integer k, the k -B iclique problem asks whether G contains a complete bipartite subgraph with k vertices on each side. Whether there is an f (k) c | G |$^{O (1)}$ -time algorithm, solving k Biclique for some computable function f has been a longstanding open problem. We show that k -B iclique is W[1] -hard, which implies that such an f (k) c | G |$^{O (1)}$ -time algorithm does not exist under the hypothesis W[1] /= FPT from parameterized complexity theory. To prove this result, we give a reduction which, for every n -vertex graph G and small integer k, constructs a bipartite graph H = (L \cup R, E) in time polynomial in n such that if G contains a clique with k vertices, then there are k (k - 1)/2 vertices in L with n$^{ \theta (1 / k)}$ common neighbors; otherwise, any k (k - 1)/2 vertices in L have at most (k +1)! common neighbors. An additional feature of this reduction is that it creates a gap on the right side of the biclique. Such a gap might have further applications in proving hardness of approximation results. Assuming a randomized version of Exponential Time Hypothesis, we establish an $ f(k) c |G|^{o (\sqrt k)}$-time lower bound for $k$-Biclique for any computable function $f$. Combining our result with the work of Bulatov and Marx [2014], we obtain a dichotomy classification of the parameterized complexity of cardinality constraint satisfaction problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Babaioff:2018:MSP, author = "Moshe Babaioff and Nicole Immorlica and David Kempe and Robert Kleinberg", title = "Matroid Secretary Problems", journal = j-J-ACM, volume = "65", number = "6", pages = "35:1--35:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3212512", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3212512", abstract = "We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes its value and must make an irrevocable decision whether or not to accept it. The accepted elements must form an independent set, and the objective is to maximize the combined value of these elements. We present an O (log k)-competitive algorithm for general matroids (where k is the rank of the matroid), and constant-competitive algorithms for several special cases including graphic matroids, truncated partition matroids, and bounded degree transversal matroids. We leave as an open question the existence of constant-competitive algorithms for general matroids. Our results have applications in welfare-maximizing online mechanism design for domains in which the sets of simultaneously satisfiable agents form a matroid.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Henzinger:2018:DSS, author = "Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai", title = "Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time", journal = j-J-ACM, volume = "65", number = "6", pages = "36:1--36:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3218657", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3218657", abstract = "In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n -node m -edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O (mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ \epsilon)-approximation factor, the running time was recently improved to n$^{2 + o (1)}$ by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ \epsilon)-approximation algorithm with m$^{1 + o (1)}$ expected total update time, thus obtaining near-linear time. Moreover, we obtain m$^{1 + o (1)}$ log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o (mn) time is the mn$^{0.9 + o (1)}$ -time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary. In contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, \epsilon )- hop set introduced by Cohen [12] in the PRAM literature. An (h, \epsilon)-hop set of a graph G =( V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ \epsilon)-approximated by their h -hop distance (given by a path containing at most h edges) on G$^'$ =(V, E \cup F). Our algorithm can maintain an (n$^{o (1)}$, \epsilon)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Madry [27]. These two new tools might be of independent interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grochow:2018:CCP, author = "Joshua A. Grochow and Toniann Pitassi", title = "Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System", journal = j-J-ACM, volume = "65", number = "6", pages = "37:1--37:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3230742", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We introduce a new and natural algebraic proof system, whose complexity measure is essentially the algebraic circuit size of Nullstellensatz certificates. This enables us to exhibit close connections between effective Nullstellensatz{\"e}, proof complexity, and (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent does not have polynomial-size algebraic circuits (VNP /= VP). We also show that super-polynomial lower bounds on the number of lines in Polynomial Calculus proofs imply the Permanent versus Determinant Conjecture. Note that there was no proof system prior to ours for which lower bounds on an arbitrary tautology implied any complexity class lower bound. Our proof system helps clarify the relationships between previous algebraic proof systems. In doing so, we highlight the importance of polynomial identity testing (PIT) in proof complexity. In particular, we use PIT to illuminate AC$^0$ [ p ]-Frege lower bounds, which have been open for nearly 30 years, with no satisfactory explanation as to their apparent difficulty. Finally, we explain the obstacles that must be overcome in any attempt to extend techniques from algebraic circuit complexity to prove lower bounds in proof complexity. Using the algebraic structure of our proof system, we propose a novel route to such lower bounds. Although such lower bounds remain elusive, this proposal should be contrasted with the difficulty of extending AC$^0$ [ p ] circuit lower bounds to AC$^0$ [ p ]-Frege lower bounds.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Aspnes:2018:ELU, author = "James Aspnes and Hagit Attiya and Keren Censor-Hillel and Faith Ellen", title = "Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity", journal = j-J-ACM, volume = "65", number = "6", pages = "38:1--38:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3231592", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3231592", abstract = "This is an erratum for the article ``Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity'' published in J. ACM 62(1): 3:1-3:22 (2015). The implementation of a MaxArray$_{k \times h}$ object in Algorithm 2 does not guarantee linearizability. We give here a simple correction to the algorithm and its correctness proof.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bitansky:2018:IOF, author = "Nir Bitansky and Vinod Vaikuntanathan", title = "Indistinguishability Obfuscation from Functional Encryption", journal = j-J-ACM, volume = "65", number = "6", pages = "39:1--39:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3234511", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3234511", abstract = "Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. Prior candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct encryption circuits and subexponential security. This shows the equivalence of indistinguishability obfuscation and public-key functional encryption, a primitive that has previously seemed to be much weaker, lacking the power and the staggering range of applications of indistinguishability obfuscation. Our main construction can be based on functional encryption schemes that support a single functional key, and where the encryption circuit grows sub-linearly in the circuit-size of the function. We further show that sublinear succinctness in circuit-size for single-key schemes can be traded with sublinear succinctness in the number of keys (also known as the collusion-size) for multi-key schemes. We also show that, under the Learning with Errors assumption, our techniques imply that any indistinguishability obfuscator can be converted into one where the size of obfuscated circuits is twice that of the original circuit plus an additive overhead that is polynomial in its depth, input length, and the security parameter.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2018:SQC, author = "Xi Chen and Rocco A. Servedio and Li-Yang Tan and Erik Waingarten and Jinyu Xie", title = "Settling the Query Complexity of Non-adaptive Junta Testing", journal = j-J-ACM, volume = "65", number = "6", pages = "40:1--40:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3213772", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that any non-adaptive algorithm that tests whether an unknown Boolean function $ f : \{ 0, 1 \}^n \to \{ 0, 1 \} $ is a $k$-junta or $ \epsilon $-far from every $k$-junta must make $ \Omega^~(k^{3 / 2} / \epsilon)$ many queries for a wide range of parameters $k$ and $ \epsilon $ . Our result dramatically improves previous lower bounds and is essentially optimal since there is a known non-adaptive junta tester which makes $ \Omega^~(k^{3 / 2}) / \epsilon $ queries. Combined with the known existence of an adaptive tester which makes $ O(k \log k + k / \epsilon)$ queries, our result shows that adaptivity enables polynomial savings in query complexity for junta testing.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Roughgarden:2018:SCL, author = "Tim Roughgarden and Sergei Vassilvitskii and Joshua R. Wang", title = "Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)", journal = j-J-ACM, volume = "65", number = "6", pages = "41:1--41:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3232536", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "The goal of this article is to identify fundamental limitations on how efficiently algorithms implemented on platforms such as MapReduce and Hadoop can compute the central problems in motivating application domains, such as graph connectivity problems. We introduce an abstract model of massively parallel computation, where essentially the only restrictions are that the ``fan-in'' of each machine is limited to s bits, where s is smaller than the input size n, and that computation proceeds in synchronized rounds, with no communication between different machines within a round. Lower bounds on the round complexity of a problem in this model apply to every computing platform that shares the most basic design principles of MapReduce-type systems. We prove that computations in our model that use few rounds can be represented as low-degree polynomials over the reals. This connection allows us to translate a lower bound on the (approximate) polynomial degree of a Boolean function to a lower bound on the round complexity of every (randomized) massively parallel computation of that function. These lower bounds apply even in the ``unbounded width'' version of our model, where the number of machines can be arbitrarily large. As one example of our general results, computing any nontrivial monotone graph property-such as connectivity-requires a super-constant number of rounds when every machine receives only a subpolynomial (in n ) number of input bits s. Finally, we prove that, in two senses, our lower bounds are the best one could hope for. For the unbounded-width model, we prove a matching upper bound. Restricting to a polynomial number of machines, we show that asymptotically better lower bounds would separate P from NC$^1$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Makarychev:2018:SOP, author = "Konstantin Makarychev and Maxim Sviridenko", title = "Solving Optimization Problems with Diseconomies of Scale via Decoupling", journal = j-J-ACM, volume = "65", number = "6", pages = "42:1--42:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3266140", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3266140", abstract = "We present a new framework for solving optimization problems with a diseconomy of scale. In such problems, our goal is to minimize the cost of resources used to perform a certain task. The cost of resources grows superlinearly, as $ x^q $, $ q \geq 1 $, with the amount $x$ of resources used. We define a novel linear programming relaxation for such problems and then show that the integrality gap of the relaxation is $ A_q$, where $ A_q$ is the $q$-th moment of the Poisson random variable with parameter $1$. Using our framework, we obtain approximation algorithms for the Minimum Energy Efficient Routing, Minimum Degree Balanced Spanning Tree, Load Balancing on Unrelated Parallel Machines, and Unrelated Parallel Machine Scheduling with Nonlinear Functions of Completion Times problems. Our analysis relies on the decoupling inequality for nonnegative random variables. The inequality states that $ || \Sigma_{i = 1}^n X_i||_q \leq C_q || \Sigma_{i = 1}^n Y_i||_q$, where $ X_i$ are independent nonnegative random variables, $ Y_i$ are possibly dependent nonnegative random variables, and each $ Y_i$ has the same distribution as $ X_i$. The inequality was proved by de la Pe{\~n}a in 1990. De la Pe{\~n}a, Ibragimov, and Sharakhmetov showed that $ C_q \leq 2$ for $ q \in (1, 2)$ and $ C_q \leq A_q^{1 / q}$ for $ q \geq 2$. We show that the optimal constant is $ C_q = A_q^{1 / q}$ for any $ q \geq 1$. We then prove a more general inequality: For every convex function $ \varphi $, $ E[\varphi (\Sigma_{i = 1}^n X_i)] \leq E[\varphi (P \Sigma_{i = 1}^n Y_i)]$, and, for every concave function $ \psi $, $ E[\psi (\Sigma_{i = 1}^n X_i)] \geq E[\psi (P \Sigma_{i = 1}^n Y_i)]$, where $P$ is a Poisson random variable with parameter $1$ independent of the random variables $ Y_i$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Friedrichs:2018:PMT, author = "Stephan Friedrichs and Christoph Lenzen", title = "Parallel Metric Tree Embedding Based on an Algebraic View on {Moore-Bellman-Ford}", journal = j-J-ACM, volume = "65", number = "6", pages = "43:1--43:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3231591", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "A metric tree embedding of expected stretch $ \alpha \geq 1 $ maps a weighted $n$-node graph $ G = (V, E, \omega)$ to a weighted tree $ T = (V_T, E_T, \omega_T)$ with $ V \sqsubseteq V_T$ such that, for all $v$, $ w \in V$, $ \dist (v, w, G) \leq \dist (v, w, T)$, and $ E[\dist (v, w, T)] \leqw \alpha \dist (v, w, G)$. Such embeddings are highly useful for designing fast approximation algorithms as many hard problems are easy to solve on tree instances. However, to date, the best parallel $ \polylog n$-depth algorithm that achieves an asymptotically optimal expected stretch of $ \alpha \in O(\log n)$ requires $ \Omega (n^2)$ work and a metric as input. In this article, we show how to achieve the same guarantees using $ \polylog n$ depth and $ {\~ O}(m^{1 + \epsilon })$ work, where $ m = | E |$ and $ \epsilon > 0$ is an arbitrarily small constant. Moreover, one may further reduce the work to $ {\~ O}(m + n^{1 + \epsilon })$ at the expense of increasing the expected stretch to $ O(\epsilon^{-1} \log n)$. Our main tool in deriving these parallel algorithms is an algebraic characterization of a generalization of the classic Moore--Bellman--Ford algorithm. We consider this framework, which subsumes a variety of previous ``Moore--Bellman--Ford-like'' algorithms, to be of independent interest and discuss it in depth. In our tree embedding algorithm, we leverage it to provide efficient query access to an approximate metric that allows sampling the tree using $ \polylog n$ depth and $ {\~ O}(m)$ work. We illustrate the generality and versatility of our techniques by various examples and a number of additional results. Specifically, we (1) improve the state of the art for determining metric tree embeddings in the Congest model, (2) determine a $ (1 + \epsilon)$-approximate metric regarding the distances in a graph $G$ in polylogarithmic depth and $ {\~ O}(n (m + n^{1 + \epsilon }))$ work, and (3) improve upon the state of the art regarding the $k$ median and the buy-at-bulk network design problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2018:IAFd, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "65", number = "6", pages = "44:1--44:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3241947", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Castaneda:2018:UCO, author = "Armando Casta{\~n}eda and Sergio Rajsbaum and Michel Raynal", title = "Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability", journal = j-J-ACM, volume = "65", number = "6", pages = "45:1--45:??", month = nov, year = "2018", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3266457", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 29 14:39:21 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3266457", abstract = "Tasks and objects are two predominant ways of specifying distributed problems where processes should compute outputs based on their inputs. Roughly speaking, a task specifies, for each set of processes and each possible assignment of input values, their valid outputs. In contrast, an object is defined by a sequential specification. Also, an object can be invoked multiple times by each process, while a task is a one-shot problem. Each one requires its own implementation notion, stating when an execution satisfies the specification. For objects, linearizability is commonly used, while tasks implementation notions are less explored. The article introduces the notion of interval-sequential object, and the corresponding implementation notion of interval-linearizability, to encompass many problems that have no sequential specification as objects. It is shown that interval-sequential specifications are local, namely, one can consider interval-linearizable object implementations in isolation and compose them for free, without sacrificing interval-linearizability of the whole system. The article also introduces the notion of refined tasks and its corresponding satisfiability notion. In contrast to a task, a refined task can be invoked multiple times by each process. Also, objects that cannot be defined using tasks can be defined using refined tasks. In fact, a main result of the article is that interval-sequential objects and refined tasks have the same expressive power and both are complete in the sense that they are able to specify any prefix-closed set of well-formed executions. Interval-linearizability and refined tasks go beyond unifying objects and tasks; they shed new light on both of them. On the one hand, interval-linearizability brings to task the following benefits: an explicit operational semantics, a more precise implementation notion, a notion of state, and a locality property. On the other hand, refined tasks open new possibilities of applying topological techniques to objects.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bishop:2019:ELR, author = "Steve Bishop and Matthew Fairbairn and Hannes Mehnert and Michael Norrish and Tom Ridge and Peter Sewell and Michael Smith and Keith Wansbrough", title = "Engineering with Logic: Rigorous Test-Oracle Specification and Validation for {TCP\slash IP} and the {Sockets API}", journal = j-J-ACM, volume = "66", number = "1", pages = "1:1--1:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3243650", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Conventional computer engineering relies on test-and-debug development processes, with the behavior of common interfaces described (at best) with prose specification documents. But prose specifications cannot be used in test-and-debug development in any automated way, and prose is a poor medium for expressing complex (and loose) specifications. The TCP/IP protocols and Sockets API are a good example of this: they play a vital role in modern communication and computation, and interoperability between implementations is essential. But what exactly they are is surprisingly obscure: their original development focused on ``rough consensus and running code,'' augmented by prose RFC specifications that do not precisely define what it means for an implementation to be correct. Ultimately, the actual standard is the de facto one of the common implementations, including, for example, the 15\,000 to 20\,000 lines of the BSD implementation-optimized and multithreaded C code, time dependent, with asynchronous event handlers, intertwined with the operating system, and security critical. This article reports on work done in the Netsem project to develop lightweight mathematically rigorous techniques that can be applied to such systems: to specify their behavior precisely (but loosely enough to permit the required implementation variation) and to test whether these specifications and the implementations correspond with specifications that are executable as test oracles. We developed post hoc specifications of TCP, UDP, and the Sockets API, both of the service that they provide to applications (in terms of TCP bidirectional stream connections) and of the internal operation of the protocol (in terms of TCP segments and UDP datagrams), together with a testable abstraction function relating the two. These specifications are rigorous, detailed, readable, with broad coverage, and rather accurate. Working within a general-purpose proof assistant (HOL4), we developed language idioms (within higher-order logic) in which to write the specifications: operational semantics with nondeterminism, time, system calls, monadic relational programming, and so forth. We followed an experimental semantics approach, validating the specifications against several thousand traces captured from three implementations (FreeBSD, Linux, and WinXP). Many differences between these were identified, as were a number of bugs. Validation was done using a special-purpose symbolic model checker programmed above HOL4. Having demonstrated that our logic-based engineering techniques suffice for handling real-world protocols, we argue that similar techniques could be applied to future critical software infrastructure at design time, leading to cleaner designs and (via specification-based testing) more robust and predictable implementations. In cases where specification looseness can be controlled, this should be possible with lightweight techniques, without the need for a general-purpose proof assistant, at relatively little cost.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bushkov:2019:PTT, author = "Victor Bushkov and Dmytro Dziuma and Panagiota Fatourou and Rachid Guerraoui", title = "The {PCL} Theorem: Transactions cannot be Parallel, Consistent, and Live", journal = j-J-ACM, volume = "66", number = "1", pages = "2:1--2:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3266141", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) very little consistency, i.e., a consistency condition, called weak adaptive consistency, introduced here and that is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and (3) very little liveness, i.e., which transactions eventually commit if they run solo.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raz:2019:FLR, author = "Ran Raz", title = "Fast Learning Requires Good Memory: a Time-Space Lower Bound for Parity Learning", journal = j-J-ACM, volume = "66", number = "1", pages = "3:1--3:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3186563", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt et al. (2016) and shows that for some learning problems, a large storage space is crucial. More formally, in the problem of parity learning, an unknown string x \in {0,1}$^n$ was chosen uniformly at random. A learner tries to learn x from a stream of samples (a$_1$, b$_1$), (a$_2$, b$_2$) \ldots{}, where each a$_t$ is uniformly distributed over {0,1}$^n$ and b$_t$ is the inner product of a$_t$ and x, modulo 2. We show that any algorithm for parity learning that uses less than n$^2$ /25 bits of memory requires an exponential number of samples. Previously, there was no non-trivial lower bound on the number of samples needed for any learning problem, even if the allowed memory size is O (n) (where n is the space needed to store one sample). We also give an application of our result in the field of bounded-storage cryptography. We show an encryption scheme that requires a private key of length n, as well as time complexity of n per encryption/decryption of each bit, and is provably and unconditionally secure as long as the attacker uses less than n$^2$ /25 memory bits and the scheme is used at most an exponential number of times. Previous works on bounded-storage cryptography assumed that the memory size used by the attacker is at most linear in the time needed for encryption/decryption.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kawarabayashi:2019:DEC, author = "Ken-Ichi Kawarabayashi and Mikkel Thorup", title = "Deterministic Edge Connectivity in Near-Linear Time", journal = j-J-ACM, volume = "66", number = "1", pages = "4:1--4:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3274663", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present a deterministic algorithm that computes the edge-connectivity of a graph in near-linear time. This is for a simple undirected unweighted graph G with n vertices and m edges. This is the first o (mn) time deterministic algorithm for the problem. Our algorithm is easily extended to find a concrete minimum edge-cut. In fact, we can construct the classic cactus representation of all minimum cuts in near-linear time. The previous fastest deterministic algorithm by Gabow from STOC '91 took {\~O}(m + \lambda $^2$ n), where \lambda is the edge connectivity, but \lambda can be as big as n -1. Karger presented a randomized near-linear time Monte Carlo algorithm for the minimum cut problem at STOC'96, but the returned cut is only minimum with high probability. Our main technical contribution is a near-linear time algorithm that contracts vertex sets of a simple input graph G with minimum degree \Delta, producing a multigraph $ \bar {G}$ with {\~O}(m / \Delta) edges, which preserves all minimum cuts of G with at least two vertices on each side. In our deterministic near-linear time algorithm, we will decompose the problem via low-conductance cuts found using PageRank a la Brin and Page (1998), as analyzed by Andersson, Chung, and Lang at FOCS'06. Normally, such algorithms for low-conductance cuts are randomized Monte Carlo algorithms, because they rely on guessing a good start vertex. However, in our case, we have so much structure that no guessing is needed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Burgisser:2019:CHB, author = "Peter B{\"u}rgisser and Felipe Cucker and Pierre Lairez", title = "Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time", journal = j-J-ACM, volume = "66", number = "1", pages = "5:1--5:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3275242", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets that works in weak exponential time. That is, of a set of exponentially small measure in the space of data, the cost of the algorithm is exponential in the size of the data. All algorithms previously proposed for this problem have a complexity that is doubly exponential (and this is so for almost all data).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bender:2019:SEB, author = "Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Maxwell Young", title = "Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness", journal = j-J-ACM, volume = "66", number = "1", pages = "6:1--6:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3276769", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (1) it should provide constant throughput, wasting as little time as possible; (2) it should require few failed access attempts, minimizing the amount of wasted effort; and (3) it should be robust, continuing to work efficiently even if some of the access attempts fail for spurious reasons. Unfortunately, exponential backoff has some well-known limitations in two of these areas: it can suffer subconstant throughput under bursty traffic, and it is not robust to adversarial disruption. The goal of this article is to ``fix'' exponential backoff by making it scalable, particularly focusing on the case where processes arrive in an online, worst-case fashion. We present a relatively simple backoff protocol, R e-Backoff, that has, at its heart, a version of exponential backoff. It guarantees expected constant throughput with dynamic process arrivals and requires only an expected polylogarithmic number of access attempts per process. R e-Backoff is also robust to periods where the shared resource is unavailable for a period of time. If it is unavailable for D time slots, Re-Backoff provides the following guarantees. For n packets, the expected number of access attempts for successfully sending a packet is O (log$^2$ (n + D)). For the case of an infinite number of packets, we provide a similar result in terms of the maximum number of processes that are ever in the system concurrently.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Devanur:2019:NOO, author = "Nikhil R. Devanur and Kamal Jain and Balasubramanian Sivan and Christopher A. Wilkens", title = "Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems", journal = j-J-ACM, volume = "66", number = "1", pages = "7:1--7:??", month = jan, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3284177", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", abstract = "We present prior robust algorithms for a large class of resource allocation problems where requests arrive one-by-one (online), drawn independently from an unknown distribution at every step. We design a single algorithm that, for every possible underlying distribution, obtains a 1- \epsilon fraction of the profit obtained by an algorithm that knows the entire request sequence ahead of time. The factor \epsilon approaches 0 when no single request consumes/contributes a significant fraction of the global consumption/contribution by all requests together. We show that the tradeoff we obtain here that determines how fast \epsilon approaches 0, is near optimal: We give a nearly matching lower bound showing that the tradeoff cannot be improved much beyond what we obtain. Going beyond the model of a static underlying distribution, we introduce the adversarial stochastic input model, where an adversary, possibly in an adaptive manner, controls the distributions from which the requests are drawn at each step. Placing no restriction on the adversary, we design an algorithm that obtains a 1- \epsilon fraction of the optimal profit obtainable w.r.t. the worst distribution in the adversarial sequence. Further, if the algorithm is given one number per distribution, namely the optimal profit possible for each of the adversary's distribution, then we design an algorithm that achieves a 1- \epsilon fraction of the weighted average of the optimal profit of each distribution the adversary picks. In the offline setting we give a fast algorithm to solve very large linear programs (LPs) with both packing and covering constraints. We give algorithms to approximately solve (within a factor of 1+ \epsilon) the mixed packing-covering problem with O (\gamma m log (n / \delta)/ \epsilon $^2$) oracle calls where the constraint matrix of this LP has dimension n $ \times $ m, the success probability of the algorithm is 1- \delta, and \gamma quantifies how significant a single request is when compared to the sum total of all requests. We discuss implications of our results to several special cases including online combinatorial auctions, network routing, and the adwords problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fomin:2019:EAM, author = "Fedor V. Fomin and Serge Gaspers and Daniel Lokshtanov and Saket Saurabh", title = "Exact Algorithms via Monotone Local Search", journal = j-J-ACM, volume = "66", number = "2", pages = "8:1--8:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3284176", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3284176", abstract = "We give a new general approach for designing exact exponential-time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the family contains at least one set. A typical example of a subset problem is W EIGHTED d -SAT. Here, the input is a CNF-formula with clauses of size at most d, and an integer W. The universe is the set of variables and the variables have integer weights. The family contains all the subsets S of variables such that the total weight of the variables in S does not exceed W and setting the variables in S to 1 and the remaining variables to 0 satisfies the formula. Our approach is based on ``monotone local search,'' where the goal is to extend a partial solution to a solution by adding as few elements as possible. More formally, in the extension problem, we are also given as input a subset X of the universe and an integer k. The task is to determine whether one can add at most k elements to X to obtain a set in the (implicitly defined) family. Our main result is that a c$^k$ n$^{O(1)}$ time algorithm for the extension problem immediately yields a randomized algorithm for finding a solution of any size with running time O ((2-1/ c)$^n$). In many cases, the extension problem can be reduced to simply finding a solution of size at most k. Furthermore, efficient algorithms for finding small solutions have been extensively studied in the field of parameterized algorithms. Directly applying these algorithms, our theorem yields in one stroke significant improvements over the best known exponential-time algorithms for several well-studied problems, including d -H ITTING SET, FEEDBACK VERTEX SET, NODE UNIQUE LABEL COVER, and WEIGHTED d -SAT. Our results demonstrate an interesting and very concrete connection between parameterized algorithms and exact exponential-time algorithms. We also show how to derandomize our algorithms at the cost of a subexponential multiplicative factor in the running time. Our derandomization is based on an efficient construction of a new pseudo-random object that might be of independent interest. Finally, we extend our methods to establish new combinatorial upper bounds and develop enumeration algorithms.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cheraghchi:2019:CUB, author = "Mahdi Cheraghchi", title = "Capacity Upper Bounds for Deletion-type Channels", journal = j-J-ACM, volume = "66", number = "2", pages = "9:1--9:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3281275", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3281275", abstract = "We develop a systematic approach, based on convex programming and real analysis for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the classical deletion channel, we give special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information Theory, 2006). Our framework can be applied to obtain capacity upper bounds for any repetition distribution (the deletion and Poisson-repeat channels corresponding to the special cases of Bernoulli and Poisson distributions). Our techniques essentially reduce the task of proving capacity upper bounds to maximizing a univariate, real-valued, and often concave function over a bounded interval. The corresponding univariate function is carefully designed according to the underlying distribution of repetitions, and the choices vary depending on the desired strength of the upper bounds as well as the desired simplicity of the function (e.g., being only efficiently computable versus having an explicit closed-form expression in terms of elementary, or common special, functions). Among our results, we show the following: (1) The capacity of the binary deletion channel with deletion probability d is at most (1 --- d) \varphi for d \geq 1/2 and, assuming that the capacity function is convex, is at most 1 --- d log(4/ \varphi) for d < 1/2, where \varphi = (1 + \sqrt 5)/2 is the golden ratio. This is the first nontrivial capacity upper bound for any value of d outside the limiting case d - > 0 that is fully explicit and proved without computer assistance. (2) We derive the first set of capacity upper bounds for the Poisson-repeat channel. Our results uncover further striking connections between this channel and the deletion channel and suggest, somewhat counter-intuitively, that the Poisson-repeat channel is actually analytically simpler than the deletion channel and may be of key importance to a complete understanding of the deletion channel. (3) We derive several novel upper bounds on the capacity of the deletion channel. All upper bounds are maximums of efficiently computable, and concave, univariate real functions over a bounded domain. In turn, we upper bound these functions in terms of explicit elementary and standard special functions, whose maximums can be found even more efficiently (and sometimes analytically, for example, for d = 1/2).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Moitra:2019:ACL, author = "Ankur Moitra", title = "Approximate Counting, the {Lov{\'a}sz} Local Lemma, and Inference in Graphical Models", journal = j-J-ACM, volume = "66", number = "2", pages = "10:1--10:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3268930", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3268930", abstract = "In this article, we introduce a new approach to approximate counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula \Phi when the width is logarithmic in the maximum degree. This closes an exponential gap between the known upper and lower bounds. Moreover, our algorithm extends straightforwardly to approximate sampling, which shows that under Lov{\'a}sz Local Lemma-like conditions it is not only possible to find a satisfying assignment, it is also possible to generate one approximately uniformly at random from the set of all satisfying assignments. Our approach is a significant departure from earlier techniques in approximate counting, and is based on a framework to bootstrap an oracle for computing marginal probabilities on individual variables. Finally, we give an application of our results to show that it is algorithmically possible to sample from the posterior distribution in an interesting class of graphical models.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Impagliazzo:2019:PS, author = "Russell Impagliazzo and Raghu Meka and David Zuckerman", title = "Pseudorandomness from Shrinkage", journal = j-J-ACM, volume = "66", number = "2", pages = "11:1--11:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3230630", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3230630", abstract = "One powerful theme in complexity theory and pseudorandomness in the past few decades has been the use of lower bounds to give pseudorandom generators (PRGs). However, the general results using this hardness vs. randomness paradigm suffer from a quantitative loss in parameters, and hence do not give nontrivial implications for models where we don't know super-polynomial lower bounds but do know lower bounds of a fixed polynomial. We show that when such lower bounds are proved using random restrictions, we can construct PRGs which are essentially best possible without in turn improving the lower bounds. More specifically, say that a circuit family has shrinkage exponent \Gamma if a random restriction leaving a p fraction of variables unset shrinks the size of any circuit in the family by a factor of p$^{ \Gamma + o (1)}$. Our PRG uses a seed of length s$^{1 / (\Gamma + 1) + o (1)}$ to fool circuits in the family of size s. By using this generic construction, we get PRGs with polynomially small error for the following classes of circuits of size s and with the following seed lengths: (1) For de Morgan formulas, seed length s$^{1 / 3 + o (1)}$; (2) For formulas over an arbitrary basis, seed length s$^{1 / 2 + o (1)}$; (3) For read-once de Morgan formulas, seed length s$^{.234 \ldots }$; (4) For branching programs of size s, seed length s$^{1 / 2 + o (1)}$. The previous best PRGs known for these classes used seeds of length bigger than n /2 to output n bits, and worked only for size s = O (n) [8].", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Place:2019:GHF, author = "Thomas Place and Marc Zeitoun", title = "Going Higher in First-Order Quantifier Alternation Hierarchies on Words", journal = j-J-ACM, volume = "66", number = "2", pages = "12:1--12:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3303991", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3303991", abstract = "We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language in the levels B \Sigma $_2$ (finite Boolean combinations of formulas having only one alternation) and \Sigma $_3$ (formulas having only two alternations and beginning with an existential block). Our proofs work by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for higher levels.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rahli:2019:BIC, author = "Vincent Rahli and Mark Bickford and Liron Cohen and Robert L. Constable", title = "Bar Induction is Compatible with Constructive Type Theory", journal = j-J-ACM, volume = "66", number = "2", pages = "13:1--13:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3305261", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3305261", abstract = "Powerful yet effective induction principles play an important role in computing, being a paramount component of programming languages, automated reasoning, and program verification systems. The Bar Induction (BI) principle is a fundamental concept of intuitionism, which is equivalent to the standard principle of transfinite induction. In this work, we investigate the compatibility of several variants of BI with Constructive Type Theory (CTT), a dependent type theory in the spirit of Martin-L{\"o}f's extensional theory. We first show that CTT is compatible with a BI principle for sequences of numbers. Then, we establish the compatibility of CTT with a more general BI principle for sequences of name-free closed terms. The formalization of the latter principle within the theory involved enriching CTT's term syntax with a limit constructor and showing that consistency is preserved. Furthermore, we provide novel insights regarding BI, such as the non-truncated version of BI on monotone bars being intuitionistically false. These enhancements are carried out formally using the Nuprl proof assistant that implements CTT and the formalization of CTT within the Coq proof assistant presented in previous works.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Traub:2019:APT, author = "Vera Traub and Jens Vygen", title = "Approaching $ 3 / 2 $ for the $s$--$t$-path {TSP}", journal = j-J-ACM, volume = "66", number = "2", pages = "14:1--14:??", month = apr, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3309715", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3309715", abstract = "We show that there is a polynomial-time algorithm with approximation guarantee 3/2+ \epsilon for the s --- t -path TSP, for any fixed \epsilon > 0. It is well-known that Wolsey's analysis of Christofide algorithm also works for the s --- t -path TSP with its natural LP relaxation, except for the narrow cuts (in which the LP solution has a value less than two). A fixed optimum tour has either a single edge in a narrow cut (then call the edge and the cut lonely) or at least three (then call the cut busy). Our algorithm ``guesses'' (by dynamic programming) lonely cuts and edges. Then, we partition the instance into smaller instances and strengthen the LP, requiring a value of at least three for busy cuts. By setting up a k -stage recursive dynamic program, we can compute a spanning tree (V, S) and an LP solution y such that ($ 1 / 2 $ + O (2$^{- k}$)) y is in the T -join polyhedron, where T is the set of vertices whose degree in S has the wrong parity.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ouaknine:2019:DMM, author = "Jo{\"e}l Ouaknine and Amaury Pouly and Jo{\~a}o Sousa-Pinto and James Worrell", title = "On the Decidability of Membership in Matrix-exponential Semigroups", journal = j-J-ACM, volume = "66", number = "3", pages = "15:1--15:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3286487", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3286487", abstract = "We consider the decidability of the membership problem for matrix-exponential semigroups: Given k \in N and square matrices A$_1$, \ldots{}, A$_k$, C, all of the same dimension and with real algebraic entries, decide whether C is contained in the semigroup generated by the matrix exponentials exp (A$_i$ t), where i \in { 1, \ldots{}, k } and t \geq 0. This problem can be seen as a continuous analog of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations and has applications to reachability analysis of linear hybrid automata and switching systems. Our main results are that the semigroup membership problem is undecidable in general, but decidable if we assume that A$_1$, \ldots{}, A$_k$ commute. The decidability proof is by reduction to a version of integer programming that has transcendental constants. We give a decision procedure for the latter using Baker's theorem on linear forms in logarithms of algebraic numbers, among other tools. The undecidability result is shown by reduction from Hilbert's Tenth Problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kane:2019:NOL, author = "Daniel M. Kane and Shachar Lovett and Shay Moran", title = "Near-optimal Linear Decision Trees for {$k$-SUM} and Related Problems", journal = j-J-ACM, volume = "66", number = "3", pages = "16:1--16:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3285953", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3285953", abstract = "We construct near-optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant k, we construct linear decision trees that solve the k -SUM problem on n elements using O (n log$^2$ n) linear queries. Moreover, the queries we use are comparison queries, which compare the sums of two k -subsets; when viewed as linear queries, comparison queries are 2 k -sparse and have only { -1,0,1} coefficients. We give similar constructions for sorting sumsets A+B and for solving the SUBSET-SUM problem, both with optimal number of queries, up to poly-logarithmic terms. Our constructions are based on the notion of ``inference dimension,'' recently introduced by the authors in the context of active classification with comparison queries. This can be viewed as another contribution to the fruitful link between machine learning and discrete geometry, which goes back to the discovery of the VC dimension.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fraigniaud:2019:PBS, author = "Pierre Fraigniaud and Amos Korman and Yoav Rodeh", title = "Parallel {Bayesian} Search with No Coordination", journal = j-J-ACM, volume = "66", number = "3", pages = "17:1--17:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3304111", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3304111", abstract = "Coordinating the actions of agents (e.g., volunteers analyzing radio signals in SETI@home) yields efficient search algorithms. However, such an efficiency is often at the cost of implementing complex coordination mechanisms which may be expensive in terms of communication and/or computation overheads. Instead, non-coordinating algorithms, in which each agent operates independently from the others, are typically very simple, and easy to implement. They are also inherently robust to slight misbehaviors, or even crashes of agents. In this article, we investigate the ``price of non-coordinating,'' in terms of search performance, and we show that this price is actually quite small. Specifically, we consider a parallel version of a classical Bayesian search problem, where set of k \geq 1 searchers are looking for a treasure placed in one of the boxes indexed by positive integers, according to some distribution p. Each searcher can open a random box at each step, and the objective is to find the treasure in a minimum number of steps. We show that there is a very simple non-coordinating algorithm which has expected running time at most 4(1-1/ k +1)$^2$ OPT+10, where OPT is the expected running time of the best fully coordinated algorithm. Our algorithm does not even use the precise description of the distribution p, but only the relative likelihood of the boxes. We prove that, under this restriction, our algorithm has the best possible competitive ratio with respect to OPT. For the case where a complete description of the distribution p is given to the search algorithm, we describe an optimal non-coordinating algorithm for Bayesian search. This latter algorithm can be twice as fast as our former algorithm in practical scenarios such as uniform distributions. All these results provide a complete characterization of non-coordinating Bayesian search. The take-away message is that, for their simplicity and robustness, non-coordinating algorithms are viable alternatives to complex coordinating mechanisms subject to significant overheads. Most of these results apply as well to linear search, in which the indices of the boxes reflect their relative importance, and where important boxes must be visited first.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Guo:2019:UST, author = "Heng Guo and Mark Jerrum and Jingcheng Liu", title = "Uniform Sampling Through the {Lov{\'a}sz} Local Lemma", journal = j-J-ACM, volume = "66", number = "3", pages = "18:1--18:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3310131", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3310131", abstract = "We propose a new algorithmic framework, called partial rejection sampling, to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds new connections between the variable framework of the Lov{\'a}sz Local Lemma and some classical sampling algorithms such as the cycle-popping algorithm for rooted spanning trees. Among other applications, we discover new algorithms to sample satisfying assignments of k -CNF formulas with bounded variable occurrences.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ferrere:2019:RTL, author = "Thomas Ferr{\`e}re and Oded Maler and Dejan Nickovi{\'c} and Amir Pnueli", title = "From Real-time Logic to Timed Automata", journal = j-J-ACM, volume = "66", number = "3", pages = "19:1--19:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3286976", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3286976", abstract = "We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a ``simple'' formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2019:IAFa, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "66", number = "3", pages = "20:1--20:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3328536", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3328536", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goaoc:2019:SNC, author = "Xavier Goaoc and Pavel Pat{\'a}k and Zuzana Pat{\'a}kov{\'a} and Martin Tancer and Uli Wagner", title = "Shellability is {NP}-complete", journal = j-J-ACM, volume = "66", number = "3", pages = "21:1--21:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3314024", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3314024", abstract = "We prove that for every d \geq 2, deciding if a pure, d -dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d \geq 2 and k \geq 0, deciding if a pure, d -dimensional, simplicial complex is k -decomposable is NP-hard. For d \geq 3, both problems remain NP-hard when restricted to contractible pure d -dimensional complexes. Another simple corollary of our result is that it is NP-hard to decide whether a given poset is CL-shellable.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beame:2019:TVN, author = "Paul Beame and Vincent Liew", title = "Toward Verifying Nonlinear Integer Arithmetic", journal = j-J-ACM, volume = "66", number = "3", pages = "22:1--22:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3319396", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3319396", abstract = "We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits. Such short proofs were conjectured not to exist. More precisely, we give $ n^{O (1)} $ size regular resolution proofs for arbitrary degree $2$ identities on array, diagonal, and Booth multipliers and $ n^{O(\log n)}$ size proofs for these identities on Wallace tree multipliers.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ackerman:2019:CCP, author = "Nathanael L. Ackerman and Cameron E. Freer and Daniel M. Roy", title = "On the Computability of Conditional Probability", journal = j-J-ACM, volume = "66", number = "3", pages = "23:1--23:??", month = jun, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3321699", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3321699", abstract = "As inductive inference and machine-learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the computability of conditional probability, a fundamental notion in probability theory, and a cornerstone of Bayesian statistics. We show that there are computable joint distributions with noncomputable conditional distributions, ruling out the prospect of general inference algorithms, even inefficient ones. Specifically, we construct a pair of computable random variables in the unit interval such that the conditional distribution of the first variable given the second encodes the halting problem. Nevertheless, probabilistic inference is possible in many common modeling settings, and we prove several results giving broadly applicable conditions under which conditional distributions are computable. In particular, conditional distributions become computable when measurements are corrupted by independent computable noise with a sufficiently smooth bounded density.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wirth:2019:NPD, author = "Fabian R. Wirth and Sonja St{\"u}dli and Jia Yuan Yu and Martin Corless and Robert Shorten", title = "Nonhomogeneous Place-dependent {Markov} Chains, Unsynchronised {AIMD}, and Optimisation", journal = j-J-ACM, volume = "66", number = "4", pages = "24:1--24:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3312741", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3312741", abstract = "A stochastic algorithm is presented for a class of optimisation problems that arise when a group of agents compete to share a single constrained resource in an optimal manner. The approach uses intermittent single-bit feedback, which indicates a constraint violation and does not require inter-agent communication. The algorithm is based on a positive matrix model of AIMD, which is extended to the nonhomogeneous Markovian case. The key feature is the assignment of back-off probabilities to the individual agents as a function of the past average access to the resource. This leads to a nonhomogeneous Markov chain in an extended state space, and we show almost sure convergence of the average access to the social optimum.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ikenmeyer:2019:CHF, author = "Christian Ikenmeyer and Balagopal Komarath and Christoph Lenzen and Vladimir Lysikov and Andrey Mokhov and Karteek Sreenivasaiah", title = "On the Complexity of Hazard-free Circuits", journal = j-J-ACM, volume = "66", number = "4", pages = "25:1--25:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3320123", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3320123", abstract = "The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazard-free implementation is provably of exponential size. Previous lower bounds on the hazard-free complexity were only valid for depth 2 circuits. The same proof method yields that every subcubic implementation of Boolean matrix multiplication must have hazards. These results follow from a crucial structural insight: Hazard-free complexity is a natural generalization of monotone complexity to all (not necessarily monotone) Boolean functions. Thus, we can apply known monotone complexity lower bounds to find lower bounds on the hazard-free complexity. We also lift these methods from the monotone setting to prove exponential hazard-free complexity lower bounds for non-monotone functions. As our main upper-bound result, we show how to efficiently convert a Boolean circuit into a bounded-bit hazard-free circuit with only a polynomially large blow-up in the number of gates. Previously, the best known method yielded exponentially large circuits in the worst case, so our algorithm gives an exponential improvement. As a side result, we establish the NP-completeness of several hazard detection problems.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen-addad:2019:HCO, author = "Vincent Cohen-addad and Varun Kanade and Frederik Mallmann-Trenn and Claire Mathieu", title = "Hierarchical Clustering: Objective Functions and Algorithms", journal = j-J-ACM, volume = "66", number = "4", pages = "26:1--26:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3321386", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3321386", abstract = "Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific objective, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem, where a ``good'' hierarchical clustering is one that minimizes a particular cost function [23]. He showed that this cost function has certain desirable properties: To achieve optimal cost, disconnected components (namely, dissimilar elements) must be separated at higher levels of the hierarchy, and when the similarity between data elements is identical, all clusterings achieve the same cost. We take an axiomatic approach to defining ``good'' objective functions for both similarity- and dissimilarity-based hierarchical clustering. We characterize a set of admissible objective functions having the property that when the input admits a ``natural'' ground-truth hierarchical clustering, the ground-truth clustering has an optimal value. We show that this set includes the objective function introduced by Dasgupta. Equipped with a suitable objective function, we analyze the performance of practical algorithms, as well as develop better and faster algorithms for hierarchical clustering. We also initiate a beyond worst-case analysis of the complexity of the problem and design algorithms for this scenario.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Malajovich:2019:TNC, author = "Gregorio Malajovich and Mike Shub", title = "A Theory of {NP}-completeness and Ill-conditioning for Approximate Real Computations", journal = j-J-ACM, volume = "66", number = "4", pages = "27:1--27:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3321479", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3321479", abstract = "We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The theory admits deterministic and nondeterministic polynomial time recognizable problems. We prove that P is not NP in this theory if and only if P is not NP in the BSS theory over the reals. Then we develop a theory with weak and strong approximate computations. This theory is intended to model actual numerical computations that are usually performed in floating point arithmetic. It admits classes P and NP and also an NP-complete problem. We relate the P vs. NP question in this new theory to the classical P vs. NP problem.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sebo:2019:SIP, author = "Andr{\'a}s Seb{\H{o}} and Anke {Van Zuylen}", title = "The Salesman's Improved Paths through Forests", journal = j-J-ACM, volume = "66", number = "4", pages = "28:1--28:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3326123", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3326123", abstract = "We give a new, strongly polynomial-time algorithm and improved analysis for the metric s --- t path Traveling Salesman Problem (TSP). It finds a tour of cost less than 1.53 times the optimum of the subtour elimination linear program (LP), while known examples show that 1.5 is a lower bound for the integrality gap. A key new idea is the deletion of some edges of the spanning trees used in the best-of-many Christofides-Serdyukov-algorithm, which is then accompanied by novel arguments of the analysis: edge-deletion disconnects the trees, and the arising forests are then partly reconnected by ``parity correction.'' We show that the arising ``connectivity correction'' can be achieved for a minor extra cost. On the one hand, this algorithm and analysis extend previous tools such as the best-of-many Christofides-Serdyukov-algorithm. On the other hand, powerful new tools are solicited, such as a flow problem for analyzing the reconnection cost, and the construction of a set of more and more restrictive spanning trees, each of which can still be found by the greedy algorithm. We show that these trees, which are easy to compute, can replace the spanning trees of the best-of-many Christofides-Serdyukov-algorithm. These new methods lead to improving the integrality ratio and approximation guarantee below 1.53, as was shown in the preliminary, shortened version of this article that appeared in FOCS 2016. The algorithm and analysis have been significantly simplified in the current article, while details and explanations have been added.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Adamaszek:2019:ASI, author = "Anna Adamaszek and Sariel Har-Peled and Andreas Wiese", title = "Approximation Schemes for Independent Set and Sparse Subsets of Polygons", journal = j-J-ACM, volume = "66", number = "4", pages = "29:1--29:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3326122", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3326122", abstract = "We present a (1+ \epsilon)-approximation algorithm with quasi-polynomial running time for computing a maximum weight independent set of polygons from a given set of polygons in the plane. Contrasting this, the best-known polynomial time algorithm for the problem has an approximation ratio of n$^{ \epsilon }$. Surprisingly, we can extend the algorithm to the problem of computing the maximum cardinality subset of the given set of polygons whose intersection graph fulfills some sparsity condition. For example, we show that one can approximate the maximum subset of polygons such that the intersection graph of the subset is planar or does not contain a cycle of length 4 (i.e., K$_{2, 2}$). Our algorithm relies on a recursive partitioning scheme, whose backbone is the existence of balanced cuts with small complexity that intersect polygons from the optimal solution of a small total weight. For the case of large axis-parallel rectangles, we provide a polynomial time (1 + \epsilon )-approximation for the maximum weight independent set. Specifically, we consider the problem where each rectangle has one edge whose length is at least a constant fraction of the length of the corresponding edge of the bounding box of all the input elements. This is now the most general case for which a PTAS is known, and it requires a new and involved partitioning scheme, which should be of independent interest.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kleinberg:2019:BEM, author = "Robert Kleinberg and Aleksandrs Slivkins and Eli Upfal", title = "Bandits and Experts in Metric Spaces", journal = j-J-ACM, volume = "66", number = "4", pages = "30:1--30:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3299873", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3299873", abstract = "In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is well understood, bandit problems with large strategy sets are still a topic of active investigation, motivated by practical applications, such as online auctions and web advertisement. The goal of such research is to identify broad and natural classes of strategy sets and payoff functions that enable the design of efficient solutions. In this work, we study a general setting for the multi-armed bandit problem, in which the strategies form a metric space, and the payoff function satisfies a Lipschitz condition with respect to the metric. We refer to this problem as the Lipschitz MAB problem. We present a solution for the multi-armed bandit problem in this setting. That is, for every metric space, we define an isometry invariant that bounds from below the performance of Lipschitz MAB algorithms for this metric space, and we present an algorithm that comes arbitrarily close to meeting this bound. Furthermore, our technique gives even better results for benign payoff functions. We also address the full-feedback (``best expert'') version of the problem, where after every round the payoffs from all arms are revealed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Avni:2019:IDB, author = "Guy Avni and Thomas A. Henzinger and Ventsislav Chonev", title = "Infinite-duration Bidding Games", journal = j-J-ACM, volume = "66", number = "4", pages = "31:1--31:??", month = aug, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3340295", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3340295", abstract = "Two-player games on graphs are widely studied in formal methods, as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. The following bidding rule was previously defined and called Richman bidding. Both players have separate budgets, which sum up to 1. In each turn, a bidding takes place: Both players submit bids simultaneously, where a bid is legal if it does not exceed the available budget, and the higher bidder pays his bid to the other player and moves the token. The central question studied in bidding games is a necessary and sufficient initial budget for winning the game: a threshold budget in a vertex is a value t \in [0, 1] such that if Player 1's budget exceeds t, he can win the game; and if Player 2's budget exceeds 1 --- t, he can win the game. Threshold budgets were previously shown to exist in every vertex of a reachability game, which have an interesting connection with random-turn games-a sub-class of simple stochastic games in which the player who moves is chosen randomly. We show the existence of threshold budgets for a qualitative class of infinite-duration games, namely parity games, and a quantitative class, namely mean-payoff games. The key component of the proof is a quantitative solution to strongly connected mean-payoff bidding games in which we extend the connection with random-turn games to these games, and construct explicit optimal strategies for both players.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lenzen:2019:SSB, author = "Christoph Lenzen and Joel Rybicki", title = "Self-Stabilising {Byzantine} Clock Synchronisation Is Almost as Easy as Consensus", journal = j-J-ACM, volume = "66", number = "5", pages = "32:1--32:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3339471", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3339471", abstract = "We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the n nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e., the initial state of the system may be arbitrary, and there can be up to f < n /3 ongoing Byzantine faults, i.e., nodes that deviate from the protocol in an arbitrary manner. Furthermore, we assume that the local clocks of the nodes may progress at different speeds (clock drift) and communication has bounded delay. In this model, we study the pulse synchronisation problem, where the task is to guarantee that eventually all correct nodes generate well-separated local pulse events (i.e., unlabelled logical clock ticks) in a synchronised manner. Compared to prior work, we achieve exponential improvements in stabilisation time and the number of communicated bits, and give the first sublinear-time algorithm for the problem: o In the deterministic setting, the state-of-the-art solutions stabilise in time \Theta (f ) and have each node broadcast \Theta (f log f) bits per time unit. We exponentially reduce the number of bits broadcasted per time unit to \Theta (log f) while retaining the same stabilisation time. o In the randomised setting, the state-of-the-art solutions stabilise in time \Theta (f) and have each node broadcast O (1) bits per time unit. We exponentially reduce the stabilisation time to polylog f while each node broadcasts polylog f bits per time unit. These results are obtained by means of a recursive approach reducing the above task of self-stabilising pulse synchronisation in the bounded-delay model to non-self-stabilising binary consensus in the synchronous model. In general, our approach introduces at most logarithmic overheads in terms of stabilisation time and broadcasted bits over the underlying consensus routine.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{S:2019:PCA, author = "Karthik C. S. and Bundit Laekhanukit and Pasin Manurangsi", title = "On the Parameterized Complexity of Approximating Dominating Set", journal = j-J-ACM, volume = "66", number = "5", pages = "33:1--33:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3325116", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3325116", abstract = "We study the parameterized complexity of approximating the k -Dominating Set (DomSet) problem where an integer k and a graph G on n vertices are given as input, and the goal is to find a dominating set of size at most F (k) $ \cdot $ k whenever the graph G has a dominating set of size k. When such an algorithm runs in time T ( k) $ \cdot $ poly (n) (i.e., FPT-time) for some computable function T, it is said to be an F (k)- FPT-approximation algorithm for k -DomSet. Whether such an algorithm exists is listed in the seminal book of Downey and Fellows (2013) as one of the ``most infamous'' open problems in parameterized complexity. This work gives an almost complete answer to this question by showing the non-existence of such an algorithm under W[1] /= FPT and further providing tighter running time lower bounds under stronger hypotheses. Specifically, we prove the following for every computable functions T, F and every constant \epsilon > 0: o Assuming W[1] /= FPT, there is no F (k)- FPT-approximation algorithm for k -DomSet. o Assuming the Exponential Time Hypothesis (ETH), there is no F (k)-approximation algorithm for k -DomSet that runs in T (k) $ \cdot $ n$^{o (k)}$ time. o Assuming the Strong Exponential Time Hypothesis (SETH), for every integer k \geq 2, there is no F (k )-approximation algorithm for k -DomSet that runs in T (k) $ \cdot $ n$^{k - - - \epsilon }$ time. o Assuming the k -SUM Hypothesis, for every integer k \geq 3, there is no F (k)-approximation algorithm for k -DomSet that runs in T (k) $ \cdot $ n$^{ \lceil k / 2 \rceil - - - \epsilon }$ time. Previously, only constant ratio FPT-approximation algorithms were ruled out under sf W[1] /= FPT and (log$^{1 / 4}$ - \epsilon k)-FPT-approximation algorithms were ruled out under ETH [Chen and Lin, FOCS 2016]. Recently, the non-existence of an F (k )-FPT-approximation algorithm for any function F was shown under Gap-ETH [Chalermsook et al., FOCS 2017]. Note that, to the best of our knowledge, no running time lower bound of the form n$^{\delta k}$ for any absolute constant \delta > 0 was known before even for any constant factor inapproximation ratio. Our results are obtained by establishing a connection between communication complexity and hardness of approximation, generalizing the ideas from a recent breakthrough work of Abboud et al. [FOCS 2017]. Specifically, we show that to prove hardness of approximation of a certain parameterized variant of the label cover problem, it suffices to devise a specific protocol for a communication problem that depends on which hypothesis we rely on. Each of these communication problems turns out to be either a well-studied problem or a variant of one; this allows us to easily apply known techniques to solve them.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Komargodski:2019:WBV, author = "Ilan Komargodski and Moni Naor and Eylon Yogev", title = "White-Box vs. Black-Box Complexity of Search Problems: {Ramsey} and Graph Property Testing", journal = j-J-ACM, volume = "66", number = "5", pages = "34:1--34:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3341106", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3341106", abstract = "Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how difficult is it to find the clique or independent set? If the graph is given explicitly, then it is possible to do so while examining a linear number of edges. If the graph is given by a black-box, where to figure out whether a certain edge exists the box should be queried, then a large number of queries must be issued. But what if one is given a program or circuit for computing the existence of an edge? This problem was raised by Buss and Goldberg and Papadimitriou in the context of TFNP, search problems with a guaranteed solution. We examine the relationship between black-box complexity and white-box complexity for search problems with guaranteed solution such as the above Ramsey problem. We show that under the assumption that collision-resistant hash function exists (which follows from the hardness of problems such as factoring, discrete-log, and learning with errors) the white-box Ramsey problem is hard and this is true even if one is looking for a much smaller clique or independent set than the theorem guarantees. This is also true for the colorful Ramsey problem where one is looking, say, for a monochromatic triangle. In general, one cannot hope to translate all black-box hardness for TFNP into white-box hardness: we show this by adapting results concerning the random oracle methodology and the impossibility of instantiating it. Another model we consider is that of succinct black-box, where the complexity of an algorithm is measured as a function of the description size of the object in the box (and no limitation on the computation time). In this case, we show that for all TFNP problems there is an efficient algorithm with complexity proportional to the description size of the object in the box times the solution size. However, for promise problems this is not the case. Finally, we consider the complexity of graph property testing in the white-box model. We show a property that is hard to test even when one is given the program for computing the graph (under the appropriate assumptions such as hardness of Decisional Diffie--Hellman). The hard property is whether the graph is a two-source extractor.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Iwata:2019:IRD, author = "Satoru Iwata and Taihei Oki and Mizuyo Takamatsu", title = "Index Reduction for Differential-algebraic Equations with Mixed Matrices", journal = j-J-ACM, volume = "66", number = "5", pages = "35:1--35:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3341499", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3341499", abstract = "Differential-algebraic equations (DAEs) are widely used for the modeling of dynamical systems. The difficulty in numerically solving a DAE is measured by its differentiation index. For highly accurate simulation of dynamical systems, it is important to convert high-index DAEs into low-index DAEs. Most of the existing simulation software packages for dynamical systems are equipped with an index-reduction algorithm given by Mattsson and S{\"o}derlind. Unfortunately, this algorithm fails if there are numerical cancellations. These numerical cancellations are often caused by accurate constants in structural equations. Distinguishing those accurate constants from generic parameters that represent physical quantities, Murota and Iri introduced the notion of a mixed matrix as a mathematical tool for faithful model description in a structural approach to systems analysis. For DAEs described with the use of mixed matrices, efficient algorithms to compute the index have been developed by exploiting matroid theory. This article presents an index-reduction algorithm for linear DAEs whose coefficient matrices are mixed matrices, i.e., linear DAEs containing physical quantities as parameters. Our algorithm detects numerical cancellations between accurate constants and transforms a DAE into an equivalent DAE to which Mattsson-S{\"o}derlind's index-reduction algorithm is applicable. Our algorithm is based on the combinatorial relaxation approach, which is a framework to solve a linear algebraic problem by iteratively relaxing it into an efficiently solvable combinatorial optimization problem. The algorithm does not rely on symbolic manipulations but on fast combinatorial algorithms on graphs and matroids. Our algorithm is proved to work for any linear DAEs whose coefficient matrices are mixed matrices. Furthermore, we provide an improved algorithm under an assumption based on dimensional analysis of dynamical systems. Through numerical experiments, it is confirmed that our algorithms run sufficiently fast for large-scale DAEs and output DAEs such that physical meanings of coefficients are easy to interpret. Our algorithms can also be applied to nonlinear DAEs by regarding nonlinear terms as parameters.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harris:2019:MTF, author = "David G. Harris and Aravind Srinivasan", title = "The {Moser--Tardos} Framework with Partial Resampling", journal = j-J-ACM, volume = "66", number = "5", pages = "36:1--36:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3342222", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3342222", abstract = "The resampling algorithm of Moser and Tardos is a powerful approach to develop constructive versions of the Lov{\'a}sz Local Lemma. We generalize this to partial resampling: When a bad event holds, we resample an appropriately random subset of the variables that define this event rather than the entire set, as in Moser and Tardos. This is particularly useful when the bad events are determined by sums of random variables. This leads to several improved algorithmic applications in scheduling, graph transversals, packet routing, and so on. For instance, we settle a conjecture of Szab{\'o} and Tardos (2006) on graph transversals asymptotically and obtain improved approximation ratios for a packet routing problem of Leighton, Maggs, and Rao (1994).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bernstein:2019:OBM, author = "Aaron Bernstein and Jacob Holm and Eva Rotenberg", title = "Online Bipartite Matching with Amortized {$ O(\log^2 n) $} Replacements", journal = j-J-ACM, volume = "66", number = "5", pages = "37:1--37:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3344999", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3344999", abstract = "In the online bipartite matching problem with replacements, all the vertices on one side of the bipartition are given, and the vertices on the other side arrive one-by-one with all their incident edges. The goal is to maintain a maximum matching while minimizing the number of changes (replacements) to the matching. We show that the greedy algorithm that always takes the shortest augmenting path from the newly inserted vertex (denoted the SAP protocol) uses at most amortized O (log$^2$ n) replacements per insertion, where n is the total number of vertices inserted. This is the first analysis to achieve a polylogarithmic number of replacements for any replacement strategy, almost matching the \Omega (log n) lower bound. The previous best strategy known achieved amortized O (\sqrt n) replacements [Bosek, Leniowski, Sankowski, Zych, FOCS 2014]. For the SAP protocol in particular, nothing better than the trivial O (n) bound was known except in special cases. Our analysis immediately implies the same upper bound of O (log$^2$ n) reassignments for the capacitated assignment problem, where each vertex on the static side of the bipartition is initialized with the capacity to serve a number of vertices. We also analyze the problem of minimizing the maximum server load. We show that if the final graph has maximum server load L, then the SAP protocol makes amortized O (min { L log$^2$ n, \sqrt n log n }) reassignments. We also show that this is close to tight, because \Omega (min { L, \sqrt n }) reassignments can be necessary.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Romashchenko:2019:OCM, author = "Andrei Romashchenko and Marius Zimand", title = "An Operational Characterization of Mutual Information in Algorithmic Information Theory", journal = j-J-ACM, volume = "66", number = "5", pages = "38:1--38:??", month = sep, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3356867", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356867", abstract = "We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x and y is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties-one having x and the complexity profile of the pair and the other one having y and the complexity profile of the pair-can establish via a probabilistic protocol with interaction on a public channel. For l > 2, the longest shared secret that can be established from a tuple of strings (x$_1$, \ldots{}, x$_l$) by l parties-each one having one component of the tuple and the complexity profile of the tuple-is equal, up to logarithmic precision, to the complexity of the tuple minus the minimum communication necessary for distributing the tuple to all parties. We establish the communication complexity of secret key agreement protocols that produce a secret key of maximal length for protocols with public randomness. We also show that if the communication complexity drops below the established threshold, then only very short secret keys can be obtained.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jez:2019:DCU, author = "Artur Jez", title = "Deciding Context Unification", journal = j-J-ACM, volume = "66", number = "6", pages = "39:1--39:??", month = oct, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3356904", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356904", abstract = "In first-order term unification, variables represent well-formed terms over a given signature, and we are to solve equations built using function symbols from the signature and such variables; this problem is well-known to be decidable (in linear time). In second-order term unification, the variables take arguments (i.e., other terms) and a substitution uses those arguments an arbitrary number of times; for instance, an equation f (X (c), X (c)) = X (f ( c, c)) has a solution X = o, where o is a special symbol denoting the place in which the argument is substituted. Under this substitution, both sides evaluate to f (c, c). There are other solutions, for instance X = f (o,o), which evaluates both sides to f ( f (c, c), f (c, c)); in general, a solution that evaluates both sides to full binary tree of arbitrary height is easy to construct. Second-order unification is in general undecidable. Context unification is a natural problem in between first- and second-order unification-we deal with equations over terms, the variables take arguments, but we restrict the set of solutions: The argument is used exactly once. Formally, contexts are terms with exactly one occurrence of the special symbol o and in context unification, we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation. For instance, when the aforementioned equation f (X (c), X (c)) = X (f (c, c)) is treated as a context unification problem, then it has exactly one solution: X = o. Other substitutions that are solutions of it as an instance of the second-unification problem, say X = f (o, o), are not valid, as o is used more than once. Context unification also generalizes satisfiability of word equations, which is decidable (in PSPACE). The decidability status of context unification remained unknown for almost two decades. In this article, we show that context unification is in PSPACE (in EXPTIME, when tree regular constraints are also allowed). Those results are obtained by extending the recently developed recompression technique, which was previously defined for strings and used to obtain a new PSPACE algorithm for satisfiability of word equations. In this article, the technique is generalized to trees, and the corresponding algorithm is generalized from word equations to context unification. The idea of recompression is to apply simple compression rules (replacing pairs of neighboring function symbols) to the solution of the context equation; to this end, we appropriately modify the equation (without the knowledge of the actual solution) so compressing the solution can be simulated by compressing parts of the equation. It is shown that if the compression operations are appropriately chosen, then the size of the instance is polynomial during the whole algorithm, thus giving a PSPACE-upper bound.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Disser:2019:TBU, author = "Yann Disser and Jan Hackfeld and Max Klimm", title = "Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents", journal = j-J-ACM, volume = "66", number = "6", pages = "40:1--40:??", month = oct, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3356883", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Oct 23 06:51:07 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3356883", abstract = "We study the problem of deterministically exploring an undirected and initially unknown graph with n vertices either by a single agent equipped with a set of pebbles or by a set of collaborating agents. The vertices of the graph are unlabeled and cannot be distinguished by the agents, but the edges incident to a vertex have locally distinct labels. The graph is explored when all vertices have been visited by at least one agent. In this setting, it is known that for a single agent without pebbles \Theta (log n) bits of memory are necessary and sufficient to explore any graph with at most n vertices. We are interested in how the memory requirement decreases as the agent may mark vertices by dropping and retrieving distinguishable pebbles or when multiple agents jointly explore the graph. We give tight results for both questions showing that for a single agent with constant memory \Theta (log log n) pebbles are necessary and sufficient for exploration. We further prove that using collaborating agents instead of pebbles does not help as \Theta (log log n) agents with constant memory each are necessary and sufficient for exploration. For the upper bounds, we devise an algorithm for a single agent with constant memory that explores any n -vertex graph using O (log log n) pebbles, even when n is not known a priori. The algorithm terminates after polynomial time and returns to the starting vertex. We further show that the algorithm can be realized with additional constant-memory agents rather than pebbles, implying that O (log log n) agents with constant memory can explore any n -vertex graph. For the lower bound, we show that the number of agents needed for exploring any graph with at most n vertices is already \Omega (log log n) when we allow each agent to have at most O ((log n)$^1$ - \epsilon) bits of memory for any \epsilon > 0. Our argument also implies that a single agent with sublogarithmic memory needs \Theta (log log n) pebbles to explore any n -vertex graph.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Monniaux:2019:CCA, author = "David Monniaux and Valentin Touzeau", title = "On the Complexity of Cache Analysis for Different Replacement Policies", journal = j-J-ACM, volume = "66", number = "6", pages = "41:1--41:??", month = dec, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3366018", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Dec 11 06:27:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3366018", abstract = "Modern processors use cache memory, a memory access that ``hits'' the cache returns early, while a ``miss'' takes more time. Given a memory access in a program, cache analysis consists in deciding whether this access is always a hit, always a miss, or is a hit or a miss depending on execution. Such an analysis is of high importance for bounding the worst-case execution time of safety-critical real-time programs. There exist multiple possible policies for evicting old data from the cache when new data are brought in, and different policies, though apparently similar in goals and performance, may be very different from the analysis point of view. In this article, we explore these differences from a complexity-theoretical point of view. Specifically, we show that, among the common replacement policies, Least Recently Used is the only one whose analysis is NP-complete, whereas the analysis problems for the other policies are PSPACE-complete.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mendelson:2019:ULP, author = "Shahar Mendelson", title = "An Unrestricted Learning Procedure", journal = j-J-ACM, volume = "66", number = "6", pages = "42:1--42:??", month = dec, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3361699", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Dec 11 06:27:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3361699", abstract = "We study learning problems involving arbitrary classes of functions F, underlying measures $ \mu $, and targets Y. Because proper learning procedures, i.e., procedures that are only allowed to select functions in F, tend to perform poorly unless the problem satisfies some additional structural property (e.g., that F is convex), we consider unrestricted learning procedures that are free to choose functions outside the given class. We present a new unrestricted procedure whose sample complexity is almost the best that one can hope for and holds for (almost) any problem, including heavy-tailed situations. Moreover, the sample complexity coincides with what one could expect if F were convex, even when F is not. And if F is convex, then the unrestricted procedure turns out to be proper.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2019:IAFb, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "66", number = "6", pages = "43:1--43:??", month = dec, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3371337", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Dec 11 06:27:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3371337", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kiefer:2019:WLD, author = "Sandra Kiefer and Ilia Ponomarenko and Pascal Schweitzer", title = "The {Weisfeiler--Leman} Dimension of Planar Graphs Is at Most $3$", journal = j-J-ACM, volume = "66", number = "6", pages = "44:1--44:??", month = dec, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3333003", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Dec 11 06:27:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3333003", abstract = "We prove that the Weisfeiler--Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best-known upper bounds for the dimension and number of variables were 14 and 15, respectively. First, we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of every arc-colored 3-connected graph belonging to this class. Then, we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two appropriately chosen vertices of a colored 3-connected planar graph followed by the one-dimensional WL-algorithm produces the discrete vertex partition. This implies that the three-dimensional WL-algorithm determines the orbits of arc-colored 3-connected planar graphs. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Despre:2019:CGI, author = "Vincent Despr{\'e} and Francis Lazarus", title = "Computing the Geometric Intersection Number of Curves", journal = j-J-ACM, volume = "66", number = "6", pages = "45:1--45:??", month = dec, year = "2019", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3363367", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Wed Dec 11 06:27:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3363367", abstract = "The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e., of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at most $l$ on a combinatorial surface of complexity $n$, we describe simple algorithms to (1) compute the geometric intersection number of $c$ in $ O(n + l^2)$ time, (2) construct a curve homotopic to $c$ that realizes this geometric intersection number in $ O(n + l^4)$ time, and (3) decide if the geometric intersection number of $c$ is zero, i.e., if $c$ is homotopic to a simple curve, in $ O(n + l \log l)$ time. The algorithms for (2) and (3) are restricted to orientable surfaces, but the algorithm for (1) is also valid on non-orientable surfaces. To our knowledge, no exact complexity analysis had yet appeared on those problems. An optimistic analysis of the complexity of the published algorithms for problems (1) and (3) gives at best a $ O(n + g^2 l^2)$ time complexity on a genus $g$ surface without boundary. No polynomial time algorithm was known for problem (2) for surfaces without boundary. Interestingly, our solution to problem (3) provides a quasi-linear algorithm to a problem raised by Poincar{\'e} more than a century ago. Finally, we note that our algorithm for problem (1) extends to computing the geometric intersection number of two curves of length at most $l$ in $ O(n + l^2)$ time.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Karstadt:2020:MML, author = "Elaye Karstadt and Oded Schwartz", title = "Matrix Multiplication, a Little Faster", journal = j-J-ACM, volume = "67", number = "1", pages = "1:1--1:31", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3364504", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Jan 23 07:27:59 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3364504", abstract = "Strassen's algorithm (1969) was the first sub-cubic matrix multiplication algorithm. Winograd (1971) improved the leading coefficient of its complexity from 6 to 7. There have been many subsequent asymptotic improvements. Unfortunately, most of these have the disadvantage of very large, often gigantic, hidden constants. Consequently, Strassen--Winograd's $ O(n^{\log_2 7}) $ algorithm often outperforms other fast matrix multiplication algorithms for all feasible matrix dimensions. The leading coefficient of Strassen-Winograd's algorithm has been generally believed to be optimal for matrix multiplication algorithms with a $ 2 \times 2 $ base case, due to the lower bounds by Probert (1976) and Bshouty (1995).\par Surprisingly, we obtain a faster matrix multiplication algorithm, with the same base case size and asymptotic complexity as Strassen--Winograd's algorithm, but with the leading coefficient reduced from 6 to 5. To this end, we extend Bodrato's (2010) method for matrix squaring, and transform matrices to an alternative basis. We also prove a generalization of Probert's and Bshouty's lower bounds that holds under change of basis, showing that for matrix multiplication algorithms with a $ 2 \times 2 $ base case, the leading coefficient of our algorithm cannot be further reduced, and is therefore optimal. We apply our method to other fast matrix multiplication algorithms, improving their arithmetic and communication costs by significant constant factors.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gagie:2020:FFS, author = "Travis Gagie and Gonzalo Navarro and Nicola Prezza", title = "Fully Functional Suffix Trees and Optimal Text Searching in {BWT}-Runs Bounded Space", journal = j-J-ACM, volume = "67", number = "1", pages = "2:1--2:54", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3375890", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Jan 23 07:27:59 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3375890", abstract = "Indexing highly repetitive texts-such as genomic databases, software repositories and versioned text collections-has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is r, the number \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goren:2020:S, author = "Guy Goren and Yoram Moses", title = "Silence", journal = j-J-ACM, volume = "67", number = "1", pages = "3:1--3:26", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3377883", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Jan 30 08:50:16 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3377883", abstract = "The cost of communication is a substantial factor affecting the scalability of many distributed applications. Every message sent can incur a cost in storage, computation, energy, and bandwidth. Consequently, reducing the communication costs of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ciaccia:2020:FCA, author = "Paolo Ciaccia and Davide Martinenghi and Riccardo Torlone", title = "Foundations of Context-aware Preference Propagation", journal = j-J-ACM, volume = "67", number = "1", pages = "4:1--4:43", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3375713", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Jan 23 07:27:59 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3375713", abstract = "Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer science, for deciding the best choices among possible alternatives. Contexts provide another important aspect to be considered in the selection of the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chudnovsky:2020:DOH, author = "Maria Chudnovsky and Alex Scott and Paul Seymour and Sophie Spirkl", title = "Detecting an Odd Hole", journal = j-J-ACM, volume = "67", number = "1", pages = "5:1--5:12", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3375720", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Thu Jan 30 08:50:16 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3375720", abstract = "We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Platzer:2020:DEI, author = "Andr{\'e} Platzer and Yong Kiam Tan", title = "Differential Equation Invariance Axiomatization", journal = j-J-ACM, volume = "67", number = "1", pages = "6:1--6:66", month = apr, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3380825", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Sat Apr 4 14:43:11 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3380825", abstract = "This article proves the completeness of an axiomatization for differential equation invariants described by Noetherian functions. First, the differential equation axioms of differential dynamic logic are shown to be complete for reasoning about analytic \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Emek:2020:AGN, author = "Yuval Emek and Shay Kutten and Ron Lavi and Yangguang Shi", title = "Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency", journal = j-J-ACM, volume = "67", number = "1", pages = "7:1--7:33", month = feb, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3377387", ISSN = "0004-5411 (print), 1557-735X (electronic)", bibdate = "Sat Feb 8 07:39:53 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3377387", abstract = "In a generalized network design (GND) problem, a set of resources are assigned (non-exclusively) to multiple requests. Each request contributes its weight to the resources it uses and the total load on a resource is then translated to the cost it incurs \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bhargava:2020:DFS, author = "Vishwas Bhargava and Shubhangi Saraf and Ilya Volkovich", title = "Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree", journal = j-J-ACM, volume = "67", number = "2", pages = "8:1--8:28", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3365667", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3365667", abstract = "In this article, we study the problem of deterministic factorization of sparse polynomials. We show that if $ f \in F[x_1, x_2, \ldots {}, x_n] $ is a polynomial with $w$ $s$ monomials, with individual degrees of its variables bounded by $d$, then $f$ can be deterministically \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Beyersdorff:2020:FSQ, author = "Olaf Beyersdorff and Ilario Bonacina and Leroy Chew and Jan Pich", title = "{Frege} Systems for Quantified {Boolean} Logic", journal = j-J-ACM, volume = "67", number = "2", pages = "9:1--9:36", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3381881", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3381881", abstract = "We define and investigate Frege systems for quantified Boolean formulas (QBF). For these new proof systems, we develop a lower bound technique that directly lifts circuit lower bounds for a circuit class C to the QBF Frege system operating with lines \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Olver:2020:SFS, author = "Neil Olver and L{\'a}szl{\'o} A. V{\'e}gh", title = "A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization", journal = j-J-ACM, volume = "67", number = "2", pages = "10:1--10:26", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3383454", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3383454", abstract = "We present a new strongly polynomial algorithm for generalized flow maximization that is significantly simpler and faster than the previous strongly polynomial algorithm [34]. For the uncapacitated problem formulation, the complexity bound O ( mn ( m + n log \ldots{} )) \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kowalski:2020:PCA, author = "Dariusz R. Kowalski and Miguel A. Mosteiro", title = "Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations", journal = j-J-ACM, volume = "67", number = "2", pages = "11:1--11:17", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3385075", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3385075", abstract = "Starting with with work of Michail et al., the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the \ldots{}).", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2020:IAFa, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "67", number = "2", pages = "12:1--12:1", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3391411", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3391411", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Elkin:2020:SDD, author = "M. Elkin", title = "A Simple Deterministic Distributed {MST} Algorithm with Near-Optimal Time and Message Complexities", journal = j-J-ACM, volume = "67", number = "2", pages = "13:1--13:15", month = may, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3380546", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue May 19 09:02:46 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3380546", abstract = "The distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Kutten and Peleg devised an algorithm with running time $ O (D + \sqrt n \cdot \log^* n) $, where $D$ is the hop diameter of the input \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bangalore:2020:PSE, author = "Laasya Bangalore and Ashish Choudhury and Arpita Patra", title = "The Power of Shunning: Efficient Asynchronous {Byzantine} Agreement Revisited*", journal = j-J-ACM, volume = "67", number = "3", pages = "14:1--14:59", month = jun, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3388788", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3388788", abstract = "The problem of Byzantine Agreement (BA) is of interest to both the distributed computing and cryptography communities. Following well-known results from distributed computing literature, the BA problem in the asynchronous network setting encounters \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Elkin:2020:DES, author = "Michael Elkin", title = "Distributed Exact Shortest Paths in Sublinear Time", journal = j-J-ACM, volume = "67", number = "3", pages = "15:1--15:36", month = jun, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3387161", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3387161", abstract = "The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in O ( n ) time, where n is the number of vertices in the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kratsch:2020:RSI, author = "Stefan Kratsch and Magnus Wahlstr{\"o}M", title = "Representative Sets and Irrelevant Vertices: New Tools for Kernelization", journal = j-J-ACM, volume = "67", number = "3", pages = "16:1--16:50", month = jun, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3390887", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3390887", abstract = "We continue the development of matroid-based techniques for kernelization, initiated by the present authors [47]. We significantly extend the usefulness of matroid theory in kernelization by showing applications of a result on representative sets due to \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Huang:2020:FOM, author = "Zhiyi Huang and Ning Kang and Zhihao Gavin Tang and Xiaowei Wu and Yuhao Zhang and Xue Zhu", title = "Fully Online Matching", journal = j-J-ACM, volume = "67", number = "3", pages = "17:1--17:25", month = jun, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3390890", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3390890", abstract = "We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors'. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raghvendra:2020:NLT, author = "Sharath Raghvendra and Pankaj K. Agarwal", title = "A Near-linear Time $ \epsilon $-Approximation Algorithm for Geometric Bipartite Matching", journal = j-J-ACM, volume = "67", number = "3", pages = "18:1--18:19", month = jun, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3393694", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3393694", abstract = "For point sets A, B \subset R$^d$, | A | = | B | = n, and for a parameter \epsilon {$>$} 0, we present a Monte Carlo algorithm that computes, in O ( n poly(log n, 1/ \epsilon )) time, an \epsilon -approximate perfect matching of A and B under any L$_p$ -norm with high probability; the previously best-\ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chua:2020:SGF, author = "Jeroen Chua and Pedro F. Felzenszwalb", title = "Scene Grammars, Factor Graphs, and Belief Propagation", journal = j-J-ACM, volume = "67", number = "4", pages = "19:1--19:41", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3396886", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3396886", abstract = "We describe a general framework for probabilistic modeling of complex scenes and for inference from ambiguous observations. The approach is motivated by applications in image analysis and is based on the use of priors defined by stochastic grammars. We \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{deMesmay:2020:ERN, author = "Arnaud de Mesmay and Yo'av Rieck and Eric Sedgwick and Martin Tancer", title = "Embeddability in {$ \mathbb {R}^3 $} is {NP}-hard", journal = j-J-ACM, volume = "67", number = "4", pages = "20:1--20:29", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3396593", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3396593", abstract = "We prove that the problem of deciding whether a two- or three-dimensional simplicial complex embeds into R$^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an S$^3$ filling is NP-hard. The former stands \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Anari:2020:PGP, author = "Nima Anari and Vijay V. Vazirani", title = "Planar Graph Perfect Matching Is in {NC}", journal = j-J-ACM, volume = "67", number = "4", pages = "21:1--21:34", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3397504", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3397504", abstract = "Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC perfect matching algorithms. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dujmovic:2020:PGB, author = "Vida Dujmovi{\'c} and Gwena{\"e}l Joret and Piotr Micek and Pat Morin and Torsten Ueckerdt and David R. Wood", title = "Planar Graphs Have Bounded Queue-Number", journal = j-J-ACM, volume = "67", number = "4", pages = "22:1--22:38", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3385731", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3385731", abstract = "We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath et al. [66] from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chattopadhyay:2020:LAR, author = "Arkadev Chattopadhyay and Nikhil S. Mande and Suhail Sherif", title = "The Log-Approximate-Rank Conjecture Is False", journal = j-J-ACM, volume = "67", number = "4", pages = "23:1--23:28", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3396695", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3396695", abstract = "We construct a simple and total Boolean function $ F = f \circ {\rm XOR} $ on $ 2 n $ variables that has only $ O (\sqrt n) $ spectral norm, $ O(n^2) $ approximate rank, and $ O(n^{2.5}) $ approximate nonnegative rank. We show it has polynomially large randomized bounded-error communication \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Babaioff:2020:SAO, author = "Moshe Babaioff and Nicole Immorlica and Brendan Lucier and S. Matthew Weinberg", title = "A Simple and Approximately Optimal Mechanism for an Additive Buyer", journal = j-J-ACM, volume = "67", number = "4", pages = "24:1--24:40", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3398745", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3398745", abstract = "We consider a monopolist seller with n heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The seller aims to \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gaina:2020:FCH, author = "Daniel Gaina", title = "Forcing and Calculi for Hybrid Logics", journal = j-J-ACM, volume = "67", number = "4", pages = "25:1--25:55", month = aug, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3400294", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Aug 14 15:12:00 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3400294", abstract = "The definition of institution formalizes the intuitive notion of logic in a category-based setting. Similarly, the concept of stratified institution provides an abstract approach to Kripke semantics. This includes hybrid logics, a type of modal logics \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Duditek:2020:OEO, author = "Miroslav Dud{\'\i}te;k and Nika Haghtalab and Haipeng Luo and Robert E. Schapire and Vasilis Syrgkanis and Jennifer Wortman Vaughan", title = "Oracle-efficient Online Learning and Auction Design", journal = j-J-ACM, volume = "67", number = "5", pages = "26:1--26:57", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3402203", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3402203", abstract = "We consider the design of computationally efficient online learning algorithms in an adversarial setting in which the learner has access to an offline optimization oracle. We present an algorithm called Generalized Follow-the-Perturbed-Leader and \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blelloch:2020:PRI, author = "Guy E. Blelloch and Yan Gu and Julian Shun and Yihan Sun", title = "Parallelism in Randomized Incremental Algorithms", journal = j-J-ACM, volume = "67", number = "5", pages = "27:1--27:27", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3402819", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3402819", abstract = "In this article, we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems, including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk, least-element \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Canetti:2020:UCS, author = "Ran Canetti", title = "Universally Composable Security", journal = j-J-ACM, volume = "67", number = "5", pages = "28:1--28:94", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3402457", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3402457", abstract = "This work presents a general framework for describing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2020:IAFb, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "67", number = "5", pages = "29:1--29:1", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3418066", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3418066", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zhuk:2020:PCD, author = "Dmitriy Zhuk", title = "A Proof of the {CSP} Dichotomy Conjecture", journal = j-J-ACM, volume = "67", number = "5", pages = "30:1--30:78", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3402029", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3402029", abstract = "Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Atserias:2020:ARN, author = "Albert Atserias and Moritz M{\"u}ller", title = "Automating Resolution is {NP}-Hard", journal = j-J-ACM, volume = "67", number = "5", pages = "31:1--31:17", month = oct, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3409472", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 17 06:20:18 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3409472", abstract = "We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatable unless P = NP. Indeed, we show that it is NP-hard to \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ashtiani:2020:NOS, author = "Hassan Ashtiani and Shai Ben-David and Nicholas J. A. Harvey and Christopher Liaw and Abbas Mehrabian and Yaniv Plan", title = "Near-optimal Sample Complexity Bounds for Robust Learning of {Gaussian} Mixtures via Compression Schemes", journal = j-J-ACM, volume = "67", number = "6", pages = "32:1--32:42", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3417994", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3417994", abstract = "We introduce a novel technique for distribution learning based on a notion of sample compression. Any class of distributions that allows such a compression scheme can be learned with few samples. Moreover, if a class of distributions has such a \ldots{}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Esparza:2020:UTL, author = "Javier Esparza and Jan Kret{\'\i}nsk{\'y} and Salomon Sickert", title = "A Unified Translation of Linear Temporal Logic to $ \omega $-Automata", journal = j-J-ACM, volume = "67", number = "6", pages = "33:1--33:61", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3417995", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3417995", abstract = "We present a unified translation of linear temporal logic (LTL) formulas into deterministic Rabin automata (DRA), limit-deterministic B{\"u}chi automata (LDBA), and nondeterministic B{\"u}chi automata (NBA). The translations yield automata of asymptotically \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barcelo:2020:SOC, author = "Pablo Barcel{\'o} and Diego Figueira and Georg Gottlob and Andreas Pieris", title = "Semantic Optimization of Conjunctive Queries", journal = j-J-ACM, volume = "67", number = "6", pages = "34:1--34:60", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3424908", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3424908", abstract = "This work deals with the problem of semantic optimization of the central class of conjunctive queries (CQs). Since CQ evaluation is NP-complete, a long line of research has focussed on identifying fragments of CQs that can be efficiently evaluated. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2020:IAF, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "67", number = "6", pages = "35:1--35:1", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3429262", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3429262", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chakraborty:2020:AED, author = "Diptarka Chakraborty and Debarati Das and Elazar Goldenberg and Michal Kouck{\'y} and Michael Saks", title = "Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time", journal = j-J-ACM, volume = "67", number = "6", pages = "36:1--36:22", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3422823", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3422823", abstract = "Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a dynamic \ldots{}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Svensson:2020:CFA, author = "Ola Svensson and Jakub Tarnawski and L{\'a}szl{\'o} A. V{\'e}gh", title = "A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem", journal = j-J-ACM, volume = "67", number = "6", pages = "37:1--37:53", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3424306", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3424306", abstract = "We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goemans:2020:PPC, author = "Michel X. Goemans and Thomas Rothvoss", title = "Polynomiality for Bin Packing with a Constant Number of Item Types", journal = j-J-ACM, volume = "67", number = "6", pages = "38:1--38:21", month = nov, year = "2020", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3421750", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:24 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3421750", abstract = "We consider the bin packing problem with d different item sizes s$_i$ and item multiplicities a$_i$, where all numbers are given in binary encoding. This problem formulation is also known as the one-dimensional cutting stock problem. In this work, we provide \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haastad:2021:SDF, author = "Johan H{\aa}stad", title = "On Small-depth {Frege} Proofs for {Tseitin} for Grids", journal = j-J-ACM, volume = "68", number = "1", pages = "1:1--1:31", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3425606", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3425606", abstract = "We prove that a small-depth Frege refutation of the Tseitin contradiction on the grid requires subexponential size. We conclude that polynomial size Frege refutations of the Tseitin contradiction must use formulas of almost logarithmic depth.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gasieniec:2021:EPC, author = "Leszek Gasieniec and Grzegorz Stachowiak", title = "Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election", journal = j-J-ACM, volume = "68", number = "1", pages = "2:1--2:21", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3424659", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3424659", abstract = "The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen:2021:SLP, author = "Michael B. Cohen and Yin Tat Lee and Zhao Song", title = "Solving Linear Programs in the Current Matrix Multiplication Time", journal = j-J-ACM, volume = "68", number = "1", pages = "3:1--3:39", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3424305", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3424305", abstract = "This article shows how to solve linear programs of the form min$_{Ax = b, x \{ > \} = 0}$ c$^{ \top }$ x with n variables in time $O^*((n^{ \omega } + n^{2.5 - \alpha / 2} + n^{2 + 1 / 6}) \log ( n / \delta ))$, where \omega is the exponent of matrix multiplication, \alpha is the dual exponent of matrix multiplication, and \delta is the \ldots{}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Murawski:2021:GSI, author = "Andrzej S. Murawski and Nikos Tzevelekos", title = "Game Semantics for Interface Middleweight {Java}", journal = j-J-ACM, volume = "68", number = "1", pages = "4:1--4:51", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3428676", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/java2020.bib", URL = "https://dl.acm.org/doi/10.1145/3428676", abstract = "We consider an object calculus in which open terms interact with the environment through interfaces. The calculus is intended to capture the essence of contextual interactions of Middleweight Java code. Using game semantics, we provide fully abstract \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tabareau:2021:MUP, author = "Nicolas Tabareau and {\'E}ric Tanter and Matthieu Sozeau", title = "The Marriage of Univalence and Parametricity", journal = j-J-ACM, volume = "68", number = "1", pages = "5:1--5:44", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3429979", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3429979", abstract = "Reasoning modulo equivalences is natural for everyone, including mathematicians. Unfortunately, in proof assistants based on type theory, which are frequently used to mechanize mathematical results and carry out program verification efforts, equality is \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFa, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "68", number = "1", pages = "6:1--6:1", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3442687", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3442687", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Czerwinski:2021:RPP, author = "Wojciech Czerwi{\'n}ski and S{\l}awomir Lasota and Ranko Lazi{\'c} and J{\'E}r{\^o}me Leroux and Filip Mazowiecki", title = "The Reachability Problem for {Petri} Nets Is Not Elementary", journal = j-J-ACM, volume = "68", number = "1", pages = "7:1--7:28", month = feb, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3422822", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Feb 23 11:03:25 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3422822", abstract = "Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modeling and analysis of hardware, software, and database systems, as well as chemical, biological, and business processes. The \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cramer:2021:MSV, author = "Ronald Cramer and L{\'e}o Ducas and Benjamin Wesolowski", title = "Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time", journal = j-J-ACM, volume = "68", number = "2", pages = "8:1--8:26", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3431725", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3431725", abstract = "In this article, we study the geometry of units and ideals of cyclotomic rings and derive an algorithm to find a mildly short vector in any given cyclotomic ideal lattice in quantum polynomial time, under some plausible number-theoretic assumptions. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bonamy:2021:ESA, author = "Marthe Bonamy and {\'E}douard Bonnet and Nicolas Bousquet and Pierre Charbit and Panos Giannopoulos and Eun Jung Kim and Pawe{\l} Rzazewski and Florian Sikora and St{\'e}phan Thomass{\'e}", title = "{EPTAS} and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs", journal = j-J-ACM, volume = "68", number = "2", pages = "9:1--9:38", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3433160", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3433160", abstract = "A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for MAXIMUM CLIQUE on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dughmi:2021:BFB, author = "Shaddin Dughmi and Jason Hartline and Robert D. Kleinberg and Rad Niazadeh", title = "{Bernoulli} Factories and Black-box Reductions in Mechanism Design", journal = j-J-ACM, volume = "68", number = "2", pages = "10:1--10:30", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3440988", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3440988", abstract = "We provide a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multi-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jin:2021:NOM, author = "Chi Jin and Praneeth Netrapalli and Rong Ge and Sham M. Kakade and Michael I. Jordan", title = "On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points", journal = j-J-ACM, volume = "68", number = "2", pages = "11:1--11:29", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3418526", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3418526", abstract = "Gradient descent (GD) and stochastic gradient descent (SGD) are the workhorses of large-scale machine learning. While classical theory focused on analyzing the performance of these methods in convex optimization problems, the most notable successes in \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFb, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "68", number = "2", pages = "12e:1--12e:1", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3456290", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3456290", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12e", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tzameret:2021:UIF, author = "Iddo Tzameret and Stephen A. Cook", title = "Uniform, Integral, and Feasible Proofs for the Determinant Identities", journal = j-J-ACM, volume = "68", number = "2", pages = "12:1--12:80", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3431922", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3431922", abstract = "Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over GF (2) in Hrubes-Tzameret \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Czumaj:2021:EST, author = "Artur Czumaj and Peter Davies", title = "Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks", journal = j-J-ACM, volume = "68", number = "2", pages = "13:1--13:22", month = mar, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3446383", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 26 09:10:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3446383", abstract = "We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dottling:2021:IBE, author = "Nico D{\"o}ttling and Sanjam Garg", title = "Identity-based Encryption from the {Diffie--Hellman} Assumption", journal = j-J-ACM, volume = "68", number = "3", pages = "14:1--14:46", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3422370", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3422370", abstract = "We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring. Our construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. We bypass known impossibility results using garbled circuits that make a non-black-box use of the underlying cryptographic primitives.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gonczarowski:2021:SCM, author = "Yannai A. Gonczarowski and S. Matthew Weinberg", title = "The Sample Complexity of Up-to-$ \epsilon $ Multi-dimensional Revenue Maximization", journal = j-J-ACM, volume = "68", number = "3", pages = "15:1--15:28", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3439722", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3439722", abstract = "We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of additive bidders whose values for heterogeneous items are drawn independently. For \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bhattacharyya:2021:PIE, author = "Arnab Bhattacharyya and {\'E}douard Bonnet and L{\'a}szl{\'o} Egri and Suprovat Ghoshal and Karthik C. S. and Bingkai Lin and Pasin Manurangsi and D{\'a}niel Marx", title = "Parameterized Intractability of Even Set and Shortest Vector Problem", journal = j-J-ACM, volume = "68", number = "3", pages = "16:1--16:40", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3444942", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3444942", abstract = "The -Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over , which can be stated as follows: given a generator matrix and an integer , determine whether the code generated by has distance at most , or, in other \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zeng:2021:FJQ, author = "Yun Zeng and Jian Tan and Cathy H. Xia", title = "Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension and Throughput Limit", journal = j-J-ACM, volume = "68", number = "3", pages = "17:1--17:30", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3448213", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3448213", abstract = "Parallel and distributed computing systems are foundational to the success of cloud computing and big data analytics. These systems process computational workflows in a way that can be mathematically modeled by a fork-and-join queueing network with \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Mika:2021:FFU, author = "Maksymilian Mika and Marek Szyku{\l}a", title = "The {Frobenius} and Factor Universality Problems of the {Kleene} Star of a Finite Set of Words", journal = j-J-ACM, volume = "68", number = "3", pages = "18:1--18:22", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3447237", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3447237", abstract = "We solve open problems concerning the Kleene star of a finite set of words over an alphabet . The Frobenius monoid problem is the question for a given finite set of words , whether the language is cofinite. We show that it is PSPACE-complete. We also \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Boroujeni:2021:AED, author = "Mahdi Boroujeni and Soheil Ehsani and Mohammad Ghodsi and Mohammadtaghi Hajiaghayi and Saeed Seddighin", title = "Approximating Edit Distance in Truly Subquadratic Time: Quantum and {MapReduce}", journal = j-J-ACM, volume = "68", number = "3", pages = "19:1--19:41", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3456807", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3456807", abstract = "The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is ``one of the \ldots{}''.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFc, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "68", number = "3", pages = "20:1--20:1", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3448013", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3448013", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chang:2021:NOD, author = "Yi-Jun Chang and Seth Pettie and Thatchaphol Saranurak and Hengjie Zhang", title = "Near-optimal Distributed Triangle Enumeration via Expander Decompositions", journal = j-J-ACM, volume = "68", number = "3", pages = "21:1--21:36", month = may, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3446330", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Jun 4 15:35:42 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3446330", abstract = "We present improved distributed algorithms for variants of the triangle finding problem in the model. We show that triangle detection, counting, and enumeration can be solved in rounds using expander decompositions. This matches the triangle enumeration \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harrison:2021:RTD, author = "P. G. Harrison and J. Bor", title = "Response Time Distribution in a Tandem Pair of Queues with Batch Processing", journal = j-J-ACM, volume = "68", number = "4", pages = "22:1--22:41", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3448973", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3448973", abstract = "Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and batch departures. The method uses conditional forward and reversed node sojourn times and derives the Laplace transform of the response time probability \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Atserias:2021:CHA, author = "Albert Atserias and Ilario Bonacina and Susanna F. {De Rezende} and Massimo Lauria and Jakob Nordstr{\"o}m and Alexander Razborov", title = "Clique Is Hard on Average for Regular Resolution", journal = j-J-ACM, volume = "68", number = "4", pages = "23:1--23:26", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3449352", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3449352", abstract = "We prove that for $ k \ll 4 \sqrt n $ regular resolution requires length $ n^{\Omega (k)} $ to establish that an Erd{\H{o}}s--R{\'e}nyi graph with appropriately chosen edge density does not contain a $k$-clique. This lower bound is optimal up to the multiplicative constant in the exponent and \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lykouris:2021:CCM, author = "Thodoris Lykouris and Sergei Vassilvitskii", title = "Competitive Caching with Machine Learned Advice", journal = j-J-ACM, volume = "68", number = "4", pages = "24:1--24:25", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3447579", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3447579", abstract = "Traditional online algorithms encapsulate decision making under uncertainty, and give ways to hedge against all possible future events, while guaranteeing a nearly optimal solution, as compared to an offline optimum. On the other hand, machine learning \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bubeck:2021:KBM, author = "S{\'e}bastien Bubeck and Ronen Eldan and Yin Tat Lee", title = "Kernel-based Methods for Bandit Convex Optimization", journal = j-J-ACM, volume = "68", number = "4", pages = "25:1--25:35", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3453721", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3453721", abstract = "We consider the adversarial convex bandit problem and we build the first $\poly(T)$-time algorithm with $\poly(n) \sqrt T$-regret for this problem. To do so, we introduce three new ideas in the derivative-free optimization literature: (i) kernel methods, (ii) a \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Atserias:2021:PSL, author = "Albert Atserias and Anuj Dawar and Joanna Ochremiak", title = "On the Power of Symmetric Linear Programs", journal = j-J-ACM, volume = "68", number = "4", pages = "26:1--26:35", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3456297", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3456297", abstract = "We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points corresponding \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ganardi:2021:BSL, author = "Moses Ganardi and Artur Jez and Markus Lohrey", title = "Balancing Straight-line Programs", journal = j-J-ACM, volume = "68", number = "4", pages = "27:1--27:40", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3457389", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3457389", abstract = "We show that a context-free grammar of size that produces a single string of length (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for of size , whose unique derivation tree \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barto:2021:AAP, author = "Libor Barto and Jakub Bul{\'\i}n and Andrei Krokhin and Jakub Oprsal", title = "Algebraic Approach to Promise Constraint Satisfaction", journal = j-J-ACM, volume = "68", number = "4", pages = "28:1--28:66", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3457606", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3457606", abstract = "The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the past 20 years. A new version of the CSP, the promise CSP (PCSP), has recently been proposed, motivated by open questions about the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFd, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "68", number = "4", pages = "29:1--29:1", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3464772", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3464772", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen-Addad:2021:ATL, author = "Vincent Cohen-Addad and {\'E}ric Colin {De Verdi{\`e}re} and D{\'a}niel Marx and Arnaud {De Mesmay}", title = "Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs", journal = j-J-ACM, volume = "68", number = "4", pages = "30:1--30:26", month = aug, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3450704", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Aug 2 16:00:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3450704", abstract = "We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut problem. A cut \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Brakerski:2021:CTQ, author = "Zvika Brakerski and Paul Christiano and Urmila Mahadev and Umesh Vazirani and Thomas Vidick", title = "A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device", journal = j-J-ACM, volume = "68", number = "5", pages = "31:1--31:47", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3441309", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3441309", abstract = "We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial time bounded quantum device interacting with a classical polynomial time verifier. In this model, we propose solutions to two tasks-a protocol for \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Argue:2021:CCB, author = "C. J. Argue and Anupam Gupta and Ziye Tang and Guru Guruganesh", title = "Chasing Convex Bodies with Linear Competitive Ratio", journal = j-J-ACM, volume = "68", number = "5", pages = "32:1--32:10", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3450349", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3450349", abstract = "We study the problem of chasing convex bodies online: given a sequence of convex bodies the algorithm must respond with points in an online fashion (i.e., is chosen before is revealed). The objective is to minimize the sum of distances between \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zhandry:2021:HCQ, author = "Mark Zhandry", title = "How to Construct Quantum Random Functions", journal = j-J-ACM, volume = "68", number = "5", pages = "33:1--33:43", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3450745", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "https://dl.acm.org/doi/10.1145/3450745", abstract = "Pseudorandom functions (PRFs) are one of the foundational concepts in theoretical computer science, with numerous applications in complexity theory and cryptography. In this work, we study the security of PRFs when evaluated on quantum superpositions of inputs. The classical techniques for arguing the security of PRFs do not carry over to this setting, even if the underlying building blocks are quantum resistant. We therefore develop a new proof technique to show that many of the classical PRF constructions remain secure when evaluated on superpositions.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blondin:2021:RPT, author = "Michael Blondin and Matthias Englert and Alain Finkel and Stefan G{\"O}ller and Christoph Haase and Ranko Lazi{\'c} and Pierre Mckenzie and Patrick Totzke", title = "The Reachability Problem for Two-Dimensional Vector Addition Systems with States", journal = j-J-ACM, volume = "68", number = "5", pages = "34:1--34:43", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3464794", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3464794", abstract = "We prove that the reachability problem for two-dimensional vector addition systems with states is NL-complete or PSPACE-complete, depending on whether the numbers in the input are encoded in unary or binary. As a key underlying technical result, we show \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2021:SMS, author = "Georg Gottlob and Andr{\'e} Hernich and Clemens Kupke and Thomas Lukasiewicz", title = "Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity", journal = j-J-ACM, volume = "68", number = "5", pages = "35:1--35:87", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3447508", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3447508", abstract = "This work investigates the decidability and complexity of database query answering under guarded existential rules with nonmonotonic negation according to the classical stable model semantics. In this setting, existential quantification is interpreted via \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Haeupler:2021:SSC, author = "Bernhard Haeupler and Amirbehshad Shahrasbi", title = "Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound", journal = j-J-ACM, volume = "68", number = "5", pages = "36:1--36:39", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3468265", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3468265", abstract = "We introduce synchronization strings, which provide a novel way to efficiently deal with synchronization errors, i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to cope with than more commonly considered \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFe, author = "Eva Tardos", title = "Invited Articles Foreword", journal = j-J-ACM, volume = "68", number = "5", pages = "37:1--37:1", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3485044", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3485044", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gottlob:2021:CAG, author = "Georg Gottlob and Matthias Lanzinger and Reinhard Pichler and Igor Razgon", title = "Complexity Analysis of Generalized and Fractional Hypertree Decompositions", journal = j-J-ACM, volume = "68", number = "5", pages = "38:1--38:50", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3457374", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3457374", abstract = "Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for answering conjunctive \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Balliu:2021:LBM, author = "Alkida Balliu and Sebastian Brandt and Juho Hirvonen and Dennis Olivetti and Mika{\"e}l Rabie and Jukka Suomela", title = "Lower Bounds for Maximal Matchings and Maximal Independent Sets", journal = j-J-ACM, volume = "68", number = "5", pages = "39:1--39:30", month = oct, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3461458", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:15 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3461458", abstract = "There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $ O(\Delta + \log^* n) $ communication rounds; here, n is the number of nodes and \Delta is the maximum degree. The lower bound by Linial (1987, 1992) shows that the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Feng:2021:FSC, author = "Weiming Feng and Heng Guo and Yitong Yin and Chihao Zhang", title = "Fast Sampling and Counting $k$-{SAT} Solutions in the Local Lemma Regime", journal = j-J-ACM, volume = "68", number = "6", pages = "40:1--40:42", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3469832", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3469832", abstract = "We give new algorithms based on Markov chains to sample and approximately count satisfying assignments to k -uniform CNF formulas where each variable appears at most d times. For any k and d satisfying kd {$<$} n$^{o(1)}$ and k {$>$}= 20 log k + 20 log d + 60, the new \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Sterling:2021:LRT, author = "Jonathan Sterling and Robert Harper", title = "Logical Relations as Types: Proof-Relevant Parametricity for Program Modules", journal = j-J-ACM, volume = "68", number = "6", pages = "41:1--41:47", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3474834", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3474834", abstract = "The theory of program modules is of interest to language designers not only for its practical importance to programming, but also because it lies at the nexus of three fundamental concerns in language design: the phase distinction, computational effects, \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dujmovic:2021:ALP, author = "Vida Dujmovi{\'c} and Louis Esperet and Cyril Gavoille and Gwena{\"e}l Joret and Piotr Micek and Pat Morin", title = "Adjacency Labelling for Planar Graphs (and Beyond)", journal = j-J-ACM, volume = "68", number = "6", pages = "42:1--42:33", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3477542", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3477542", abstract = "We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an n -vertex planar graph G is assigned a (1 + o(1)) log$_2$ n -bit label and the labels of two vertices u and v are sufficient to determine if uv is an edge of G. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bates:2021:DFR, author = "Stephen Bates and Anastasios Angelopoulos and Lihua Lei and Jitendra Malik and Michael Jordan", title = "Distribution-free, Risk-controlling Prediction Sets", journal = j-J-ACM, volume = "68", number = "6", pages = "43:1--43:34", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3478535", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3478535", abstract = "While improving prediction accuracy has been the focus of machine learning in recent years, this alone does not suffice for reliable decision-making. Deploying learning systems in consequential settings also requires calibrating and communicating the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen-Addad:2021:NLT, author = "Vincent Cohen-Addad and Andreas Emil Feldmann and David Saulpic", title = "Near-linear Time Approximation Schemes for Clustering in Doubling Metrics", journal = j-J-ACM, volume = "68", number = "6", pages = "44:1--44:34", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3477541", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3477541", abstract = "We consider the classic Facility Location, k -Median, and k -Means problems in metric spaces of doubling dimension d. We give nearly linear-time approximation schemes for each problem. The complexity of our algorithms is {\~O}(2$^{(1 / \epsilon)}^{O(d2)}$ n), making a \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lovett:2021:DLC, author = "Shachar Lovett and Kewen Wu and Jiapeng Zhang", title = "Decision List Compression by Mild Random Restrictions", journal = j-J-ACM, volume = "68", number = "6", pages = "45:1--45:17", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3485007", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3485007", abstract = "A decision list is an ordered list of rules. Each rule is specified by a term, which is a conjunction of literals, and a value. Given an input, the output of a decision list is the value corresponding to the first rule whose term is satisfied by the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fugger:2021:TBA, author = "Matthias F{\"u}gger and Thomas Nowak and Manfred Schwarz", title = "Tight Bounds for Asymptotic and Approximate Consensus", journal = j-J-ACM, volume = "68", number = "6", pages = "46:1--46:35", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3485242", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3485242", abstract = "Agreeing on a common value among a set of agents is a fundamental problem in distributed computing, which occurs in several variants: In contrast to exact consensus, approximate variants are studied in systems where exact agreement is not possible or \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "46", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2021:IAFf, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "68", number = "6", pages = "47:1--47:1", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3490689", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3490689", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "47", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Arenas:2021:NAF, author = "Marcelo Arenas and Luis Alberto Croquevielle and Rajesh Jayaram and Cristian Riveros", title = "{{\#NFA}} Admits an {FPRAS}: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes", journal = j-J-ACM, volume = "68", number = "6", pages = "48:1--48:40", month = dec, year = "2021", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3477045", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jan 27 06:13:16 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3477045", abstract = "In this work, we study two simple yet general complexity classes, based on logspace Turing machines, that provide a unifying framework for efficient query evaluation in areas such as information extraction and graph databases, among others. We investigate \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "48", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kalai:2022:HDC, author = "Yael Tauman Kalai and Ran Raz and Ron D. Rothblum", title = "How to Delegate Computations: The Power of No-Signaling Proofs", journal = j-J-ACM, volume = "69", number = "1", pages = "1:1--1:82", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3456867", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3456867", abstract = "We construct a 1-round delegation scheme (i.e., argument-system) for every language computable in time t = t ( n ), where the running time of the prover is poly( t ) and the running time of the verifier is n $ \cdot $ polylog( t ). In particular, for every language in P \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gupta:2022:OBC, author = "Anupam Gupta and David G. Harris and Euiwoong Lee and Jason Li", title = "Optimal Bounds for the $k$-cut Problem", journal = j-J-ACM, volume = "69", number = "1", pages = "2:1--2:18", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3478018", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3478018", abstract = "In the k -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into k connected components. Algorithms of Karger and Stein can solve this in roughly $ O(n^{2k}) $ time. However, lower bounds from conjectures about \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bonnet:2022:TWT, author = "{\'E}douard Bonnet and Eun Jung Kim and St{\'e}phan Thomass{\'e} and R{\'e}mi Watrigant", title = "Twin-width {I}: Tractable {FO} Model Checking", journal = j-J-ACM, volume = "69", number = "1", pages = "3:1--3:46", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3486655", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3486655", abstract = "Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA'14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $ K_t$-free unit $d$-dimensional ball \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Abrahamsen:2022:AGP, author = "Mikkel Abrahamsen and Anna Adamaszek and Tillmann Miltzow", title = "The Art Gallery Problem is {$ \exists R $}-complete", journal = j-J-ACM, volume = "69", number = "1", pages = "4:1--4:70", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3486220", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3486220", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Barenboim:2022:LID, author = "Leonid Barenboim and Michael Elkin and Uri Goldenberg", title = "Locally-iterative Distributed {$ (\Delta + 1) $}-coloring and Applications", journal = j-J-ACM, volume = "69", number = "1", pages = "5:1--5:26", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3486625", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3486625", abstract = "We consider graph coloring and related problems in the distributed message-passing model. Locally-iterative algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kaminski:2022:CEP, author = "Mark Kaminski and Egor V. Kostylev and Bernardo Cuenca Grau and Boris Motik and Ian Horrocks", title = "The Complexity and Expressive Power of Limit {Datalog}", journal = j-J-ACM, volume = "69", number = "1", pages = "6:1--6:83", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3495009", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3495009", abstract = "Motivated by applications in declarative data analysis, in this article, we study Datalog$_Z$ --- an extension of Datalog with stratified negation and arithmetic functions over integers. This language is known to be undecidable, so we present the fragment of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2022:IAFa, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "69", number = "1", pages = "7:1--7:1", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3505279", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3505279", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Edalat:2022:SAL, author = "Abbas Edalat", title = "Smooth Approximation of {Lipschitz} Maps and Their Subgradients", journal = j-J-ACM, volume = "69", number = "1", pages = "8:1--8:32", month = feb, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3481805", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Feb 19 11:14:44 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3481805", abstract = "We derive new representations for the generalised Jacobian of a locally Lipschitz map between finite dimensional real Euclidean spaces as the lower limit (i.e., limit inferior) of the classical derivative of the map where it exists. The new \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{ODonnell:2022:FP, author = "Ryan O'Donnell and Rocco A. Servedio and Li-Yang Tan", title = "Fooling Polytopes", journal = j-J-ACM, volume = "69", number = "2", pages = "9:1--9:37", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3460532", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3460532", abstract = "We give a pseudorandom generator that fools m -facet polytopes over $ \{ 0, 1 \}^n $ with seed length $ \polylog (m) \cdot \log n $. The previous best seed length had superlinear dependence on $m$.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Guruswami:2022:ORL, author = "Venkatesan Guruswami and Chaoping Xing", title = "Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes", journal = j-J-ACM, volume = "69", number = "2", pages = "10:1--10:48", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3506668", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3506668", abstract = "We give new constructions of two classes of algebraic code families that are efficiently list decodable with small output list size from a fraction $ 1 - R - \epsilon$ of adversarial errors, where $R$ is the rate of the code, for any desired positive constant $ \epsilon $. The\ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blasiok:2022:GSP, author = "Jaros{\l}aw B{\l}asiok and Venkatesan Guruswami and Preetum Nakkiran and Atri Rudra and Madhu Sudan", title = "General Strong Polarization", journal = j-J-ACM, volume = "69", number = "2", pages = "11:1--11:67", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3491390", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3491390", abstract = "Arikan's exciting discovery of polar codes has provided an altogether new way to efficiently achieve Shannon capacity. Given a (constant-sized) invertible matrix M, a family of polar codes can be associated with this matrix and its ability to approach \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Harvey:2022:PMF, author = "David Harvey and Joris van der Hoeven", title = "Polynomial Multiplication over Finite Fields in Time {$ O(n \log n) $}", journal = j-J-ACM, volume = "69", number = "2", pages = "12:1--12:40", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3505584", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3505584", abstract = "Assuming a widely believed hypothesis concerning the least prime in an arithmetic progression, we show that polynomials of degree less than \( n \) over a finite field \( \mathbb {F}_q \) with \( q \) elements can be multiplied in time $ O (n \log \ldots{} ) $ \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fulek:2022:AEC, author = "Radoslav Fulek and Csaba D. T{\'o}th", title = "Atomic Embeddability, Clustered Planarity, and Thickenability", journal = j-J-ACM, volume = "69", number = "2", pages = "13:1--13:34", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3502264", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3502264", abstract = "We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynomial-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bonchi:2022:SDR, author = "Filippo Bonchi and Fabio Gadducci and Aleks Kissinger and Pawel Sobocinski and Fabio Zanasi", title = "String Diagram Rewrite Theory {I}: Rewriting with {Frobenius} Structure", journal = j-J-ACM, volume = "69", number = "2", pages = "14:1--14:58", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3502719", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3502719", abstract = "String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal categories. In recent years, they have found application in the modelling of various computational \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chiesa:2022:SII, author = "Alessandro Chiesa and Michael A. Forbes and Tom Gur and Nicholas Spooner", title = "Spatial Isolation Implies Zero Knowledge Even in a Quantum World", journal = j-J-ACM, volume = "69", number = "2", pages = "15:1--15:44", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3511100", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3511100", abstract = "Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tardos:2022:IAFb, author = "Eva Tardos", title = "Invited Article Foreword", journal = j-J-ACM, volume = "69", number = "2", pages = "16:1--16:1", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3519019", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3519019", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Eliezer:2022:FAR, author = "Omri Ben-Eliezer and Rajesh Jayaram and David P. Woodruff and Eylon Yogev", title = "A Framework for Adversarially Robust Streaming Algorithms", journal = j-J-ACM, volume = "69", number = "2", pages = "17:1--17:33", month = apr, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3498334", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Mar 25 07:20:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3498334", abstract = "We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dutta:2022:DRU, author = "Pranjal Dutta and Nitin Saxena and Amit Sinhababu", title = "Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring", journal = j-J-ACM, volume = "69", number = "3", pages = "18:1--18:39", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3510359", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3510359", abstract = "Newton iteration is an almost 350-year-old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all roots simultaneously. In this form, the process yields \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fleming:2022:RTL, author = "Noah Fleming and Denis Pankratov and Toniann Pitassi and Robert Robere", title = "Random {$ \Theta (\log n) $}-{CNFs} are Hard for Cutting Planes", journal = j-J-ACM, volume = "69", number = "3", pages = "19:1--19:32", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3486680", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3486680", abstract = "The random k -SAT model is one of the most important and well-studied distributions over k -SAT instances. It is closely connected to statistical physics and is a benchmark for satisfiability algorithms. We show that when \( k = \Theta (\log n) \) , any \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Soloviev:2022:IAU, author = "Matvey Soloviev and Joseph Y. Halpern", title = "Information Acquisition Under Resource Limitations in a Noisy Environment", journal = j-J-ACM, volume = "69", number = "3", pages = "20:1--20:37", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3510024", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3510024", abstract = "We introduce a theoretical model of information acquisition under resource limitations in a noisy environment. An agent must guess the truth value of a given Boolean formula \( \varphi \) after performing a bounded number of noisy tests of the truth \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Balkanski:2022:LOS, author = "Eric Balkanski and Aviad Rubinstein and Yaron Singer", title = "The Limitations of Optimization from Samples", journal = j-J-ACM, volume = "69", number = "3", pages = "21:1--21:33", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3511018", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3511018", abstract = "In this article, we consider the following question: Can we optimize objective functions from the training data we use to learn them? We formalize this question through a novel framework we call optimization from samples (OPS). In OPS, we are given \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Schweikardt:2022:EFQ, author = "Nicole Schweikardt and Luc Segoufin and Alexandre Vigny", title = "Enumeration for {FO} Queries over Nowhere Dense Graphs", journal = j-J-ACM, volume = "69", number = "3", pages = "22:1--22:37", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3517035", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3517035", abstract = "We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nesetril and Ossona de Mendez as a formalization of classes of ``sparse'' graphs and generalizes many \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bera:2022:CSD, author = "Suman K. Bera and Lior Gishboliner and Yevgeny Levanzov and C. Seshadhri and Asaf Shapira", title = "Counting Subgraphs in Degenerate Graphs", journal = j-J-ACM, volume = "69", number = "3", pages = "23:1--23:21", month = jun, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3520240", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Jun 30 06:25:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3520240", abstract = "We consider the problem of counting the number of copies of a fixed graph H within an input graph G. This is one of the most well-studied algorithmic graph problems, with many theoretical and practical applications. We focus on solving this problem when \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Taubenfeld:2022:ASM, author = "Gadi Taubenfeld", title = "Anonymous Shared Memory", journal = j-J-ACM, volume = "69", number = "4", pages = "24:1--24:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3529752", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3529752", abstract = "Assuming that there is an a priori agreement between processes on the names of shared memory locations, as is done in almost all the publications on concurrent shared memory algorithms, is tantamount to assuming that agreement has already been solved at a \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2022:BNP, author = "Lijie Chen and Shuichi Hirahara and Igor Carboni Oliveira and J{\'a}n Pich and Ninad Rajgopal and Rahul Santhanam", title = "Beyond Natural Proofs: Hardness Magnification and Locality", journal = j-J-ACM, volume = "69", number = "4", pages = "25:1--25:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3538391", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3538391", abstract = "Hardness magnification reduces major complexity separations (such as EXP $ \not \subseteq $ NC$^1$) to proving lower bounds for some natural problem Q against weak circuit models. Several recent works [ 11 , 13 , 14 , 40 , 42 , 43 , 46 ] have established results of this form. In the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Braverman:2022:OSC, author = "Mark Braverman and Klim Efremenko and Ran Gelles and Michael Yitayew", title = "Optimal Short-Circuit Resilient Formulas", journal = j-J-ACM, volume = "69", number = "4", pages = "26:1--26:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3538390", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3538390", abstract = "We consider fault-tolerant boolean formulas in which the output of a faulty gate is short-circuited to one of the gate's inputs. A recent result by Kalai et al. [FOCS 2012] converts any boolean formula into a resilient formula of polynomial size that \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chan:2022:FDO, author = "T.-H. Hubert Chan and Kai-Min Chung and Bruce Maggs and Elaine Shi", title = "Foundations of Differentially Oblivious Algorithms", journal = j-J-ACM, volume = "69", number = "4", pages = "27:1--27:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3555984", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3555984", abstract = "It is well-known that a program's memory access pattern can leak information about its input. To thwart such leakage, most existing works adopt the technique of oblivious RAM (ORAM) simulation. Such an obliviousness notion has stimulated much debate. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Alon:2022:POL, author = "Noga Alon and Mark Bun and Roi Livni and Maryanthe Malliaris and Shay Moran", title = "Private and Online Learnability Are Equivalent", journal = j-J-ACM, volume = "69", number = "4", pages = "28:1--28:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3526074", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3526074", abstract = "Let H be a binary-labeled concept class. We prove that H can be PAC learned by an (approximate) differentially private algorithm if and only if it has a finite Littlestone dimension. This implies a qualitative equivalence between online learnability and \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dory:2022:EFS, author = "Michal Dory and Merav Parter", title = "Exponentially Faster Shortest Paths in the Congested Clique", journal = j-J-ACM, volume = "69", number = "4", pages = "29:1--29:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3527213", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3527213", abstract = "We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. We obtain poly(log log n )-round algorithms for the following problems in unweighted undirected n -vertex graphs: \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Raz:2022:OSB, author = "Ran Raz and Avishay Tal", title = "Oracle Separation of {BQP} and {PH}", journal = j-J-ACM, volume = "69", number = "4", pages = "30:1--30:??", month = aug, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3530258", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3530258", abstract = "We present a distribution D over inputs in {\pm 1}$^{2 N}$, such that: There exists a quantum algorithm that makes one (quantum) query to the input, and runs in time O(log N), that distinguishes between D and the uniform distribution with advantage \Omega (1/log N). \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ephraim:2022:SSP, author = "Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass", title = "{SPARKs}: Succinct Parallelizable Arguments of Knowledge", journal = j-J-ACM, volume = "69", number = "5", pages = "31:1--31:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3549523", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3549523", abstract = "We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This is an argument of knowledge with the following three efficiency properties for computing and proving a (non-deterministic, polynomial time) parallel RAM computation \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rubin:2022:IBW, author = "Natan Rubin", title = "An Improved Bound for Weak Epsilon-nets in the Plane", journal = j-J-ACM, volume = "69", number = "5", pages = "32:1--32:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3555985", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3555985", abstract = "We show that for any finite point set P in the plane and \epsilon {$>$} 0 there exist \( O(\tfrac{1}{{\epsilon }^{3/2+\gamma }}) \) points in R$^2$, for arbitrary small \gamma {$>$} 0, that pierce every convex set K with | K \cap P |{$>$} \epsilon | P |. This is the first improvement of the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chia:2022:SBS, author = "Nai-Hui Chia and Andr{\'a}s Pal Gily{\'e}n and Tongyang Li and Han-Hsuan Lin and Ewin Tang and Chunhao Wang", title = "Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning", journal = j-J-ACM, volume = "69", number = "5", pages = "33:1--33:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3549524", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3549524", abstract = "We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang's breakthrough quantum-inspired algorithm for recommendation systems [STOC'19]. Motivated by \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bonakdarpour:2022:DAC, author = "Borzoo Bonakdarpour and Pierre Fraigniaud and Sergio Rajsbaum and David Rosenblueth and Corentin Travers", title = "Decentralized Asynchronous Crash-resilient Runtime Verification", journal = j-J-ACM, volume = "69", number = "5", pages = "34:1--34:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3550483", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3550483", abstract = "Runtime verification is a lightweight method for monitoring the formal specification of a system during its execution. It has recently been shown that a given state predicate can be monitored consistently by a set of crash-prone asynchronous distributed. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Zhuk:2022:QMD, author = "Dmitriy Zhuk and Barnaby Martin", title = "{QCSP} Monsters and the Demise of the {Chen Conjecture}", journal = j-J-ACM, volume = "69", number = "5", pages = "35:1--35:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3563820", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3563820", abstract = "We give a surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language \Gamma , QCSP( \Gamma ), where \Gamma is a finite language over three elements that contains all constants. In particular, such \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Garg:2022:TRM, author = "Sanjam Garg and Akshayaram Srinivasan", title = "Two-round Multiparty Secure Computation from Minimal Assumptions", journal = j-J-ACM, volume = "69", number = "5", pages = "36:1--36:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3566048", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3566048", abstract = "We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2022:IIP, author = "Martin Grohe and Peter Lindner", title = "Independence in Infinite Probabilistic Databases", journal = j-J-ACM, volume = "69", number = "5", pages = "37:1--37:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3549525", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3549525", abstract = "Probabilistic databases (PDBs) model uncertainty in data. The current standard is to view PDBs as finite probability spaces over relational database instances. Since many attributes in typical databases have infinite domains, such as integers, strings, or \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Labrada:2022:GSF, author = "Elizabeth Labrada and Mat{\'\i}as Toro and {\'E}ric Tanter", title = "Gradual System {F}", journal = j-J-ACM, volume = "69", number = "5", pages = "38:1--38:??", month = oct, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3555986", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 29 07:15:10 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3555986", abstract = "Bringing the benefits of gradual typing to a language with parametric polymorphism like System F, while preserving relational parametricity, has proven extremely challenging: first attempts were formulated a decade ago, and several designs have been \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Blanc:2022:PLD, author = "Guy Blanc and Jane Lange and Mingda Qiao and Li-Yang Tan", title = "Properly Learning Decision Trees in almost Polynomial Time", journal = j-J-ACM, volume = "69", number = "6", pages = "39:1--39:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3561047", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3561047", abstract = "We give an n$^{O (log log n)}$ -time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over { \pm 1}$^n$. Even in the realizable setting, the previous fastest runtime was n$^{O (log n)}$, a consequence of a \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Immorlica:2022:ABK, author = "Nicole Immorlica and Karthik Sankararaman and Robert Schapire and Aleksandrs Slivkins", title = "Adversarial Bandits with Knapsacks", journal = j-J-ACM, volume = "69", number = "6", pages = "40:1--40:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3557045", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3557045", abstract = "We consider Bandits with Knapsacks (henceforth, BwK ), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a limited-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Farina:2022:SUN, author = "Gabriele Farina and Andrea Celli and Alberto Marchesi and Nicola Gatti", title = "Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium", journal = j-J-ACM, volume = "69", number = "6", pages = "41:1--41:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3563772", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3563772", abstract = "The existence of simple uncoupled no-regret learning dynamics that converge to correlated equilibria in normal-form games is a celebrated result in the theory of multi-agent systems. Specifically, it has been known for more than 20 years that when all \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hassidim:2022:ARS, author = "Avinatan Hassidim and Haim Kaplan and Yishay Mansour and Yossi Matias and Uri Stemmer", title = "Adversarially Robust Streaming Algorithms via Differential Privacy", journal = j-J-ACM, volume = "69", number = "6", pages = "42:1--42:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3556972", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3556972", abstract = "A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously, by an adaptive adversary. We establish a connection between adversarial robustness of streaming algorithms \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Doron:2022:NOP, author = "Dean Doron and Dana Moshkovitz and Justin Oh and David Zuckerman", title = "Nearly Optimal Pseudorandomness from Hardness", journal = j-J-ACM, volume = "69", number = "6", pages = "43:1--43:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3555307", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "https://dl.acm.org/doi/10.1145/3555307", abstract = "Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown. Specifically, assuming exponential lower bounds against randomized NP $ \cap $ coNP circuits, formally known as randomized SVN circuits, we convert any randomized algorithm over inputs of length n running in time $ t \geq n $ into a deterministic one running in time $ t^{2 + \alpha } $ for an arbitrarily small constant $ \alpha > 0 $. Such a slowdown is nearly optimal for $t$ close to $n$, since under standard complexity-theoretic assumptions, there are problems with an inherent quadratic derandomization slowdown. We also convert any randomized algorithm that errs rarely into a deterministic algorithm having a similar running time (with pre-processing). The latter derandomization result holds under weaker assumptions, of exponential lower bounds against deterministic SVN circuits.\par Our results follow from a new, nearly optimal, explicit pseudorandom generator fooling circuits of size $s$ with seed length $ (1 + \alpha) \log s$, under the assumption that there exists a function $ f \in E$ that requires randomized SVN circuits of size at least $ 2^{(1 - \alpha ')} n$, where $ \alpha = O(\alpha)'$. The construction uses, among other ideas, a new connection between pseudoentropy generators and locally list recoverable codes.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "43", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cheng:2022:DDE, author = "Kuan Cheng and Zhengzhong Jin and Xin Li and Ke Wu", title = "Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors", journal = j-J-ACM, volume = "69", number = "6", pages = "44:1--44:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3561046", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3561046", abstract = "We study two basic problems regarding edit errors, document exchange and error correcting codes. Here, two parties try to exchange two strings with length roughly n and edit distance at most k, or one party tries to send a string of length n to another \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "44", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fahrbach:2022:EWO, author = "Matthew Fahrbach and Zhiyi Huang and Runzhou Tao and Morteza Zadimoghaddam", title = "Edge-Weighted Online Bipartite Matching", journal = j-J-ACM, volume = "69", number = "6", pages = "45:1--45:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3556971", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3556971", abstract = "Online bipartite matching is one of the most fundamental problems in the online algorithms literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for unweighted bipartite matching that achieves an optimal competitive ratio of 1-1/e \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "45", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Grohe:2022:GDC, author = "Martin Grohe and Benjamin Lucien Kaminski and Joost-pieter Katoen and Peter Lindner", title = "Generative {Datalog} with Continuous Distributions", journal = j-J-ACM, volume = "69", number = "6", pages = "46:1--46:??", month = dec, year = "2022", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3559102", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Dec 1 07:54:23 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3559102", abstract = "Arguing for the need to combine declarative and probabilistic programming, B{\'a}r{\'a}ny et al. (TODS 2017) recently introduced a probabilistic extension of Datalog as a ``purely declarative probabilistic programming language.'' We revisit this language and \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "46", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kock:2023:WGP, author = "Joachim Kock", title = "Whole-grain {Petri} Nets and Processes", journal = j-J-ACM, volume = "70", number = "1", pages = "1:1--1:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3559103", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3559103", abstract = "We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an algebraic semantics \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bodirsky:2023:DCT, author = "Manuel Bodirsky and Jakub Rydval", title = "On the Descriptive Complexity of Temporal Constraint Satisfaction Problems", journal = j-J-ACM, volume = "70", number = "1", pages = "2:1--2:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3566051", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3566051", abstract = "Finite-domain constraint satisfaction problems are either solvable by Datalog or not even expressible in fixed-point logic with counting. The border between the two regimes can be described by a universal-algebraic minor condition. For infinite-domain \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Orlin:2023:DSP, author = "James B. Orlin and L{\'a}szl{\'o} V{\'e}gh", title = "Directed Shortest Paths via Approximate Cost Balancing", journal = j-J-ACM, volume = "70", number = "1", pages = "3:1--3:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3565019", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3565019", abstract = "We present an O(nm) algorithm for all-pairs shortest paths computations in a directed graph with n nodes, m arcs, and nonnegative integer arc costs. This matches the complexity bound attained by Thorup [ 31 ] for the all-pairs problems in undirected graphs. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Asharov:2023:OOO, author = "Gilad Asharov and Ilan Komargodski and Wei-Kai Lin and Kartik Nayak and Enoch Peserico and Elaine Shi", title = "{OptORAMa}: Optimal Oblivious {RAM}", journal = j-J-ACM, volume = "70", number = "1", pages = "4:1--4:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3566049", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3566049", abstract = "Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC '87 and J. ACM '96) is a technique for provably obfuscating programs' access patterns, such that the access patterns leak no information about the programs'. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jiang:2023:MCF, author = "Haotian Jiang", title = "Minimizing Convex Functions with Rational Minimizers", journal = j-J-ACM, volume = "70", number = "1", pages = "5:1--5:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3566050", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3566050", abstract = "Given a separation oracle SO for a convex function f defined on R$^n$ that has an integral minimizer inside a box with radius R, we show how to find an exact minimizer of f using at most O(n (n log log (n)/ log (n) + log (R))) calls to SO and poly (n, log (R)) \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chia:2023:NLQ, author = "Nai-Hui Chia and Kai-Min Chung and Ching-Yi Lai", title = "On the Need for Large Quantum Depth", journal = j-J-ACM, volume = "70", number = "1", pages = "6:1--6:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3570637", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3570637", abstract = "Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates. A natural approach to leverage these quantum computers is interleaving them with classical computers. Understanding the capabilities and limits of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Fearnley:2023:CGD, author = "John Fearnley and Paul Goldberg and Alexandros Hollender and Rahul Savani", title = "The Complexity of Gradient Descent: {CLS = PPAD $ \cap $ PLS}", journal = j-J-ACM, volume = "70", number = "1", pages = "7:1--7:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3568163", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3568163", abstract = "We study search problems that can be solved by performing Gradient Descent on a bounded convex polytopal domain and show that this class is equal to the intersection of two well-known classes: PPAD and PLS. As our main underlying technical contribution, \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goaoc:2023:CHR, author = "Xavier Goaoc and Emo Welzl", title = "Convex Hulls of Random Order Types", journal = j-J-ACM, volume = "70", number = "1", pages = "8:1--8:??", month = feb, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3570636", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3570636", abstract = "We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank 3): The number of extreme points in an n-point order type, \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bauwens:2023:UAO, author = "Bruno Bauwens* and Marius Zimand", title = "Universal almost Optimal Compression and {Slepian--Wolf} Coding in Probabilistic Polynomial Time", journal = j-J-ACM, volume = "70", number = "2", pages = "9:1--9:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3575807", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3575807", abstract = "In a lossless compression system with target lengths, a compressor C maps an integer m and a binary string x to an m -bit code p, and if m is sufficiently large, a decompressor D reconstructs x from p. We call a pair (m,x) achievable for (C,D) if this \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bubeck:2023:ULR, author = "S{\'e}bastien Bubeck and Mark Sellke", title = "A Universal Law of Robustness via Isoperimetry", journal = j-J-ACM, volume = "70", number = "2", pages = "10:1--10:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3578580", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3578580", abstract = "Classically, data interpolation with a parametrized model class is possible as long as the number of parameters is larger than the number of equations to be satisfied. A puzzling phenomenon in deep learning is that models are trained with many more \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Wang:2023:NAE, author = "Haitao Wang", title = "A New Algorithm for {Euclidean} Shortest Paths in the Plane", journal = j-J-ACM, volume = "70", number = "2", pages = "11:1--11:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3580475", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3580475", abstract = "Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. Previously, Hershberger and Suri \ldots{}.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Charalampopoulos:2023:AOE, author = "Panagiotis Charalampopoulos and Pawe{\l} Gawrychowski and Yaowei Long and Shay Mozes and Seth Pettie and Oren Weimann and Christian Wulff-Nilsen", title = "Almost Optimal Exact Distance Oracles for Planar Graphs", journal = j-J-ACM, volume = "70", number = "2", pages = "12:1--12:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3580474", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3580474", abstract = "We consider the problem of preprocessing a weighted directed planar graph in order to quickly answer exact distance queries. The main tension in this problem is between space S and query time Q, and since the mid-1990s all results had polynomial time- \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Geffner:2023:LBI, author = "Ivan Geffner and Joseph Y. Halpern", title = "Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents", journal = j-J-ACM, volume = "70", number = "2", pages = "13:1--13:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3578579", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3578579", abstract = "Abraham, Dolev, Geffner, and Halpern [ 1 ] proved that, in asynchronous systems, a (k, t)-robust equilibrium for n players and a trusted mediator can be implemented without the mediator as long as n > 4 (k + t), where an equilibrium is (k, t)-robust if, \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lichter:2023:SRL, author = "Moritz Lichter", title = "Separating Rank Logic from Polynomial Time", journal = j-J-ACM, volume = "70", number = "2", pages = "14:1--14:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3572918", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3572918", abstract = "In the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends fixed-point logic with counting by a rank operator over prime fields. We show that the isomorphism \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bruni:2023:CIP, author = "Roberto Bruni and Roberto Giacobazzi and Roberta Gori and Francesco Ranzato", title = "A Correctness and Incorrectness Program Logic", journal = j-J-ACM, volume = "70", number = "2", pages = "15:1--15:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3582267", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3582267", abstract = "Abstract interpretation is a well-known and extensively used method to extract over-approximate program invariants by a sound program analysis algorithm. Soundness means that no program errors are lost and it is, in principle, guaranteed by construction. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Afshani:2023:LBS, author = "Peyman Afshani and Pingan Cheng", title = "Lower Bounds for Semialgebraic Range Searching and Stabbing Problems", journal = j-J-ACM, volume = "70", number = "2", pages = "16:1--16:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3578574", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3578574", abstract = "In the semialgebraic range searching problem, we are given a set of n points in R$^d$, and we want to preprocess the points such that for any query range belonging to a family of constant complexity semialgebraic sets (Tarski cells), all the points \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rinberg:2023:IVL, author = "Arik Rinberg and Idit Keidar", title = "Intermediate Value Linearizability: a Quantitative Correctness Criterion", journal = j-J-ACM, volume = "70", number = "2", pages = "17:1--17:??", month = apr, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3584699", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Apr 21 11:32:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3584699", abstract = "Big data processing systems often employ batched updates and data sketches to estimate certain properties of large data. For example, a CountMin sketch approximates the frequencies at which elements occur in a data stream, and a batched counter counts \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "17", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Rutschmann:2023:CKC, author = "Daniel Rutschmann and Manuel Wettstein", title = "Chains, {Koch} Chains, and Point Sets with Many Triangulations", journal = j-J-ACM, volume = "70", number = "3", pages = "18:1--18:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3585535", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3585535", abstract = "We introduce the abstract notion of a chain, which is a sequence of n points in the plane, ordered by x-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general theory of the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "18", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jagadeesan:2023:LEM, author = "Meena Jagadeesan and Alexander Wei and Yixin Wang and Michael I. Jordan and Jacob Steinhardt", title = "Learning Equilibria in Matching Markets with Bandit Feedback", journal = j-J-ACM, volume = "70", number = "3", pages = "19:1--19:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3583681", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3583681", abstract = "Large-scale, two-sided matching platforms must find market outcomes that align with user preferences while simultaneously learning these preferences from data. Classical notions of stability (Gale and Shapley, 1962; Shapley and Shubik, 1971) are, \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "19", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Gaitonde:2023:PAS, author = "Jason Gaitonde and {\'E}va Tardos", title = "The Price of Anarchy of Strategic Queuing Systems", journal = j-J-ACM, volume = "70", number = "3", pages = "20:1--20:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3587250", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3587250", abstract = "Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish behavior of the participants, has been an important area of research in algorithmic game theory. Classical work on such bounds in repeated games makes the strong \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "20", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Liu:2023:RLG, author = "Allen Liu and Ankur Moitra", title = "Robustly Learning General Mixtures of {Gaussians}", journal = j-J-ACM, volume = "70", number = "3", pages = "21:1--21:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3583680", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3583680", abstract = "This work represents a natural coalescence of two important lines of work --- learning mixtures of Gaussians and algorithmic robust statistics. In particular, we give the first provably robust algorithm for learning mixtures of any constant number of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "21", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2023:RIC, author = "Ho-Lin Chen and David Doty and Wyatt Reeves and David Soloveichik", title = "Rate-independent Computation in Continuous Chemical Reaction Networks", journal = j-J-ACM, volume = "70", number = "3", pages = "22:1--22:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3590776", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3590776", abstract = "Understanding the algorithmic behaviors that are in principle realizable in a chemical system is necessary for a rigorous understanding of the design principles of biological regulatory networks. Further, advances in synthetic biology herald the time when \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "22", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Doyen:2023:SGS, author = "Laurent Doyen", title = "Stochastic Games with Synchronization Objectives", journal = j-J-ACM, volume = "70", number = "3", pages = "23:1--23:??", month = jun, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3588866", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3588866", abstract = "We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding stochasticity. The \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "23", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Feldman:2023:OWC, author = "Moran Feldman and Ashkan Norouzi-Fard and Ola Svensson and Rico Zenklusen", title = "The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness", journal = j-J-ACM, volume = "70", number = "4", pages = "24:1--24:??", month = aug, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3588564", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3588564", abstract = "We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multiplayer model \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "24", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chen:2023:ETH, author = "Lijie Chen and Ron D. Rothblum and Roei Tell and Eylon Yogev", title = "On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds", journal = j-J-ACM, volume = "70", number = "4", pages = "25:1--25:??", month = aug, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3593581", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3593581", abstract = "The Exponential-Time Hypothesis (ETH) is a strengthening of the P /= NP conjecture, stating that 3-SAT on n variables cannot be solved in (uniform) time 2$^{ \epsilon c n}$, for some \epsilon {$>$} 0. In recent years, analogous hypotheses that are ``exponentially strong'' forms of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "25", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chonev:2023:ZEP, author = "Ventsislav Chonev and Joel Ouaknine and James Worrell", title = "On the Zeros of Exponential Polynomials", journal = j-J-ACM, volume = "70", number = "4", pages = "26:1--26:??", month = aug, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3603543", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3603543", abstract = "We consider the problem of deciding the existence of real roots of real-valued exponential polynomials with algebraic coefficients. Such functions arise as solutions of linear differential equations with real algebraic coefficients. We focus on two \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "26", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cotumaccio:2023:CLO, author = "Nicola Cotumaccio and Giovanna D'Agostino and Alberto Policriti and Nicola Prezza", title = "Co-lexicographically Ordering Automata and Regular Languages --- Part {I}", journal = j-J-ACM, volume = "70", number = "4", pages = "27:1--27:??", month = aug, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3607471", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Aug 22 06:51:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "https://dl.acm.org/doi/10.1145/3607471", abstract = "The states of a finite-state automaton N can be identified with collections of words in the prefix closure of the regular language accepted by N. But words can be ordered, and among the many possible orders a very natural one is the co-lexicographic order. Such naturalness stems from the fact that it suggests a transfer of the order from words to the automaton's states. This suggestion is, in fact, concrete and in a number of articles automata admitting a total co-lexicographic (co-lex for brevity) ordering of states have been proposed and studied. Such class of ordered automata --- Wheeler automata --- turned out to require just a constant number of bits per transition to be represented and enable regular expression matching queries in constant time per matched character.\par Unfortunately, not all automata can be totally ordered as previously outlined. In the present work, we lay out a new theory showing that all automata can always be partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width p of one of their admissible co-lex partial orders --- dubbed here the automaton's co-lex width. We first show that this new measure captures at once the complexity of several seemingly-unrelated hard problems on automata. Any NFA of co-lex width p: (i) has an equivalent powerset DFA whose size is exponential in p rather than (as a classic analysis shows) in the NFA's size; (ii) can be encoded using just $ \Theta (\log p) $ bits per transition; (iii) admits a linear-space data structure solving regular expression matching queries in time proportional to p2 per matched character. Some consequences of this new parameterization of automata are that PSPACE-hard problems such as NFA equivalence are FPT in p, and quadratic lower bounds for the regular expression matching problem do not hold for sufficiently small p.\par Having established that the co-lex width of an automaton is a fundamental complexity measure, we proceed by (i) determining its computational complexity and (ii) extending this notion from automata to regular languages by studying their smallest-width accepting NFAs and DFAs. In this work we focus on the deterministic case and prove that a canonical minimum-width DFA accepting a language $ {\cal L} $ --- dubbed the Hasse automaton {$ \cal H $} of $ {\cal L} $ --- can be exhibited. {$ \cal H $} provides, in a precise sense, the best possible way to (partially) order the states of any DFA accepting $ {\cal L} $, as long as we want to maintain an operational link with the (co-lexicographic) order of $ {\cal L} $'s prefixes. Finally, we explore the relationship between two conflicting objectives: minimizing the width and minimizing the number of states of a DFA. In this context, we provide an analogue of the Myhill-Nerode Theorem for co-lexicographically ordered regular languages.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "27", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bodwin:2023:RSP, author = "Greg Bodwin and Merav Parter", title = "Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs", journal = j-J-ACM, volume = "70", number = "5", pages = "28:1--28:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3603542", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3603542", abstract = "The restoration lemma by Afek et al. [ 3 ] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "28", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hrushovski:2023:SAP, author = "Ehud Hrushovski and Jo{\"e}l Ouaknine and Amaury Pouly and James Worrell", title = "On Strongest Algebraic Program Invariants", journal = j-J-ACM, volume = "70", number = "5", pages = "29:1--29:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3614319", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3614319", abstract = "A polynomial program is one in which all assignments are given by polynomial expressions and in which all branching is nondeterministic (as opposed to conditional). Given such a program, an algebraic invariant is one that is defined by polynomial \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "29", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cormode:2023:RES, author = "Graham Cormode and Zohar Karnin and Edo Liberty and Justin Thaler and Pavel Vesel{\'y}", title = "Relative Error Streaming Quantiles", journal = j-J-ACM, volume = "70", number = "5", pages = "30:1--30:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3617891", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3617891", abstract = "Estimating ranks, quantiles, and distributions over streaming data is a central task in data analysis and monitoring. Given a stream of n items from a data universe equipped with a total order, the task is to compute a sketch (data structure) of size \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "30", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-Sasson:2023:PGR, author = "Eli Ben-Sasson and Dan Carmon and Yuval Ishai and Swastik Kopparty and Shubhangi Saraf", title = "Proximity Gaps for {Reed--Solomon} Codes", journal = j-J-ACM, volume = "70", number = "5", pages = "31:1--31:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3614423", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3614423", abstract = "A collection of sets displays a proximity gap with respect to some property if for every set in the collection, either (i) all members are $\delta$-close to the property in relative Hamming distance or (ii) only a tiny fraction of members are $\delta$-close to the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "31", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Berkholz:2023:NOL, author = "Christoph Berkholz and Jakob Nordstr{\"o}m", title = "Near-optimal Lower Bounds on Quantifier Depth and {Weisfeiler--Leman} Refinement Steps", journal = j-J-ACM, volume = "70", number = "5", pages = "32:1--32:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3195257", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3195257", abstract = "We prove near-optimal tradeoffs for quantifier depth (also called quantifier rank) versus number of variables in first-order logic by exhibiting pairs of $n$-element structures that can be distinguished by a $k$-variable first-order sentence but where every \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "32", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Baltag:2023:TMC, author = "Alexandru Baltag and Nick Bezhanishvili and David Fern{\'a}ndez-Duque", title = "The Topological Mu-Calculus: Completeness and Decidability", journal = j-J-ACM, volume = "70", number = "5", pages = "33:1--33:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3623268", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3623268", abstract = "We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability, and finite model property over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "33", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Behnezhad:2023:EFM, author = "Soheil Behnezhad and Mohammadtaghi Hajiaghayi and David G. Harris", title = "Exponentially Faster Massively Parallel Maximal Matching", journal = j-J-ACM, volume = "70", number = "5", pages = "34:1--34:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3617360", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3617360", abstract = "The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, we still have a limited understanding of maximal matching which is one of the central problems of \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "34", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Goubault-Larrecq:2023:DTA, author = "Jean Goubault-Larrecq and Xiaodong Jia and Cl{\'e}ment Th{\'e}ron", title = "A Domain-theoretic Approach to Statistical Programming Languages", journal = j-J-ACM, volume = "70", number = "5", pages = "35:1--35:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3611660", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3611660", abstract = "We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which allows for \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "35", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Jin:2023:FPA, author = "Yaonan Jin and Pinyan Lu", title = "First Price Auction is $ 1 - 1 / e^2 $ Efficient", journal = j-J-ACM, volume = "70", number = "5", pages = "36:1--36:??", month = oct, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3617902", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Oct 21 08:28:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3617902", abstract = "We prove that the PoA of First Price Auctions is $ 1 - 1 / e^2 \approx 0.8647 $, closing the gap between the best known bounds $ [0.7430, 0.8689] $.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "36", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", keywords = "Price of Anarchy (PoA)", } @Article{Los:2023:BAC, author = "Dimitrios Los and Thomas Sauerwald", title = "Balanced Allocations with the Choice of Noise", journal = j-J-ACM, volume = "70", number = "6", pages = "37:1--37:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3625386", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3625386", abstract = "We consider the allocation of m balls (jobs) into n bins (servers). In the standard Two-Choice process, at each step t =1,2,\ldots{},m we first sample two randomly chosen bins, compare their two loads and then place a ball in the least loaded bin. It is well-\ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "37", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ben-David:2023:NMT, author = "Shalev Ben-David and Eric Blais", title = "A New Minimax Theorem for Randomized Algorithms", journal = j-J-ACM, volume = "70", number = "6", pages = "38:1--38:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3626514", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3626514", abstract = "The celebrated minimax principle of Yao says that for any Boolean-valued function $f$ with finite domain, there is a distribution $\mu$ over the domain of $f$ such that computing $f$ to error $\epsilon$ against inputs from $\mu$ is just as hard as computing $f$ to error $\epsilon$ on \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "38", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Tang:2023:TBU, author = "Zhihao Gavin Tang and Xiaowei Wu and Yuhao Zhang", title = "Toward a Better Understanding of Randomized Greedy Matching", journal = j-J-ACM, volume = "70", number = "6", pages = "39:1--39:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3614318", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "https://dl.acm.org/doi/10.1145/3614318", abstract = "There has been a long history of studying randomized greedy matching algorithms since the work by Dyer and Frieze [ 9 ]. We follow this trend and consider the problem formulated in the oblivious setting, in which the vertex set of a graph is known to the \ldots{}", abstract = "There has been a long history of studying randomized greedy matching algorithms since the work by Dyer and Frieze [9]. We follow this trend and consider the problem formulated in the oblivious setting, in which the vertex set of a graph is known to the algorithm but not the edge set. The algorithm can make queries for the existence of the edge between any pair of vertices but must include the edge into the matching if it exists, i.e., as in the query-commit model by Gamlath et al. [12]. We revisit the Modified Randomized Greedy (MRG) algorithm by Aronson et al. [1] that is proved to achieve a $ (0.5 + \epsilon)$-approximation. In each step of the algorithm, an unmatched vertex is chosen uniformly at random and matched to a randomly chosen neighbor (if exists). We study a weaker version of the algorithm named Random Decision Order (RDO) that, in each step, randomly picks an unmatched vertex and matches it to an arbitrary neighbor (if exists). We prove that the RDO algorithm provides a 0.639-approximation for bipartite graphs and 0.531-approximation for general graphs. As a corollary, we substantially improve the approximation ratio of MRG.\par Furthermore, we generalize the RDO algorithm to the edge-weighted case and prove that it achieves a 0.501-approximation ratio. This result solves the open question by Chan et al. [4] and Gamlath et al. [12] about the existence of an algorithm that beats greedy in edge-weighted general graphs, where the greedy algorithm probes the edges in descending order of edge-weights. We also present a variant of the algorithm that achieves a (1-1/e)-approximation for edge-weighted bipartite graphs, which generalizes the (1-1/e)-approximation ratio of Gamlath et al. [12] for the stochastic setting to the case when the realizations of edges are arbitrarily correlated, where in the stochastic setting, there is a known probability associated with each pair of vertices that indicates the probability that an edge exists between the two vertices, when the pair is probed.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "39", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bender:2023:IHO, author = "Michael A. Bender and Alex Conway and Mart{\'\i}n Farach-Colton and William Kuszmaul and Guido Tagliavini", title = "Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once", journal = j-J-ACM, volume = "70", number = "6", pages = "40:1--40:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3625817", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3625817", abstract = "Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reason for this is that many of the fundamental properties that one desires from a hash table are difficult to achieve simultaneously; thus many variants offering different trade-offs have been proposed.\par This article introduces Iceberg hashing, a hash table that simultaneously offers the strongest known guarantees on a large number of core properties. Iceberg hashing supports constant-time operations while improving on the state of the art for space efficiency, cache efficiency, and low failure probability. Iceberg hashing is also the first hash table to support a load factor of up to 1 - o(1) while being stable, meaning that the position where an element is stored only ever changes when resizes occur. In fact, in the setting where keys are $ \Theta (\log n) $ bits, the space guarantees that Iceberg hashing offers, namely that it uses at most $ \log (|U| \over n) + O(n \log \log n) $ bits to store $n$ items from a universe $U$, matches a lower bound by Demaine et al. that applies to any stable hash table.\par Iceberg hashing introduces new general-purpose techniques for some of the most basic aspects of hash-table design. Notably, our indirection-free technique for dynamic resizing, which we call waterfall addressing, and our techniques for achieving stability and very-high probability guarantees, can be applied to any hash table that makes use of the front-yard\ldots{} backyard paradigm for hash table design.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "40", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Romero:2023:PAM, author = "Miguel Romero and Marcin Wrochna and Stanislav Zivn{\'y}", title = "Pliability and Approximating {Max-CSPs}", journal = j-J-ACM, volume = "70", number = "6", pages = "41:1--41:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3626515", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3626515", abstract = "We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint graphs (with \ldots{})", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "41", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Bhargava:2023:FAM, author = "Vishwas Bhargava and Sumanta Ghosh and Mrinal Kumar and Chandra Kanta Mohapatra", title = "Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications", journal = j-J-ACM, volume = "70", number = "6", pages = "42:1--42:??", month = dec, year = "2023", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3625226", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Dec 12 09:32:00 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3625226", abstract = "Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. Besides being a natural and fundamental question in computer algebra on its own, fast algorithms for this problem are also \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "42", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Ovens:2024:SCC, author = "Sean Ovens", title = "The Space Complexity of Consensus from Swap", journal = j-J-ACM, volume = "71", number = "1", pages = "1:1--1:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3631390", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3631390", abstract = "Nearly thirty years ago, it was shown that \(\Omega (\sqrt {n})\) read/write registers are needed to solve randomized wait-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches known algorithms. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "1", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Stein:2024:PPE, author = "Dario Stein and Sam Staton", title = "Probabilistic Programming with Exact Conditions", journal = j-J-ACM, volume = "71", number = "1", pages = "2:1--2:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3632170", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3632170", abstract = "We spell out the paradigm of exact conditioning as an intuitive and powerful way of conditioning on observations in probabilistic programs. This is contrasted with likelihood-based scoring known from languages such as Stan. We study exact conditioning in \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "2", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Georges:2024:CPV, author = "A{\"\i}na Linn Georges and Arma{\"e}l Gu{\'e}neau and Thomas {Van Strydonck} and Amin Timany and Alix Trieu and Dominique Devriese and Lars Birkedal", title = "{Cerise}: Program Verification on a Capability Machine in the Presence of Untrusted Code", journal = j-J-ACM, volume = "71", number = "1", pages = "3:1--3:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3623510", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3623510", abstract = "A capability machine is a type of CPU allowing fine-grained privilege separation using capabilities, machine words that represent certain kinds of authority. We present a mathematical model and accompanying proof methods that can be used for formal verification of functional correctness of programs running on a capability machine, even when they invoke and are invoked by unknown (and possibly malicious) code. We use a program logic called Cerise for reasoning about known code, and an associated logical relation, for reasoning about unknown code. The logical relation formally captures the capability safety guarantees provided by the capability machine. The Cerise program logic, logical relation, and all the examples considered in the paper have been mechanized using the Iris program logic framework in the Coq proof assistant.\par The methodology we present underlies recent work of the authors on formal reasoning about capability machines [Georges et al. 2021; Skorstengaard et al. 2019a; Van Strydonck et al. 2022], but was left somewhat implicit in those publications. In this paper we present a pedagogical introduction to the methodology, in a simpler setting (no exotic capabilities), and starting from minimal examples. We work our way up to new results about a heap-based calling convention and implementations of sophisticated object-capability patterns of the kind previously studied for high-level languages with object-capabilities, demonstrating that the methodology scales to such reasoning.", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "3", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chaudhury:2024:EET, author = "Bhaskar Ray Chaudhury and Jugal Garg and Kurt Mehlhorn", title = "{EFX} Exists for Three Agents", journal = j-J-ACM, volume = "71", number = "1", pages = "4:1--4:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3616009", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3616009", abstract = "We study the problem of distributing a set of indivisible goods among agents with additive valuations in a fair manner. The fairness notion under consideration is envy-freeness up to any good (EFX). Despite significant efforts by many researchers for \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "4", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Dutting:2024:OAT, author = "Paul D{\"u}tting and Zhe Feng and Harikrishna Narasimhan and David C. Parkes and Sai Srivatsa Ravindranath", title = "Optimal Auctions through Deep Learning: Advances in Differentiable Economics", journal = j-J-ACM, volume = "71", number = "1", pages = "5:1--5:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3630749", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3630749", abstract = "Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later, a full analytical understanding of the optimal \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "5", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Hu:2024:PAJ, author = "Xiao Hu and Yufei Tao", title = "Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation", journal = j-J-ACM, volume = "71", number = "1", pages = "6:1--6:??", month = feb, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3633512", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3633512", abstract = "We study equi-join computation in the massively parallel computation (MPC) model. Currently, a main open question under this topic is whether it is possible to design an algorithm that can process any join with load O(N polylog N/p$^{1 / \rho *}$ ) --- measured in the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "6", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Lichter:2024:CPT, author = "Moritz Lichter and Pascal Schweitzer", title = "Choiceless Polynomial Time with Witnessed Symmetric Choice", journal = j-J-ACM, volume = "71", number = "2", pages = "7:1--7:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3648104", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3648104", abstract = "We extend Choiceless Polynomial Time (CPT), the currently only remaining promising candidate in the quest for a logic capturing Ptime, so that this extended logic has the following property: for every class of structures for which isomorphism is definable,. \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "7", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Khamis:2024:CDP, author = "Mahmoud Abo Khamis and Hung Q. Ngo and Reinhard Pichler and Dan Suciu and Yisu Remy Wang", title = "Convergence of datalog over (Pre-) Semirings", journal = j-J-ACM, volume = "71", number = "2", pages = "8:1--8:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3643027", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3643027", abstract = "Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big data systems \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "8", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Kong:2024:DTP, author = "Yuqing Kong", title = "Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks", journal = j-J-ACM, volume = "71", number = "2", pages = "9:1--9:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3638239", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3638239", abstract = "$^1$ In the setting where participants are asked multiple similar possibly subjective multi-choice questions (e.g., Do you like Panda Express? Y/N; Do you like Chick-fil-A? Y/N), a series of peer prediction mechanisms have been designed to incentivize honest \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "9", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Cohen-Addad:2024:FDT, author = "Vincent Cohen-Addad and Debarati Das and Evangelos Kipouridis and Nikos Parotsidis and Mikkel Thorup", title = "Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor", journal = j-J-ACM, volume = "71", number = "2", pages = "10:1--10:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3639453", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3639453", abstract = "We consider the numerical taxonomy problem of fitting a positive distance function \({\mathcal {D}:{S\choose 2}\rightarrow \mathbb {R}_{\gt 0}}\) by a tree metric. We want a tree T with positive edge weights and including S among the vertices so that \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "10", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Neiger:2024:FMC, author = "Vincent Neiger and Bruno Salvy and {\'E}ric Schost and Gilles Villard", title = "Faster Modular Composition", journal = j-J-ACM, volume = "71", number = "2", pages = "11:1--11:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3638349", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3638349", abstract = "A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by n, the algorithm uses $O(n^{1.43})$ field operations, breaking through the 3/2 \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "11", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Huang:2024:BAO, author = "Shang-En Huang and Seth Pettie and Leqi Zhu", title = "{Byzantine} Agreement with Optimal Resilience via Statistical Fraud Detection", journal = j-J-ACM, volume = "71", number = "2", pages = "12:1--12:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3639454", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3639454", abstract = "Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that can adaptively corrupt up to f {$<$} n/3 parties. Moreover, the problem is \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "12", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Balcan:2024:LBG, author = "Maria-Florina Balcan and Travis Dick and Tuomas Sandholm and Ellen Vitercik", title = "Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization", journal = j-J-ACM, volume = "71", number = "2", pages = "13:1--13:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3637840", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3637840", abstract = "Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and non-convex problems. For example, they are the foremost method for solving (mixed) integer programs and constraint satisfaction problems. Tree \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "13", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Vale:2024:CTL, author = "Arthur Oliveira Vale and Zhong Shao and Yixuan Chen", title = "A Compositional Theory of Linearizability", journal = j-J-ACM, volume = "71", number = "2", pages = "14:1--14:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3643668", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3643668", abstract = "Compositionality is at the core of programming languages research and has become an important goal toward scalable verification of large systems. Despite that, there is no compositional account of linearizability, the gold standard of correctness for \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "14", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Chou:2024:SAA, author = "Chi-Ning Chou and Alexander Golovnev and Madhu Sudan and Santhoshini Velusamy", title = "Sketching Approximability of All Finite {CSPs}", journal = j-J-ACM, volume = "71", number = "2", pages = "15:1--15:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3649435", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3649435", abstract = "A constraint satisfaction problem (CSP), \(\textsf {Max-CSP}(\mathcal {F})\), is specified by a finite set of constraints \(\mathcal {F}\subseteq \lbrace [q]^k \rightarrow \lbrace 0,1\rbrace \rbrace\) for positive integers q and k. An instance of the \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "15", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } @Article{Esparza:2024:ENL, author = "Javier Esparza and Rub{\'e}n Rubio and Salomon Sickert", title = "Efficient Normalization of Linear Temporal Logic", journal = j-J-ACM, volume = "71", number = "2", pages = "16:1--16:??", month = apr, year = "2024", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/3651152", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Apr 23 12:14:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib", URL = "https://dl.acm.org/doi/10.1145/3651152", abstract = "In the mid 1980s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of Linear Temporal Logic (LTL) with past operators) is equivalent to a formula of the form \ldots{}", acknowledgement = ack-nhfb, ajournal = "J. Assoc. Comput. Mach.", articleno = "16", fjournal = "Journal of the ACM", journal-URL = "https://dl.acm.org/loi/jacm", } %%% ==================================================================== %%% Cross-referenced entries come last: @Article{Lamport:1982:BGP, author = "Leslie Lamport and Robert Shostak and Marshall Pease", title = "The {Byzantine} Generals Problem", journal = j-TOPLAS, volume = "4", number = "3", pages = "382--401", month = jul, year = "1982", CODEN = "ATPSDT", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Sat Oct 17 12:24:31 1998", bibsource = "Compiler/bevan.bib; Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib; Database/dbase.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; Theory/ProbAlgs.bib", abstract = "Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one or more of them may be traitors who will try and confuse the others. The problem is to find an algorithm to ensure that the loyal generals will reach agreement. It is shown that, using only oral messages, this problem is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals. With unforgeable written messages, the problem is solvable for any number of generals and possible traitors. Applications of the solutions to reliable computer systems are then discussed.", acknowledgement = ack-pb, ajournal = "ACM Trans. Program. Lang. Syst.", checked = "19940302", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", keywords = "fault tolerance; interactive consistency; network communications; network operating systems; reliability", remark = "They proved that Byzantine agreement (the subject of Section \ref{sec-byzantine}) cannot be reached unless fewer than one-third of the processes are faulty. This result assumes that authentication, i.e., the crypting of messages to make them unforgeable, is not used. With unforgeable messages, they show that the problem is solvable for any $ n \geq t > 0 $, where $n$ is the total number of processes and $t$ is the number of faulty processes.", source = "Dept. Library", } @Article{Fushimi:1990:RNG, author = "Masanori Fushimi", title = "Random number generation with the recursion {$ X_t = X_{t - 3p} \oplus X_{t - 3q} $}", journal = j-J-COMPUT-APPL-MATH, volume = "31", number = "1", pages = "105--118", day = "24", month = jul, year = "1990", CODEN = "JCAMDI", DOI = "https://doi.org/10.1016/0377-0427(90)90341-V", ISSN = "0377-0427 (print), 1879-1778 (electronic)", ISSN-L = "0377-0427", bibdate = "Tue Dec 27 06:57:58 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib", URL = "http://www.sciencedirect.com/science/article/pii/037704279090341V", acknowledgement = ack-nhfb, ajournal = "J. Comput. Appl. Math.", fjournal = "Journal of Computational and Applied Mathematics", journal-URL = "http://www.sciencedirect.com/science/journal/03770427", keywords = "$M$-sequence; generalized feedback shift register (GFSR) algorithm; multidimensional uniformity; statistical tests", remark = "Special issue on random numbers and simulation, guest editors: J. Lehn and H. Neunzert.", remark-2 = "See \cite{Ripley:1990:TPN} for a new implementation of Fushimi's GFSR generator that reduces array storage from $8 P$ to $3 P$ (where $P = 521$ is related to the generator period, $2^P$).", remark-3 = "Fushima points out some errors in \cite{Lewis:1973:GFS} that caused later authors to reject GFSR generators. Fushima improves the randomness of the Lewis and Payne generator, and speeds up its initialization by a factor of 250. Tests with a C translation of Ripley's variant of the Fushima/Saito Fortran code show that the generator is fast, and capable of passing all of the Diehard Battery suite, except for a small p value (0.000005) for the OVERLAPPING SUMS tests when only the top bit of each word is used to produce a random bit stream.", }