Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.30",
%%%     date            = "26 May 2022",
%%%     time            = "07:21:17 MDT",
%%%     filename        = "sigact.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",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "07248 63166 265759 2639692",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                       beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "ACM SIGACT News; BibTeX; bibliography",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is an almost-complete bibliography of
%%%                        ACM SIGACT News (CODEN SIGNDM, ISSN 0163-5700
%%%                        (print), 1943-5827 (electronic)), the
%%%                        newsletter of the ACM Special Interest Group
%%%                        on Automata and Computability Theory,
%%%                        covering 1969--date.  The journal began
%%%                        publishing with volume 1, number 1, in April
%%%                        1969, and usually appears three or four times
%%%                        yearly.
%%%
%%%                        From 1969 to 1972, issues were assigned in
%%%                        ascending order, without volume numbers.
%%%                        Volume numbering began in 1973 with volume 5,
%%%                        with issue numbering restarted in each
%%%                        volume. We therefore assign yearly volumes to
%%%                        the preceding issues.
%%%
%%%                        The journal has a Web site at
%%%
%%%                            https://dl.acm.org/loi/sigact
%%%
%%%                        At version 1.30, the year coverage looked
%%%                        like this:
%%%
%%%                             1963 (   1)    1983 (  25)    2003 (  66)
%%%                             1964 (   0)    1984 (  24)    2004 (  75)
%%%                             1965 (   0)    1985 (  13)    2005 (  90)
%%%                             1966 (   1)    1986 (  21)    2006 (  82)
%%%                             1967 (   2)    1987 (  12)    2007 (  79)
%%%                             1968 (   0)    1988 (  10)    2008 ( 104)
%%%                             1969 (   2)    1989 (  27)    2009 ( 115)
%%%                             1970 (   8)    1990 (  24)    2010 ( 105)
%%%                             1971 (   5)    1991 (  30)    2011 (  79)
%%%                             1972 (  21)    1992 (  30)    2012 (  86)
%%%                             1973 (  15)    1993 (  50)    2013 (  81)
%%%                             1974 (  23)    1994 (  35)    2014 (  73)
%%%                             1975 (  14)    1995 (  50)    2015 (  56)
%%%                             1976 (  23)    1996 (  40)    2016 (  52)
%%%                             1977 (  16)    1997 (  64)    2017 (  50)
%%%                             1978 (  25)    1998 (  60)    2018 (  53)
%%%                             1979 (  18)    1999 (  61)    2019 (  45)
%%%                             1980 (  11)    2000 (  69)    2020 (  45)
%%%                             1981 (   6)    2001 (  65)    2021 (  48)
%%%                             1982 (  17)    2002 (  64)    2022 (   7)
%%%
%%%                             Article:       1944
%%%                             Book:           417
%%%                             Proceedings:     11
%%%                             TechReport:       1
%%%
%%%                             Total entries: 2373
%%%
%%%                        The ACM Portal database lacks data for 1(2)
%%%                        1969, 2(5) 1970, and 12(2) 1980 [Special
%%%                        issue on the proceedings of the annual ACM
%%%                        Symposium on Theory of Computing], but
%%%                        otherwise, coverage is believed to be
%%%                        complete.  If indeed ACM SIGACT News 12(2)
%%%                        corresponds to the STOC '80 conference,
%%%                        entries for it are available in the companion
%%%                        file, stoc1980.bib.
%%%
%%%                        Because the journal contains more than 330
%%%                        book reviews, BibTeX entries are supplied for
%%%                        most of those books.  Book-review entries
%%%                        have been mostly regularized, and supplied
%%%                        with cross-references to the reviewed books;
%%%                        only a single entry, Gasarch:2007:JRB, lacks
%%%                        book links.
%%%
%%%                        This bibliography has been constructed
%%%                        primarily from the ACM Portal data for the
%%%                        journal, but merged with data for numerous
%%%                        entries from the TeX User Group, BibNet
%%%                        Project, and Karlsruhe bibliography archives.
%%%                        Numerous errors have been corrected.  In
%%%                        particular, many of the book reviews in the
%%%                        ACM Portal journal tables of contents have
%%%                        incorrect authors; some have been corrected
%%%                        by consulting the PDF files for the reviews,
%%%                        but author errors are likely to remain in
%%%                        others.  They will be corrected in this
%%%                        bibliography if readers report the errors.
%%%
%%%                        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 \booktitle \def \booktitle#1{{{\em #1}}} \fi"
 # "\ifx \undefined \circled \def \circled #1{(#1)}\fi"
 # "\ifx \undefined \reg \def \reg {\circled{R}} \fi"
 # "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi "
}

%%%=====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%%=====================================================================
%%% Journal abbreviations:
@String{j-CACM                  = "Communications of the ACM"}

@String{j-COMP-PHYS-COMM        = "Computer Physics Communications"}

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

@String{j-SIGACT                = "ACM SIGACT News"}

%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-A-K-PETERS          = "A. K. Peters, Ltd."}
@String{pub-A-K-PETERS:adr      = "Wellesley, MA, USA"}

@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-AMS                 = "American Mathematical Society"}
@String{pub-AMS:adr             = "Providence, RI, USA"}

@String{pub-APA                 = "American Psychological Association"}
@String{pub-APA:adr             = "Washington, DC, USA"}

@String{pub-APRESS              = "Apress"}
@String{pub-APRESS:adr          = "Berkeley, CA, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-BASIC               = "Basic Books"}
@String{pub-BASIC:adr           = "New York, NY, USA"}

@String{pub-BENCUM              = "Benjamin\slash Cummings Pub. Co."}
@String{pub-BENCUM:adr          = "Menlo Park, CA, USA"}

@String{pub-BIRKHAUSER          = "Birkh{\"a}user Verlag"}
@String{pub-BIRKHAUSER:adr      = "Basel, Switzerland"}

@String{pub-BOYD-FRASER         = "boyd \& fraser"}
@String{pub-BOYD-FRASER:adr     = "One Corporate Place, Suite 205, Danvers, MA,
                                    USA 01923, USA"}

@String{pub-BROOKS-COLE         = "Brooks\slash Cole Publishing Co."}
@String{pub-BROOKS-COLE:adr     = "Pacific Grove, CA, USA"}

@String{pub-CAMBRIDGE           = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr       = "Cambridge, UK"}

@String{pub-CHAPMAN-HALL        = "Chapman and Hall, Ltd."}
@String{pub-CHAPMAN-HALL:adr    = "London, UK"}

@String{pub-CHAPMAN-HALL-CRC    = "Chapman and Hall/CRC"}
@String{pub-CHAPMAN-HALL-CRC:adr = "Boca Raton, FL, USA"}

@String{pub-CLARENDON           = "Clarendon Press"}
@String{pub-CLARENDON:adr       = "New York, NY, USA"}

@String{pub-CORNELL             = "Cornell University Press"}
@String{pub-CORNELL:adr         = "Ithaca, NY, USA"}

@String{pub-CRC                 = "CRC Press"}
@String{pub-CRC:adr             = "2000 N.W. Corporate Blvd., Boca Raton, FL
                                    33431-9868, USA"}

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

@String{pub-CSP                 = "Computer Science Press, Inc."}
@String{pub-CSP:adr             = "11 Taft Court, Rockville, MD 20850, USA"}

@String{pub-DEKKER              = "Marcel Dekker, Inc."}
@String{pub-DEKKER:adr          = "New York, NY, USA"}

@String{pub-DOUBLEDAY           = "Doubleday"}
@String{pub-DOUBLEDAY:adr       = "New York, NY, USA"}

@String{pub-DOVER               = "Dover Publications, Inc."}
@String{pub-DOVER:adr           = "New York, NY, USA"}

@String{pub-ELSEVIER            = "Elsevier"}
@String{pub-ELSEVIER:adr        = "Amsterdam, The Netherlands"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300, Silver
                                   Spring, MD 20910, USA"}

@String{pub-IOS                 = "IOS Press"}
@String{pub-IOS:adr             = "Amsterdam, The Netherlands"}

@String{pub-JONES-BARTLETT      = "Jones and Bartlett"}
@String{pub-JONES-BARTLETT:adr  = "Boston, MA, USA"}

@String{pub-KLUWER              = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht, The
                                    Netherlands"}

@String{pub-LIBRARIES-UNLIMITED = "Libraries Unlimited"}

@String{pub-MACMILLAN           = "Macmillan Publishing Company"}
@String{pub-MACMILLAN:adr       = "New York, NY, USA"}

@String{pub-MANNING             = "Manning"}
@String{pub-MANNING:adr         = "Greenwich, CT, USA"}

@String{pub-MATH-ASSOC-AMER     = "Mathematical Association of America"}
@String{pub-MATH-ASSOC-AMER:adr = "Washington, DC, USA"}

@String{pub-MCGRAW-HILL         = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr     = "New York, NY, USA"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

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

@String{pub-NORTH-HOLLAND       = "North-Holland Publishing Co."}
@String{pub-NORTH-HOLLAND:adr   = "Amsterdam, The Netherlands"}

@String{pub-OLDENBOURG          = "R. Oldenbourg"}
@String{pub-OLDENBOURG:adr      = "M{\"u}nchen, Germany"}

@String{pub-OXFORD              = "Oxford University Press"}
@String{pub-OXFORD:adr          = "Walton Street, Oxford OX2 6DP, UK"}

@String{pub-PH                  = "Pren{\-}tice-Hall"}
@String{pub-PH:adr              = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PHYSICA-VERLAG      = "Physica-Verlag"}
@String{pub-PHYSICA-VERLAG:adr  = "Vienna, Austria"}

@String{pub-PITMAN              = "Pitman Publishing Ltd."}
@String{pub-PITMAN:adr          = "London, UK"}

@String{pub-PRINCETON           = "Princeton University Press"}
@String{pub-PRINCETON:adr       = "Princeton, NJ, USA"}

@String{pub-PWS                 = "PWS-Kent Publishing Company, Division
                                   of Wadsworth, Inc."}
@String{pub-PWS:adr             = "20 Park Plaza, Boston, MA 02116, USA"}

@String{pub-ROUTLEDGE           = "Routledge \& Kegan Paul"}
@String{pub-ROUTLEDGE:adr       = "London, UK and New York, NY, USA"}

@String{pub-SCI-RES-ASSOC       = "Science Research Associates"}
@String{pub-SCI-RES-ASSOC:adr   = "Chicago, IL, USA"}

@String{pub-SIAM                = "Society for Industrial and Applied
                                  Mathematics"}
@String{pub-SIAM:adr            = "Philadelphia, PA, USA"}

@String{pub-SPIE                = "SPIE Optical Engineering Press"}
@String{pub-SPIE:adr            = "Bellingham, WA, USA"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}

@String{pub-TAYLOR-FRANCIS      = "Taylor and Francis"}
@String{pub-TAYLOR-FRANCIS:adr  = "Boca Raton, FL, USA"}

@String{pub-U-CHICAGO           = "University of Chicago Press"}
@String{pub-U-CHICAGO:adr       = "Chicago, IL, USA"}

@String{pub-U-TEXAS             = "University of Texas Press"}
@String{pub-U-TEXAS:adr         = "Austin, TX, USA"}

@String{pub-WAITE-GROUP         = "Waite Group Press"}
@String{pub-WAITE-GROUP:adr     = "Corte Madera, CA, USA"}

@String{pub-WALKER              = "Walker and Company"}
@String{pub-WALKER:adr          = "435 Hudson Street, New York, NY 10014, USA"}

@String{pub-WEIDENFELD-NICOLSON = "Weidenfeld and Nicolson"}
@String{pub-WEIDENFELD-NICOLSON:adr = "London, UK"}

@String{pub-WI                  = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WI:adr              = "New York, NY, USA"}

@String{pub-WILEY               = "John Wiley"}
@String{pub-WILEY:adr           = "New York, NY, USA"}

@String{pub-WINTHROP-PUB        = "Winthrop Publishers"}
@String{pub-WINTHROP-PUB:adr    = "Cambridge, MA, USA"}

@String{pub-WOLFRAM-MEDIA       = "Wolfram Media"}
@String{pub-WOLFRAM-MEDIA:adr   = "Champaign, IL, USA"}

@String{pub-WORLD-SCI           = "World Scientific Publishing Co."}
@String{pub-WORLD-SCI:adr       = "Singapore; Philadelphia, PA, USA; River
                                    Edge, NJ, USA"}

%%% ====================================================================
%%% Bibliography entries, in publication order:
@Article{Muller:1969:UBF,
  author =       "D. E. Muller",
  title =        "Universal {Boolean} functions",
  journal =      j-SIGACT,
  volume =       "1",
  number =       "1",
  pages =        "8--11",
  year =         "1969",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247030.1247032",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

%%% ACM Portal has empty Web page for SIGACT volume 1 number 2 July 1969
%%% The 4-page issue has only brief notes and announcements
@Article{Cudia:1969:DDU,
  author =       "Dennis F. Cudia",
  title =        "The degree diagram of undecidable problems of formal
                 grammars",
  journal =      j-SIGACT,
  volume =       "1",
  number =       "3",
  pages =        "7--8",
  year =         "1969",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247043.1247045",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Let $O$ be the degree of all solvable problems, let
                 $O'$ be the degree of unsolvability of the halting
                 problem for Turing machines, let $O''$ be the degree of
                 unsolvability of the problem of whether an arbitrary
                 Turing machine eventually halts for only finitely many
                 finite initial configurations, and let $O'''$ be the
                 degree of unsolvability of the problem of whether an
                 arbitrary Turing machine never halts for only finitely
                 many finite initial configurations. Let $\leq $ denote
                 the partial ordering of Turing reducibility. Then using
                 results and methods of 1. and 2., the following degree
                 diagram refinement of a table of solvable and
                 unsolvable problems, which appears in 3., p. 230, may
                 be obtained.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fischer:1970:NIR,
  author =       "M. Fischer and A. Meyer and P. O'Neil and M.
                 Paterson",
  title =        "A note on independence of a regularity-preserving
                 operator",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "4",
  pages =        "3--7",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247047.1247050",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Paz:1970:EWR,
  author =       "A. Paz",
  title =        "Events which are not representable by a probabilistic
                 automaton",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "4",
  pages =        "8--11",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247047.1247051",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chaitin:1970:MDL,
  author =       "G. J. Chaitin",
  title =        "To a Mathematical Definition of ``Life''",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "4",
  pages =        "12--18",
  month =        jan,
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247047.1247052",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/cbofn.bib;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "'Life' and its 'evolution' are fundamental concepts
                 that have not yet been formulated in precise
                 mathematical terms, although some efforts in this
                 direction have been made. We suggest a possible point
                 of departure for a mathematical definition of 'life'.
                 This definition is based on the computer and is closely
                 related to recent analyses of 'inductive inference' and
                 'randomness'. A living being is a unity; It is simpler
                 to view a living organism as a whole than as the sum of
                 its parts. If we want to compute a complete description
                 of a region of space-time that is a living being, the
                 program will be smaller in size if the calculation is
                 done all together, than if it is done by independently
                 calculating descriptions of parts of the region and
                 then putting them together.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  remark =       "A definition of life based on the notion that a living
                 organism is its own simplest description.",
}

@Article{Hutchins:1970:SSC,
  author =       "Sandra E. Hutchins",
  title =        "Stochastic sources for context-free languages",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "4",
  pages =        "19--19",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247047.1247048",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The concept of a stochastic source of a context-free
                 language is presented and one possible source model
                 based on a probabilistic grammar is defined. It is
                 shown that this source is equivalent to an infinite
                 Markov chain which can be defined recursively. Various
                 statistics of the Markov chain are derived. An analogue
                 of the Greibach Normal Form theorem is presented, which
                 then allows for the construction of a Markov source
                 with a single terminal symbol per transition. The class
                 of probability distributions generable over
                 context-free languages by such sources is examined.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

%%% ACM Portal missing Web page for SIGACT volume 2 number 5 1970
@Article{Ellis:1970:NCF,
  author =       "Clarence A. Ellis",
  title =        "Non-context-free probabilistic languages",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "6",
  pages =        "9--14",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247054.1247056",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We consider the following problems: (a) Is there any
                 Probabilistic Language which is not Regular? (b) Is
                 there any Probabilistic Language which is not Context
                 Free?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Robertson:1970:CDL,
  author =       "Edward L. Robertson",
  title =        "A corrected definition of ``local speed-up''",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "6",
  pages =        "15--16",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247054.1247057",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pager:1970:SOP,
  author =       "David Pager",
  title =        "A solution to an open problem by {Knuth}",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "7",
  pages =        "9--10",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247059.1247060",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In Knuth [2] the problem of minimizing the number of
                 sets of states required for his parsing algorithm is
                 raised as an open question. We solve this problem by
                 showing it is equivalent to that of finding the minimal
                 representation for an incompletely specified finite
                 automaton. A solution may thus be obtained using the
                 known methods of the latter. This result may be viewed
                 in contrast to Pager [8] and [9] where it is shown that
                 it is not generally possible to make optimizations of
                 this kind.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Isard:1970:TOQ,
  author =       "Stephen D. Isard and Arnold M. Zwicky",
  title =        "Three open questions in the theory of one-symbol
                 {Smullyan} systems",
  journal =      j-SIGACT,
  volume =       "2",
  number =       "7",
  pages =        "11--19",
  year =         "1970",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247059.1247061",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Havel:1971:WCM,
  author =       "Ivan M. Havel",
  title =        "Weak complexity measures",
  journal =      j-SIGACT,
  volume =       "3",
  number =       "8",
  pages =        "21--30",
  month =        jan,
  year =         "1971",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247063.1247064",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Buttelmann:1971:SSS,
  author =       "H. W. Buttelmann",
  title =        "Syntax-semantics systems as structure manipulation
                 systems: phrase structure grammars and generalized
                 finite automata",
  journal =      j-SIGACT,
  volume =       "3",
  number =       "9",
  pages =        "10--10",
  month =        apr,
  year =         "1971",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247066.1247067",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The graphic representation for the structural
                 description of an arbitrary semi-Thue derivation is
                 called a derivation structure. Arbitrary phrase
                 structure grammars and generalized finite automata are
                 regarded primarily as derivation structure definition
                 systems. The languages they define are related in a
                 direct way to their defined sets of structures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chaitin:1971:CCG,
  author =       "G. J. Chaitin",
  title =        "Computational complexity and {G{\"o}del}'s
                 incompleteness theorem",
  journal =      j-SIGACT,
  volume =       "3",
  number =       "9",
  pages =        "11--12",
  month =        apr,
  year =         "1971",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247066.1247068",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Given any simply consistent formal theory F of the
                 state complexity L(S) of finite binary sequences S as
                 computed by 3-tape-symbol Turing machines, there exists
                 a natural number $L(F)$ such that $L(S) > n$ is
                 provable in $F$ only if $n < L(F)$. On the other hand,
                 almost all finite binary sequences $S$ satisfy $L(S) <
                 L(F)$. The proof resembles Berry's paradox, not the
                 Epimenides nor Richard paradoxes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

%%% Volume 3 number 10 July 1971 contains only notes:
%%%
%%%    Chairman's Column ..................................................... 3
%%%    Secretary's Report .................................................... 4
%%%    Editor's Column ....................................................... 7
%%%    Bibliographical Entries Wanted ........................................ 8
%%%    News Notes ............................................................ 9
%%%    New Journals ......................................................... 11
%%%    Guide to Presentation of Papers ...................................... 12
%%%    Conference Report: PIB Symposium ..................................... 13
%%%    Call for papers: Conference on Proving Assertions .................... 16
%%%    International Symposium .............................................. 17
%%%    Additional Conferences ............................................... 19
%%%    Technical Reports .................................................... 20
%%%    Membership Application ............................................... 24
%%%
%%% Volume 3 number 11 August 1971 contains only a 34-page membership list
@Article{Longo:1971:ATD,
  author =       "Giuseppe Longo",
  title =        "Axioms for time dependence of resource consumption in
                 computing recursive functions",
  journal =      j-SIGACT,
  volume =       "3",
  number =       "12",
  pages =        "14--24",
  year =         "1971",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1247036.1247037",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 17:48:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Any formal definition of effective computability
                 includes the idea of graduality of computation: whether
                 it is a matter of Markov's algorithms (ANM) or of
                 Turing Machines (TM) or of any other equivalent
                 mathematical system, the elaboration progresses by
                 discrete and successive instants.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Reeker:1971:NBN,
  author =       "L. Reeker",
  title =        "A note on a {Badly Nondeterministic} automaton",
  journal =      j-SIGACT,
  volume =       "3",
  number =       "13",
  pages =        "22--24",
  month =        dec,
  year =         "1971",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1810923.1810924",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A `Badly Nondeterministic' (BN) n-state acceptor is a
                 machine for which any deterministic finite state
                 acceptor for the same language requires 2$^n$ states. A
                 family of such machines, attributed to G. Ott, was
                 described in (1). Taking liberties with the notation of
                 that paper, we will call the family {R$_n$ }n > 0 (see
                 figure below). Another family of BN automata, which we
                 will call {B$_n$ }n > 0, was described in (2). These
                 latter BN automata are the subject of this note.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Milner:1972:IAS,
  author =       "Robin Milner",
  title =        "Implementation and applications of {Scott}'s logic for
                 computable functions",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "1--6",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807067",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The basis for this paper is a logic designed by Dana
                 Scott [1] in 1969 for formalizing arguments about
                 computable functions of higher type. This logic uses
                 typed combinators, and we give a more or less direct
                 translation into typed {\&}lgr;-calculus, which is an
                 easier formalism to use, though not so easy for the
                 metatheory because of the presence of bound variables.
                 We then describe, by example only, a proof-checker
                 program which has been implemented for this logic; the
                 program is fully described in [2]. We relate the
                 induction rule which is central to the logic to two
                 more familiar rules --- Recursion Induction and
                 Structural Induction --- showing that the former is a
                 theorem of the logic, and that for recursively defined
                 structures the latter is a derived rule of the logic.
                 Finally we show how the syntax and semantics of a
                 simple programming language may be described completely
                 in the logic, and we give an example of a theorem which
                 relates syntactic and semantic properties of programs
                 and which can be stated and proved within the logic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Burstall:1972:ADP,
  author =       "Rod M. Burstall",
  title =        "An algebraic description of programs with assertions,
                 verification and simulation",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "7--14",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807068",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A program in flow diagram form is described by a
                 function from a free category to the category of sets
                 and relations. Attaching assertions to it is described
                 as a natural transformation and so is simulation of one
                 program by another with the same shape of flow diagram.
                 These notions are used to prove the theorems justifying
                 Floyd's method of proving correctness by verification
                 and Milner's method of proving simulation, restricted
                 to programs of similar form. The treatment is novel but
                 the results are not new, except that non-deterministic
                 programs are dealt with throughout.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Allen:1972:DAD,
  author =       "C. David Allen",
  title =        "Derivation of axiomatic definitions of programming
                 languages from algorithmic definitions",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "15--26",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807069",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Language definitions by abstract interpreters are
                 appropriate to the design and development of a
                 language. Axiomatic definitions are more appropriate to
                 proving program properties and verification of
                 compilers. The proof methods of Manna and Ashcroft can
                 be applied to an algorithmic definition in, e.g., the
                 Vienna Definition Language to deduce theorems which
                 constitute an axiomatic definition of precisely the
                 same language. The process and techniques are
                 explained, and illustrated on a simple language of
                 assignment statements.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Manna:1972:IMP,
  author =       "Zohar Manna and Stephen Ness and Jean Vuillemin",
  title =        "Inductive methods for proving properties of programs",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "27--50",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807070",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We have two main purposes in this paper. First, we
                 clarify and extend known results about computation of
                 recursive programs, emphasizing the difference between
                 the theoretical and practical approaches. Secondly, we
                 present and examine various known methods for proving
                 properties of recursive programs. We discuss in detail
                 two powerful inductive methods, computational induction
                 and structural induction, illustrating their
                 applications by various examples. We also briefly
                 discuss some other related methods. Our aim in this
                 work is to introduce inductive methods to as wide a
                 class of readers as possible and to demonstrate their
                 power as practical techniques. We ask the forgiveness
                 of our more theoretical-minded colleagues for our
                 occasional choice of clarity over precision.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ashcroft:1972:PCM,
  author =       "E. A. Ashcroft",
  title =        "Program correctness methods and language definition",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "51--57",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807071",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The development of the method of proving correctness
                 of programs is considered in relation to methods of
                 defining programming languages. Informal methods are
                 given for checking proposed adaptations of the
                 correctness method to new programming languages. It is
                 shown how correctness-formulae can be considered as
                 semantic definitions of programs, and how Burstall's
                 logical language definitions can be considered as
                 correctness formulae.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadiou:1972:RDP,
  author =       "J. M. Cadiou and Zohar Manna",
  title =        "Recursive definitions of partial functions and their
                 computations",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "58--65",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807072",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The object of this paper is to present a syntactic and
                 semantic model for recursive definitions, and to study
                 the relation between their computed functions and their
                 fixpoints. The recursive definitions that we consider
                 are syntactic generalizations of those introduced in
                 [2] by Kleene and in [5] by McCarthy. Each recursive
                 definition yields two classes of fixpoint partial
                 functions ('fixpoints over $D \cup \omega$' and
                 `fixpoints over $D$'), and a class of computed partial
                 functions obtained by applying different computation
                 rules to the recursive definition. In this work we
                 first describe the relations between the computed
                 functions and the fixpoints over $D \cup \omega$
                 (Theorem 1), and between the computed functions and the
                 fixpoints over $D$ (Theorem 2). Our main interest is in
                 the class of fixpoints (over $D$ or $D \cup \omega$)
                 which are also computed functions of the recursive
                 definition.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hull:1972:CNA,
  author =       "T. E. Hull and W. H. Enright and A. E. Sedgwick",
  title =        "The correctness of numerical algorithms",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "66--73",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807073",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Structured programming and the use of assertions are
                 two basic techniques needed in organizing proofs of the
                 correctness of algorithms. These techniques can be
                 combined with theorems in numerical analysis to produce
                 proofs of the correctness of numerical algorithms. A
                 simple algorithm for finding the sum of $n$ numbers is
                 first used to show how assertions can be modified to
                 take account of the effect of roundoff. A so-called
                 backward error analysis then leads to a proof that the
                 algorithm is correct in the sense that it produces
                 exact results for slightly perturbed problems.
                 Alternative points of view are possible, and one of the
                 distinguishing features of numerical algorithms is that
                 there usually are a number of different senses in which
                 one might want to prove them correct. Two other more
                 substantial algorithms, one for solving linear
                 algebraic equations and one for solving differential
                 equations, are then used to show how structured
                 programming and the use of assertions can be combined
                 with error analyses of fairly complicated numerical
                 processes to provide proofs of correctness. One of
                 these algorithms involves roundoff error while the
                 other is affected primarily by truncation error.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Paterson:1972:DPC,
  author =       "Michael S. Paterson",
  title =        "Decision problems in computational models",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "74--82",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807074",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Some of the assertions about programs which we might
                 be interested in proving are concerned with
                 correctness, equivalence, accessibility of subroutines
                 and guarantees of termination. We should like to
                 develop techniques for determining such properties
                 efficiently and intelligently wherever possible. Though
                 theory tells us that for a realistic programming
                 language almost any interesting property of the
                 behaviour is effectively undecidable, this situation
                 may not be intolerable in practice. An unsolvability
                 result just gives us warning that we may not be able to
                 solve all of the problems we are presented with, and
                 that some of the ones we can solve will be very hard.
                 In such circumstances it is very reasonable to try and
                 determine necessary or sufficient conditions on
                 programs for our techniques to be assured of success;
                 however, in this paper we shall discuss a more
                 qualitative, indirect, approach. We consider a range of
                 more or less simplified computer models, chosen
                 judiciously to exemplify some particular feature or
                 features of computation. A demonstration of
                 unsolvability in such a model reveals more accurately
                 those sources which can contribute to unsolvability in
                 a more complicated structure. On the other hand a
                 decision procedure may illustrate a technique of
                 practical use. It is our thesis that this kind of
                 strategy of exploration can and will yield insight and
                 practical advances in the theory of computation.
                 Provided that the model retains some practical
                 relevance, the dividends are the greater the nearer the
                 decision problem lies to the frontier between
                 solvability and unsolvability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Garland:1972:TRS,
  author =       "Stephen J. Garland and David C. Luckham",
  title =        "Translating recursion schemes into program schemes",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "83--96",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807075",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Here and in a further paper [2] we study translations
                 between schemes and related equivalence problems, i.e.,
                 problems of determining whether two schemes in a given
                 class are equivalent. In particular, we are concerned
                 with the question of developing methods for attacking
                 these problems. It seems to us that some `general
                 methods' ought to exist or, at least, a general form
                 ought to be given to the existing `tricks'. In these
                 papers we present four methods: applying the theory of
                 formal languages, programming, measuring the complexity
                 of a computation, and `cutting and pasting' (roughly
                 speaking, the application of a method due to Rabin and
                 Scott [8] to bound the search necessary to determine if
                 two schemes will behave differently). Although a few of
                 the results are true for some general notion of scheme,
                 we have nearly always had in mind, for the sake of
                 illustration, just three specific classes of schemes:
                 program schemes, program schemes augmented with
                 counters, and recursively defined schemes. The greater
                 part of the study is restricted to monadic schemes
                 (i.e., schemes containing only functions and predicates
                 of a single argument), and in the case of recursively
                 defined schemes, we are concerned almost exclusively
                 with the single variable monadic recursion schemes
                 introduced by de Bakker and Scott in [1].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Strong:1972:PPU,
  author =       "H. R. Strong and S. A. Walker",
  title =        "Properties preserved under recursion removal",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "97--103",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807076",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper we report research which is going on at
                 present. Rather than presenting major results, we have
                 selected a number of partial results and techniques in
                 order to indicate a direction we think is promising. In
                 the first section we review methods for converting a
                 program with a calling structure involving recursion
                 into one without such a structure. In the second
                 section we discuss the separation of the aspects of
                 control and storage in this recursion removal process.
                 We show, by example, how the separation provides the
                 possibility of preserving properties other than
                 functional equivalence. These two sections provide a
                 slight generalization of and complement work presented
                 in the expository paper [S2]. In this third section we
                 illustrate implications of invertibility of operations
                 with respect to the recursion removal process. The
                 central example of this section is the Ackerman
                 functional, obtained by schematizing a version of the
                 Ackerman function. With this example, we note that a
                 recursion need not be convertible to a primitive
                 recursion in order to be removable.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fischer:1972:LCS,
  author =       "Michael J. Fischer",
  title =        "Lambda calculus schemata",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "104--109",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807077",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A lambda calculus schema is an expression of the
                 lambda calculus augmented by uninterpreted constant and
                 function symbols and thus is an abstraction of
                 programming languages such as LISP which permit
                 functions to be passed to or returned from other
                 functions. We then consider two natural implementation
                 strategies: the retention strategy in which all
                 variable bindings are retained until no longer needed
                 (implying the use of some sort of garbage collected
                 store) and the deletion strategy, modelled after the
                 usual stack implementation of ALGOL-60, in which
                 variable bindings are destroyed when control leaves the
                 procedure (or block) in which they were created. Berry
                 shows that the deletion strategy implementation is not
                 `correct' for a wide class of languages in the sense
                 that it is not equivalent to natural extensions of the
                 copy rule of ALGOL to such languages, whereas the
                 retention strategy is correct in that sense. We show,
                 however, that no real power is lost in restricting
                 oneself to a deletion strategy implementation, for any
                 program can be translated into an equivalent one which
                 will work correctly under such an implementation. The
                 proof makes no use of the particular primitive
                 functions and data of the language and hence is true of
                 the corresponding schemata under all interpretations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McGowan:1972:CML,
  author =       "Clement McGowan",
  title =        "The {Contour Model Lambda Calculus Machine}",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "110--115",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807078",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Much work has been done towards characterizing the
                 semantics of block structured programming languages
                 using the lambda calculus [2]. Johnston [3] recently
                 introduced a cell-based approach, called the contour
                 model, for specifying the execution semantics of such
                 languages. This paper relates the two approaches by
                 giving a contour model evaluator for compiled lambda
                 expressions. Section 2 gives the basic definitions
                 needed from the lambda calculus to make the paper
                 self-contained. Section 3 defines the Contour Model
                 Lambda Calculus Machine (CMLCM). Unfortunately
                 publication limitations preclude some worked examples
                 which would greatly aid the reader's understanding.
                 They will be provided in the talk itself and in an
                 expanded version of this paper for the Tutorial
                 Conference on Semantic Models of Computation. Section 4
                 outlines the structure of the proof of the CMLCM's
                 correctness. And Section 5 is a set of concluding
                 remarks on the significance of the CMLCM.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miller:1972:BBD,
  author =       "Raymond E. Miller",
  title =        "A boundary between decidability and undecidability for
                 parallel program schemata (extended abstract)",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "116--120",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807079",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Some theorems showing undecidability for computational
                 commutativity, boundedness, termination and determinacy
                 of parallel program schemata are given. These results
                 are then compared with contrasting decidability results
                 in [1] showing that the deletion of the hypothesis of
                 repetition-freeness from the decidability theorems
                 produces undecidability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{London:1972:CCL,
  author =       "Ralph L. London",
  title =        "Correctness of a compiler for a {Lisp} subset",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "121--127",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807080",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Excerpts of a proof of correctness of a running Lisp
                 compiler for the PDP-10 computer are given. Included
                 are the rationale for presenting this proof and a
                 discussion of an actual extension of the proof to
                 another compiler.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wegner:1972:OSP,
  author =       "Peter Wegner",
  title =        "Operational semantics of programming languages",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "128--141",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807081",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A framework is developed for the operational
                 characterization of the semantics of computational
                 formalisms such as programming languages, digital
                 computers and automata. Operational semantics is
                 contrasted with input-output semantics and it is shown
                 that input-output semantics is inappropriate to the
                 study of certain important implementation-dependent
                 attributes of computational formalisms. Notions of
                 equivalence are developed for a very general class of
                 operational models called information structure models.
                 The structure of proofs of compiler correctness and
                 interpreter equivalence is discussed independently of
                 the form of the states and state transitions of a
                 specific interpreter. These techniques are then applied
                 to defining a correctness criterion for block structure
                 implementations and to correctness proofs of
                 interpreters for block structure languages.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:1972:DVR,
  author =       "John A. N. Lee",
  title =        "The definition and validation of the radix sorting
                 technique",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "142--149",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807082",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Based on the formal definition techniques of Lucas et
                 al$^{[1]}$ which have been applied to the description
                 of programming languages, this paper defines the
                 algorithm of radix sorting and develops a proof of its
                 validity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jones:1972:FDC,
  author =       "C. B. Jones",
  title =        "Formal development of correct algorithms: an example
                 based on {Earley}'s recogniser",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "150--169",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807083",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper contains the formal development of a
                 correct algorithm from an implicit definition of the
                 task to be performed. Each step of the development can
                 be accompanied by a proof of its correctness. As well
                 as ensuring the correctness of the final program, the
                 structured development gives considerable insight into
                 the algorithm and possible alternatives. The example
                 used is a simplified form of the recognition algorithm
                 due to Earley.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Berry:1972:EMT,
  author =       "Daniel M. Berry",
  title =        "The equivalence of models of tasking",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "170--190",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807084",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A technique for proving the equivalence of
                 implementations of multi-tasking programming languages
                 is developed and applied to proving the equivalence of
                 the contour model and a multi-tasking version of the
                 copy rule.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McGowan:1972:MRE,
  author =       "Clement L. McGowan",
  title =        "The ``most recent'' error: Its causes and correction",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "191--202",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807085",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The notion of a general block structured programming
                 language and the `most recent' evaluation strategy for
                 such a language are formalized and their relationship
                 investigated. Sufficient conditions for `most recent'
                 correctness are obtained.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sintzoff:1972:CPP,
  author =       "Michel Sintzoff",
  title =        "Calculating properties of programs by valuations on
                 specific models",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "203--207",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807086",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The proof that a program verifies some property is
                 carried out by the valuation of the program in a model
                 characterizing that property. Specific models are given
                 for sufficient conditions of the correctness of types,
                 locations and asynchronous computations; a hypothetical
                 programming language is used, which includes functions
                 and locations and allows their recursive composition.
                 The application of the method in studying termination
                 or correctness problems is discussed on particular
                 programs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cheatham:1972:LSA,
  author =       "T. E. {Cheatham, Jr.} and Ben Wegbreit",
  title =        "On a laboratory for the study of automating
                 programming",
  journal =      j-SIGACT,
  volume =       "4",
  number =       "14",
  pages =        "208--211",
  month =        jan,
  year =         "1972",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/942580.807087",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "At the present time there is considerable interest in
                 the general question of `automating programming:' there
                 are a number of people actively doing research
                 concerned with various aspects of the question and even
                 a few projects exploring various practical issues via
                 experimental implementations. The area encompassed by
                 `automating programming' is a very broad one,
                 particularly if one understands `programming' to
                 include the entire spectrum of activities concerned
                 with producing algorithms which are correct and
                 effective in terms of certain design specifications. It
                 is therefore to be expected that comparison of various
                 techniques and integration of those techniques and the
                 experimental facilities developed in a variety of
                 institutions will be difficult and expensive unless
                 there is some coordinated effort to provide a common
                 framework to support such activities. We would note
                 that at present it is relatively expensive just to
                 construct sufficient programs to permit the
                 investigation of and experimentation with some proposed
                 technique of program automation; because of this many
                 studies in the general area of programming automation
                 are primarily `paper studies'. It is the purpose of
                 this note to provide an overview of the project
                 currently under way at Harvard's Center for Research in
                 Computing Technology, directed toward the
                 implementation of a laboratory for the study of
                 programming automation techniques. A more detailed
                 discussion of our approach is provided in [1]. In the
                 four sections which follow we will discuss briefly our
                 view of the use of a program automation laboratory, the
                 basis for and basic components of the facility
                 currently being implemented, and finally, suggest that
                 there are a variety of research areas which are
                 strongly related to the question of automating
                 programming in which the laboratory might be employed
                 as a research tool.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rosenburg:1973:TRR,
  author =       "A. L. Rosenburg",
  key =          "Rosenburg",
  title =        "On the Time Required to Recognize Properties of
                 Graphs: a Problem",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "??",
  pages =        "15--16",
  month =        "????",
  year =         "1973",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  owner =        "seufert",
}

@Article{Benson:1973:ACN,
  author =       "David B. Benson",
  title =        "Another comment on the null word definition problem",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "1",
  pages =        "14--17",
  month =        jan,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008289.1008290",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1973:RTRa,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "1",
  pages =        "21--24",
  month =        jan,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008289.1008291",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bauer:1973:NDF,
  author =       "M. Bauer and D. Brand and M. Fischer and A. Meyer and
                 M. Paterson",
  title =        "A note on disjunctive form tautologies",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "2",
  pages =        "17--20",
  month =        apr,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811123.1811124",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Cook [1] and Karp [2] have shown that a large class of
                 combinatorial decision problems can be solved in time
                 bounded by a polynomial in the size of the problem iff
                 there is a polynomial time procedure for deciding
                 whether a disjunctive formula with at most three
                 literals per disjunct in the propositional calculus is
                 a tautology.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chaitin:1973:SPI,
  author =       "G. J. Chaitin",
  title =        "Some philosophical implications of
                 information-theoretic computational complexity",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "2",
  pages =        "21--23",
  month =        apr,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811123.1811125",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Greg Chaitin, a frequent past contributor to SIGACT
                 News, has produced a non-technical exposition of some
                 of the concepts and methods in information-theoretic
                 computational complexity, and some of his results, as
                 presented in `Information Theoretic Limitations of
                 Formal Systems'. Both a revised version of the
                 technical paper (see SIGACT News, December 1971, page
                 12, for an abstract) and the non-technical exposition
                 should appear in the literature soon. Meanwhile, we
                 excerpt --- by permission --- some of the philosophical
                 implications which we find interesting. -Ed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chaitin:1973:SAC,
  author =       "G. J. Chaitin",
  title =        "Some abstracts from {The Computer Science
                 Conference}",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "2",
  pages =        "24--25",
  month =        apr,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811123.1811126",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Computer Science Conference in Columbus, Ohio,
                 February 20--22, 1973, was an experiment in organizing
                 a broad education-and-research-oriented meeting
                 analogous to some of the more
                 industry-and-profession-oriented meetings that occur on
                 a regular basis. In terms of bringing together many
                 people from the appropriate communities, we think the
                 meeting must be judged a success and the organizers
                 congratulated. We found the unrefereed research
                 presentations--as expected-- of very uneven quality.
                 (One in formal language theory consisted of a result
                 often given as an exercise in the first portion of a
                 standard course. It is not reproduced here.) We will
                 include some of the relevant abstracts in the next
                 issue or two of SIGACT News as research notices.
                 Interested persons may want to correspond with the
                 authors; but it should be remembered that these are not
                 abstracts of papers, and may involve research in
                 progress. --Ed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1973:RTRb,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "2",
  pages =        "26--27",
  month =        apr,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811123.1811127",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stockmeyer:1973:PCN,
  author =       "L. Stockmeyer",
  title =        "Planar $3$-colorability is {NP}-complete",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "3",
  pages =        "19--25",
  month =        jul,
  year =         "1973",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/pearce.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/graph.coloring.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "NCPY",
  acknowledgement = ack-nhfb,
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "graph coloring complexity; graph theory, computational
                 complexity, honours reading",
  xxtitle =      "Planar 3-Colorability is Polynomial Complete",
}

@Article{Stockmeyer:1973:PCP,
  author =       "Larry Stockmeyer",
  title =        "Planar $3$-colorability is polynomial complete",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "3",
  pages =        "19--25",
  month =        jul,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008293.1008294",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lind:1973:CLS,
  author =       "John Lind and Albert R. Meyer",
  title =        "A characterization of log-space computable functions",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "3",
  pages =        "26--29",
  month =        jul,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008293.1008295",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ricci:1973:SFC,
  author =       "G. Ricci",
  title =        "Some further comments about nothing",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "3",
  pages =        "29--30",
  month =        jul,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008293.1008296",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1973:RTRc,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "3",
  pages =        "31--32",
  month =        jul,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008293.1008297",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jones:1973:MOS,
  author =       "Louise H. Jones",
  title =        "Microprogramming: an opportunity for {SIGACT}",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "4",
  pages =        "9--11",
  month =        oct,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008299.1008300",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Benson:1973:APA,
  author =       "David B. Benson",
  title =        "An alternate proof of {Aho} \& {Ullman}'s {LR(k)}
                 viable prefix theorem",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "4",
  pages =        "11--14",
  month =        oct,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008299.1008301",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rosenberg:1973:TRR,
  author =       "Arnold L. Rosenberg",
  key =          "Rosenberg",
  title =        "On the Time Required to Recognize Properties of
                 Graphs: a Problem",
  journal =      j-SIGACT,
  volume =       "5",
  number =       "4",
  pages =        "15--16",
  month =        oct,
  year =         "1973",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008299.1008302",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  owner =        "seufert",
}

@Article{Knuth:1974:TP,
  author =       "Donald E. Knuth",
  title =        "A terminological proposal",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "12--18",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811130",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "While preparing a book on combinatorial algorithms, I
                 felt a strong need for a new technical term, a word
                 which is essentially a one-sided version of polynomial
                 complete. A great many problems of practical interest
                 have the property that they are at least as difficult
                 to solve in polynomial time as those of the Cook--Karp
                 class KP. I needed an adjective to convey such a degree
                 of difficulty, both formally and informally; and since
                 the range of practical applications is so broad, I felt
                 it would be best to establish such a term as soon as
                 possible.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1974:SDE,
  author =       "Zvi Galil",
  title =        "On some direct encodings of nondeterministic {Turing}
                 machines operating in polynomial time into $p$-complete
                 problems",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "19--24",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811131",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Cook [1] and Karp [2] introduced the notion of
                 complete problems. Meyer and Stockmeyer [3] showed that
                 some problems require exponential time. All these
                 problems have a common property which in the latter
                 case implies that they cannot be solved in polynomial
                 time.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1974:NPR,
  author =       "Joel I. Seiferas",
  title =        "A note on prefixes of regular languages",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "25--29",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811132",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Hopcroft and Ullman (problem 3.10 [1]) pose the
                 amusing question of whether the `first third' of a
                 regular language L, FIRST-THIRD(L) = \{x| x is a prefix
                 of a member of L of length 3|x|\}, is necessarily
                 regular. To see that it is, we can adapt of 1-way
                 deterministic finite-state acceptor (an FA, for short)
                 for L to get a 2-way non-deterministic finite-state
                 acceptor with endmarkers for FIRST-THIRD(L). This
                 acceptor behaves like the FA on $x$ until it reaches
                 the right endmarker, and then it uses another pass over
                 $x$ at half speed to behave like the FA on some
                 nondeterministically chosen continuation of length $ 2
                 |x|$. That such an acceptor accepts a regular language
                 follows from an argument similar to that of Shepherdson
                 for deterministic acceptors [2].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lipton:1974:ARC,
  author =       "Richard J. Lipton and Lawrence Snyder",
  title =        "On the {Aanderaa--Rosenberg Conjecture}",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "30--31",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811133",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In a recent paper [1], Rosenberg conjectures that the
                 results found in Holt and Reingold [2], can be
                 generalized. Suppose that graphs are presented via
                 their adjacency matrices. Then Holt and Reingold show
                 that any algorithm which detects whether or not a graph
                 is strongly connected (respectively, contains a cycle)
                 must in worst case probe $ O(n^2) $ entries of the
                 given $ n \times n $ adjacency matrix. Rosenberg then
                 considers restrictions on graph property P such that
                 any algorithm takes in worst case $ O(n^2) $ probes to
                 determine whether or not a $n$-node graph has property
                 $P$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wegner:1974:MAU,
  author =       "Peter Wegner",
  title =        "Modification of {Aho} and {Ullman}'s correctness proof
                 of {Warshall}'s algorithm",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "32--35",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811134",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Aho and Ullman's correctness proof of Warshall's
                 algorithm (ref. 1, p. 48) is obscure and at one point
                 incorrect. A modified version of this proof is
                 presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1974:TR,
  author =       "SIGACT News Staff",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "1",
  pages =        "35--35",
  month =        jan,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1811129.1811135",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knuth:1974:PAN,
  author =       "Donald E. Knuth",
  title =        "Postscript about {NP}-hard problems",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "2",
  pages =        "15--16",
  month =        apr,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008304.1008305",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kosaraju:1974:RPF,
  author =       "S. Rao Kosaraju",
  title =        "Regularity preserving functions",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "2",
  pages =        "16--17",
  month =        apr,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008304.1008306",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  MRclass =      "68A25 (02F25)",
  MRnumber =     "0408318 (53 \#12083)",
  MRreviewer =   "John T. Gill",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See correction \cite{Kosaraju:1974:CRP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Havel:1974:ATM,
  author =       "Ivan M. Havel",
  title =        "Automata theory motivated by problem solving",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "2",
  pages =        "18--23",
  month =        apr,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008304.1008307",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  MRclass =      "68A25 (68A45)",
  MRnumber =     "0483716 (58 \#3694)",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/alspaugh.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bennison:1974:STS,
  author =       "Victor L. Bennison",
  title =        "Saving tapes in the simulation of multihead {Turing}
                 machines",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "2",
  pages =        "23--26",
  month =        apr,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008304.1008308",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1974:RTRa,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "2",
  pages =        "57--60",
  month =        apr,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008304.1008309",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1974:RTRb,
  author =       "SIGACT News Staff",
  title =        "A recent technical report",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "3",
  pages =        "5--5",
  month =        jul,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008311.1008312",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cook:1974:CLP,
  author =       "Stephen Cook and Robert Reckhow",
  title =        "Corrections for {``On the lengths of proofs in the
                 propositional calculus preliminary version''}",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "3",
  pages =        "15--22",
  month =        jul,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008311.1008313",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Original paper published in Proceedings of the Sixth
                 Annual Symposium on the Theory of Computing, Seattle
                 1974, 135--148 (1974).",
  ZMnumber =     "Zbl 0375.02004",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  remark =       "This paper does not identify the source of the paper
                 being corrected, but I found it in the Zentrallblat
                 MATH database.",
}

@Article{Kosaraju:1974:CRP,
  author =       "S. Rao Kosaraju",
  title =        "Correction to {``Regularity preserving functions''}
                 {(ACM SIGACT News {\bf 6} (1974), no. 2, 16--17)}",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "3",
  pages =        "22--22",
  month =        jul,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008311.1008314",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  MRclass =      "68A25 (02F20)",
  MRnumber =     "0451868 (56 \#10150)",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kosaraju:1974:RPF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Smith:1974:MRA,
  author =       "Carl H. Smith and J. van Leeuwen",
  title =        "Microprogrammed random access stored program
                 machines",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "3",
  pages =        "23--32",
  month =        jul,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008311.1008315",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  MRclass =      "68A05",
  MRnumber =     "0495141 (58 \#13878)",
  MRreviewer =   "K. H. V. Booth",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a typical framework for microprogramming
                 using a well-known theoretical computer-model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1974:RTRc,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "3",
  pages =        "33--34",
  month =        jul,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008311.1008316",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanLeeuwen:1974:FCB,
  author =       "Jan van Leeuwen",
  title =        "A forgotten connection between tag-systems and
                 parallel-rewriting",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "4",
  pages =        "19--20",
  month =        oct,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008318.1008319",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Germano:1974:LAC,
  author =       "G. Germano and A. Maggiolo-Schettini",
  title =        "Loops in {Algol 60} and in category theory",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "4",
  pages =        "21--23",
  month =        oct,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008318.1008320",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cheriton:1974:ELM,
  author =       "David R. Cheriton",
  title =        "An extension to on-line multiplication lower bound
                 results",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "4",
  pages =        "24--31",
  month =        oct,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008318.1008321",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The improved lower bound result of Fischer et al. <2>
                 is extended to a larger class of machines, namely from
                 uniform BAM's to `simple' BAM's.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Constable:1974:SIS,
  author =       "Robert Constable and David Park",
  title =        "Special issue on semantics and program schemas: {SIAM
                 Journal on Computing}",
  journal =      j-SIGACT,
  volume =       "6",
  number =       "4",
  pages =        "32--32",
  month =        oct,
  year =         "1974",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008318.1008322",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ladner:1975:CVP,
  author =       "Richard E. Ladner",
  title =        "The circuit value problem is log space complete for
                 {P}",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "1",
  pages =        "18--20",
  month =        jan,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990518.990519",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lien:1975:PPS,
  author =       "Y. Edmund Lien",
  title =        "Periodic properties of strings",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "1",
  pages =        "21--25",
  month =        jan,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990518.990520",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krishnamoorthy:1975:NHP,
  author =       "M. S. Krishnamoorthy",
  title =        "An {NP}-hard problem in bipartite graphs",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "1",
  pages =        "26--26",
  month =        jan,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990518.990521",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Checking for Hamiltonian circuit in bipartite graphs
                 is shown to be NP-hard.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kugel:1975:T,
  author =       "Peter Kugel",
  title =        "Trees",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "2",
  pages =        "19--19",
  month =        apr,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008324.1008325",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1975:TR,
  author =       "SIGACT News Staff",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "2",
  pages =        "20--24",
  month =        apr,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008324.1008326",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rosen:1975:CRT,
  author =       "Barry K. Rosen",
  title =        "A {Church--Rosser} Theorem for Graph Grammars",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "3",
  pages =        "26--31",
  month =        "Summer",
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008343.1008344",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/gragra.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  added =        "1996-03-13-10-09-20",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{deJong:1975:IBN,
  author =       "Lieuwe de Jong and Jan van Leeuwen",
  title =        "An improved bound on the number of multiplications and
                 divisions necessary to evaluate a polynomial and all
                 its derivatives",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "3",
  pages =        "32--34",
  month =        "Summer",
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008343.1008345",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1975:RTR,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "3",
  pages =        "35--39",
  month =        "Summer",
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008343.1008346",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schneider:1975:ATW,
  author =       "Richard E. Schneider",
  title =        "Automata theory: what is it used for?",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "4",
  pages =        "8--11",
  month =        nov,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990502.990503",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lipton:1975:QCN,
  author =       "Richard J. Lipton and Nancy Lynch",
  title =        "A quantifier characterization for nondeterministic log
                 space",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "4",
  pages =        "24--25",
  month =        nov,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990502.990504",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1975:CLA,
  author =       "Zvi Galil",
  title =        "On converting on-line algorithms into real-time and on
                 real-time algorithms for string-matching and palindrome
                 recognition",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "4",
  pages =        "26--30",
  month =        nov,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990502.990505",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We give a sufficient condition when an on-line
                 algorithm can be transformed into a real-time
                 algorithm. We use this condition to construct real-time
                 algorithms for string-matching and palindrome
                 recognition problems by random access machines and by
                 Turing machines.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alt:1975:LOS,
  author =       "Helmut Alt and Kurt Mehlhorn",
  title =        "A language over a one symbol alphabet requiring only
                 {$ O(\log \log n) $} space",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "4",
  pages =        "31--33",
  month =        nov,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990502.990506",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gabow:1975:HGN,
  author =       "Harold N. Gabow",
  title =        "How to gracefully number certain symmetric trees",
  journal =      j-SIGACT,
  volume =       "7",
  number =       "4",
  pages =        "33--36",
  month =        nov,
  year =         "1975",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990502.990507",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kugel:1976:UT,
  author =       "Peter Kugel",
  title =        "On uninteresting theorems",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "1",
  pages =        "27--29",
  month =        jan,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008591.1008592",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Angluin:1976:FRA,
  author =       "Dana Angluin",
  title =        "The {Four Russians' Algorithm} for {Boolean} matrix
                 multiplication is optimal in its class",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "1",
  pages =        "29--33",
  month =        jan,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008591.1008593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "In {\bf 8}(2) 1976 of this journal, the author writes
                 that the work in this paper is subsumed by a more
                 general treatment in \cite{Savage:1974:ACL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simon:1976:TRP,
  author =       "Istvan Simon",
  title =        "Two results on polynomial-time reducibilities",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "1",
  pages =        "33--37",
  month =        jan,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008591.1008594",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pyster:1976:LCD,
  author =       "Arthur Pyster",
  title =        "A language construct for ``Dovetailing''",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "1",
  pages =        "38--40",
  month =        jan,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008591.1008595",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1976:RTRa,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "1",
  pages =        "41--49",
  month =        jan,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008591.1008596",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knuth:1976:BOB,
  author =       "Donald E. Knuth",
  title =        "Big {Omicron} and big {Omega} and big {Theta}",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "2",
  pages =        "18--24",
  month =        apr # "\slash " # jun,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008328.1008329",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/allison.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Intro.Algorithms.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/complexity.information.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See comments
                 \cite{Brassard:1985:CBN,Vitanyi:1985:BOV}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "big Oh, O, bigO, bigOh, complexity, algorithm, c1976,
                 c197x, c19xx, math, maths, algorithmic, analysis, time,
                 space, is order, origins, history, notation, little",
}

@Article{Hamlet:1976:ADP,
  author =       "Richard Hamlet",
  title =        "Application of {``DOVETAILING'}' to program testing",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "2",
  pages =        "25--26",
  month =        apr # "\slash " # jun,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008328.1008330",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kugel:1976:DAC,
  author =       "Peter Kugel",
  title =        "Digital to analog conversion: a speculation",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "2",
  pages =        "27--33",
  month =        apr # "\slash " # jun,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008328.1008331",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1976:ACS,
  author =       "SIGACT News Staff",
  title =        "Abstracts from the computer science conference",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "2",
  pages =        "34--37",
  month =        apr # "\slash " # jun,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008328.1008332",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1976:RTRb,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "2",
  pages =        "38--52",
  month =        apr # "\slash " # jun,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008328.1008333",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Morgan:1976:PDR,
  author =       "Carroll Morgan",
  title =        "A prime decomposition result for parallel systems",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "3",
  pages =        "14--20",
  month =        jul,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1810926.1810927",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper, we propose to investigate some aspects
                 of the parallel composition of processes to form
                 concurrent systems. We consider processes simply to be
                 sets of possible action sequences, and define a merging
                 operation on these sets which closely mimics parallel
                 composition of computational processes. Synchronisation
                 of processes is expressed in perhaps the simplest
                 possible way: two actions in discrete processes are
                 either independent or must occur simultaneously. This
                 approach to synchronisation is essentially that used by
                 Riddle [1]. A simplistic view of process behaviour is
                 taken in the hope that those behavioural aspects which
                 are due solely to parallel composition will be more
                 easily identifiable, and that the parallel or
                 sequential nature of the processes themselves may be
                 defined in terms of the sequences they admit.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanLeunen:1976:HYA,
  author =       "Mary-Claire van Leunen and Richard Lipton",
  title =        "How to have your abstract rejected",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "3",
  pages =        "21--24",
  month =        jul,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1810926.1810928",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "If your ideas are bad enough all on their own, you
                 needn't worry about this advice. Banality, irrelevance,
                 plagiarism, and plain old madness will get any abstract
                 rejected, no matter how good it is. Similarly, if your
                 ideas are brilliant, pointed, original, and sane, you
                 have a hard road ahead of you. Even the worst abstract
                 may not suffice for rejection. Program committees
                 differ in their standards. If, however, you are like
                 most of us, neither a genius nor an idiot, neither
                 Newton nor Simple Simon, you will have to put some
                 effort into making your abstract suitable for
                 rejection. Here are a few tips we can offer.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yuval:1976:GMD,
  author =       "G. Yuval",
  title =        "The geometric mean distance",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "3",
  pages =        "24--25",
  month =        jul,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1810926.1810929",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Given N points in K-space, the O(N$^2$) distances
                 between them may be characterized by their minimum[1,
                 2], maximum [3], mean[4, 5, 6], or median [7]; since
                 these problems are geometrical, it may be Interesting
                 to consider the geometric mean --- or, which is
                 equivalent, the product --- of the distances between
                 all pairs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{News:1976:RTR,
  author =       "SIGACT News",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "3",
  pages =        "26--36",
  month =        jul,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1810926.1810930",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Eilenberg:1976:BRB,
  author =       "Samuel Eilenberg",
  title =        "Book Review: {{\booktitle{Algebraic and
                 Automata-Theoretic Properties of Formal Languages}}, by
                 Seymour Ginsburg. North Holland, 1975}",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "4",
  pages =        "11--12",
  month =        oct,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008335.1008341",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Ginsburg:1975:AAT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hartmanis:1976:IRC,
  author =       "J. Hartmanis and J. E. Hopcroft",
  key =          "Hartmanis \& Hopcroft",
  title =        "Independence Results in Computer Science",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "4",
  pages =        "13--24",
  month =        oct,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008335.1008336",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this note we show that instances of problems which
                 appear naturally in computer science cannot be answered
                 in formalized set theory. We show, for example, that
                 some relativized versions of the famous P = NP problem
                 cannot be answered in formalized set theory, that
                 explicit algorithms can be given whose running time is
                 independent of the axioms of set theory, and that one
                 can exhibit a specific context-free grammar $G$ for
                 which it cannot be proven in set theory that $ L(G) =
                 \Sigma *$ or $ L(G) /= \Sigma *$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  owner =        "seufert",
}

@Article{vanLeeuwen:1976:RCP,
  author =       "Jan van Leeuwen",
  title =        "A regularity condition for parallel rewriting
                 systems",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "4",
  pages =        "24--27",
  month =        oct,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008335.1008337",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cook:1976:SPP,
  author =       "Stephen A. Cook",
  title =        "A short proof of the pigeon hole principle using
                 extended resolution",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "4",
  pages =        "28--32",
  month =        oct,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008335.1008338",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1976:RTRc,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "8",
  number =       "4",
  pages =        "33--40",
  month =        oct,
  year =         "1976",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008335.1008339",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knuth:1977:SMA,
  author =       "Donald E. Knuth",
  title =        "The {Samson--Mueller} Algorithm",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1977",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Fri Sep 23 02:23:15 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  xxnote =       "UC Berkeley has no volumes before 1984. University of
                 Utah has none at all.",
}

@Article{Cherniavsky:1977:BRD,
  author =       "John C. Cherniavsky",
  title =        "Book review department",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "1",
  pages =        "15--15",
  month =        jan,
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008348.1008350",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herman:1977:BRB,
  author =       "Gabor Herman",
  title =        "Book Review: {{\booktitle{Automata, Languages,
                 Development}}, by A. Lindenmayer and G. Rozenberg.
                 North Holland Publishing Co. 1976}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "1",
  pages =        "16--18",
  month =        jan,
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008348.1008351",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lindenmayer:1976:ALD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1977:RTRa,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "1",
  pages =        "19--34",
  month =        jan,
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008348.1008352",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knuth:1977:CS,
  author =       "Donald E. Knuth",
  title =        "The complexity of songs",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "2",
  pages =        "17--24",
  month =        "Summer",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008354.1008355",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Reprinted in \cite{Knuth:1984:CS}; errata (June 1984),
                 593. Reprinted in {\sl Metafolkloristica}, edited by
                 Franz Kinder and Boaz the Clown (Salt Lake City, Utah
                 84158-8183: Frank and Boaz, P.O. Box 58183), 63--65.
                 Reprinted in {\sl Humour the Computer}, edited by
                 Andrew Davison (Cambridge, Massachusetts: MIT Press,
                 1994), to appear.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldschlager:1977:MPC,
  author =       "Leslie M. Goldschlager",
  title =        "The monotone and planar circuit value problems are log
                 space complete for {P}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "2",
  pages =        "25--29",
  month =        "Summer",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008354.1008356",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/LogicProgramming/prolog.1.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "prolog",
}

@Article{Britton:1977:NCI,
  author =       "Dianne E. Britton and Ralph B. McLaughlin and Richard
                 J. Orgass",
  title =        "A note concerning intermittent assertions",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "2",
  pages =        "30--35",
  month =        "Summer",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008354.1008357",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Carter:1977:FG,
  author =       "Larry Carter",
  title =        "A four-gadget",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "2",
  pages =        "36--36",
  month =        "Summer",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008354.1008358",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1977:RTRb,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "2",
  pages =        "37--44",
  month =        "Summer",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008354.1008359",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:52:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Reeker:1977:BRB,
  author =       "Larry H. Reeker",
  title =        "Book Review: {{\booktitle{Programs, Machines, and
                 Computation: an Introduction to the Theory of
                 Computing}}, by K. L. Clark and D. F. Cowell}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "3",
  pages =        "20--22",
  month =        "Fall",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008361.1008367",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Clark:1976:PMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Booth:1977:BMM,
  author =       "Kellogg S. Booth",
  title =        "{Boolean} matrix multiplication using only {$
                 O(n^{\log_2 7} \log n) $} bit operations",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "3",
  pages =        "23--23",
  month =        "Fall",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008361.1008362",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krishnamoorthy:1977:NSS,
  author =       "M. S. Krishnamoorthy",
  title =        "A note on {``Some simplified NP-complete graph
                 problems''}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "3",
  pages =        "24--24",
  month =        "Fall",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008361.1008363",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Garey:1978:NNS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rosen:1977:AGP,
  author =       "Barry K. Rosen",
  title =        "Arcs in graphs are {NOT} pairs of nodes",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "3",
  pages =        "25--27",
  month =        "Fall",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008361.1008364",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1977:RTRc,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "3",
  pages =        "28--32",
  month =        "Fall",
  year =         "1977",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008361.1008365",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lewis:1978:BRB,
  author =       "Harry R. Lewis",
  title =        "Book Review: {{\booktitle{Mariages stables et leurs
                 relations avec d'autre probl{\`e}mes combinatoires:
                 introduction {\`a} l'analyze math{\'e}matique des
                 algorithmes}}, by Donald E. Knuth. Les Presses de
                 l'Universit{\'e} de Montr{\'e}al}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "13--14",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008376",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:1976:MSR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nisselbaum:1978:MOE,
  author =       "Y. Nisselbaum",
  title =        "On merging {$N$} ordered elements with three
                 elements",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "14--16",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008370",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Garey:1978:NNS,
  author =       "M. R. Garey and D. S. Johnson",
  title =        "A note on {``A note on 'Some simplified NP-complete
                 graph problems'''}",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "17--17",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008371",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Krishnamoorthy:1977:NSS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shyamasundar:1978:NTC,
  author =       "R. K. Shyamasundar",
  title =        "A note on the transitive closure of a {Boolean}
                 matrix",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "18--21",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008372",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See notes \cite{Yelowitz:1978:NNT}.",
  abstract =     "A row oriented algorithm is given for obtaining the
                 transitive clousure of a Boolean matrix.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katseff:1978:RFT,
  author =       "Howard P. Katseff",
  title =        "From the recursive function theory newsletter",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "22--23",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008373",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1978:RTR,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "9",
  number =       "4",
  pages =        "24--28",
  month =        "Winter",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008369.1008374",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanLeeuwen:1978:EPR,
  author =       "Jan van Leeuwen",
  title =        "Evaluating a polynomial and its reverse",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "18--21",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008606",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The reverse of an $ n^{\rm th} $ degree polynomial $
                 p(x) $ is $ {\rm rev}(p)(x) = x^n p(x^{-1}) $. We show
                 that one can evaluate $p$ and $ {\rm rev}(p)$ in only $
                 n + O(\log n)$ multiplications modulo {x$^{-1}$ }. The
                 method uses an algorithm to evaluate reciprocal
                 polynomials of degree $n$ in only $ [n / 2] + 1 + l([n
                 / 2])$ multiplications modulo x$^{-1}$, where $ l(k)$
                 denotes the length of a shortest addition chain for
                 $k$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1978:KTB,
  author =       "Zvi Galil",
  title =        "Killing two birds with one stone",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "22--24",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008607",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is shown that the problem of finding the
                 biconnected components of an undirected graph is, in a
                 certain sense, a special case of the problem of finding
                 the strongly connected components of a directed graph.
                 Therefore, the linear-time algorithm for the former can
                 be derived from the linear-time algorithm for the
                 latter.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Colbourn:1978:GIS,
  author =       "Marlene Jones Colbourn and Charles J. Colbourn",
  title =        "Graph isomorphism and self-complementary graphs",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "25--29",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008608",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yelowitz:1978:NNT,
  author =       "Lawrence Yelowitz",
  title =        "Notes on {``A note on the transitive closure of a
                 Boolean matrix''}",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "30--30",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008609",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shyamasundar:1978:NTC}.",
  abstract =     "The row-oriented algorithm in [1] for obtaining
                 transitive closure is Dijkstra's algorithm [2] (for
                 obtaining all nodes reachable from a single node)
                 applied to each row in turn. Furthermore, [1] does not
                 work properly in the acyclic case unless the matrix is
                 in triangular form initially. In general, it may be
                 necessary to renumber the nodes (and correspondingly
                 rearrange the matrix) to bring an acyclic adjacency
                 matrix into triangular form (a technique such as
                 topological sorting [3] can be used). Finally, if
                 interest is in obtaining the nonredundant digraph of an
                 acyclic digraph, [4] appears to be a more efficient
                 algorithm than [5].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shyamasundar:1978:NMM,
  author =       "R. K. Shyamasundar",
  title =        "A note on the multiplication of $ 4 \times 4 $
                 matrices",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "31--32",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008610",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this note, it is shown that the multiplication off
                 two $ 4 \times 4 $ matrices can be done using only 48
                 multiplications, using a result due to Winograd
                 (1988).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1978:IBM,
  author =       "SIGACT News Staff",
  title =        "{International Business Machines}",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "1",
  pages =        "38--41",
  month =        "Spring",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008605.1008611",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Subrahmanyam:1978:BRB,
  author =       "P. A. Subrahmanyam",
  title =        "Book Review: {{\booktitle{Linguistic Structures
                 Processing}}, by A. Zampolli. North Holland Publishing
                 Company 1977}",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "39--41",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990526",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Zampolli:1977:LSP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Burns:1978:MEL,
  author =       "James E. Burns",
  title =        "Mutual exclusion with linear waiting using binary
                 shared variables",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "42--47",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990527",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The problem of mutual exclusion among N asynchronous,
                 parallel processes using only shared binary variables
                 for communication is considered. Upper and lower bounds
                 of N+1 and N shared binary variables, respectively, are
                 shown for the problem of mutual exclusion with linear
                 waiting. Lockout-free mutual exclusion is shown to
                 require at least N shared binary variables when the
                 primitive operations are suitably restricted. This
                 latter bound is tight for N=2.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jaffe:1978:NSP,
  author =       "Jeffrey Jaffe",
  title =        "A necessary and sufficient pumping lemma for regular
                 languages",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "48--49",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990528",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kozen:1978:CPE,
  author =       "Dexter Kozen",
  title =        "A clique problem equivalent to graph isomorphism",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "50--52",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990529",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A class of graphs called $M$-graphs is defined. It is
                 shown that (i) the problem of determining whether a
                 given $M$-graph of order $ n^2$ has a clique of order n
                 is logspace equivalent to graph isomorphism, and (ii)
                 for any fixed but arbitrarily small $e$, the problem of
                 determining whether a given $M$-graph of order $ n^2$
                 has a clique of order $ (1 - e)^n$ is NP complete.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Litow:1978:NEO,
  author =       "B. Litow and I. H. Sudborough",
  title =        "On non-erasing oracle tapes in space bounded
                 reducibility",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "53--57",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990530",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Velu:1978:TPU,
  author =       "Jacques V{\'e}lu",
  title =        "Tests for primality under the {Riemann} hypothesis",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "58--59",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990531",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Assuming the extended Riemann hypothesis (ERH), G.
                 Miller produced in a very interesting paper [1], an
                 algorithm which tests primality and runs in $ O((\log
                 n)^{4 + \epsilon }) $ steps. We provide a short proof
                 of this result.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wood:1978:OSH,
  author =       "Derick Wood",
  title =        "One-sided height-balanced search trees",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "2",
  pages =        "60--62",
  month =        "Summer",
  year =         "1978",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990524.990532",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dewdney:1979:LCP,
  author =       "A. K. Dewdney",
  title =        "Logic circuits in the plane: minimal crossovers",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "3",
  pages =        "38--48",
  month =        "Winter",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1113654.1113655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There are, essentially, just 17 subsets of the 16
                 binary logical operations which are both (a) complete
                 in the sense that any n-variable logical function can
                 be expressed with them and (b) minimal, subject to (a).
                 For each of these bases, it is shown how to construct,
                 for any logical function F, a planar logical circuit
                 with gates from that base alone which realizes F. This
                 is done by constructing a planar crossover circuit for
                 each minimal base. Minimality of the crossover circuits
                 is discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krishnamoorthy:1979:GTH,
  author =       "M. S. Krishnamoorthy and Somenath Biswas",
  title =        "The {Generalized Towers of Hanoi}",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "3",
  pages =        "49--49",
  month =        "Winter",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1113654.1113656",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krishnamoorthy:1979:RTR,
  author =       "M. S. Krishnamoorthy and Somenath Biswas",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "10",
  number =       "3",
  pages =        "50--94",
  month =        "Winter",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1113654.1113657",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1979:BRBa,
  author =       "John C. Cherniavsky",
  title =        "Book Review: {{\booktitle{The Theory of Computer
                 Science: a Programming Approach}}, by J. M. Brady.
                 Chapman and Hall}",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "1",
  pages =        "17--17",
  month =        "Summer",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008613.1008617",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Brady:1977:TCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1979:BRBb,
  author =       "John C. Cherniavsky",
  title =        "Book Review: {{\booktitle{Automated Theorem Proving: a
                 Logical Basis}}, by D. W. Loveland. North-Holland
                 Publishing Co. 1977}",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "1",
  pages =        "18--18",
  month =        "Summer",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008613.1008618",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Loveland:1978:ATP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Derus:1979:LTD,
  author =       "Kenneth H. Derus and John C. Hansen",
  title =        "Logics of truth and disposition",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "1",
  pages =        "36--43",
  month =        "Summer",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008613.1008614",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1979:RTRa,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "1",
  pages =        "44--80",
  month =        "Summer",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008613.1008615",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1979:BRBc,
  author =       "John C. Cherniavsky",
  title =        "Book Review: {{\booktitle{TORIX: a Programming System
                 for Operations on Vectors and Matrices over Arbitrary
                 Fields and of Variable Size, vol 1}}, by S. G. Van Der
                 Meulen and M. Veldhorst. Mathematisch Centrum 1978}",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "6--6",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008627",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{VanDerMeulen:1978:TPS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{DeMillo:1979:BRB,
  author =       "Richard A. DeMillo and Richard J. Lipton",
  title =        "Book Review: {{\booktitle{Proofs and Refutations: the
                 Logic of Mathematical Discovery}}, by Imre Lakatos.
                 Cambridge University Press 1976}",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "7--9",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008628",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lakatos:1976:PRL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Borodin:1979:TST,
  author =       "Allan Borodin and Michael J. Fischer and David G.
                 Kirkpatrick and Nancy A. Lynch and Martin Tompa",
  title =        "A time-space tradeoff for sorting and related
                 non-oblivious computations",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "24--24",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008621",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ehrig:1979:AIA,
  author =       "H. Ehrig and H. J. Kreowski and P. Padawitz",
  title =        "Algebraic implementation of abstract data types: an
                 announcement",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "25--29",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008622",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/COMPASS.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/obscure.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A new concept for the implementation of abstract data
                 types is proposed: Given algebraic specifications SPECO
                 and SPEC1 of abstract data types ADTO and ADT1 an
                 implementation of ADTO by ADT1 is defined separately on
                 the syntactical level of specifications and on the
                 semantical level of algebras. In addition to a short
                 overview a simple example is provided.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Derus:1979:PMD,
  author =       "Kenneth H. Derus and John C. Hansen",
  title =        "Propositions with multiple dispositions and multiple
                 truth values",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "30--35",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008623",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bentley:1979:AVS,
  author =       "Jon Louis Bentley and James B. Saxe",
  title =        "Algorithms on Vector Sets",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "36--39",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008624",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1979:RTRb,
  author =       "SIGACT News Staff",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "11",
  number =       "2",
  pages =        "40--57",
  month =        "Fall",
  year =         "1979",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008620.1008625",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 06:53:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1980:TR,
  author =       "{SIGACT News Staff}",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "1",
  pages =        "2--135",
  month =        "Winter--Spring",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008630.1008631",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:19 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

%%% ACM Portal has empty Web page for SIGACT volume 12 number 2 Summer 1980
%%% The 14-page issue contains only brief notes and announcements
@Article{Maier:1980:BRB,
  author =       "David Maier",
  title =        "Book Review: {{\booktitle{Introduction to Automata
                 Theory, Languages and Computation}}, by John E.
                 Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979}",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "13--14",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008863",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Hopcroft:1979:IAT,Hopcroft:2001:IATa,Hopcroft:2007:IAT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1980:BRB,
  author =       "John Cherniavsky",
  title =        "Book Reviews: {{\booktitle{Checking Landau's
                 ``Grundlagen'' in the Automath system}}, by L. S. Van
                 Benthem Jutting. Mathematical Centre 1979:
                 \booktitle{First Order Dynamic Logic}, by David Harel.
                 Springer-Verlag 1979. And \booktitle{A Programming
                 Logic}, by Robert L. Constable and Michael J.
                 O'Donnell. Winthrop Publishers 1978}",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "14--16",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008864",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Constable:1978:PLI,vanBenthemJutting:1979:CLG,Harel:1979:FOD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bentley:1980:GMS,
  author =       "Jon Louis Bentley and Dorothea Haken and James B.
                 Saxe",
  title =        "A General Method For Solving Divide-and-conquer
                 Recurrences",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "36--44",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008865",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Intro.Algorithms.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The approximate complexity of divide-and-conquer
                 algorithms is often described by recurrence relations
                 of the form $ T(n) = k T(n / c) + f(n) $. The only
                 well-defined method currently used for solving such
                 recurrences consists of solution tables for fixed
                 functions $f$ and varying $k$ and $c$. In this note we
                 describe a unifying method for solving these
                 recurrences that is both general in applicability and
                 easy to apply. This method is appropriate both as a
                 classroom technique and as a tool for practicing
                 algorithm designers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gaifman:1980:RHC,
  author =       "H. Gaifman and E. Shamir",
  title =        "Roots of the hardest context free language and other
                 constructs",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "45--51",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008866",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gens:1980:CAA,
  author =       "Georgii Gens and Evgenii Levner",
  title =        "Complexity of approximation algorithms for
                 combinatorial problems: a survey",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "52--65",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008867",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this survey we examine recent results on the
                 complexity of approximation algorithms which have
                 appeared in Russian.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gottlieb:1980:NSI,
  author =       "Allan Gottlieb and Clyde P. Kruskal",
  title =        "A note on sorting integers from a bounded range",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "66--67",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008868",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harel:1980:FT,
  author =       "David Harel",
  title =        "On folk theorems",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "68--80",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008869",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We suggest criteria for a statement to be a folk
                 theorem and illustrate the ideas with a detailed
                 example.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Leiss:1980:CFA,
  author =       "Ernst Leiss",
  title =        "Constructing a finite automaton for a given regular
                 expression",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "81--87",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008870",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nourani:1980:NCC,
  author =       "Farshid Nourani",
  title =        "A note on the constructors of the computable
                 universe",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "88--89",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008871",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Porto:1980:AS,
  author =       "Ant{\'o}nio G. Porto and Armando B. Matos",
  title =        "{Ackermann} and the superpowers",
  journal =      j-SIGACT,
  volume =       "12",
  number =       "3",
  pages =        "90--95",
  month =        "Fall",
  year =         "1980",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008861.1008872",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Greibach:1981:CRT,
  author =       "S. A. Greibach",
  title =        "Comments on the roots of theorems and languages both
                 easy and hard",
  journal =      j-SIGACT,
  volume =       "13",
  number =       "1",
  pages =        "26--29",
  month =        "Winter",
  year =         "1981",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008883.1008884",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schoning:1981:NCS,
  author =       "Uwe Sch{\"o}ning",
  title =        "A note on complete sets for the polynomial-time
                 hierarchy",
  journal =      j-SIGACT,
  volume =       "13",
  number =       "1",
  pages =        "30--34",
  month =        "Winter",
  year =         "1981",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008883.1008885",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kruskal:1981:NWC,
  author =       "Clyde P. Kruskal and Elia Weixelbaum",
  title =        "A note on the worst case of heapsort",
  journal =      j-SIGACT,
  volume =       "13",
  number =       "1",
  pages =        "35--38",
  month =        "Winter",
  year =         "1981",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008883.1008886",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1981:TRa,
  author =       "{SIGACT News Staff}",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "13",
  number =       "1",
  pages =        "39--87",
  month =        "Winter",
  year =         "1981",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008883.1008887",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1981:TRb,
  author =       "{SIGACT News Staff}",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "13",
  number =       "2",
  pages =        "16--65",
  month =        "Spring--Summer",
  year =         "1981",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008889.1008890",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schoning:1982:NDS,
  author =       "Uwe Sch{\"o}ning",
  title =        "On {NP}-decomposable sets",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "1",
  pages =        "18--20",
  month =        "Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008892.1008893",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Culik:1982:TCA,
  author =       "Karel Culik",
  title =        "Theory of computation on abstract\slash concrete
                 computer automata",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "1",
  pages =        "21--35",
  month =        "Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008892.1008894",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stanat:1982:PTR,
  author =       "Donald F. Stanat and Stephen F. Weiss",
  title =        "A pumping theorem for regular languages",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "1",
  pages =        "36--37",
  month =        "Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008892.1008895",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Walsh:1982:BBO,
  author =       "T. R. S. Walsh",
  title =        "The busy beaver on a one-way infinite tape",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "1",
  pages =        "38--43",
  month =        "Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008892.1008896",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1982:RTR,
  author =       "{SIGACT News Staff}",
  title =        "Recent technical reports",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "1",
  pages =        "44--65",
  month =        "Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008892.1008897",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1982:TR,
  author =       "{SIGACT News Staff}",
  title =        "Technical reports",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "2",
  pages =        "20--41",
  month =        "Spring",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008899.1008900",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Landweber:1982:CTR,
  author =       "L. H. Landweber",
  title =        "{CSNET}: a tool for researchers in theoretical
                 computer science",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "3",
  pages =        "21--22",
  month =        "Summer",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990511.990512",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tsou:1982:DRS,
  author =       "Don-Min Tsou and Patrick C. Fischer",
  title =        "Decomposition of a relation scheme into {Boyce--Codd
                 Normal Form}",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "3",
  pages =        "23--29",
  month =        "Summer",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990511.990513",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Decomposition into Boyce--Codd Normal Form (BCNF) with
                 a lossless join and preservation of dependencies is
                 desired in the design of a relational database scheme.
                 However, there may be no decomposition of a relation
                 scheme into BCNF that is dependency preserving, and the
                 known algorithms for lossless join decomposition into
                 BCNF require exponential time and space. In this paper
                 we give an efficient algorithm for lossless join
                 decomposition and show that the problem of deciding
                 whether a relation scheme has a dependency-preserving
                 decomposition into BCNF is NP-hard. The algorithm and
                 the proof assume that all data dependencies are
                 functional. We then discuss the extension of our
                 techniques to the case where data dependencies are
                 multivalued.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Grandjean:1982:NUQ,
  author =       "Etienne Grandjean",
  title =        "Number of universal quantifiers and computational
                 complexity: preliminary report",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "3",
  pages =        "30--30",
  month =        "Summer",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990511.990514",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Afshar:1982:CPN,
  author =       "Siroos K. Afshar",
  title =        "On the complexity of permutation network design",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "3",
  pages =        "31--35",
  month =        "Summer",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990511.990515",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The problem addressed is: Given a set of permutations
                 of $n$ objects, design a network consisting of 2-state
                 switches which realizes the given permutations, and in
                 which the number of switches is minimal. A general
                 standard form for feedback-free permutation networks is
                 proposed and used to formulate the problem
                 mathematically. The complexity of an algorithm to solve
                 the problem is studied, and it is shown that there is
                 evidence to suspect that the problem is in the class
                 NP$^{NP}$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mandrioli:1982:TTFa,
  author =       "Dino Mandrioli",
  title =        "On teaching theoretical foundations of computer
                 science",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "3",
  pages =        "36--53",
  month =        "Summer",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990511.990516",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Theoretical foundations of Computer Science (Automata
                 Theory, Complexity, Formal Languages\ldots{}) are
                 taught almost everywhere within Computer Science
                 curricula. However little effort is usually done to
                 present this material in an integrated and motivated
                 way, that is in such a way that its application and use
                 in the solution of practical problems appears to any
                 student. A proposal is developed in order to overcome
                 this inadequacy and to emphasize the basic aspects of
                 theoretical Computer Science.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Diffie:1982:CTF,
  author =       "Whitfield Diffie",
  title =        "Cryptographic technology: fifteen year forecast",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "4",
  pages =        "38--57",
  month =        "Fall--Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008902.1008903",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper examines the forces driving public
                 development of cryptography today and projects the
                 course of the field over the next fifteen years with
                 attention to the possible influence of government
                 regulation. This paper was prepared, under contractual
                 arrangements to CRC Systems, in support of the Commerce
                 Department (National Telecommunications and Information
                 Administration, Special Projects Office) response to a
                 White House Office of Science and Technology Policy
                 request that the secretaries of the Departments of
                 Commerce and Defense propose a national policy on
                 cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mandrioli:1982:TTFb,
  author =       "Dino Mandrioli",
  title =        "On teaching theoretical foundations of {Computer
                 Science}",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "4",
  pages =        "58--69",
  month =        "Fall--Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008902.1008904",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Theoretical foundations of Computer Science (Automata
                 Theory, Complexity, Formal Languages \ldots{}) are
                 taught almost everywhere within Computer Science
                 curricula. However little effort is usually done to
                 present this material in an integrated and motivated
                 way, that is in such a way that its application and use
                 in the solution of practical problems appears to any
                 student. A proposal is developed in order to overcome
                 this inadequacy and to emphasize the basic aspects of
                 theoretical Computer Science.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1982:BRB,
  author =       "John C. Cherniavsky",
  title =        "Book Review: {{\booktitle{Unsolvable Classes of
                 Quantificational Formulas}}, by Harry R. Lewis.
                 Addison-Wesley 1979. and \booktitle{The Decision
                 Problem: Solvable Classes of Quantificational
                 Formulas}, by Burton Dreben and Warren D. Goldfarb.
                 Addison-Wesley 1979}",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "4",
  pages =        "70--71",
  month =        "Fall--Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008902.1008905",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lewis:1979:UCQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1982:RAA,
  author =       "{SIGACT News Staff}",
  title =        "Research advance abstracts",
  journal =      j-SIGACT,
  volume =       "14",
  number =       "4",
  pages =        "72--83",
  month =        "Fall--Winter",
  year =         "1982",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008902.1008906",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Amirazizi:1983:TMP,
  author =       "Hamid R. Amirazizi and Martin E. Hellman",
  title =        "Time-memory-processor tradeoffs",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "18--19",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008909",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Amirazizi:1983:CKP,
  author =       "Hamid R. Amirazizi and Ehud D. Karnin and Justin M.
                 Reyneri",
  title =        "Compact knapsacks are polynomially solvable",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "20--22",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008910",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Blum:1983:CFT,
  author =       "Manuel Blum",
  title =        "Coin Flipping by Telephone --- a Protocol for Solving
                 Impossible Problems",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "23--27",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008911",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Alice and Bob want to flip a coin by telephone. (They
                 have just divorced, live in different cities, want to
                 decide who gets the car.) Bob would not like to tell
                 Alice HEADS and hear Alice (at the other end of the
                 line) say ``Here goes \ldots{} I'm flipping the
                 coin\ldots{}. You lost!'' Coin-flipping in the SPECIAL
                 way done here has a serious purpose. Indeed, it should
                 prove an INDISPENSABLE TOOL of the protocol designer.
                 Whenever a protocol requires one of two adversaries,
                 say Alice, to pick a sequence of bits at random, and
                 whenever it serves Alice's interests best NOT to pick
                 her sequence of bits at random, then coin-flipping (Bob
                 flipping coins to Alice) as defined here achieves the
                 desired goal: (1) It GUARANTEES to Bob that Alice will
                 pick her sequence of bits at random. Her bit is 1 if
                 Bob flips heads to her, 0 otherwise. (2) It GUARANTEES
                 to Alice that Bob will not know WHAT sequence of bits
                 he flipped to her. Coin-flipping has already proved
                 useful in solving a number of problems once thought
                 impossible: mental poker, certified mail, and exchange
                 of secrets. It will certainly prove a useful tool in
                 solving other problems as well.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1983:OSR,
  author =       "Giles Brassard",
  title =        "An optimally secure relativized cryptosystem",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "28--33",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008912",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Even:1983:PSC,
  author =       "Shimon Even",
  title =        "A protocol for signing contracts",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "34--39",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008913",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hellman:1983:NCE,
  author =       "Martin E. Hellman and Ehud D. Karnin and Justin
                 Reyneri",
  title =        "On the necessity of cryptanalytic exhaustive search",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "40--44",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008914",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is shown that the amount of computation required
                 for a general cryptanalytic method is equivalent to an
                 exhaustive search over the key space. In particular,
                 any general time-memory tradeoff must do an exhaustive
                 search as a part of the pre- or post-computation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Henze:1983:SGE,
  author =       "Ernst Henze",
  title =        "The solution of a general equation for the public key
                 system",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "45--49",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008915",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herlestam:1983:FCD,
  author =       "Tore Herlestam",
  title =        "On the feasibility of computing discrete logarithms
                 using {Adleman}'s subexponential algorithm",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "50--55",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008916",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Some public key distribution systems, based on the
                 difficulties in computing logarithms modulo a large
                 prime, have been alleged to be insecure because of a
                 statement that any logarithm modulo a 200 bit prime can
                 be computed within a reasonable time by means of a
                 subexponential algorithm due to Adleman. In this
                 commentary said algorithm is examined from an algebraic
                 and number-theoretical point of view. The scrutiny
                 shows that the algebraic model for the algorithm
                 contains several traps which seem to be hard to
                 circumvent, and also, not least, that the presupposed
                 abundance of so called round numbers will not be at
                 hand in the computationally interesting cases. Hence it
                 is concluded that the algorithm cannot be a serious
                 threat to the mentioned public key distribution
                 systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ingemarsson:1983:AIK,
  author =       "Ingemar Ingemarsson",
  title =        "Are all injective knapsacks partly solvable after
                 multiplication modulo q?",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "56--60",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008917",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jordan:1983:VPK,
  author =       "John P. Jordan",
  title =        "A variant of a public key cryptosystem based on {Goppa
                 Codes}",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "61--66",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008918",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper suggests a way in which an interesting
                 Public Key Cryptosystem based on Goppa Codes introduced
                 by R. J. McEliece can be modified and used in a
                 classical way to yield several advantages. The primary
                 benefit is that the rate of the code (or data expansion
                 reciprocal) can be increased by approximately 75\%.
                 Secondly (for public key and classical versions), by
                 using a polynomial with no linear or repeated factors
                 instead of an irreducible one to generate the Goppa
                 Code, the code parameters remain the same and the
                 decoding apparatus can be used to test candidate
                 generators. Lastly, a wider range of transformations is
                 made possible. No degradation in security is
                 incurred.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Morrison:1983:SEA,
  author =       "D. R. Morrison",
  title =        "Subtractive encryptors: alternatives to the {DES}",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "67--77",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008919",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wiesner:1983:CC,
  author =       "Stephen Wiesner",
  title =        "Conjugate coding",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "78--88",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008920",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1983:ACR,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts computing research laboratory",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "1",
  pages =        "93--104",
  month =        "Winter--Spring",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008908.1008921",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guessarian:1983:IVR,
  author =       "Ir{\`e}ne Guessarian and Francesco Parisi-Presicce",
  title =        "Iterative vs. regular factor algebras",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "32--44",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008924",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We characterize the free regular algebra in any
                 variety of regular algebras as a factor algebra and
                 prove that no similar characterization can be obtained
                 for varieties of iterative or continuous algebras.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moffat:1983:EPM,
  author =       "Alistair Moffat",
  title =        "The effect of paged memory upon algorithm performance:
                 short note",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "45--52",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008925",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We investigate the effect of a common memory
                 management scheme on the running times of some simple
                 algorithms. We find that some otherwise comparable
                 algorithms have markedly different performance under
                 this new algorithm metric.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calude:1983:CIP,
  author =       "Cristian Calude",
  title =        "On a class of independent problems related to {Rice}
                 theorem",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "53--57",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008926",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coren:1983:GA,
  author =       "Stanley Coren",
  title =        "The game of academe",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "58--62",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008927",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A game simulating the progress of a professor through
                 the ranks of academe is offered. This simulation
                 includes many of the most relevant aspects of
                 university life, such as teaching, administration and
                 research. Because it is faithful to the rules of the
                 real life academic situation, its actual playability is
                 somewhat suspect.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1983:A,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "63--74",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008928",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Olsen:1983:EMG,
  author =       "Dan R. Olsen and Norman Badler",
  title =        "An expression model for graphical command languages",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "76--76",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008929",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A unified command model for interactive systems is
                 presented based on the expression syntax of PASCAL-like
                 languages. The relationships between command
                 specification and feedback as they relate to command
                 structure are reviewed for both continuous and discrete
                 interactions. The advantages of a discrete prefix
                 command structure are presented in relationship to the
                 PASCAL expression mechanism. The procedure mechanism of
                 PASCAL-like languages is presented as a basis for
                 graphical command specifications. The advantages of
                 such a model are discussed in terms of borrowed
                 knowledge from compiler construction and user
                 familiarity. The automatic generation of interactive
                 systems from such a model is discussed. An extended
                 example of how procedure declarations can serve as the
                 basis for interactive command definition is given. It
                 is shown how menu-driven systems can be automatically
                 generated from such a description. It is also shown how
                 by extending the procedure declaration it is possible
                 to support iconic identifiers, function buttons and
                 locater and valuator type devices. The role of data
                 types in such a command model is explored in depth. The
                 notion of using a typed data value as a pick identifier
                 is presented. It is shown how such typed identifiers
                 can be integrated into the command model to provide
                 automatic error checking and resolution of ambiguous
                 pointing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Findler:1983:AIT,
  author =       "Nicholas V. Findler and Robert F. Cromp",
  title =        "An artificial intelligence technique to generate
                 self-optimizing experimental designs",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "77--77",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008930",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The paper describes a completed and independent module
                 of a large-scale system, the Quasi-Optimizer (QO). The
                 QO system has three major objectives: (i) to observe
                 and measure adversaries' behavior in a competitive
                 environment, to infer their strategies and to construct
                 a computer model, a {\em descriptive theory}, of each;
                 (ii) to identify strategy components, evaluate their
                 effectiveness and to select the most satisfactory ones
                 from a set of computed descriptive theories; (iv) to
                 combine these components in a quasi-optimum strategy
                 that represents a {\em normative theory\/} in the
                 statistical sense. The measurements on the input
                 strategies can take place either in a sequence of
                 confrontations unperturbed by the QO, or, for
                 efficiency's sake, in a series of environments
                 specified according to some experimental design. The
                 module completed first, QO-I, can perform the
                 experiments either in an exhaustive manner---when every
                 level of a decision variable is combined with every
                 level of the other decision variables---or, in relying
                 on the assumption of a monotonically changing response
                 surface, it uses the binary chopping technique. The
                 module discussed here, QO-3, does not assume monotonic
                 response surfaces and can deal also with
                 multidimensional responses. It starts with a (loosely)
                 balanced incomplete block design for the experiments
                 and computes dynamically the specifications for each
                 subsequent experiment. Accordingly, the levels of the
                 decision variables in any single experiment and the
                 length of the whole sequence of experiments depend on
                 the responses obtained in previous experiments. In
                 general, QO-3 is an on-line, dynamic generator of
                 experimental design that minimizes the total number of
                 experiments performed for a predetermined level of
                 precision.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Findler:1983:NFE,
  author =       "Nicholas V. Findler and Ron Lo",
  title =        "A note on the functional estimation of values of
                 hidden variables: an extended module for expert
                 systems",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "2",
  pages =        "78--78",
  month =        "Spring--Summer",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008923.1008931",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The paper describes an extension of our work on the
                 Generalized Production Rules System. In its original
                 form, it could estimate at a given point of time or
                 space the value of {\em hidden variables\/} ---
                 variables that can be measured only intermittently or
                 periodically. In contrast, {\em open variables\/} are
                 readily measurable any time. The system establishes
                 stochastic, causal relations, {\em generalized
                 production rules}, between known values of hidden
                 variables and certain mathematical properties of the
                 open variables' behavior. These rules are then used to
                 make the point estimates. We have now provided the
                 system with the additional ability to estimate the {\em
                 functional behavior\/} of the hidden variables. The
                 system can serve as a domain-independent module to a
                 knowledge-based expert system in need of such numerical
                 estimates.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fass:1983:LCF,
  author =       "Leona F. Fass",
  title =        "Learning Context-Free Languages from their Structured
                 Sentences",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "3",
  pages =        "24--35",
  month =        "Summer--Fall",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008933.1008934",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Neural/automata-NN.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Neural/neural.6.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cooke:1983:NHS,
  author =       "D. J. Cooke",
  title =        "On non-hierarchical systems of binary operators",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "3",
  pages =        "36--44",
  month =        "Summer--Fall",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008933.1008935",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In a previous paper [3] a system was described by
                 which context-sensitive grammars could be used to
                 specify balanced derivations of certain expressions;
                 such derivations corresponding in a natural way to
                 balanced semantic trees appropriate for parallel
                 execution. The earlier work was only applicable to
                 expressions involving a strictly ordered hierarchy of
                 binary operators. This note shows how under certain
                 `reasonable' algebraic constraints the method can be
                 extended to less well-behaved situations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guessarian:1983:SCI,
  author =       "Ir{\`e}ne Guessarian",
  title =        "Survey on classes of interpretations and some of their
                 applications",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "3",
  pages =        "45--71",
  month =        "Summer--Fall",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008933.1008936",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We introduce classes of interpretations. We
                 characterize the free and Herbrand interpretations for
                 a class. We define the algebraic, equational,
                 relational and first-order classes of interpretations,
                 study their properties and relate them to the
                 literature. We apply this study to derive complete
                 proof systems for deducing (in some (in) equational
                 logic) all (in) equalitions valid in a class.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1983:AAT,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts and available technical reports",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "3",
  pages =        "72--95",
  month =        "Summer--Fall",
  year =         "1983",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008933.1008937",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simons:1984:RCSa,
  author =       "Babra Simons",
  title =        "The reentry {Computer Science Program} at {U.C.
                 Berkeley}",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "36--36",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008940",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stark:1984:CAa,
  author =       "Richard Stark",
  title =        "Combinatory automaton",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "37--37",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008941",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1984:Aa,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "48--56",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008942",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Turner:1984:GGEa,
  author =       "Jonathan S. Turner",
  title =        "On the general graph embedding problem with
                 applications to circuit layout",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "59--59",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008943",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper addresses a class of graph embeding
                 problems in which the object is to map the vertices of
                 one graph to the vertices of another, so that the
                 images of vertices that are adjacent in the {\em source
                 graph\/} are close together in the {\em target graph}.
                 An important special case is the bandwidth minimization
                 problem in which the target graph is a simple line
                 graph. In a previous paper, this author showed that for
                 random graphs having bandwidth at most $k$, a
                 well-known heuristic produces solutions having cost not
                 more than $ 3 k$ with high probability. This paper
                 generalizes these results to the general graph
                 embedding problem. A class of heuristics is described
                 that can be applied to many families of target graphs.
                 Certain aspects of these heuristics depend on
                 properties of the target graphs. These properties are
                 characterized and used to state several metatheorems.
                 Typical of the results is a theorem showing that there
                 exists an efficient heuristic that for random graphs
                 having a cost $k$ embedding in a rectangular grid, will
                 produce an embedding having cost not more than $ 3 k$
                 with high probability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hakimi:1984:MTCa,
  author =       "S. Louis Hakimi and Oded Kariv",
  title =        "Midwest theory of computation symposium: on a
                 generalization of edge-coloring in graphs",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "60--60",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008944",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Bounds are given on the number of colors required to
                 color the edges of a graph (multigraph) such that each
                 color appears at each vertex $v$ at most $ m(v)$ times.
                 The known results and proofs generalize in natural
                 ways. Certain new edge-coloring problems, which have no
                 counterparts when $ m(v) = 1$ for all $ v \in V$, are
                 studied.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Book:1984:RCCa,
  author =       "Ronald V. Book",
  title =        "Relativizations of complexity classes",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "61--61",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008945",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Franco:1984:DFIa,
  author =       "John Franco",
  title =        "Duality, finite improvement and efficiently solved
                 optimization problems",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "62--62",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008946",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gurari:1984:DDCa,
  author =       "Eitan M. Gurari and Ten Hwang Lai",
  title =        "Deadlock detection in communicating finite state
                 machines",
  journal =      j-SIGACT,
  volume =       "15",
  number =       "4",
  pages =        "63--64",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008939.1008947",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simons:1984:RCSb,
  author =       "Babra Simons",
  title =        "The reentry {Computer Science Program} at {U.C.
                 Berkeley}",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "36--36",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008950",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stark:1984:CAb,
  author =       "Richard Stark",
  title =        "Combinatory automaton",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "37--37",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008951",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1984:Ab,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "48--56",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008952",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Turner:1984:GGEb,
  author =       "Jonathan S. Turner",
  title =        "On the general graph embedding problem with
                 applications to circuit layout",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "59--59",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008953",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper addresses a class of graph embeding
                 problems in which the object is to map the vertices of
                 one graph to the vertices of another, so that the
                 images of vertices that are adjacent in the {\em source
                 graph\/} are close together in the {\em target graph}.
                 An important special case is the bandwidth minimization
                 problem in which the target graph is a simple line
                 graph. In a previous paper, this author showed that for
                 random graphs having bandwidth at most $k$, a
                 well-known heuristic produces solutions having cost not
                 more than $ 3 k$ with high probability. This paper
                 generalizes these results to the general graph
                 embedding problem. A class of heuristics is described
                 that can be applied to many families of target graphs.
                 Certain aspects of these heuristics depend on
                 properties of the target graphs. These properties are
                 characterized and used to state several metatheorems.
                 Typical of the results is a theorem showing that there
                 exists an efficient heuristic that for random graphs
                 having a cost $k$ embedding in a rectangular grid, will
                 produce an embedding having cost not more than $ 3 k$
                 with high probability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hakimi:1984:MTCb,
  author =       "S. Louis Hakimi and Oded Kariv",
  title =        "Midwest theory of computation symposium: on a
                 generalization of edge-coloring in graphs",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "60--60",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008954",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Bounds are given on the number of colors required to
                 color the edges of a graph (multigraph) such that each
                 color appears at each vertex $v$ at most m(v) times.
                 The known results and proofs generalize in natural
                 ways. Certain new edge-coloring problems, which have no
                 counterparts when $ m(v) = 1$ for all $ v \in V$, are
                 studied.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Book:1984:RCCb,
  author =       "Ronald V. Book",
  title =        "Relativizations of complexity classes",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "61--61",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008955",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Franco:1984:DFIb,
  author =       "John Franco",
  title =        "Duality, finite improvement and efficiently solved
                 optimization problems",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "62--62",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008956",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gurari:1984:DDCb,
  author =       "Eitan M. Gurari and Ten Hwang Lai",
  title =        "Deadlock detection in communicating finite state
                 machines",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "1",
  pages =        "63--64",
  month =        "Winter--Spring",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008949.1008957",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Johnson:1984:GTC,
  author =       "David S. Johnson",
  title =        "The genealogy of theoretical computer science: a
                 preliminary report",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "2",
  pages =        "36--49",
  month =        "Summer",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008959.1008960",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Santoro:1984:SDT,
  author =       "Nicola Santoro",
  title =        "Sense of direction, topological awareness and
                 communication complexity",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "2",
  pages =        "50--56",
  month =        "Summer",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008959.1008961",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Based on some recent results, it is here argued that
                 the communication complexity of distributed problems
                 can be greatly affected by two factors hereby
                 identified as 'sense of direction' and 'topological
                 awareness'. It is also suggested that 'insensitivity'
                 to either or both factors is an indicator of the
                 inherent difficulty of a distributed problem. A
                 bibliography of recent results is included.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staff:1984:Ac,
  author =       "{SIGACT News Staff}",
  title =        "Abstracts",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "2",
  pages =        "57--62",
  month =        "Summer",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1008959.1008962",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dunham:1984:SUF,
  author =       "Charles B. Dunham",
  title =        "A sequence of uncomputable functions",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "3",
  pages =        "48--48",
  month =        "Fall",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990534.990535",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Broder:1984:PAS,
  author =       "Andrei Broder and Jorge Stolfi",
  title =        "Pessimal algorithms and simplexity analysis",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "3",
  pages =        "49--53",
  month =        "Fall",
  year =         "1984",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/990534.990536",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The twin disciplines of Pessimal Algorithm Design and
                 Simplexity Analysis are introduced and illustrated by
                 means of representative problems",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cherniavsky:1985:NN,
  author =       "John C. Cherniavsky",
  title =        "{NSF} news",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "4",
  pages =        "46--47",
  month =        apr,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382242.382243",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simons:1985:STR,
  author =       "Barbara Simons",
  title =        "Some thoughts on running a conference",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "4",
  pages =        "48--52",
  month =        apr,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382242.382833",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Various aspects of the conference running problem are
                 discussed. Solutions for some special cases are
                 presented, and some new open problems are introduced
                 into the literature.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ornstein:1985:RR,
  author =       "Severo M. Ornstein and Lucy A. Suchman",
  title =        "Reliability and responsibility",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "4",
  pages =        "53--55",
  month =        apr,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382242.382834",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vitanyi:1985:BOV,
  author =       "Paul M. B. Vit{\'a}nyi and Lambert Meertens",
  title =        "Big omega versus the wild functions",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "4",
  pages =        "56--59",
  month =        apr,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382242.382835",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:1976:BOB,Brassard:1985:CBN}.",
  abstract =     "The question of the desirable properties and proper
                 definitions of the Order-of-Magnitude symbols, in
                 particular $O$ and $ {\O }$, is addressed once more.
                 The definitions proposed are chosen for complementary
                 mathematical properties, rather than for similarity of
                 form.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Morgenstern:1985:HCF,
  author =       "Jacques Morgenstern",
  title =        "How to Compute Fast a Function and All Its
                 Derivatives, {A} Variation on the Theorem of
                 {Baur}-{Strassen}",
  journal =      j-SIGACT,
  volume =       "16",
  number =       "4",
  pages =        "60--62",
  month =        apr,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382242.382836",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/auto.diff.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This note is about a simple and algorithmic proof of
                 the striking result of BAUR-STRASSEN [1] showing that
                 the complexity of the evaluation of a rational function
                 of several variables and all its derivatives is bounded
                 above by three times the complexity of the evaluation
                 of the function itself.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  referred =     "[Faure1996a], [Grimm1996a].",
}

@Article{Santoro:1985:MP,
  author =       "Nicola Santoro",
  title =        "The un-merging problem",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "1",
  pages =        "5--6",
  month =        jun,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382250.382251",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Franco:1985:SPR,
  author =       "J. Franco",
  title =        "Sensitivity of probabilistic results on algorithms for
                 {NP}-complete problems to input distributions",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "1",
  pages =        "40--59",
  month =        jun,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382250.382807",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1985:CBN,
  author =       "Gillea Brassard",
  title =        "Crusade for a better notation",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "1",
  pages =        "60--64",
  month =        jun,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382250.382808",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:1976:BOB,Vitanyi:1985:BOV}.",
  abstract =     "In a well-known SIGACT/NEWS paper, Knuth sets forth
                 the asymptotic notation by which we all now live [K76].
                 He closes his discussion with: ``I propose that members
                 of SIGACT (\ldots{}) adopt the $O$, $ O m e g a$ and $
                 T h e t a$ notations as defined above, unless a better
                 alternative can be found reasonably soon''. Although
                 one can hardly consider nearly a full decade later as
                 being ``reasonably soon'', I would like to share with
                 you my thoughts on the subject.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McBeth:1985:TSE,
  author =       "Rod McBeth",
  title =        "The tree structure of exponential calculations",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "1",
  pages =        "65--77",
  month =        jun,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382250.382809",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Eqvhazy:1985:GSF,
  author =       "C. J. Eqvhazy and T. B. Ramsay",
  title =        "Generating a set of fundamental cycles in a graph",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "1",
  pages =        "78--82",
  month =        jun,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382250.382810",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hastings:1985:MIP,
  author =       "Harold M. Hastings",
  title =        "Maps of the interval, polynomial time, and polynomial
                 space",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "2",
  pages =        "44--51",
  month =        sep,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382252.382253",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We use sequences of expansive maps of the interval to
                 construct non-autonomous systems which appear to
                 display ``hyper-exponential loss of information''
                 (defined below). A rigorous proof of this loss of
                 information would prove that the class P of languages
                 accepted in polynomial time is properly contained in
                 the class PTAPE of languages accepted in polynomial
                 space. Thus either P = NP or NP = PTAPE, where NP is
                 the class of languages accepted by non-deterministic
                 machines in polynomial time.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hastings:1985:CSA,
  author =       "Harold M. Hastings",
  title =        "Convergence of simulated annealing",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "2",
  pages =        "52--63",
  month =        sep,
  year =         "1985",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382252.382806",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We develop worst-case and typical estimates for the
                 rate of convergence of annealing algorithms. The
                 worst-case estimates extend results of Geman and Geman
                 (1983) for pattern recognition. However, as Geman and
                 Geman observe, and empirical results imply, simulated
                 annealing usually displays much faster convergence (and
                 thus allows much faster cooling) than their worst-case
                 results. Our typical case results help to explain this
                 phenomenon.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dunham:1986:SAB,
  author =       "Charles B. Dunham",
  title =        "A Simpler Approach to the {Busy Beaver Problem}",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "3",
  pages =        "29--29",
  month =        "Winter",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382254.990522",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chibnik:1986:AES,
  author =       "Mara Chibnik",
  title =        "Algorithmic elimination of spurious nondeterminism
                 from {Mealy} machines",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "3",
  pages =        "30--34",
  month =        "Winter",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382254.382804",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nirenberg:1986:PTM,
  author =       "Robert M. Nirenberg",
  title =        "A practical {Turing} machine representation",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "3",
  pages =        "35--44",
  month =        "Winter",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/382254.382805",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:22 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/RISC.parlab.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A tool is presented for research work on Turing
                 machines and other abstract programming models. This
                 tool is based on the use of the Recursive Function
                 Algorithmic Language (Refal). A short background of
                 this language is presented. Examples are given as to
                 how this language may be useful for running simulations
                 of Turing machines, and how it may be useful for the
                 researcher into abstract machines.",
  acknowledgement = ack-nhfb,
  descr =        "plfun-refal",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wegman:1986:WLP,
  author =       "M. N. Wegman",
  title =        "What it's like to be a {POPL} referee",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "4",
  pages =        "50--51",
  month =        "Spring",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8307.8308",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1986:ISM,
  author =       "Z. Galil and R. Giancarlo",
  title =        "Improved string matching with {$k$} mismatches",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "4",
  pages =        "52--54",
  month =        "Spring",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8307.8309",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/tq.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fass:1986:ICC,
  author =       "L. F. Fass",
  title =        "On the inference of canonical context-free grammars",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "4",
  pages =        "55--60",
  month =        "Spring",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8307.8310",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gurevich:1986:WDM,
  author =       "Y. Gurevich",
  title =        "What does {O(n)} mean",
  journal =      j-SIGACT,
  volume =       "17",
  number =       "4",
  pages =        "61--63",
  month =        "Spring",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8307.8311",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bernstein:1986:TS,
  author =       "R. Bernstein",
  title =        "Testing for semilattices",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "49--50",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8313",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dunham:1986:CBP,
  author =       "C. B. Dunham",
  title =        "The cycle burning problem",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "51--51",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8314",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wilson:1986:HPT,
  author =       "D. M. Wilson",
  title =        "The halting problem for {Turning} machines",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "52--52",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8315",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Atkinson:1986:ICB,
  author =       "D. M. Atkinson and N. Santoro and J. Urrutia",
  title =        "On the integer complexity of {Boolean} matrix
                 multiplication",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "53--53",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8316",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1986:PSS,
  author =       "I. Parberry",
  title =        "Parallel speedup of sequential machines: a defense of
                 parallel computation thesis",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "54--67",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8317",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is reasonable to expect parallel machines to be
                 faster than sequential ones. But exactly how much
                 faster do we expect them to be? Various authors have
                 observed that an exponential speedup is possible if
                 sufficiently many processors are available. One such
                 author has claimed (erroneously) that this is a
                 counterexample to the parallel computation thesis. We
                 show that even more startling speedups are possible. In
                 fact, if enough processors are used, any recursive
                 function can be computed in constant time. Although
                 such machines clearly do not obey the parallel
                 computation thesis, we argue that they still provide
                 evidence in favour of it. In contrast, we show that an
                 arbitrary polynomial speedup of sequential machines is
                 possible on a model which satisfies the parallel
                 computation thesis. If, as widely conjectured, P $ \not
                 \subseteq $ POLYLOGSPACE, then there can be no
                 exponential speedup on such a model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harel:1986:LDC,
  author =       "D. Harel",
  title =        "Logic and databases: a critique",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "68--74",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8318",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dewdney:1986:EGR,
  author =       "A. K. Dewdney",
  title =        "Experiments with a generic reduction computer",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "75--79",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8319",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gerety:1986:TCT,
  author =       "C. Gerety and P. Cull",
  title =        "Time complexity of the {Towers} of {Hanoi} problem",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "1",
  pages =        "80--87",
  month =        "Summer",
  year =         "1986",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/8312.8320",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kozen:1986:FPO,
  author =       "D. Kozen",
  title =        "Fast parallel orthogonalization",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "2",
  pages =        "47--47",
  month =        sep # "\slash " # mar,
  year =         "1986--1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24652.24653",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/parallel.symbolic.comp.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wiedemann:1986:QC,
  author =       "D. Wiedemann",
  title =        "Quantum cryptography",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "2",
  pages =        "48--51",
  month =        sep # "\slash " # mar,
  year =         "1986--1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24652.24654",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An idea of Stephen Wiesner [1] is expanded to give a
                 method of public key distribution which is provably
                 secure under the principles of quantum mechanics. It
                 appears that this scheme could actually be implemented
                 in favorable environments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gallaire:1986:LDR,
  author =       "H. Gallaire and J. Minker and J. M. Nicolas",
  title =        "Logic and databases: a response",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "2",
  pages =        "52--56",
  month =        sep # "\slash " # mar,
  year =         "1986--1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24652.24655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Qiang:1986:PAS,
  author =       "Z. Qiang",
  title =        "An {$ O(\ln n) $} parallel algorithm for the subset
                 sum problem",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "2",
  pages =        "57--63",
  month =        sep # "\slash " # mar,
  year =         "1986--1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24652.24656",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McBeth:1986:TSE,
  author =       "R. McBeth",
  title =        "The tree structure of exponential calculations ---
                 Addendum",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "2",
  pages =        "64--64",
  month =        sep # "\slash " # mar,
  year =         "1986--1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24652.24657",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Williams:1987:RPS,
  author =       "K. L. Williams and M. R. Meybodi",
  title =        "Representing problems as string transformations",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "29--30",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24659",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McBeth:1987:PGI,
  author =       "R. McBeth",
  title =        "A proof of generalized induction",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "31--36",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24660",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dunham:1987:PU,
  author =       "C. B. Dunham",
  title =        "Pessimization is unsolvable",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "37--37",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24661",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Epstein:1987:NCC,
  author =       "D. Epstein",
  title =        "On the {NP}-completeness of cryptarithms",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "38--40",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24662",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{DosReis:1987:RLU,
  author =       "A. J. {Dos Reis}",
  title =        "Regular languages under {F-gsm} mappings",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "41--45",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24663",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{DosReis:1987:RLD,
  author =       "A. J. {Dos Reis}",
  title =        "Regular languages do not form a lattice under {GSM}
                 mappings",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "46--47",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24664",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Burkholder:1987:HP,
  author =       "L. Burkholder",
  title =        "The halting problem",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "48--60",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24665",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Staples:1987:THP,
  author =       "E. Staples",
  title =        "The tower of {Hanoi} problem with arbitrary start and
                 end positions",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "3",
  pages =        "61--64",
  month =        apr,
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/24658.24666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Swenson:1987:CPC,
  author =       "James M. Swenson",
  title =        "A constructive proof of the countability of {$ \Sigma
                 * $}",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "4",
  pages =        "48--50",
  month =        "Summer",
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/36068.36069",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bennett:1987:QPK,
  author =       "Charles H. Bennett and Gilles Brassard",
  title =        "Quantum public key distribution reinvented",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "4",
  pages =        "51--53",
  month =        "Summer",
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/36068.36070",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Teng:1987:CHE,
  author =       "Shang-Hua Teng",
  title =        "The construction of {Huffman-equivalent} prefix code
                 in {NC}",
  journal =      j-SIGACT,
  volume =       "18",
  number =       "4",
  pages =        "54--61",
  month =        "Summer",
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/36068.36071",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper, we show that an optimal prefix code
                 (Huffman-equivalent code) over $ \Sigma = \{ 0, 1,
                 \ldots {}, \sigma \} $ for any $n$ letters $ a_1,
                 \ldots {}, a_n$ of frequency $ f_1, \ldots {}, f_n$ can
                 be constructed in $ O(\log^2 n)$ time, using only
                 polynomial number of processors. This is done by a
                 uniform reduction of optimal prefix coding problem to a
                 min-plus circuit value problem of polynomial size and
                 linear degree. Thus we can use the parallel circuit
                 evaluation algorithms presented in [7] and [8] to
                 construct a time-efficient and processor-efficient
                 parallel algorithm for optimal prefix coding problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simmons:1987:FFC,
  author =       "B. Simmons and J. Yudken",
  title =        "Federal funding in computer science: a preliminary
                 report",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "1",
  pages =        "54--63",
  month =        "Fall",
  year =         "1987",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/38309.38310",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1988:HPP,
  author =       "Ian Parberry",
  title =        "How to Present a Paper in Theoretical Computer
                 Science: a Speaker's Guide for Students",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "2",
  pages =        "42--47",
  month =        "????",
  year =         "1988",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/eureca.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kantabutra:1988:LBP,
  author =       "V. Kantabutra",
  title =        "A lower bound on the path length of binary trees",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "2",
  pages =        "48--50",
  month =        "Summer",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/49097.49098",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moret:1988:PNP,
  author =       "B. M. E. Moret",
  title =        "Planar {NAE3SAT} is in {P}",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "2",
  pages =        "51--54",
  month =        "Summer",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/49097.49099",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Lichtenstein proposed the use of a ``planar'' version
                 of 3SAT as a departure point for proofs of NP
                 -completeness that would at once prove the general
                 graph problem as well as its restriction to planar
                 graphs to be NP -complete. Dyer and Frieze later proved
                 that Planar lin3SAT is also NP -complete. Of the three
                 standard versions of 3SAT, only NAE3SAT remained open.
                 We provide a very simple reduction from NAE3SAT to
                 Simple MaxCut, which respects Lichtenstein's
                 conditions; since it is known that the planar version
                 of (Simple) MaxCut is in P, so is the planar version of
                 NAE3SAT, thereby setting the question (if in a somewhat
                 unexpected way).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Trickey:1988:UL,
  author =       "Howard Trickey",
  title =        "Using {\LaTeX}",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "2",
  pages =        "55--57",
  month =        "Summer",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/49097.49100",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This note explains how to use a IAT$_E$ X style that
                 produces a good approximation to the style used in SIAM
                 journals. The note is itself an example of the siam
                 style in action.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Klawe:1988:SSS,
  author =       "Maria Klawe",
  title =        "{SIGACT} salary survey",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "3--4",
  pages =        "11--17",
  month =        "Fall",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/58395.58396",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1988:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "3--4",
  pages =        "21--26",
  month =        "Fall",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/58395.58397",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ciesinger:1988:NN,
  author =       "Joachim Ciesinger",
  title =        "Neural nets",
  journal =      j-SIGACT,
  volume =       "19",
  number =       "3--4",
  pages =        "46--47",
  month =        "Fall",
  year =         "1988",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/58395.58398",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 08:21:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Graham:1988:TAB,
  author =       "Ronald L. Graham and Donald E. Knuth and Oren
                 Patashnik",
  title =        "Textbook Announcement: {{\booktitle{Concrete
                 Mathematics: a Foundation for Computer Science}}}",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1988",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 23 10:33:54 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Graham:1989:CM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kanellakis:1989:DBR,
  author =       "P. Kanellakis and S. Abiteboul",
  title =        "Deciding bounded recursion in database logic
                 programs",
  journal =      j-SIGACT,
  volume =       "20:4",
  number =       "??",
  month =        "Fall",
  year =         "1989",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/finite.model.theory.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zeugmann:1989:BRB,
  author =       "T. Zeugmann",
  title =        "Book Review: {Baase, \booktitle{Computer Algorithms:
                 Introduction to Design and Analysis} (2nd ed.)
                 (1988)}",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "??",
  month =        "????",
  year =         "1989",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Apr 6 06:05:01 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Baase:1978:CAI,Baase:1988:CAI,Baase:2000:CAI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ramshaw:1989:SON,
  author =       "L. Ramshaw",
  title =        "Suitening our nomenclature",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "1",
  pages =        "60--61",
  month =        "Winter",
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/65780.65781",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Donald E. Knuth has suggested an alternative name for
                 a multiset that I like very much: a suite, as in a
                 suite of rooms or a suite of dances. Please join me in
                 replacing ``multiset'' and ``bag'' with ``suite'' in
                 our mathematical lexicon.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tompa:1989:FM,
  author =       "M. Tompa",
  title =        "Figures of merit",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "1",
  pages =        "62--71",
  month =        "Winter",
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/65780.65782",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1989:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "2",
  pages =        "10--11",
  month =        mar,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/70640.70641",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1989:CCa,
  author =       "Gilles Brassard",
  title =        "Cryptology column",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "3",
  pages =        "15--19",
  month =        jul,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/70642.70643",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1989:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "3",
  pages =        "25--26",
  month =        jul,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/70642.70644",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Engelfriet:1989:CCP,
  author =       "Joost Engelfriet",
  title =        "The complexity of the circularity problem for
                 attribute grammars: a note on a counterexample for a
                 simpler construction",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "3",
  pages =        "57--59",
  month =        jul,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/70642.70645",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is shown in [Dil] that the construction in [Jaz] is
                 incorrect. A correct version of the construction can be
                 found in [EngFil].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Salenieks:1989:HAI,
  author =       "Peter Salenieks and Michael G. Farringdon",
  title =        "How {To Answer It}",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "3",
  pages =        "60--63",
  month =        jul,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/70642.990537",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A light hearted corollary to Dana Angluin's ideas on
                 the notion of 'proof' is presented. It offers useful
                 advice to people who attend seminars and conferences,
                 either to speak or to listen.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1989:CCb,
  author =       "G. Brassard",
  title =        "Cryptology --- column 2",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "13--13",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74075",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dwork:1989:DCC,
  author =       "C. Dwork",
  title =        "Distributed computing column",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "14--16",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74076",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kanellakis:1989:DTC,
  author =       "Paris C. Kanellakis and Serge Abiteboul",
  title =        "Database Theory Column: Deciding Bounded Recursion in
                 Database Logic Programs",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "17--23",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74077",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact20.html#KanellakisA89;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1989.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The study of database logic programs, popularly known
                 as Datalog programs, is one of the principal research
                 themes in database theory today. Datalog is the
                 simplest formalism available for describing rule-based
                 programming and, thus, of interest to the larger
                 computer science community. A key optimization problem
                 is to estimate the depth of recursion of a database
                 logic program, as a function of the size of its input
                 database. Deciding bounded recursion for a given
                 program, i.e., determining whether its depth of
                 recursion is bounded by a constant independent of the
                 input, turns out to be a basic and surprisingly subtle
                 task. In the first database theory column, we review
                 the progress made on understanding bounded recursion
                 and list some of the outstanding open questions. For
                 the readers, who are not familiar with the terminology,
                 we include the relevant definitions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1989:OP,
  author =       "S. Khuller",
  title =        "Open problems: 3",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "24--24",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74078",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:1989:NRC,
  author =       "D. T. Lee",
  title =        "{NSF} report --- computer and computation research",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "25--25",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74079",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1989:RCR,
  author =       "M. C. Loui",
  title =        "Reprint from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "26--29",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74080",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has reached
                 an agreement to reprint review that originally appeared
                 in Computing Reviews of books and articles of interest
                 to the theoretical computer science community.
                 Computing Reviews is a monthly journal that publishes
                 critical reviews on a broad range of computing subject,
                 including models of computation, formal languages,
                 computational complexity theory, analysis of
                 algorithms, and logics and semantics of programs. ACM
                 members can receive a subscription of Computing Reviews
                 for \$30 per year by writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1989:CGCc,
  author =       "J. O'Rourke",
  title =        "Computational geometry column 8",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "30--30",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74081",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1989:JRC,
  author =       "I. Parberry",
  title =        "The journal review column",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "31--37",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74082",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Farmer:1989:MAL,
  author =       "W. M. Farmer and A. J. Kfoury",
  title =        "Minutes of the 4th annual {LICS} business meeting",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "43--47",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74083",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Feigenbaum:1989:RDS,
  author =       "J. Feigenbaum",
  title =        "Report on {DIMACS} seminar series",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "48--49",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74084",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guessarian:1989:LLI,
  author =       "I. Guessarian and D. Perrin",
  title =        "{LITP}: {Laboratoire D'Informatique th{\'e}orique et
                 programmation Paris}: Presentation of scientific
                 activity",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "50--53",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74085",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stallman:1989:COC,
  author =       "M. Stallman",
  title =        "Course outline: course announcement (Spring 1989)
                 {CSE\slash OR 691} {I}: {Surviving Intractability}",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "74--77",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74086",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bennett:1989:EQC,
  author =       "C. H. Bennett and G. Brassard",
  title =        "Experimental quantum cryptography: the dawn of a new
                 era for quantum cryptography: the experimental
                 prototype is working",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "78--80",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74087",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:1989:LBS,
  author =       "M. Chrobak and H. Karloff",
  title =        "A lower bound on the size of universal sets for planar
                 graphs",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "83--86",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74088",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A F{\'a}ry embedding of a planar graph $G$ is an
                 embedding of $G$ into the plane, no edges crossing,
                 with each edge embedded as a straight line segment. A
                 set $ A C I R^2$ is said to be n-universal if every $n$
                 node planar graph has a F{\'a}ry embedding into $A$. We
                 show that any $n$-universal set has size at least $
                 1.098 n$, for sufficiently large $n$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fischer:1989:PRI,
  author =       "M. J. Fischer and R. P. Fischer and R. Beigel",
  title =        "Primitive recursion without implicit predecessor",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "87--91",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74089",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The primitive recursive functions are the least class
                 of functions on the natural numbers containing the
                 constant, successor, and projection functions, and
                 closed under composition and the rule of primitive
                 recursion. A weakened rule of primitive recursion,
                 lacking implicit predecessor, is shown nevertheless to
                 be adequate for defining all of the primitive recursive
                 functions. However, it is conjectured that the still
                 weaker rule of iteration is not adequate, and it is
                 shown that an easily characterized class of 1-Place
                 functions that includes predecessor cannot be defined
                 when only 0- and 1-place intermediate functions are
                 allowed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1989:GNR,
  author =       "I. Parberry",
  title =        "A guide for new referees in theoretical computer
                 science",
  journal =      j-SIGACT,
  volume =       "20",
  number =       "4",
  pages =        "92--99",
  month =        nov,
  year =         "1989",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/74074.74090",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brasard:1990:CCH,
  author =       "Gilles Brasard",
  title =        "Cryptology --- column 3 hot news on interactive
                 protocols",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "7",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379162",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1990:OP,
  author =       "Samir Khuller",
  title =        "Open problems",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "12",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379163",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:1990:NRCa,
  author =       "D. T. Lee",
  title =        "{NSF} report --- computer and computation research",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "13",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379165",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1990:RCR,
  author =       "Michael C. Loui",
  title =        "Reprint from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "14",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379166",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has reached
                 an agreement to reprint reviews that originally
                 appeared in Computing Reviews of books and articles of
                 interest to the theoretical computer science community.
                 Computing Reviews is a monthly journal that publishes
                 critical reviews on a broad range of computing
                 subjects, including models of computation, formal
                 languages, computational complexity theory, analysis of
                 algorithms, and logics and semantics of programs. ACM
                 members can receive a subscription to Computing Reviews
                 for \$32 per year by writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1990:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 9",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "18",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379167",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1990:JRCa,
  author =       "Ian Parberry",
  title =        "The journal review column",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "21",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379168",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The journal review column is established to provide
                 readers of SIGACT News with up-to-date information on
                 journals and journal-like publications which carry
                 articles of potential interest to theoretical computer
                 scientists. It will include research, survey, review
                 and `popular' publications, theory journals and applied
                 journals, general journals and specialized journals,
                 with the common thread being that they are receptive to
                 theoretical computer science. The term `theoretical
                 computer science' will be interpreted broadly. It is
                 the intent of the column to inform, not to rank or in
                 any way pass judgement on the quality of journals or
                 the articles published therein. Journals to be reviewed
                 include, but are not necessarily restricted to the list
                 appearing in the first column (SIGACT News, Vol. 12,
                 No. 3, pp. 27--28, 1989). Suggestions from readers of
                 the column are welcome.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ravi:1990:JBR,
  author =       "S. S. Ravi",
  title =        "Journal backlog report",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "1",
  pages =        "26",
  month =        jan,
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379139.379170",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Johnson:1990:SFB,
  author =       "David S. Johnson",
  title =        "A {STOC\slash FOCS} bibliography: the last progress
                 report",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "4",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379173",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1990:CCH,
  author =       "Gilles Brassard",
  title =        "Cryptology --- column 4: hiding information from
                 oracles",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "5",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379174",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dwork:1990:DCC,
  author =       "Cynthia Dwork",
  title =        "Distributed computing column",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "12",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379175",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:1990:NRCb,
  author =       "D. T. Lee",
  title =        "{NSF} report --- computer and computation research",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "16",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379177",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1990:JRCb,
  author =       "Ian Parberry",
  title =        "The journal review column",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "21",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379182",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The journal review column is established to provide
                 readers of SIGACT News with up-to-date information on
                 journals and journal-like publications which carry
                 articles of potential interest to theoretical computer
                 scientists. It will include research, survey, review
                 and `popular' publications, theory journals and applied
                 journals, general journals and specialized journals,
                 with the common thread being that they are receptive to
                 theoretical computer science. The term `theoretical
                 computer science' will be interpreted broadly. It is
                 the intent of the column to inform, not to rank or in
                 any way pass judgement on the quality of journals or
                 the articles published therein. Journals to be reviewed
                 include, but are not necessarily restricted to the list
                 appearing in the first column (SIGACT News, Vol. 12,
                 No. 3, pp. 27--28, 1989). Suggestions from readers of
                 the column are welcome.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Feigenbaum:1990:RDS,
  author =       "Joan Feigenbaum",
  title =        "Report on {DIMACS} seminar series",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "25",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379184",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hambrusch:1990:RMT,
  author =       "Susanne E. Hambrusch",
  title =        "Report of the {21st Midwest Theory Consortium}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "30",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379185",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Liestman:1990:RWM,
  author =       "Arthur L. Liestman",
  title =        "Report on {WOBCATS meeting}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "32",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379186",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Proskurowski:1990:RGG,
  author =       "Andrzej Proskurowski",
  title =        "Report on {GRA-GRA: 4th International Workshop on
                 Graph Grammars and Their Applications to Computer
                 Science}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "39",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379187",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dwyer:1990:KGA,
  author =       "Rex A. Dwyer",
  title =        "Kinder, gentler average-case analysis for convex hulls
                 and maximal vectors",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "2",
  pages =        "64",
  month =        "Spring",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/379172.379188",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "While the derivations of precise asymptotic estimates
                 found in the mathematical literature are not easily
                 accessible to the non-specialist, there are rather
                 simple arguments for deriving rougher `big-theta'
                 bounds on the expected size of random convex hulls.
                 These arguments are presented, then applied to verify a
                 recently published conjecture on the expected number of
                 maximal vectors among a set of random points chosen
                 from a ball. A summary of recent progress follows.
                 Results relevant for analyzing algorithms are
                 emphasized.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abiteboul:1990:DTC,
  author =       "Serge Abiteboul and Paris C. Kanellakis",
  title =        "Database Theory Column: Query Languages for Complex
                 Object Databases",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "3",
  pages =        "9--18",
  month =        "Summer",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/101368.101370",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact21.html#AbiteboulK90;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1990.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Complex object databases have been proposed as a
                 significant extension of relational databases, with
                 many practical applications. In the second database
                 theory column, we present languages for the
                 manipulation of such databases: a many-sorted algebra
                 and an equivalent calculus. Without attempting to
                 standardize, we try to provide general and short
                 definitions that highlight the two key constructors of
                 complex objects: tuples and (finite) sets. We comment
                 on issues, such as language expressive power and
                 complexity, and we describe equivalent rule-based
                 languages with fixpoint semantics. Finally, we review
                 the state-of-the art in database complex objects and
                 list some interesting open questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Thurimella:1990:RWW,
  author =       "Ramki Thurimella",
  title =        "Report on {WOPA: Workshop on Parallel Algorithms}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "3",
  pages =        "??--??",
  month =        "Summer",
  year =         "1990",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/RISC.parlab.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Published by: ACM Press",
  acknowledgement = ack-nhfb,
  descr =        "pa",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  owner =        "pcl",
}

@Article{Palopoli:1990:NPU,
  author =       "Luigi Palopoli",
  title =        "A new proof of undecidability of safety of logic
                 queries",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "4",
  pages =        "69--72",
  month =        "Fall",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/101371.101373",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ravikumar:1990:SAT,
  author =       "B. Ravikumar",
  title =        "Some applications of a technique of {Sakoda} and
                 {Sipser}",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "4",
  pages =        "73--77",
  month =        "Fall",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/101371.101375",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Sakoda and Sipser [Sa78] introduced a technique for
                 constructing certain regular languages over a large
                 alphabet and used these languages as candidates for
                 proving lower bounds on the size increase when
                 converting a nondeterministic finite automaton (NFA) to
                 a deterministic one (DFA). The purpose of this note is
                 to show that their method is quite useful in solving
                 several problems in the theory of regular languages. In
                 view of its intuitive appeal, we recommend it as a
                 pedagogic aid for presenting lower bound proofs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tompa:1990:FMS,
  author =       "Martin Tompa",
  title =        "Figures of merit: the sequel",
  journal =      j-SIGACT,
  volume =       "21",
  number =       "4",
  pages =        "78--81",
  month =        "Fall",
  year =         "1990",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/101371.101376",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Science has marched on despite the appearance of the
                 original `Figures of Merit' [18]. The purpose of this
                 survey is to bring the community up to date on the most
                 recent bounds, so that we may collaborate to improve
                 them.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1991:HCY,
  author =       "Gilles Brassard",
  title =        "How convincing is your protocol?",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "5--12",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.122414",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Levin:1991:TCH,
  author =       "Leonid Levin",
  title =        "Theory of computation: how to start",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "47--56",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.122415",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1991:REC,
  author =       "Zvi Galil and Giuseppe F. Italiano",
  title =        "Reducing edge connectivity to vertex connectivity",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "57--61",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.122416",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/dynamic.graph.alg.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We show how to reduce edge connectivity to vertex
                 connectivity. Using this reduction, we obtain a
                 linear-time algorithm for deciding whether an
                 undirected graph is 3-edge-connected, and for computing
                 the 3-edge-connected components of an undirected
                 graph.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ibarra:1991:RD,
  author =       "Oscar H. Ibarra",
  title =        "On resetting {DLBA}'s",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "62--63",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.122417",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Leiss:1991:SCR,
  author =       "Ernst L. Leiss",
  title =        "Some comments on a recent note by {Ravikumar}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "64--64",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.122418",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sherman:1991:SSFa,
  author =       "Alan T. Sherman",
  title =        "On {Superpolylogarithmic Subexponential Functions}
                 {(Part I)}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "1",
  pages =        "65",
  month =        "Winter",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122413.990652",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A superpolylogarithmic subexponential function is any
                 function that asymptotically grows faster than any
                 polynomial of any logarithm but slower than any
                 exponential. We present a recently discovered
                 nineteenth-century manuscript about these functions,
                 which in part because of their applications in
                 cryptology, have received considerable attention in
                 contemporary computer science research. Attributed to
                 the little-known yet highly-suspect
                 composer/mathematician Maria Poopings, the manuscript
                 can be sung to the tune of
                 `Supercalifragilisticexpialidocious' from the musical
                 Mary Poppins. In addition, we prove three ridiculous
                 facts about superpolylogarithmic subexponential
                 functions. Using novel extensions to the popular DTIME
                 notation from complexity theory, we also define the
                 complexity class Super PolyLog/SubExp, which consists
                 of all languages that can be accepted within
                 deterministic superpolylogarithmic subexponential time.
                 We show that this class is notationally intractable in
                 the sense that it cannot be conveniently described
                 using existing terminology. Surprisingly, there is some
                 scientific value in our notational novelties; moreover,
                 students may find this paper helpful in learning about
                 growth rates, asymptotic notations, cryptology, and
                 reversible computation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Birget:1991:IRL,
  author =       "Jean-Camille Birget",
  title =        "Intersection of {Regular Languages} and {State
                 Complexity}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "2",
  pages =        "49",
  month =        "Spring",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122295.993136",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ragde:1991:EPT,
  author =       "Prabhakar Ragde",
  title =        "Extracting Poetry from Technical Papers",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "2",
  pages =        "50",
  month =        "Spring",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122295.993137",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:47:44 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sherman:1991:SSFb,
  author =       "Man T. Sherman",
  title =        "On {Superpolylogarithmic Subexponential Functions}
                 {(Part II)}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "2",
  pages =        "51--56",
  month =        "Spring",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/122295.993138",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cole:1991:RSW,
  author =       "Richard Cole and Alan Siegel",
  title =        "Report on the {Second Workshop on Parallel Algorithms
                 (WOPA)}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "20--23",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126538",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kirchner:1991:RTA,
  author =       "H{\'e}l{\`e}ne Kirchner and Pierre Lescanne",
  title =        "Rewriting techniques and applications, {RTA'91}",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "24--30",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126539",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Angier:1991:GCT,
  author =       "Natalie Angier",
  title =        "The glass ceiling: in theory women swell ranks of
                 science, but remain invisible at the top",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "38--40",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126540",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "[I]n extensive interviews with women at all stages of
                 their scientific careers and in a broad variety of
                 disciplines, the researchers insisted that in fact some
                 of the difficulties they encountered were peculiar to
                 their trade, and that certain characteristics of the
                 scientific culture were likelier to impede women's
                 progress than to propel it. Among those characteristics
                 is the extreme insularity of science, and the need to
                 be at the center of the rumor mill if one is to hear of
                 vital new results before competitors do \ldots{}. They
                 also said they were given far fewer chances to present
                 their findings and ideas to powerful audiences of their
                 peers, a key method of winning converts and scientific
                 influence \ldots{} [M]any female scientists believe
                 that when conference organizers put together their
                 roster of speakers, deciding who are the most respected
                 elders, or the hottest young turks, women seem to come
                 to mind rarely\ldots{} Despite the greater
                 opportunities in the lower ranks, women remain poorly
                 represented in the upper echelons\ldots{} 'Women appear
                 invisible to men,' said Dr. Margaret Davis \ldots{} 'If
                 you ask men for the names of seminar or symposium
                 speakers, the names you get back are almost invariably
                 male. If you ask women, you get both male and female
                 names.' \ldots{} 'We've got lots of women on the
                 panel,' [Dr. Darrell S. Rigel] said. But on checking
                 the exact number, he laughed nervously. 'Oh, wait a
                 minute. Only 2 out of 28. Hmm. It never occurred to me.
                 I just don't choose people on the basis of gender. But
                 this does raise my consciousness.'\ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1991:TCA,
  author =       "Michael C. Loui",
  title =        "Theory of computing: achievements, challenges, and
                 opportunities",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "41--48",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126541",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parikh:1991:TFL,
  author =       "Rohit Parikh",
  title =        "A test for fuzzy logic",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "49--50",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126542",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yu:1991:SCI,
  author =       "Sheng Yu and Qingyu Zhuang",
  title =        "On the state complexity of intersection of regular
                 languages",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "52--54",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126543",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McBeth:1991:FTE,
  author =       "M. A. McBeth",
  title =        "Finite types, exponential forms and complete trees",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "55--62",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126544",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Laplante:1991:HUP,
  author =       "P. A. Laplante",
  title =        "The {Heisenberg} uncertainty principle and the halting
                 problem",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "3",
  pages =        "63--65",
  month =        "Summer",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126537.126545",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper it is suggested that the Heisenberg
                 Uncertainty Principle, normally applied to physical
                 systems, can be applied directly to show that the
                 Halting Problem is unsolvable. Although the Heisenberg
                 Uncertainty Principle has appeared in the context of
                 software engineering before [3] it is used in analogy
                 there. As far as the author can determine, this would
                 be the first direct application of the Uncertainty
                 Principle to the solution of a problem in computer
                 science.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rupert:1991:CRL,
  author =       "C. P. Rupert",
  title =        "Commutative regular languages",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "4",
  pages =        "48--49",
  month =        "Fall",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126546.126547",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aurenhammer:1991:PVD,
  author =       "F. Aurenhammer and G. St{\"o}ckl",
  title =        "On the {Peeper}'s {Voronoi} diagram",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "4",
  pages =        "50--59",
  month =        "Fall",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126546.126548",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the peeper's Voronoi diagram for $n$ sites, any
                 point in the plane belongs to the region of the closest
                 site visible from it. Visibility is constrained to a
                 segment on a line avoiding the convex hull of the
                 sites. We show that the peeper's Voronoi diagram
                 attains a size of $ \Theta (n^2)$ in the worst case,
                 and that it can be computed in $ O(n^2)$ time and
                 space.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-Amram:1991:SNN,
  author =       "Amir M. Ben-Amram",
  title =        "Some notions on notations",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "4",
  pages =        "60--62",
  month =        "Fall",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126546.126549",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vishkin:1991:CPA,
  author =       "Uzi Vishkin",
  title =        "Can parallel algorithms enhance serial
                 implementation",
  journal =      j-SIGACT,
  volume =       "22",
  number =       "4",
  pages =        "63--63",
  month =        "Fall",
  year =         "1991",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/126546.126550",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Consider the serial emulation of a parallel algorithm.
                 The thesis presented in this informal paper is rather
                 broad. It suggests that such a serial emulation has the
                 potential advantage of running on a serial machine
                 faster than a standard serial algorithm for the same
                 problem. The main concrete observation is very simple:
                 just before the serial emulation of a round of the
                 parallel algorithm begins, the whole list of memory
                 addresses needed during this round is readily
                 available; and, we can start fetching these addresses
                 from secondary memories. This enables to prefetch the
                 data that will be needed in the next `time window',
                 perhaps by means of pipelining and have them ready at
                 the fast memories when requested by the CPU. Thereby,
                 utilization of commonly used memory management systems
                 will be theoretically enhanced. Another (considerably
                 less orthodox) implementation approach will result in
                 abandoning locality of references, in favor of a
                 drastically different approach: distribute memory
                 addresses at random over memory modules, as has been
                 proposed in the context of implementing the
                 parallel-random-access machine (PRAM) design space. It
                 is too early to reach conclusions regarding the
                 significance of the thesis of this paper. Serious
                 attempts to follow it up are needed to determine its
                 usefulness. Parts of this paper are intentionally
                 written in an informal way, suppressing issues that
                 will have to be resolved in the context of a concrete
                 implementation. My general intention is to encourage
                 colleagues to: (i) suggest other specific approaches,
                 and (ii) explore opportunities for taking advantage of
                 the fine structure of parallel programs well beyond
                 concrete suggestions made in the paper. The full paper
                 is available as UMIACS TR 91-145, from the Institute
                 for Advanced Computer Studies, University of Maryland,
                 College Park, Maryland 20742--3251.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alur:1991:SNL,
  author =       "Rajeev Alur and Thomas A. Henzinger",
  title =        "Sigact News Logic Column 1: Time for Logic",
  journal =      j-SIGACT,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1991",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/deduction.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zeugmann:1992:BRR,
  author =       "T. Zeugmann",
  title =        "Book Review: {Reingold and Shen, \booktitle{More
                 Nearly Optimal Algorithms for Unbounded Searching}
                 (1991)}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1992",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Apr 6 06:05:02 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Reingold:1988:MNO,Reingold:1991:MNOa,Reingold:1991:MNOb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Berman:1992:CSW,
  author =       "Francine Berman",
  title =        "{CRA} status of women column",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "14--17",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.140648",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1992:EFa,
  author =       "Rocky Ross",
  title =        "Education Forum",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "18--19",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.990655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1992:BRB,
  author =       "Joseph O'Rourke",
  title =        "Book Review: {{\booktitle{Intersection and
                 Decomposition Algorithms for Planar Arrangements}}, by
                 Pankaj K. Agarwal. (Cambridge University Press,
                 Cambridge, 1991. xvii + 277 pp. \$39.50 cloth. ISBN
                 0-521-40446-0)}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "35--36",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.990656",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Agarwal:1991:IDA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McBeth:1992:TMA,
  author =       "M. A. McBeth",
  title =        "The {Turing} machine of {Ackermann}'s function",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "37--43",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.140655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:1992:CST,
  author =       "Oded Goldreich",
  title =        "Critique of some trends in the {TCS} community in
                 light of two controversies",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "44--46",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.140657",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I criticize the growing influence of some
                 `trade-unionism'' attitudes in the Theoretical Computer
                 Science community. I trace these attitudes in the
                 arguments used in two recent controversies which
                 attracted much attention: the controversy on the
                 acceptance rate in STOC/FOCS conferences and the
                 controversy on anonymous submissions (in Crypto
                 conferences). I believe that these attitudes stand in
                 contradiction to the scientific progress and call for
                 their abolishment.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Akman:1992:USE,
  author =       "Varol Akman",
  title =        "Undaunted sets (extended abstract)",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "1",
  pages =        "47--48",
  month =        "Winter",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/140645.140659",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1992:CG,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "26--28",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.130957",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Recent solutions of three `art gallery' problems are
                 reported. Three related still-open problems are
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lincoln:1992:LL,
  author =       "Patrick Lincoln",
  title =        "Linear logic",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "29--37",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.130958",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lincoln:1992:LLG,
  author =       "Patrick Lincoln",
  title =        "Linear Logic: Guest Logic Column",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "29--37",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 16:33:55 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/deduction.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Par.Arch.Indep.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/CLiCS.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/linbib.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/linear.logic.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/scedrov.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://www.csl.sri.com/lincoln/sigact92.dvi.Z",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  urldvi =       "http://www.csl.sri.com/lincoln/sigact92.dvi.Z",
}

@Article{Ross:1992:EFb,
  author =       "Rocky Ross",
  title =        "Education Forum",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "50--53",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.990670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stasko:1992:AAX,
  author =       "John T. Stasko",
  title =        "Animating Algorithms with {XTANGO}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "67--71",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.130959",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/reengineering.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "algorithm animation; reverse engineering; reverse
                 specification; software animation; software reverse
                 engineering",
}

@Article{Luccio:1992:SPC,
  author =       "Fabrizio Luccio and Linda Pagli",
  title =        "The $p$-shovelers problem: (computing with
                 time-varying data)",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "72--75",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.130960",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In a winter morning one man shovels the snow from his
                 driveway. When the job is finished he can get out with
                 the car. In the neighbouring driveway $p$ men remove
                 the same amount of snow in one p-th of time. The next
                 morning is snowy. As the single shoveler goes on, new
                 snow falls making his job harder. The neighbouring
                 shovelers work for a shorter time, and a smaller amount
                 of snow falls meanwhile, so that they clean the
                 driveway in less than one p-th of time. This seems to
                 conflict with a folklore theorem on parallel
                 speed-up.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galil:1992:RC,
  author =       "Zvi Galil",
  title =        "Renato {Capocelli}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "2",
  pages =        "104",
  month =        "Spring",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/130956.130961",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jacob:1992:BRB,
  author =       "Tom Jacob and Bill Kaizer",
  title =        "Book review: {{\booktitle{A Unifying Framework for
                 Structured Analysis and Design Models}}. By T. H. Tse.
                 (Cambridge University Press, 1991. xi + 179pp. ISBN
                 0-521-39196-2)}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "30",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.990671",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Tse:1991:UFS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Das:1992:BRB,
  author =       "Sajal K. Das",
  title =        "Book Review: {{\booktitle{Introduction to Parallel
                 Algorithms and Architectures: Arrays, Trees,
                 Hypercubes}}, by F. T. Leighton (Morgan Kauffman Pub,
                 1992)}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "31--32",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.990672",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Leighton:1992:IPA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1992:EFc,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "33",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.990673",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Litow:1992:R,
  author =       "B. Litow",
  title =        "On {Rat$_\infty $}",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "98--99",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.141916",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Julstrom:1992:BSF,
  author =       "Bryant A. Julstrom",
  title =        "A bound on the shift function in terms of the {Busy
                 Beaver} function",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "100--106",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.141918",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Busy Beaver function $ \Sigma (n) $ is the maximum
                 number of 1's a halting $n$-state Turing machine may
                 leave on an initially blank tape. The shift function $
                 S(n)$ is the maximum number of moves such a machine may
                 make before it halts. This paper shows that $ S(n) <
                 \Sigma (20 n)$, then uses this result to prove that
                 both $ \Sigma (n)$ and $ S(n)$ are non-computable and
                 their non-computability is equivalent to the
                 undecidability of the halting problem. Demonstrations
                 that several other functions are also non-computable
                 apply a construction used in the proof of the bound on
                 $ S(n)$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Young:1992:HRS,
  author =       "Paul Young",
  title =        "How reductions to sparse sets collapse the
                 polynomial-time hierarchy: a primer; part {I}:
                 polynomial-time {Turing} reductions",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "3",
  pages =        "107--117",
  month =        "Summer",
  year =         "1992",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/141914.141921",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:1992:RAP,
  author =       "J. Shallit",
  title =        "Randomized Algorithms in ``Primitive Cultures''",
  journal =      j-SIGACT,
  volume =       "23",
  number =       "4",
  pages =        "77--80",
  month =        "Fall",
  year =         "1992",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/ProbAlgs.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Shallit, in a slightly tongue-in-cheek manner, traces
                 back some of the concepts of randomized algorithms to
                 the native American society of the Naskapi and the
                 central African society of the Azande. Roots in the
                 works of Pierre Laplace and Lord Kelvin are also
                 pointed out.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1993:TRC,
  author =       "Mark A. Weiss",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "10--16",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152993",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1993:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 18",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "20--25",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152994",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Results on visibility graphs are classified and
                 organized into five tables.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Purushothaman:1993:BRB,
  author =       "S. Purushothaman",
  title =        "Book Review: {{\booktitle{Nets, Terms and Formulas}}.
                 By E.-R. Olderog. (Cambridge University Press, 1991. x
                 + 267pp. ISBN 0-521-40044-9. \$49.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "26--27",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990674",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Olderog:1991:NTF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Henzinger:1993:BRB,
  author =       "Thomas A. Henzinger",
  title =        "Book Review: {{\booktitle{Verifying Temporal
                 Properties of Systems}}, by Julian Charles Bradfield.
                 (Birkh{\"a}user, 1992 viii + 113pp. ISBN 0-8176-3625-0.
                 \$49.50)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "27--28",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990675",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bradfield:1992:VTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stansifer:1993:BRB,
  author =       "Ryan Stansifer",
  title =        "Book Review: {{\booktitle{Semantics of Programming
                 Languages: Structures and Techniques}}. By Carl A.
                 Gunter. (MIT Press, 1992. xviii + 419pp. ISBN
                 0-262-07143-6 \$37.50)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "28--29",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990676",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gunter:1992:SPL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1993:EFN,
  author =       "Rocky Ross",
  title =        "Education Forum: {New Courses} on the {Horizon}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "30",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990677",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Batini:1993:AGD,
  author =       "Carlo Batini",
  title =        "Applications of graph drawing to software engineering
                 (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "57",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152995",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Several conventions for drawing rooted trees are
                 discussed: classical drawings, tip-over drawings,
                 inclusion drawings, and h-v drawings. In each
                 convention, a number of algorithms and complexity
                 results are available. For free trees (no specific
                 root), algorithms are mostly drawn from folklore.
                 Radial drawings, spring drawings, and orthogonal
                 drawings are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Eades:1993:ADT,
  author =       "Peter Eades",
  title =        "Algorithms for drawing trees (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "57",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152996",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In several application areas of software engineering
                 intermediate and final products of the design activity
                 are represented by means of diagrams. Diagrams present
                 several advantages over other representations, since
                 they are an aid to clear thinking (a diagram is better
                 that a thousand words). Diagrams are external
                 representations of organization charts, data and
                 function schemas, structure of procedure calls, pieces
                 of code, etc. A diagram is characterized by a meaning
                 (the `piece of reality' it draws), and a syntax,
                 expressed by: a graphic grammar, that defines the types
                 of symbols and connections allowed, aesthetic criteria
                 adopted in drawing the diagram. an underlying diagram
                 model (e.g., hierarchical, planar, connected, etc). In
                 software engineering tools, diagram are manipulated by
                 several functions, such as beautification,
                 modification, refinement, merging of several diagrams,
                 animation, etc. Each one of such functions is
                 characterized by specific algorithms needed for the
                 final activity of diagram drawing. E.g. when we
                 beautify a diagram we are interested to achieve some
                 aesthetic criteria that were previously not respected;
                 when we refine a diagram into a more detailed one, we
                 are interested to maintain monotonicity of shape.
                 Producing incrementally such a library by dynamically
                 tailoring and merging paradigmatic algorithms, results
                 in a new and interesting research area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pach:1993:EPG,
  author =       "Janos Pach",
  title =        "Extremal problems in graph drawings (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "57",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152997",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tollis:1993:VRP,
  author =       "Ioannis G. Tollis",
  title =        "Visibility representations of planar graphs
                 (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "57--58",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152998",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Interesting representations of graphs results from
                 mapping vertices into horizontal segments and edges
                 into vertical segments drawn between visible
                 vertex-segments. (Two parallel segments of a given set
                 are visible if they can be joined by a segment
                 orthogonal to them, which does not intersect any other
                 segment.) Such representations are called visibility
                 representations. These representations find
                 applications in VLSI layout, algorithm animation,
                 visual languages and CASE tools. We consider three
                 types of visibility representations: (i)
                 Weak-visibility representation, if two vertices are
                 adjacent then their corresponding segments must be
                 visible. (ii) $ \epsilon $-visibility representation,
                 where vertices can be represented by open, closed, or
                 semiclosed horizontal segments in the plane such that
                 two vertices are adjacent if and only if their
                 associated segments are visible. (iii)
                 Strong-visibility representation, where vertices are
                 represented by closed horizontal segments such that two
                 vertices are adjacent if and only if their
                 corresponding segments are visible. We discuss various
                 types of visibility representations of planar graphs on
                 the plane, cylinder, and sphere.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{deFraysseix:1993:POP,
  author =       "Hubert de Fraysseix and Pierre Rosenstiehl",
  title =        "Partial orders for planarity and drawings (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "58",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.152999",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A bipolar orientation of a graph appears often in the
                 algorithm literature as a first step for the generation
                 of a particular drawing. Here the properties of bipolar
                 orientations are systematically explored in terms of
                 circuits, cocircuits, rank activities, Tutte
                 polynomial, poset dimension, angle bipartition and max
                 flow-min cut theorem. Efficient algorithms are
                 described to list, generate or extend bipolar
                 orientations for general graphs or plane ones, with or
                 without constraints. (Joint work with Patrice de
                 Mendez.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sugiyama:1993:DCD,
  author =       "Kozo Sugiyama",
  title =        "Drawing compound digraphs and its application to an
                 idea organizer (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "58",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153000",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An upward drawing of an acyclic digraph is a planar
                 straight-line drawing with the additional requirement
                 that all the edges flow in the same direction, e.g.,
                 from bottom to top. The literature on the problem of
                 constructing upward drawings of important classes of
                 digraphs is surveyed. First, it is show that there is a
                 family of binary trees with $n$ vertices requiring $
                 \Omega (n \log n)$ area for any upward drawing;
                 moreover, that bound is tight, i.e. each binary tree
                 with $n$ vertices can be drawn with O (n \log n) area.
                 Second, motivated by the elegant H -tree layout
                 algorithm for constructing non-upward drawings of
                 complete binary trees, an algorithm is presented for
                 constructing an upward drawing of a complete binary
                 tree with $n$ vertices in O(n) area. This result is
                 extended to the drawings of Fibonacci trees. Third, it
                 is shown that the area requirement of upward drawings
                 of series-parallel digraphs crucially depends on the
                 choice of planar embedding. Also, parallel and
                 sequential drawing algorithms are presented that are
                 optimal with respect to both the time complexity and to
                 the area achieved. Several results show that while
                 series-parallel digraphs have a rather simple and well
                 understood combinatorial structure, naive drawing
                 strategies lead to drawings with exponential area, and
                 clever algorithms are needed to achieve optimal area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{DiBattista:1993:ARA,
  author =       "Giuseppe {Di Battista}",
  title =        "Area requirements (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "58--59",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153001",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A compound diagraph is a directed graph with both
                 inclusion and adjacency edges and is widely used in
                 diverse fields. In this talk, first, a heuristic method
                 for automatically drawing a compound digraph is
                 presented. Then, several graphic interface techniques
                 which facilitate the method in organizing ideas such as
                 direct manipulation, animation, incremental editing,
                 fish-eyes (focusing, abridgements), and utilization of
                 curves are discussed. Finally, it is emphasized that
                 interface issues are important as well as algorithmic
                 aspects of graph drawing. (Joint work with K. Misue.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kaufmann:1993:ARS,
  author =       "Michael Kaufmann",
  title =        "Angular resolution of straight-line drawings
                 (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "59",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153002",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An orthogonal drawing of a graph is such that the
                 edges are represented by polygonal chains consisting of
                 horizontal and vertical segments. The intermediate
                 vertices of the chain (which are not vertices of the
                 graph) are called bends. In this talk we survey
                 algorithms for constructing planar orthogonal drawings.
                 The main quality measures considered are the
                 minimization of the number of bends and of the area of
                 the drawing. The construction of planar orthogonal
                 drawings has many important applications, including
                 graph visualization, VLSI layout, facilities
                 floorplanning, and communication by light or microwave.
                 Given an embedded planar graph $G$ with $n$ vertices, a
                 planar orthogonal drawing of $G$ with the minimum
                 number of bends can be computed in $ O(n^2 \log n)$
                 time using network-flow techniques. Drawings with $
                 O(n)$ bends can be constructed in $ O(n)$ time using
                 visibility representations. Also, there are families of
                 graphs that require $ \Omega (n)$ bends. Open problems
                 include minimizing bends over all possible embeddings,
                 and finding an efficient parallel algorithm for bend
                 minimization.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mohar:1993:CPR,
  author =       "Bojan Mohar",
  title =        "Circle packing representation in the plane and other
                 surfaces",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "59",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153004",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The angular resolution of a drawing of graph $G$ is
                 the minimum angle between two incident edges that
                 appears in the drawing. In this talk the state of the
                 art is presented how to maximize the angular
                 resolution. First the general technique by Formann et
                 al. [FOCS'90] is reviewed, then a refinement for planar
                 graphs is given. A recent paper of Malitz/Papakostas
                 [STOC'92] shows that planar graphs can be drawn planar
                 with minimum angle only depending on the maximum degree
                 of the vertices. At the end, some aspect on the
                 relationship of resolution and area are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tamassia:1993:AOD,
  author =       "Roberto Tamassia",
  title =        "Algorithms for orthogonal drawings (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "59",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153003",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Andreev-Thurston circle packing theorem is
                 generalized and improved in three ways. First, to
                 arbitrary maps on closed surfaces. Second, we get the
                 simultaneous circle packing of the map and its dual map
                 so that, in the corresponding straight-line
                 representations of the map and the dual, any two edges
                 dual to each other cross at the right angle. The
                 necessary and sufficient condition for a map to have
                 such a primal-dual circle packing representation is
                 that its universal cover is 3-connected (the map has no
                 `planar' 2-separations). Finally, a polynomial time
                 algorithm is obtained that given a map M and a rational
                 number {\&}\#949; {\&}gt; 0 finds an
                 {\&}\#949;-approximation for the primal-dual circle
                 packing representation of M. In particular, we get a
                 polynomial time algorithm for geodesic convex
                 representation of reduced maps on arbitrary surfaces.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cohen:1993:DGD,
  author =       "Robert F. Cohen",
  title =        "Dynamic graph drawing (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "60",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153005",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An automatic layout facility is a tool that receives
                 as input a graph-like structure and is able to produce
                 a diagram that nicely represents such a structure.
                 Because of the increasing number of systems that manage
                 diagrams, automatic layout facilities and algorithms
                 for graphs layout have been extensively studied in the
                 last years. We present a new approach in designing an
                 automatic layout facility. Our approach is based on a
                 modular management of a collection of algorithms and on
                 a tool that is able to automatically select the best
                 algorithm for a given application. Such approach has
                 been used for devising the automatic layout facility of
                 Diagram Server, a network server that offers to its
                 clients several facilities for managing diagrams.
                 (Joint work with P. Bertolazzi and G. Di Battista.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kant:1993:NMP,
  author =       "Goos Kant",
  title =        "A new method for planar graph drawings on a grid
                 (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "60",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153006",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Drawing graphs is an important problem that combines
                 flavors of computational geometry and graph theory.
                 Applications can be found in a variety of areas
                 including circuit layout, network management, software
                 engineering, and graphics. The main contributions of
                 this paper can be summarized as follows: (i) We devise
                 a model for dynamic graph algorithms, based on
                 performing queries and updates on an implicit
                 representation of the drawing, and we show its
                 applications. (ii) We present several efficient dynamic
                 drawing algorithms for trees, series-parallel digraphs,
                 planar st-digraphs, and planar graphs. These algorithms
                 adopt a variety of representations (e.g.,
                 straight-line, polyline, visibility), and update the
                 drawing in a smooth way. (iii) We show that the
                 implicit representation of the layout used by our
                 algorithms for trees and series-parallel digraphs also
                 supports point-location and window queries. (Joint work
                 with P. Bertolazzi, G. Di Battista, R. Tamassia, and I.
                 G. Tollis.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Liotta:1993:ALF,
  author =       "Giuseppe Liotta",
  title =        "An automatic layout facility (abstract)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "60",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153007",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We introduce a new method to optimize the required
                 area, minimum angle and number of bends of planar
                 drawings of graphs on a grid. The main tool is a new
                 type of ordering on the vertices and faces of
                 triconnected planar graphs. With this method linear
                 time an space algorithms can be designed for many graph
                 drawing problems. (i) We show that every triconnected
                 planar graph $G$ can be drawn convexly with straight
                 lines on an $ (2 n - 4) \times (n - 2)$ grid. (ii) If
                 $G$ has maximum degree four (three), then $G$ can be
                 drawn orthogonal with at most $ [3 n / 2] + 3$ (at most
                 $ [n / 2] + 1$) bends on an $ n \times n$ grid ($ [n /
                 2] \times [n / 2]$ grid, respectively). (iii) If $G$
                 has maximum degree $d$, then $G$ can be drawn planar on
                 an $ (2 n - 6) \times (3 n - 6)$ grid with minimum
                 angle larger than $ 1 / d - 2$ radians and at most $ 5
                 n - 15$ bends. These results give in some cases
                 considerable improvements over previous results, and
                 give new bounds in other cases. Several other results,
                 e.g., concerning visibility representations, are
                 included.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Escardo:1993:LNN,
  author =       "Mart{\'\i}n H{\"o}tzel Escard{\'o}",
  title =        "On lazy natural numbers with applications to
                 computability theory and functional programming",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "61--67",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153008",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Lazy natural numbers arise by lazy evaluation of the
                 successor function. This work investigates fundamental
                 mathematical properties of the domain L of lazy natural
                 numbers, and presents applications to computability
                 theory and functional programming. It is shown that
                 certain functions on sets of natural numbers like
                 cardinality-finding and emptyness-testing which are not
                 continuous (or even monotonic) when sets are given by
                 characteristic functions $ N \perp \to T $ are both
                 continuous and computable when sets are given by
                 characteristic functions $ L \to T $ defined in an
                 appropriate way. These functions are definable in $
                 \lambda $ calculus based functional programming
                 languages provided some parallel features are
                 available.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Davison:1993:VTC,
  author =       "Andrew Davison",
  title =        "Vague text compression",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "1",
  pages =        "68--74",
  month =        "Winter",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.153009",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A new approach to the `lossy' compression of text is
                 described, based on the computational benefits of
                 reading handwritten text, as opposed to text set in a
                 more formal typographical style. Specifically, a new
                 class of fonts, called vague fonts, are proposed which
                 encode the vagueness of handwriting. Text written using
                 a vague font can be compressed to a much greater degree
                 than the same text represented in a conventional
                 font.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1993:LYN,
  author =       "Lane A. Hemaspaandra",
  title =        "Lowness: a yardstick for {NP}-{P}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "10--14",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/156063.156064",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column gives a quick introduction to lowness
                 theory [Sch83], which classifies the complexity of
                 problems that are in NP but seem to be neither in P nor
                 NP-complete.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Toynbee:1993:OWC,
  author =       "Claire Toynbee",
  title =        "On the outer: women in computer science courses",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "18--21",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/156063.156065",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "After more than three years researching the question
                 `Why women drop computer science' at Victoria
                 University of Wellington in New Zealand, I am surprised
                 so many women succeed given the overwhelming odds
                 against them. Women who take computer science are
                 'different' not simply because they are women, but
                 because they have chosen a subject which has been
                 primarily a male domain. Once enrolled, they find
                 themselves 'on the outer', facing difficulties not
                 usually experienced by white middle class men who take
                 computer science. There is evidence that other
                 minorities also suffer alienation in what is
                 essentially a distinct subculture whose origins will be
                 discussed later.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Riecke:1993:BRB,
  author =       "Jon G. Riecke",
  title =        "Book Review: {{\booktitle{Action Semantics}}. By Peter
                 D. Mosses. (Cambridge University Press, 1992. xx +
                 372pp. ISBN 0-521-40347-2. \$49.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "24--25",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/156063.990678",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mosses:1992:AS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zwarico:1993:BRB,
  author =       "Amy Zwarico",
  title =        "Book Review: {{\booktitle{Action Refinement in Process
                 Algebras}}. By Luca Aceto. (Cambridge University Press,
                 1992. ix + 273pp. ISBN 0-521-43111-5. \$49.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "25--26",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990712",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Aceto:1992:ARP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1993:EFI,
  author =       "Rocky Ross",
  title =        "Education Forum: {An Introductory Computer Science
                 Curriculum Incorporating Theory}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "27--29",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/152992.990713",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Colton:1993:RPL,
  author =       "Don Colton",
  title =        "A restated pumping lemma for context-free languages",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "87",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/156063.156066",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chaudhuri:1993:SST,
  author =       "R. Chaudhuri and H. H{\"o}ft",
  title =        "Splaying a search tree in preorder takes linear time",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "2",
  pages =        "88--93",
  month =        "Spring",
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/156063.156067",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper we prove that if the nodes of an
                 arbitrary no-node binary search tree T are splayed in
                 the preorder sequence of T then the total time is O(n).
                 This is a special case of the splay tree traversal
                 conjecture of Sleator and Tarjan.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Regan:1993:MML,
  author =       "Kenneth W. Regan",
  title =        "Machine models and linear time complexity",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "5--15",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.166591",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mikolajzak:1993:BRB,
  author =       "Boleslaw Mikolajzak",
  title =        "Book Review: {{\booktitle{Coloured Petri Nets: Basic
                 Concepts, Analysis Methods and Practical Use}}, Volume
                 One. By Kurt Jensen. (Springer-Verlag, 1992. vii + 234
                 pages. ISBN 0-387-55597-8. \$69.00)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "31--33",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.990815",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Jensen:1992:CPN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Panangaden:1993:BRB,
  author =       "Prakesh Panangaden",
  title =        "Book Review: {{\booktitle{Programs, Recursion and
                 Unbounded Choice}}. By Wim H. Hesselink. (Cambridge
                 University Press, 1992. xii + 223 pages. ISBN
                 0-521-40436-3. \$39.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "34--37",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.990816",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hesselink:1992:PRU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1993:EFL,
  author =       "Rocky Ross",
  title =        "Education Forum: Lecture and Lab Syllabus for a
                 Breadth-First Introductory Computer Science Course
                 Sequence following the Data Structures and Algorithms
                 Paradigm",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "38--43",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.990817",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Thomborson:1993:WFF,
  author =       "Clark Thomborson",
  title =        "Why are fewer females obtaining bachelor's degrees in
                 computer science?",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "114--116",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.166593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Xiao-Long:1993:RPB,
  author =       "Hu Xiao-Long",
  title =        "The representation of a program in the
                 {Blum--Shub--Smale} theory of computation over an
                 arbitrary ring",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "3",
  pages =        "117--119",
  month =        oct,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/166589.166596",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the paper `On a Theory of Computation and
                 Complexity over the Real Numbers: NP Completeness,
                 Recursive Functions and Universal machines' (BSS 1989),
                 the authors, Lenore Blum, Mike Shub, and Steve Smale,
                 generalize the notion of computability from the set of
                 natural numbers to an arbitrary ordered ring. In
                 particular they discuss the existence of a Universal
                 Machine over such a ring and the `G{\"o}del' number or
                 `code' of machines defined on such a ring. In this
                 short paper we wish to correct some minor error in
                 their definition of a `code' of a machine.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:1993:TPS,
  author =       "Oded Goldreich",
  title =        "A Taxonomy of Proof Systems (part 1)",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  organization = "ACM",
  pages =        "2--13",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.165000",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/crypto.security.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/interactive.proofs.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Several alternative formulations of the concept of an
                 efficient proof system are nowadays coexisting in our
                 field. These systems include the classical formulation
                 of NP, interactive proof systems (giving rise to the
                 class IP) computationally-sound proof systems, and
                 probabilistically checkable proofs (PCP) which are
                 closely related to multi-prover interactive proofs (
                 MIP). Although these notions are sometimes introduced
                 using the same generic phrases, they are actually very
                 different in motivation, applications and expressive
                 power. The main objective of this essay is to try to
                 clarify these differences.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goodrich:1993:PAC,
  author =       "Michael T. Goodrich",
  title =        "Parallel algorithms column 1: models of computation",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "16--21",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.165002",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sistla:1993:BRB,
  author =       "A. P. Sistla",
  title =        "Book Review: {{\booktitle{The Temporal Logic of
                 Reactive and Concurrent Systems --- Specification}}. By
                 Zohar Manna and Amir Pnueli. (Springer-Verlag, 1991.
                 xiv + 427pp. ISBN 0-387-97664-7. \$49.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "34--36",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.990818",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Manna:1992:TLR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Makowsky:1993:BRB,
  author =       "J. A. Makowsky",
  title =        "Book Review: {{\booktitle{Predicate Transformer
                 Semantics}}. By Ernest G. Manes. (Cambridge University
                 Press, 1992. 233pp. ISBN 0-521-42036-9. \$39.95)}",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "36--38",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.990819",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Manes:1992:PTS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1993:CSL,
  author =       "R. Ross",
  title =        "Computer science laboratories",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "45--48",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.165004",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the second issue of the News (volume 24, number 2)
                 this year I described the new breadth-first
                 introductory curriculum in place at Montana State
                 University, focusing on the role that theory plays in
                 the four lecture courses constituting the curriculum.
                 In the third issue (volume 24, number 3) an abbreviated
                 syllabus was given for the four course sequence. During
                 the interim, I have received numerous e-mail requests
                 for more complete information, which indicates a
                 growing interest in breadth-first, integrated
                 approaches to the computer science curriculum as
                 proposed in the Denning Report and Computing Curricula
                 1991 (cited in the last two issues). In this
                 installment of the Forum some of the interesting
                 aspects of the laboratory component of the curriculum
                 are described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Diderich:1993:BMT,
  author =       "Claude G. Diderich",
  title =        "A Bibliography on Minimax Trees",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "82--89",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.165007",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/SEL-HPC.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://diwww.epfl.ch/~diderich/research/minimax/bib/minimax.html",
  abstract =     "This article lists all theoretical and practical
                 papers, theses and reports known to the author on the
                 subject of studying minimax trees and analyzing
                 sequential and parallel minimax tree search algorithms.
                 The items of the bibliography are listed in
                 alphabetical order in accordance with the first
                 author's name. Items not marked are in my collection or
                 are available to me (if there are any hard-to-obtain
                 items in this group, I would be happy to make copies of
                 them available). Others, e.g., items marked with a star
                 (*), are cited elsewhere as relevant, but are yet
                 unavailable to me (I would appreciate receiving copies
                 of these from anyone who has access to them). This
                 bibliography is available in computer readable
                 {\BibTeX} form by sending an e-mail request to the
                 author or by anonymous ftp from {\tt
                 valkyries.andrew.cmu.edu} in directory {\tt
                 /pub/chess/texts}. The labels indicated are they keys
                 used in the {\BibTeX} version of the bibliography. Any
                 corrections as well as new items to this bibliography
                 are kindly requested and highly appreciated in advance.
                 Finally the author wishes to thank all the people who
                 have helped in building this bibliography.",
  abstract-URL = "http://diwww.epfl.ch/~diderich/research/minimax",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "Minimax Games Tree Search Optimization",
  scope =        "Minimax Game Theory",
}

@Article{Spencer:1993:CFL,
  author =       "Thomas H. Spencer",
  title =        "Context-free languages",
  journal =      j-SIGACT,
  volume =       "24",
  number =       "4",
  pages =        "90--91",
  month =        dec,
  year =         "1993",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/164996.165009",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper introduces a new level into the Chomsky of
                 formal languages. Specifically the content-free
                 languages are a subset of the regular languages.
                 Content-free languages have many interesting
                 properties.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:1994:TPS,
  author =       "Oded Goldreich",
  title =        "A Taxonomy of Proof Systems (part 2)",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "1",
  organization = "ACM",
  pages =        "22--30",
  month =        mar,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181773.181775",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/RC.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/crypto.security.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/interactive.proofs.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1994:CG,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "1",
  pages =        "31--33",
  month =        mar,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181773.181777",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The class of n$^2$ -hard geometric problems is
                 described, with special concentration on detecting
                 collinearities among a set of points in the plane.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fortnow:1994:IVO,
  author =       "Lance Fortnow and Stuart Kurtz and Duke Whang",
  title =        "The infinite version of an open communication
                 complexity problem is independent of the axioms of set
                 theory",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "1",
  pages =        "87--89",
  month =        mar,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181773.181778",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In 1986, Babai, Frankl and Simon (BFS86) defined the
                 polynomial hierarchy in communication complexity and
                 asked whether $ \Sigma^{ee} 2 = \Phi^{ee} 2 $. In order
                 to tackle this problem, researchers have looked at an
                 infinite version. We recently became aware of a paper
                 from 1979 where Miller [Mil79] shows that this infinite
                 version is independent of the axioms of set theory. In
                 this note we will describe Miller's result and give a
                 simplified proof of one direction by showing that the
                 continuum hypothesis implies that $ \Sigma^r 2 = \Phi^r
                 2 p (R \times R) $.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Matos:1994:IUP,
  author =       "Armando B. Matos",
  title =        "An introduction to ultimately periodic sets of
                 integers",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "1",
  pages =        "90--96",
  month =        mar,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181773.181780",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We summarize some of the theory and an application of
                 a new method for representing `periodic' sets of
                 integers. A much more detailed discussion will be
                 presented in [5].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1994:CTC,
  author =       "Lane A. Hemaspaandra",
  title =        "Complexity theory column 5: the
                 not-ready-for-prime-time conjectures",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "5--10",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.181463",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gurevich:1994:LAE,
  author =       "Yuri Gurevich",
  title =        "Logic Activities in {Europe}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "11--24",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.181464",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/abstract.state.machines.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  remark =       "A critical analysis of European logic activities in
                 computer science. The part relevant to ASMs is
                 subsection 4.6 called Mathematics and Pedantics.",
}

@Article{Jouannaud:1994:BRB,
  author =       "Jean-Pierre Jouannaud",
  title =        "Book Review: {{\booktitle{A Proof Theory for General
                 Unification}}. By Wayne Snyder. (Birkh{\"a}user, 1991.
                 vi + 175 pages. ISBN 0-8176-3593-9. \$28.00)}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "25",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.993134",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Snyder:1991:PTG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vlach:1994:BRB,
  author =       "Frank Vlach",
  title =        "Book Review: {{\booktitle{The Deductive Foundations of
                 Computer Programming}}. By Zohar Manna and Richard
                 Waldinger. (Addison-Wesley, 1993. xiv + 717pp. ISBN
                 0-201-54886-0. \$46.25)}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "26--27",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.993135",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Manna:1993:DFC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bloch:1994:HHH,
  author =       "Stephen A. Bloch and Jonathan F. Buss and Judy
                 Goldsmith",
  title =        "How hard are $ n^2$-hard problems?",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "83--85",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.181465",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Many of the ` n$^2$ -hard' problems described by
                 Gajentaan and Overmars can be solved using limited
                 nondeterminism or other sharply-bounded quantifiers.
                 Thus we suggest that problems are not among the hardest
                 problems solvable in quadratic time",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Raman:1994:SAA,
  author =       "Rajeev Raman",
  title =        "A simpler analysis of algorithm 65 (find)",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "86--89",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.181466",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a simpler analysis of the expected number
                 of comparisons made by Hoare's selection algorithm (
                 Comm. ACM 4 (1961), pp. 321--322).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Costa:1994:IC,
  author =       "Ant{\^o}nio Carlos da Rocha Costa and Vanderlei Moraes
                 Rodrigues",
  title =        "Inspecting continuations",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "2",
  pages =        "90--91",
  month =        jun,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/181462.181467",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This note discusses some implications of allowing
                 programs to inspect their continuations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Denny-Brown:1994:SMA,
  author =       "Derek Denny-Brown and Yenjo Han and Lane A.
                 Hemaspaandra and Leen Torenvliet",
  title =        "Semi-membership algorithms: some recent advances",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "12--23",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193828",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A semi-membership algorithm for a set A is,
                 informally, a program that when given any two strings
                 determines which is logically more likely to be in A. A
                 flurry of interest in this topic in the late seventies
                 and early eighties was followed by a relatively
                 quiescent half-decade. However, in the 1990s there has
                 been a resurgence of interest in this topic. We survey
                 recent work on the theory of semi-membership
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1994:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 23",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "24--27",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193831",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Three open problems on tetrahedralizations are
                 described: Does bisection refinement keep solid angle
                 bound away from zero? Can a tetrahedralization be
                 frozen with respect to flips? Do points in convex
                 position have a Hamiltonian tetrahedralization?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1994:BRB,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Finite Automata, Formal
                 Logic, and Circuit Complexity}}. By Howard Straubing.
                 (Birkh{\"a}user. 1994. xii + 226pp. ISBN 0-8176-3719-2.
                 \$39.50)}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "28--32",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.993132",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Straubing:1994:FAF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1994:EFP,
  author =       "Rocky Ross",
  title =        "Education Forum: {Project Impact}: {NSF}-Funded
                 Science Education Projects",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "49--52",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.993133",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "During the academic year it is sometimes difficult to
                 find the inspiration to write this column because of
                 the many other pressing responsibilities we all face as
                 faculty. But to even remember the due date of the next
                 installment gets tough in July when one is standing in
                 the middle of a mountain river, fly rod in hand,
                 relishing the cool mountain air and the clear, rushing
                 water. Ah, well, here goes\ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Petersen:1994:TWO,
  author =       "H. Petersen",
  title =        "Two-way one-counter automata accepting bounded
                 languages",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "102--105",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193835",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We show that languages such as $ \tilde {L} = \{ 0^n
                 1^{n^2} | n \geq 1 \} $ and $ \hat {L} = \{ 0^n 1^{2^n}
                 | n \geq 1 \} $ can be accepted by deterministic
                 two-way one-counter automata.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Regan:1994:QIC,
  author =       "Kenneth W. Regan and Jie Wang",
  title =        "The quasilinear isomorphism challenge",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "106--113",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193839",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We show that all the basic facts about the
                 Berman-Hartmanis Isomorphism Conjecture carry over from
                 polynomial to quasilinear time bounds. However, we show
                 that the connection between unique-accepting NTMs and
                 one-way functions, which underlies much subsequent work
                 on the B-H conjecture, breaks down for quasilinear time
                 under relativizations. Hence we have a whole new
                 ballgame, on a tighter playing field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lopez-Ortiz:1994:LPM,
  author =       "Alejandro L{\'o}pez-Ortiz",
  title =        "Linear pattern matching of repeated substrings",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "114--121",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193842",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hallett:1994:CPC,
  author =       "Michael T. Hallett and H. Todd Wareham",
  title =        "A compendium of parameterized complexity results",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "122--123",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193845",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{French:1994:WAT,
  author =       "Jim French and Edward Fox and Kurt Maly and Alan L.
                 Selman",
  title =        "Wide area technical report service-technical reports
                 online",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "3",
  pages =        "124--127",
  month =        sep,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/193820.193849",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1994:TCC,
  author =       "Lane A. Hemaspaandra",
  title =        "Teaching {Computational Complexity}: {Resources} to
                 {Treasure}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "2--11",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.993025",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article describes and discusses textbooks,
                 monographs, and collections that are excellent
                 resources from which to teach courses on computational
                 complexity theory.",
  acknowledgement = ack-nhfb,
  added-by =     "jla",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1994:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry Column 24",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "12--14",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.993026",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Open problems from the Tenth ACM Symposium on
                 Computational Geometry and the Sixth Canadian
                 Conference on Computational Geometry listed tersely.
                 The Tenth ACM Symposium on Computational Geometry was
                 held June 6--8, 1994 in Stony Brook, New York, USA, and
                 the Sixth Canadian Conference on Computational Geometry
                 was held August 2--6, 1994 in Saskatoon, Saskatchewan,
                 Canada. The problems listed below were either suggested
                 or referenced by the authors of the indicated papers.
                 Papers are identified by the last names of the authors;
                 the start page in the proceedings in indicated in
                 brackets.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1994:CCQ,
  author =       "Gilles Brassard",
  title =        "Cryptology Column -- Quantum Computing: The End of
                 Classical Cryptography?",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "15--21",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 16:33:55 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  added-by =     "sti",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "quantum computing, quantum cryptology, factoring",
  remark =       "very high-level introduction in quantum cryptology and
                 it's implication to the complexity theory. using
                 quantum computing problems assumed to be hard (e.g
                 factoring) become tractable.",
}

@Article{Brassard:1994:QCE,
  author =       "Gilles Brassard",
  title =        "Quantum computing: the end of classical
                 cryptography?",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "15--21",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.190617",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kanellakis:1994:DQC,
  author =       "Paris Kanellakis",
  title =        "Database querying and constraint programming",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "22--87",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.190619",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The declarative programming paradigms used in
                 constraint languages can lead to powerful extensions of
                 relational database query languages. This is an
                 overview of recent progress on such constraint query
                 languages, with a list of related open theoretical
                 computer science questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1994:EFD,
  author =       "Rocky Ross",
  title =        "Education Forum: {The Dynalab Animation System}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "49--54",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.993027",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zeugmann:1994:RC,
  author =       "Thomas Zeugmann",
  title =        "Report on {COLT 1994}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "88--95",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.190622",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1994:FRT,
  author =       "Ian Parberry",
  title =        "A form for referees in theoretical computer science",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "96--102",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.190624",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rice:1994:MEL,
  author =       "{Rice University}",
  title =        "In memoriam {Eugene L. Lawler}",
  journal =      j-SIGACT,
  volume =       "25",
  number =       "4",
  pages =        "108--109",
  month =        dec,
  year =         "1994",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/190616.190626",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1995:SNCa,
  author =       "Lane A. Hemaspaandra and Heribert Vollmer",
  title =        "The satanic notations: counting classes beyond {{\#P}}
                 and other definitional adventures",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "2--13",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203611",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We explore the potentially `off-by-one' nature of the
                 definitions of counting (\#P versus \#NP), difference
                 (DP versus DNP), and unambiguous (UP versus UNP; FewP
                 versus FewNP) classes, and make suggestions as to
                 logical approaches in each case. We discuss the
                 strangely differing representations that oracle and
                 predicate models give for counting classes, and we
                 survey the properties of counting classes beyond \#P.
                 We ask whether subtracting a \#P function from a P
                 function it is no greater than necessarily yields a \#P
                 function.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1995:CG,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "14--16",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203613",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The recent breakthrough of Halperin and Sharir on the
                 complexity of lower envelopes of surfaces is
                 described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dwork:1995:DCC,
  author =       "Cynthia Dwork",
  title =        "Distributed Computing Column: {Lotus Notes} Security
                 and Authentication",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "17--19",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203614",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  added-by =     "rah",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tan:1995:BRB,
  author =       "Erkan Tan and Varol Akman",
  title =        "Book Reviews: {{\booktitle{Logic for Applications}},
                 by Anil Nerode and Richard A. Shore}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "20--22",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606397",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Nerode:1993:LA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1995:RCRa,
  author =       "Michael C. Loui",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "24--26",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606405",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Baylor:1995:GIW,
  author =       "Sandra Johnson Baylor",
  title =        "Graduate Information for Women in {CS{\&}E}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "27--30",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606406",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Latch:1995:NATa,
  author =       "Dana May Latch",
  title =        "{NSF Announcements}: {Theory} of {Computing Program}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "31--32",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606407",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1995:OP,
  author =       "Samir Khuller",
  title =        "Open {Problems}: 11",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "33",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606408",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1995:TRCa,
  author =       "Mark A. Weiss",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "34--39",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606409",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1995:EFAa,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Animated Textbooks}: {A Current
                 Example}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "40--43",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606410",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kearns:1995:CLT,
  author =       "Michael J. Kearns and Umesh V. Vazirani",
  title =        "Computational {Learning Theory}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "43--45",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.606411",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tamassia:1995:RGD,
  author =       "Roberto Tamassia and Ioannis G. Tollis",
  title =        "Report on {Graph Drawing '94}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "87--91",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203615",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kudlek:1995:RI,
  author =       "Manfred Kudlek",
  title =        "Report on {IFIP'94}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "92--98",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203616",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1995:SW,
  author =       "Ian Parberry",
  title =        "Surfing the {Web}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "1",
  pages =        "99--101",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/203610.203617",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Condon:1995:ASP,
  author =       "Anne Condon",
  title =        "Approximate solutions to problems in {PSPACE}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "4--13",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202841",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1995:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 26",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "15--17",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202842",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An advance on Conway's thrackle conjecture is
                 described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1995:CCB,
  author =       "Gilles Brassard",
  title =        "Cryptology {Column}: {The Book I've Always Wanted To
                 Write} (Almost)",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "18--20",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606472",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harel:1995:WPW,
  author =       "David Harel",
  title =        "Will {I} be pretty, will {I} be rich?: some thoughts
                 on theory vs. practice in systems engineering",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "21--25",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202843",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tate:1995:BR,
  author =       "Stephen R. Tate and David B. Benson and Jonathan
                 Goldstine",
  title =        "Book Reviews",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "26--32",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606473",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1995:RCRb,
  author =       "Michael C. Loui",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "33--36",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606474",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Latch:1995:NATb,
  author =       "Dana May Latch",
  title =        "{NSF Announcements}: {Theory} of {Computing Program}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "37--38",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606475",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1995:JBRa,
  author =       "Mark A. Weiss",
  title =        "Journal {Backlog Report}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "39--44",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606476",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1995:TRCb,
  author =       "Mark A. Weiss",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "45--46",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606477",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1995:EFAb,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Animation Activities} at {SRC}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "47--50",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606478",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1995:PA,
  author =       "Ian Parberry",
  title =        "Problems on {Algorithms}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "50--56",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606479",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Levin:1995:SC,
  author =       "Leonid A. Levin",
  title =        "{STOC Criteria}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "77",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.606487",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Subramanian:1995:TRA,
  author =       "Ashok Subramanian",
  title =        "Two recent algorithms for the global minimum cut
                 problem",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "78--87",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202845",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article provides a self-contained exposition of
                 two recent algorithms for the Global Minimum Cut
                 problem. In this problem, we are given an undirected
                 graph with positive weights on its edges, and we seek a
                 proper subset $S$ of the vertices that minimizes the
                 total weight of all edges that have exactly one
                 endpoint in $S$. Unlike traditional approaches to this
                 problem, the new algorithms are not based on network
                 flow computations. Instead they are based on a
                 decomposition of the weighted graph into a sequence of
                 weighted forests. The decomposition is used to identify
                 a light set of edges that contains every light cutset
                 of the graph. In general, such a decomposition requires
                 too much space (and hence time) to write down. However,
                 there is an efficient graph search procedure, Maximum
                 Adjacency Search, that can be used to compute an
                 implicit representation of such a decomposition in $
                 O(m + n \log n)$ time. The first algorithm we discuss,
                 due to Nagamochi and Ibaraki [5, 6], requires $ O(n)$
                 invocations of Maximum Adjacency Search to compute a
                 global minimum cut. The second algorithm, due to Matula
                 [4], requires $ O(\log n)$ invocations of Maximum
                 Adjacency Search to compute an approximately minimum
                 cut. We do not discuss here the randomized algorithms
                 of Karger or the matroid-based approach of Gabow.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-Amram:1995:WPM,
  author =       "Amir M. Ben-Amram",
  title =        "What is a ``Pointer Machine''?",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "88--95",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202846",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/TOPPS.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A `Pointer Machine' is many things. Authors who
                 consider referring to this term are invited to read the
                 following note first.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  id =           "For",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "pointer machine, pointer algorithm",
  puf =          "Formidlende litteratur",
  semno =        "D-233",
  summary =      "A note that describes the various contexts where the
                 term ``pointer machine'' has been used, and clarify the
                 differences",
}

@Article{Goldwasser:1995:SLP,
  author =       "Michael Goldwasser",
  title =        "A survey of linear programming in randomized
                 subexponential time",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "2",
  pages =        "96--104",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/202840.202847",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Three papers were published in 1992, each providing a
                 combinatorial, randomized algorithm solving linear
                 programming in subexponential expected time. Bounds on
                 independent algorithms were proven, one by Kalai, and
                 the other by Matousek, Sharir, and Welzl. Results by
                 G{\"a}rtner combined techniques from these papers to
                 solve a much more general optimization problem in
                 similar time bounds. Although the algorithms by Kalai
                 and Sharir-Welzl seem remarkably different in style and
                 evolution, this paper demonstrates that one of the
                 variants of Kalai's algorithm is identical (although
                 dual) to the algorithm of Sharir-Welzl. Also the
                 implication of G{\"a}rtner's framework on future
                 improvements is examined more carefully.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Macarie:1995:SBP,
  author =       "Ioan I. Macarie",
  title =        "Space-bounded probabilistic computation: old and new
                 stories",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "1--12",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.211543",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1995:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News Complexity Theory Column} 10",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "2--12",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.606544",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We survey techniques and results obtained over the
                 past thirty years for space-bounded probabilistic
                 computation. We use a common framework for the study of
                 both finite-state automata and
                 logarithmic-space-bounded Turing machines. In
                 particular, we present recent advances on
                 space-efficient deterministic simulation of
                 probabilistic automata.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papadimitriou:1995:DMA,
  author =       "Christos H. Papadimitriou",
  title =        "Database metatheory: asking the big queries",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "13--30",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.211547",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1995:RCRc,
  author =       "Michael C. Loui",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "32--41",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.606545",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cuny:1995:WOM,
  author =       "Janice E. Cuny",
  title =        "Workshops offer mentoring opportunities",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "42--44",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.211549",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1995:EWW,
  author =       "Rocky Ross",
  title =        "Education and the {World Wide Web}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "45--48",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.211551",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Motwani:1995:RA,
  author =       "Rajeev Motwani and Prabhaka Raghavan",
  title =        "Randomized {Algorithms}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "3",
  pages =        "48--50",
  month =        sep,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/211542.606546",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Amir:1995:CTC,
  author =       "Amihood Amir and Manuel Blum and Michael Loui and John
                 Savage and Carl Smith",
  title =        "Contributions of theoretical computer science",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "2--4",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.219820",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1995:W,
  author =       "Lane A. Hemaspaandra and Ajit Ramachandran and Marius
                 Zimand",
  title =        "Worlds to die for",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "5--15",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.219822",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We last had an `open problems' column eighteen months
                 ago [Hem94]. It contained seven problems. Of the seven,
                 one has since been resolved (at least insofar as one
                 can resolve the problem without outright collapsing
                 complexity classes) in an exciting FOCS paper by Cai
                 and Sivakumar ([CS95], see also [Ogi95b,CNS95]), and
                 for another I received a proof via email unfortunately
                 followed quickly by another email retracting the proof.
                 Overall score: Mysteries of Complexity Theory: 6.
                 Theoretical Computer Scientists: 1. If you go to
                 Atlantic City, you know which side to bet on! But be of
                 good cheer. This issue's column contains a new list of
                 open problems (though some favorites from the old list
                 have stowed away here too). And to stack the deck in
                 favor of theoretical computer scientists, the problems
                 are posed quite obliquely. Rather than asking you to
                 prove `X,' many of the problems (e.g., Problems 2, 4,
                 5, 6, and 7) just ask you to show that `In some oracle
                 world, X.' Sound easy? Dig in! And if your attempt to
                 find a world where X holds becomes too frustrating,
                 don't hesitate to go for the real glory --- by proving
                 that X fails in the real world (and every relativized
                 world)!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abiteboul:1995:RP,
  author =       "Serge Abiteboul",
  title =        "Report on {PODS'95}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "16--18",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.219824",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1995:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 27",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "19--21",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.219826",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The following new result is discussed: there is a
                 perfect matching between the edges of any two
                 triangulations of a finite set of points in the
                 plane.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Latch:1995:NATc,
  author =       "Dana May Latch",
  title =        "{NSF Announcements}: {Theory} of {Computing Program}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "22--23",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.606639",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1995:JBRb,
  author =       "Mark A. Weiss",
  title =        "Journal {Backlog Report}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "24--31",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.606640",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1995:EFB,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Beware} the {Backlash}: {The
                 Teaching} vs. {Research Conundrum Revisited}",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "36--38",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.606641",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1995:APS,
  author =       "Mark Allen Weiss",
  title =        "Algorithms, {Problem Solving}, and {Data Structures}
                 with {C + + }",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "39--50",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.606642",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Baeza-Yates:1995:TA,
  author =       "Ricardo A. Baeza-Yates",
  title =        "Teaching algorithms",
  journal =      j-SIGACT,
  volume =       "26",
  number =       "4",
  pages =        "51--59",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/219817.219828",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper we propose and discuss how to teach
                 algorithms, including contents, methodologies,
                 textbooks, and computer labs. We use the ACM/IEEE
                 curricula as a starting point and compare our proposal
                 to theirs. We raise several issues, but we do not
                 provide definite answers. Our main proposal is a
                 paradigm driven methodology for the main algorithmic
                 course, as well as some paradigms and problems not
                 usually covered. An ultimate teaching algorithm is
                 still an open problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1996:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News Complexity Theory Column} 12",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "2--13",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.571641",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Please don't be shy about sending even vague pointers
                 to people who may have complete or partial resolutions
                 of the problems mentioned in any of the open questions
                 columns that have appeared as earlier complexity theory
                 columns. Though I don't give a dollar for each solved
                 problem (what do you expect on a theoretician's
                 salary!), I'll be delighted to report in this space on
                 resolutions (such as the thrilling resolution by Cai
                 and Sivakumar that was mentioned in the previous
                 column). Without further delay, here is this issue's
                 guest column, by Mihir Bellare.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1996:RCRa,
  author =       "Michael C. Loui",
  title =        "Reprint from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "14--15",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.571642",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1996:TRC,
  author =       "Mark A. Weiss",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "16--23",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.571643",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1996:EFJ,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Java\ldots{}Hot Java!}: {What} is
                 that Brewing on the {Web}?",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "24--27",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.571644",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sipser:1996:ITC,
  author =       "Michael Sipser",
  title =        "Introduction to the {Theory} of {Computation}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "27--29",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.571645",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Buhrman:1996:SNS,
  author =       "Harry Buhrman",
  title =        "A short note on {Shor}'s factoring algorithm",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "1",
  pages =        "89--90",
  month =        mar,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/230514.230515",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This note shows that Shor's algorithm for factoring in
                 polynomial time on a quantum computer can be made to
                 work with zero error probability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Luby:1996:STR,
  author =       "Michael Luby",
  title =        "{SICACT Treasurer}'s {Report}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "5--6",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.571631",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1996:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 28",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "18--19",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.235768",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Web directory of Computational Geometry Software
                 is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldsmith:1996:LN,
  author =       "Judy Goldsmith and Matthew A. Levy and Martin
                 Mundhenk",
  title =        "Limited nondeterminism",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "20--29",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.235769",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Yes, the lucky 13th column is here, and it is a guest
                 column written by J. Goldsmith, M. Levy, and M.
                 Mundhenk on the topic of limited
                 nondeterminism---classes and hierarchies derived when
                 nondeterminism itself is viewed as a quantifiable
                 resource (as it indeed is!). Coming up in the
                 Complexity Theory Column in the very special 100th
                 issue of SIGACT News: A forum on the future of
                 complexity theory. Many of the field's leading lights
                 share their exciting insights on what lies ahead, so
                 please be there in three!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Grumbach:1996:QLB,
  author =       "St{\'e}phane Grumbach and Leonid Libkin and Tova Milo
                 and Limsoon Wong",
  title =        "Query languages for bags: expressive power and
                 complexity",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "30--37",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.235770",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1996:JBR,
  author =       "Mark A. Weiss",
  title =        "Journal {Backlog Report}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "38--44",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.571632",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1996:RCRb,
  author =       "Michael C. Loui",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "45--46",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.571633",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1996:OPa,
  author =       "Samir Khuller",
  title =        "Open {Problems}: 13",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "52--54",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.571634",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1996:EFM,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Making Theory Come Alive}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "58--64",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.571635",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Johnson:1996:HDE,
  author =       "David S. Johnson",
  title =        "How to do experiments (extended advertisement)",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "87",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.235771",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1996:FLS,
  author =       "William Gasarch and Wayne Kelly and William Pugh",
  title =        "Finding the $i$ th largest of $n$ for small $ i, n$",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "2",
  pages =        "88--96",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235767.235772",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A classic problem in computer science is selection:
                 given a list of $n$ numbers, find the $i$ th largest,
                 using the fewest number of comparisons. We are
                 interested in the exact number of comparisons required
                 for specific small values of $i$ and $n$. We have
                 written a program that can be used either to find the
                 exact number of comparisons for very low values of $i$
                 and $n$, or to find upper bounds on the number of
                 comparisons for slightly larger values of $i$ and $n$.
                 In some cases we have improved on the results in the
                 literature and have additional improvements contingent
                 on a conjecture.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papadimitriou:1996:FCC,
  author =       "Christos H. Papadimitriou and Oded Goldreich and Avi
                 Wigderson and Alexander A. Razborov and Michael
                 Sipser",
  title =        "The future of computational complexity theory: part
                 {I}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "6--12",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As you probably already know, there is an active
                 discussion going on---in forums ranging from
                 lunch-table conversations to workshops on `strategic
                 directions' to formal reports---regarding the future of
                 theoretical computer science. Since your complexity
                 columnist does not know The Answer, I've asked a number
                 of people to contribute their comments on the narrower
                 issue of the future of complexity theory. The only
                 ground rule was a loose 1-page limit; each contributor
                 could choose what aspect(s) of the future to address,
                 and the way in which to address them. The first
                 installment of contributions appears in this issue, and
                 one or two more installments will appear among the next
                 few issues. Also coming during the next few issues: the
                 search for the perfect theory journal, and (for the
                 sharp-eyed) Lance Fortnow dons a clown suit. Finally,
                 let me mention that work of Russell Impagliazzo
                 resolves one of the open questions from Complexity
                 Theory Column 11.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1996:YQC,
  author =       "Gilles Brassard and Claude Cr{\'e}peau",
  title =        "25 years of quantum cryptography",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "13--24",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235669",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The fates of SIGACT News and Quantum Cryptography are
                 inseparably entangled. The exact date of Stephen
                 Wiesner's invention of `conjugate coding' is unknown
                 but it cannot be far from April 1969, when the premier
                 issue of SIGACT News ---or rather SICACT News as it was
                 known at the time---came out. Much later, it was in
                 SIGACT News that Wiesner's paper finally appeared [74]
                 in the wake of the first author's early collaboration
                 with Charles H. Bennett [7]. It was also in SIGACT News
                 that the original experimental demonstration for
                 quantum key distribution was announced for the first
                 time [6] and that a thorough bibliography was published
                 [19]. Finally, it was in SIGACT News that Doug
                 Wiedemann chose to publish his discovery when he
                 reinvented quantum key distribution in 1987, unaware of
                 all previous work but Wiesner's [73, 5]. Most of the
                 first decade of the history of quantum cryptography
                 consisted of this lone unpublished paper by Wiesner.
                 Fortunately, Bennett was among the few initiates who
                 knew of Wiesner's ideas directly from the horse's
                 mouth. His meeting with the first author of this column
                 in 1979 was the beginning of a most fruitful lifelong
                 collaboration. It took us five more years to invent
                 quantum key distribution [4], which is still today the
                 best-known application of quantum mechanics to
                 cryptography. The second author joined in slightly
                 later, followed by a few others. But until the early
                 1990's, no more than a handful of people were involved
                 in quantum cryptographic research. Since then, the
                 field has taken off with a vengeance, starting with
                 Artur K. Ekert's proposal to use quantum nonlocality
                 for cryptographic purposes [33]. The golden age started
                 in earnest when Ekert organized the first international
                 workshop on quantum cryptography in Broadway, England,
                 in 1993. Since then, many conferences have been devoted
                 at least partly to quantum cryptography, which has
                 become a major international topic. The purpose of the
                 aforementioned 1993 bibliography in SIGACT News was to
                 cite as much as possible all papers ever written on the
                 subject, including unpublished manuscripts: there were
                 57 entries in total. Today, such an undertaking would
                 be nearly impossible owing to the explosion of new
                 research in the field. The purpose of this column is to
                 give an overview of the current research in quantum
                 cryptography. It is not our intention to be exhaustive
                 and we apologize in advance to any researcher whose
                 work we may have omitted. Note that we do not
                 necessarily agree with the claims in every paper
                 mentioned here: this column should not be construed as
                 a seal of approval!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yannakakis:1996:PDT,
  author =       "Mihalis Yannakakis",
  title =        "Perspectives on database theory",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "25--49",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dwork:1996:DCC,
  author =       "Cynthia Dwork",
  title =        "Distributed computing column",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "50--54",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235671",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1996:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational {Geometry Column} 29",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "55--59",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.571627",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Past accomplishments of Computational Geometry are
                 reviewed and future directions adumbrated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1996:EFR,
  author =       "Rocky Ross",
  title =        "Education forum: retrospective",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "69--70",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235676",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Levin:1996:FCC,
  author =       "Leonid A. Levin",
  title =        "Fundamentals of computing (a cheatlist)",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "89",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.235680",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See errata \cite{Levin:1997:EFC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Johnson:1996:BHS,
  author =       "David S. Johnson",
  title =        "A {Brief History} of {SIGACT News} and its {Editors}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "125",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.571628",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fenner:1996:CTN,
  author =       "Stephen A. Fenner and Lance J. Fortnow and William J.
                 Gasarch",
  title =        "Complexity Theory Newsflash",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "3",
  pages =        "126",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/235666.571629",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Allender:1996:FCC,
  author =       "E. Allender and J. Feigenbaum and J. Goldsmith and T.
                 Pitassi and S. Rudich",
  title =        "The future of computational complexity theory: part
                 {II}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "3--7",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.242582",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This is the final part of a 2-part column on the
                 future of computational complexity theory. The grounds
                 rules were that the contributors had no restrictions
                 (except a 1-page limit). For readers interested in more
                 formal reports, in addition to the two URLs mentioned
                 in the previous issue ({\tt
                 ftp://ftp.cs.washington.edu/tr/1996/O3/UW-CSE-96-O3-O3.PS.Z}
                 and {\tt http://theory.lcs.mit.edu/-oded/toc-sp.html})
                 I would also point to the recent `Strategic Directions'
                 report ({\tt
                 http://geisel.csl.uiuc.edu/-loui/complete.html}).
                 Coming during the next few issues: the search for the
                 perfect theory journal; Thomas Jefferson exposed as a
                 theoretical computer scientist; and Mitsunori Ogihara's
                 survey of DNA-based computation. (The `Lance Fortnow in
                 a clown suit' article promised in the previous column
                 actually ran stand-alone last issue due to scheduling;
                 it probably is still available at a library near you!)
                 Finally, some recent work by Edith Hemaspaandra, Harald
                 Hempel, and myself, and of Buhrman and Fortnow,
                 partially resolves one of the open questions from
                 Complexity Theory Column 11.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hull:1996:RP,
  author =       "Richard Hull",
  title =        "Report on {PODS '96}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "8--10",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.242583",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1996:OPb,
  author =       "Samir Khuller",
  title =        "Open {Problems} 14",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "11",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.571625",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1996:EFL,
  author =       "Rockford J. Ross",
  title =        "Education forum: loops and induction proofs",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "15--19",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.242584",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rodger:1996:RFI,
  author =       "Susan H. Rodger",
  title =        "Report on {The First International Workshop on
                 Implementing Automata 1996}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "38--45",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.571626",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiden:1996:TCS,
  author =       "Steve Seiden",
  title =        "Theoretical computer science cheat sheet",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "52--61",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.242585",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1996:PE,
  author =       "Ian Parberry",
  title =        "{Paul Erd{\H{o}}s (1913--1996)}",
  journal =      j-SIGACT,
  volume =       "27",
  number =       "4",
  pages =        "62--65",
  month =        dec,
  year =         "1996",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/242581.242586",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1997:J,
  author =       "Lane A. Hemaspaandra",
  title =        "Journals to {Die For}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "2",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.568467",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Following in the tracks of Pullum's search for the
                 perfect linguistics journal, we hunt the perfect theory
                 journal.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1997:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational {Geometry Column} 30",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "7",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.568469",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Several results from Combinatorial Geometry [PA95] are
                 detailed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loui:1997:RCR,
  author =       "Michael C. Loui",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "9",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.568470",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1997:EF,
  author =       "Rocky Ross",
  title =        "Education Forum",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "13",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.568466",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yang:1997:SBR,
  author =       "Ruiguang Yang and Longyun Ding and Shurun Xu",
  title =        "Some better results estimating the shift function in
                 terms of busy beaver function",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "43--48",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.250038",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "About the relation between the shift function S(n) and
                 the busy beaver function \Sigma (n), there have been
                 some results. In 1992, A. Julstrom gave his result:
                 S(n) < \Sigma (20n); in 1994, Wang Kewen and Xu Shurun
                 obtained: S(n) < \Sigma (10n). In this paper, we shall
                 show that S(n) < = \Sigma (3n -f c)(c is a constant).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shen:1997:CEC,
  author =       "Zhizhang Shen",
  title =        "Correcting an Error in a 'Cheat Sheet'",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "1",
  pages =        "49",
  month =        mar,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/250037.568468",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1997:RNL,
  author =       "Edith Hemaspaandra and Lane A. Hemaspaandra and
                 J{\"o}rg Rothe",
  title =        "Raising {NP} lower bounds to parallel {NP} lower
                 bounds",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "2--13",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261344",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's column surveys recent progress in raising
                 NP-hardness lower bounds to parallel NP lower bounds.
                 Complexity theorists will learn that Lewis Carroll
                 (unbeknownst to himself) was a fellow complexity
                 theorist. So that readers specializing in algorithms
                 don't feel left out, let me mention that they are in
                 even better company. Algorithms for apportioning the US
                 House of Representatives were designed and debated by
                 Adam, Hamilton, Jefferson, Webster, and other famous
                 figures from American history, as recounted in a
                 page-turner by Balinski and Young ([BY82]; see also
                 [BY85] for a shorter take and [HRSZ96] for a more
                 explicitly computational spin). Looking forward, the
                 next issue's column will be a survey, by Mitsunori
                 Ogihara, of DNA-based computing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brassard:1997:QCH,
  author =       "Gilles Brassard and Peter H{\o}yer and Alain Tapp",
  title =        "Quantum cryptanalysis of hash and claw-free
                 functions",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "14--19",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261346",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this note, we give a quantum algorithm that finds
                 collisions in arbitrary $ \tau $-to-one functions after
                 only $ O(\sqrt [3]{N / \tau })$ expected evaluations of
                 the function. Assuming the function is given by a black
                 box, this is more efficient than the best possible
                 classical algorithm, even allowing probabilism. We also
                 give a similar algorithm for finding claws in pairs of
                 functions. Furthermore, we exhibit a space-time
                 tradeoff for our technique. Our approach uses Grover's
                 quantum searching algorithm in a novel way.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1997:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 31",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "20--23",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261348",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Several topics related to packing on a sphere are
                 discussed: packing points, packing lines through the
                 center, and packing $k$-flats in dimension $d$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mitchell:1997:APS,
  author =       "John C. Mitchell and Jon G. Riecke",
  title =        "The analysis of programming structure",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "24--31",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.262782",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The standard course in theory of computation
                 introduces students to Turing machines and
                 computability theory. This model prescribes what can be
                 computed, and what cannot be computed, but the negative
                 results have far more consequences. To take the common
                 example, suppose an operating systems designer wants to
                 determine whether or not a program will halt given
                 enough memory or other resources. Even a Turing machine
                 program cannot be designed to solve this problem---and
                 Turing machines have far more memory than any physical
                 computer. The negative results of computability theory
                 are also robust (a principle enshrined as Church's
                 thesis): since many other models of computation,
                 including {\&}lambda;-calculus, Post systems, and
                 {\&}micro;-recursive functions, compute the same class
                 of functions on the natural numbers, negative results
                 from one description apply to all other descriptions.
                 But the discipline of programming and the architecture
                 of modern computers impose other constraints on what
                 can be computed. The constraints are ubiquitous. For
                 example, a combination of hardware and software in
                 operating systems prevents programs from manipulating
                 protected data structures except through the system
                 interface. In programming languages, there are programs
                 that `cannot be written,' e.g., a sort procedure in
                 Pascal that works on arrays of any size. In databases,
                 there is no Datalog program to calculate the parity of
                 a relation (see [1]). Each of these settings involves a
                 uniprocessor machine, but the constraints become even
                 more pronounced in distributed systems: for instance,
                 there is no mutual exclusion protocol for $n$
                 processors using fewer than $n$ atomic read/write
                 registers [5]. All of these problems are computable in
                 Turing's sense: one can encode each of these problems
                 as computation over the natural numbers, and one can
                 write programs to solve the problems. So in what sense
                 is Church's thesis applicable? It is important to
                 remember that computability theory only describes
                 properties of the set of computable functions on the
                 natural numbers (although there have been attempts to
                 extend computability theory and complexity theory to
                 higher-order functions; see, e.g., [13, 12, 20].) If
                 one adopts computability theory as the only theory of
                 computation, one is naturally forced to encode other
                 forms of computation as functions on the natural
                 numbers. Alan Perlis' phrase `Turing tarpit' highlights
                 this potential misuse of computability theory: the
                 encoding of computation into one framework forces many
                 relevant distinctions to become lost. Any attempt to
                 explain other computing constraints must necessarily
                 look for theories beyond computability theory.
                 Semantics aims to fill this niche: it is the
                 mathematical analysis and synthesis of programming
                 structures. The definition is admittedly broad and not
                 historically based: semantics was originally a means of
                 describing programming languages, and the definition
                 covers areas not usually called `semantics.' This essay
                 attempts to flesh out this definition of semantics with
                 examples, comparisons, and sources of theories. While
                 most of the ideas will be familiar to the practicing
                 semanticist, the perspective may be helpful to those in
                 and out of the field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Riecke:1997:APS,
  author =       "Jon G. Riecke",
  title =        "The Analysis of Programming Structure",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "24--31",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 16:33:55 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1997:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "32--33",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.571219",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zalcstein:1997:NRTa,
  author =       "Zeke Zalcstein",
  title =        "{NSF Report}: {Theory of Computing Program}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "34",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.571218",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1997:EFM,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Matter} of {Salesmanship}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "37--39",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.571217",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hochba:1997:AAN,
  author =       "Dorit S. Hochba",
  title =        "Approximation {Algorithms} for {NP}-Hard {Problems}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "40--52",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.571216",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Approximation algorithms have developed in response to
                 the impossibility of solving a great variety of
                 important optimization problems. Too frequently, when
                 attempting to get a solution for a problem, one is
                 confronted with the fact that the problem is NP-hard.
                 This, in the words of Garey and Johnson, means `I can't
                 find an efficient algorithm, but neither can all of
                 these famous people.' While this is a significant
                 theoretical step, it hardly qualifies as a cheering
                 piece of news. If the optimal solution is unattainable
                 then it is reasonable to sacrifice optimality and
                 settle for a `good' feasible solution that can be
                 computed efficiently. Of course, we would like to
                 sacrifice as little optimality as possible, while
                 gaining as much as possible in efficiency. Trading-off
                 optimality in favor of tractability is the paradigm of
                 approximation algorithms. The main themes of this book
                 revolve around the design of such algorithms and the
                 `closeness' to optimum that is achievable in polynomial
                 time. To evaluate the limits of approximability, it is
                 important to derive lower bounds or inapproximability
                 results. In some cases, approximation algorithms must
                 satisfy additional structural requirements such as
                 being on-line, or working within limited space. This
                 book reviews the design techniques for such algorithms
                 and the developments in this area since its inception
                 about three decades ago.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kao:1997:MSD,
  author =       "Ming-Yang Kao",
  title =        "Multiple-size divide-and-conquer recurrences",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "67--69",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261350",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kostin:1997:NAD,
  author =       "A. E. Kostin",
  title =        "The novel algorithm for determining the reachability
                 in acyclic {Petri} nets",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "70--79",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261351",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A novel algorithm for determining the reachability of
                 a marking in acyclic Petri nets is proposed. For this
                 algorithm, a Petri net is represented in the matrix
                 form, with a given pair of initial and target markings.
                 The algorithm is based on the creation of a temporal
                 ordering relation for transition firings and on using
                 this relation for determining the shortest sequence of
                 transition firings transforming the initial marking
                 into the target one. By solving the fundamental
                 equation of the Petri net, the algorithm determines
                 initially whether the target marking is reachable from
                 the given initial marking, and, in case it is, produces
                 the shortest sequence of transition firings which
                 transforms the initial marking into the target one.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Levin:1997:EFC,
  author =       "Leonid Levin",
  title =        "Errata to {``Fundamentals of Computing''}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "80",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.571215",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Levin:1996:FCC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Raman:1997:RRS,
  author =       "Rajeev Raman",
  title =        "Recent results on the single-source shortest paths
                 problem",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "2",
  pages =        "81--87",
  month =        jun,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/261342.261352",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We summarize the currently best known theoretical
                 results for the single-source shortest paths problem
                 for directed graphs with non-negative edge weights. We
                 also point out that a recent result due to Cherkassky,
                 Goldberg and Silverstein (1996) leads to even better
                 time bounds for this problem than claimed by the
                 authors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1997:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} complexity theory column 18",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "2--11",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262302",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1997:CGCc,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 32",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "12--16",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262303",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The proof of Dey's new k-set bound is illustrated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ozsoyoglu:1997:RP,
  author =       "Z. Meral {\"O}zsoyo{\u{g}}lu",
  title =        "Report on {PODS'97}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "17--20",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262304",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Matias:1997:PAC,
  author =       "Yossi Matias",
  title =        "Parallel algorithms column: on the search for suitable
                 models",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "21--29",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262305",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1997:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "30",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.1040095",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$41 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zalcstein:1997:NRTb,
  author =       "Zeke Zalcstein",
  title =        "{NSF} report: theory of computing program",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "32",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262307",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1997:OP,
  author =       "Samir Khuller",
  title =        "Open problems: 15",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "33--36",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262308",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1997:BRB,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{An Introduction to
                 Kolmogorov Complexity and its Applications}} Second
                 Edition, 1997 by Ming Li and Paul Vitanyi (Springer
                 (Graduate Text Series))}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "37--40",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.1040343",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Li:1993:IKC,Li:1997:IKC,Li:2008:IKC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1997:EFW,
  author =       "Rocky Ross",
  title =        "Education forum: {Where Have} all the {Women Gone?}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "41--49",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.1040344",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aho:1997:EOT,
  author =       "Alfred V. Aho and David S. Johnson and Richard M. Karp
                 and S. Rao Kosaraju and Catherine C. McGeoch and
                 Christos H. Papadimitriou and Pavel Pevzner",
  title =        "Emerging opportunities for theoretical computer
                 science",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "65--74",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262309",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The principles underlying this report can be
                 summarized as follows:1. A strong theoretical
                 foundation is vital to computer science.2. Theory can
                 be enriched by practice.3. Practice can be enriched by
                 theory.4. If we are guided by (2) and (3), the value,
                 impact, and funding of theory will be enhanced. In
                 order to achieve a greater synergy between theory and
                 application, and to sustain and expand on the
                 remarkable successes of Theory of Computing (TOC), we
                 consider it essential to increase the impact of theory
                 on key application areas. This requires additional
                 financial resources in support of theory, and closer
                 interaction between theoreticians and researchers in
                 other areas of computer science and in other
                 disciplines. The report does not make a detailed
                 assessment of the overall state of theoretical computer
                 science or fully chronicle the achievements of this
                 field. Instead, it has the specific objective of
                 recommending ways to harness these remarkable
                 achievements for the solution of challenging problems
                 emerging from new developments such as the information
                 superhighway. Section 1 describes the events leading up
                 to this report and delineates the report's objectives.
                 Section 2 establishes the context for the report. It
                 traces the history of TOC, describes the impact that
                 TOC has achieved in the areas of core theory and
                 fundamental algorithms, points out the differences
                 between these areas and application-oriented theory,
                 and calls for an intensified effort to bring the
                 methods of TOC to bear on applications. It then goes on
                 to define the four main categories into which our
                 recommendations fall: building bridges between theory
                 and applications, algorithm engineering, communication,
                 and education. Section 3 discusses some specific
                 opportunities for stimulating interactions between TOC
                 and applied areas. Section 4 proposes an applied
                 research initiative, Information Access in a Globally
                 Distributed Environment, which identifies an exciting
                 current technological area that we believe presents
                 challenging opportunities for excellent theoretical
                 work. Section 5 proposes a second applied research
                 initiative, The Algorithmic Stockroom, that would
                 exploit and extend the body of theoretical knowledge in
                 the field of algorithms. Section 6 proposes a
                 broadening in graduate education with two purposes in
                 mind: to better prepare theoreticians to interact
                 creatively with practitioners, and to provide future
                 practitioners with the background they will need to
                 benefit from this exchange.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Condon:1997:SDR,
  author =       "Anne Condon and Faith Fich and Greg N. Frederickson
                 and Andrew V. Goldberg and David S. Johnson and Michael
                 C. Loui and Steven Mahaney and Prabhakar Raghavan and
                 John E. Savage and Alan L. Selman and David B. Shmoys",
  title =        "Strategic directions in research in theory of
                 computing",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "75--93",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262310",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This report focuses oll two core areas of theory of
                 computing: discrete algorithms and computational
                 complexity theory. The report reviews the purposes and
                 goals of theoretical research, summarizes selected past
                 and recent achievements, explains the importance of
                 sustaining core research, and identifies promising
                 opportunities for future research. Some research
                 opportunities build bridges between theory of computing
                 and other areas of computer science, and other science
                 and engineering disciplines.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fich:1997:IIR,
  author =       "Faith Fich",
  title =        "Infrastructure issues related to theory of computing
                 research",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "94--99",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262311",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper discusses a number of issues related to the
                 support of research in Theory of Computing, including
                 funding, evaluation of research, communication,
                 interaction with other research areas, education, and
                 employment. It is directed primarily to researchers in
                 Theory of Computing and is meant to complement the
                 Infrastructure Section of the committee report
                 `Strategic Directions for Research in Theory of
                 Computing'. Theory of Computing is a field of Computer
                 Science that uses mathematical techniques to understand
                 the nature of computation and to design and analyze
                 algorithms for important and fundamental problems. It
                 provides important new ways of thinking about
                 computation and lasting insights that are applicable to
                 a wide variety of systems. There are a range of
                 different research activities that occur within this
                 field, including developing models (and ways to
                 quantify the efficiency of algorithms in those models),
                 determining the relationships among different models,
                 designing new (provably correct) algorithms, analyzing
                 the efficiency of various algorithms, proving lower
                 bounds and impossibility, and explaining experimental
                 results. Some researchers are better at posing
                 interesting questions or opening up new directions for
                 research; others are better at answering questions and
                 developing new techniques to do so. In this paper, I
                 wish to discuss a number of issues related to the
                 support of research in Theory of Computing, including
                 funding, evaluation of research, communication,
                 interaction with other research areas, education, and
                 employment. It is directed primarily to researchers in
                 Theory of Computing and is meant to complement the
                 Infrastructure Section of the committee report
                 `Strategic Directions for Research in Theory of
                 Computing', which is directed primarily to people
                 outside our community. I will examine some things our
                 community has done well, some recent innovations, and
                 some suggestions to enhance our research environment.
                 Finally, I will address the relationship of Theory of
                 Computing with experimental computing and algorithmic
                 engineering.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:1997:TCS,
  author =       "Oded Goldreich and Avi Wigderson",
  title =        "Theory of computing: a scientific perspective
                 (extended abstract)",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "3",
  pages =        "100--102",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/262301.262312",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Allender:1997:MCC,
  author =       "Eric Allender",
  title =        "Making computation count: arithmetic circuits in the
                 nineties",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "2--15",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.270564",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's expert guest column is by Eric Allender,
                 who has just taken over the Structural Complexity
                 Column in the Bulletin of the EATCS. Regarding
                 `Journals to Die For' (SIGACT News Complexity Theory
                 Column 16), Joachim von zur Gathen, the editor-in-chief
                 of computational complexity, has written me pointing
                 out, quite correctly, that I cheated his journal of a
                 point. His journal, in the issue checked, does include
                 the email address of each author. I apologize for the
                 missing point. Joachim also asked me to mention that,
                 while the journal does not require the `alpha' citation
                 style, it does strongly advise authors to use that
                 style.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1997:BRC,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "16",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571465",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Puxang:1997:BRB,
  author =       "K. Puxang",
  title =        "Book Review: {{\booktitle{Metamathematics, Machines,
                 and G{\"o}dels Proof}}, by N. Shankar}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "16--19",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571466",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shankar:1994:MMG}.",
  abstract =     "This book, first published in 1994, is derived from
                 the author's 1986 Ph.D. dissertation, one of the main
                 goals of which was to gauge the usefulness of automatic
                 theorem proving technology in constructing and
                 verifying proofs. The proofs chosen for this task were
                 G{\"o}del's first incompleteness theorem and the
                 Church--Rosser theorem of the lambda calculus. The
                 theorem prover used was the Boyer--Moore theorem prover
                 which can be obtained by ftp [1]. A manual for the
                 prover has been published as [2]. The author gives a
                 detailed account of the more important steps leading to
                 the mechanized verification of proofs of these
                 theorems. The theorem prover did not discover the
                 proofs but checked definitions and lemmas (about 2000
                 for the incompleteness theorem and supplied by the
                 author) that lead to the theorems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dekhtyar:1997:BRB,
  author =       "Alexander Dekhtyar",
  title =        "Book Review: {{\booktitle{Reasoning About Knowledge}},
                 by Ronald Fagin, Joseph Halpern, Yoram Moses and Moshe
                 Verdi}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "20--23",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571467",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Fagin:1995:RAK,Fagin:2003:RAK}.",
  abstract =     "How much do you know? How much do you know about what
                 you know? How much do you know about what someone else
                 knows? How much that someone else knows about what you
                 know about what she knows, and how much do you know
                 about that? We started with a very simple question
                 about knowledge, and almost immediately the chain of
                 questions lead to complicated and hard to comprehend
                 ones. Classic logic teaches us how one can reason about
                 truth and falsehood of statements, but can it help us
                 if we want to reason about our (or someone else's)
                 knowledge? And if the answer to the last question is
                 `yes', then how can we achieve this goal? These are
                 just a few of the questions, that served as motivation
                 for the book Reasoning About Knowledge. In the book
                 authors discuss the extentions of classical logic that
                 encapsulate the desired meaning of the statements such
                 as `I know X', `I know that Alice knows X' and
                 `Everyone knows that I know X'. In the first chapters
                 the book provides a number of motivating examples which
                 lead the reader to an informal understanding of the
                 authors' concept of knowledge. After that the notion of
                 knowledge is being formalized by introduction of modal
                 operators for knowledge, common knowledge and
                 distributed knowledge into the classic Propositional
                 logic. Kripke structures are introduced as models at
                 the same time and the obtained modal logics are then
                 studied closely with respect to their soundeness and
                 completeness properties, as well as the complexity of
                 decision procedures. Once the general background is
                 layed out, authors start discussing a variety of
                 applications of knowledge-based reasoning to other
                 problems in such fields as AI and Communications. A
                 number of chapters of the book are devoted to
                 discussing multi-agent systems and their behavior. A
                 concept of Common Knowledge and its relation to
                 Agreement and Cooperation between agents is also
                 discussed. The more detailed summary of the book is
                 provided below.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{League:1997:BRB,
  author =       "Christopher League",
  title =        "Book Review: {{\booktitle{Isomorphisms of Types: From
                 $ \lambda $-Calculus to Information Retrieval and
                 Language Design}}, by Roberto Di Cosmo (Birkh{\"a}user,
                 1995)}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "24--27",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571468",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{DiCosmo:1995:ITL}.",
  abstract =     "The \lambda -calculus is an elegant computational
                 model used extensively in the formal semantics of
                 programming languages. It was first described by Alonzo
                 Church in 1932, as a foundation of mathematics based
                 not on sets, but directly on functions. \lambda
                 calculus was, in part, the inspiration for the
                 programming language Lisp, and its typed versions have
                 become the foundation for a family of modern type-safe
                 languages that includes Haskell and ML. In its original
                 untyped form, the \lambda -calculus is an extremely
                 simple rewrite system with the concise syntax $ e : : x
                 | e_1 e_2 | \lambda x.e $, where $x$ ranges over
                 variable names, $ e_1 e_2$ is called an application,
                 and $ \lambda x.e$ is called an abstraction. An
                 abstraction is analogous to a function; $x$ is the
                 formal parameter and $e$ is the body. Effectively,
                 there is just one rewrite rule, called $ \beta
                 $-reduction: $ (\lambda x.e_1) e_2 \to \beta e_1 [e_2 /
                 x]$, where $ e_1 [e_2 / x]$ means that we substitute $
                 e_2$ for occurrences of $x$ in the expression $ e_1$
                 Voil{\`a}---Turing equivalence. Actually, there are a
                 few technicalities we are glossing over, having to do
                 with renaming bound variables and such. And in modern
                 usage we generally augment the system with natural
                 numbers, arithmetic, and boolean logic as primitives,
                 although these can be completely encoded in the raw
                 calculus. This book is about types (a familiar notion
                 in both mathematical logic and programming languages)
                 and a family of typed $ \lambda $-calculi. Armed with
                 these formalisms, Di Cosmo explores various
                 isomorphisms of types, which then prove useful in
                 building a software engineering tool to classify and
                 retrieve software components! Specifically, Chapters
                 1--3 present a quick introduction to the various typed
                 \lambda -calculi, sketch some isomorphisms, and then
                 prove important results about confluence, decidability,
                 and normalization. Chapters 4--5 contain the meat of
                 the theoretical contribution of this work, presenting
                 complete theories for first- and second-order
                 isomorphic types. Chapters 6--7 demonstrate the utility
                 of these isomorphisms in a software engineering
                 application, and sketch other potential applications
                 and extensions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1997:RCRc,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "28--30",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571469",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zalcstein:1997:NRTc,
  author =       "Zeke Zalcstein",
  title =        "{NSF Report}: {Theory} of {Computing Program}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "31",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571470",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1997:EFC,
  author =       "Rocky Ross",
  title =        "Education {Forum}: {Computer Science}, {Engineering},
                 or {Home Economics?}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "37--40",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571471",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gusfield:1997:BST,
  author =       "Dan Gusfield",
  title =        "{{\booktitle{Algorithms on Strings, Trees, and
                 Sequences: Computer Science and Computational
                 Biology}}}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "41--60",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.571472",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gusfield:1997:AST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wang:1997:RTA,
  author =       "Jie Wang",
  title =        "Report on the {Third Annual International Computing
                 and Combinatorics Conference (COCOON'97): Shanghai,
                 China, August 20--23, 1997}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "69--76",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.270565",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moret:1997:WAE,
  author =       "Bernard M. E. Moret",
  title =        "Workshop on algorithm engineering: a report",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "77--79",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.270568",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Longpre:1997:RC,
  author =       "Luc Longpr{\'e}",
  title =        "Report on {Complexity 1997}",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "80--83",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.270569",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schorer:1997:SPS,
  author =       "Peter Schorer",
  title =        "Is a solution to the $ 3 x + 1 $ problem in sight?",
  journal =      j-SIGACT,
  volume =       "28",
  number =       "4",
  pages =        "90--93",
  month =        dec,
  year =         "1997",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/270563.270570",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The $ 3 x + 1 $ Problem (also known as the Syracuse
                 Problem) asks if repeated iterations o f the basic
                 formula $ (3 x + 1) / (2^{{\rm ord}_2(3 x + 1)}) $
                 always terminate in $1$, where $x$ is an odd positive
                 integer, and $ {\rm ord}_2 (y)$ is the largest power of
                 $2$ that divides $y$. Thus, e.g., beginning with $ x =
                 3$, one iteration yields $5$, the next iteration yields
                 $1$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Agarwal:1998:CG,
  author =       "Pankaj K. Agarwal and Joseph O'Rourke",
  title =        "Computational geometry",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "27--32",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300310",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Problems presented at the open-problem session of the
                 14th Annual ACM Symposium on Computational Geometry are
                 listed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Allender:1998:BRB,
  author =       "Eric Allender",
  title =        "Book Review: {{\booktitle{Complexity Theory
                 Retrospective II}}. Edited by: Lane A. Hemaspaandra and
                 Alan L. Selman (Springer Verlag)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "2--5",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.1040351",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hemaspaandra:1997:CTR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Arora:1998:BRB,
  author =       "Anish Arora",
  title =        "Book Review: {{\booktitle{Verification of Sequential
                 and Concurrent Programs}}, by Krzysztof R. Apt and
                 Ernst-R{\"u}diger Olderog (Springer-Verlag New York,
                 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "46--48",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040357",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Apt:1991:VSC,Apt:1997:VSC,Apt:2009:VSC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Benson:1998:BRB,
  author =       "Gary Benson",
  title =        "Book Review: {{\booktitle{Algorithms on Strings,
                 Trees, and Sequences: Computer Science and
                 Computational Biology}}, by Dan Gusfield (Cambridge
                 University Press, Cambridge, England, 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "43--46",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040356",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gusfield:1997:AST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bhatia:1998:BRB,
  author =       "Randeep Bhatia and Yoram J. Sussmann",
  title =        "Book review: {{\booktitle{Approximation Algorithms for
                 NP-hard Problems}}. Edited by Dorit S. Hochbaum (PWS,
                 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "17--20",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.1041951",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hochbaum:1997:AAN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Blum:1998:TCS,
  author =       "Avrim Blum and Prabhakar Raghavan",
  title =        "On a theory of computing symposia",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "104--111",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300315",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We consider the problem of scheduling a conference to
                 achieve the benefits in time-compression of parallel
                 sessions, but without the associated high degree of
                 conflict between talks. We describe a randomized
                 construction meeting these goals that we analyze based
                 on an expansion property of an associated graph. We
                 also give algorithms for attendees scheduling their
                 time within such a conference, and algorithms for
                 verifying a proposed conference schedule. Finally, we
                 present simulation results for typical conference
                 sizes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Crescenzi:1998:HFB,
  author =       "Pierluigi Crescenzi and Viggo Kann",
  title =        "How to find the best approximation results",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "90--97",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306210",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A compendium of NP optimization problems, containing
                 the best approximation results known for each problem,
                 is available on the world wide web at {\tt
                 http://www.nada.kth.se/~viggo/problemlist/}. In this
                 paper we describe the compendium, and specify how the
                 compendium is consultable as well as modifiable on the
                 web. We also give statistics for the use of the
                 compendium.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dekhtyar:1998:BRB,
  author =       "Alexander Dekhtyar",
  title =        "Book Review: {{\booktitle{Vicious Circles}}, by Jon
                 Barwise and Lawrence Moss (Cambridge University Press
                 1996)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "10--14",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.1040363",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Barwise:1996:VCM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1998:BRCa,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "2",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.1040350",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1998:BRCb,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "17",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.1041950",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1998:BRCc,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "43",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040355",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1998:BRCd,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "2--4",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.1040361",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1999:BRCa,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "2",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1040391",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gupta:1998:BRB,
  author =       "Sanjay Gupta",
  title =        "Book Review: {{\booktitle{Theories of Computability}},
                 by Nicholas Pippenger (Cambridge University Press
                 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "5--10",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.1040362",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pippenger:1997:TC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1998:THC,
  author =       "Lane A. Hemaspaandra",
  title =        "Take-home complexity",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "9--13",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288080",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1998:WDC,
  author =       "Edith Hemaspaandra and Lane A. Hemaspaandra and Harald
                 Hempel",
  title =        "{What}'s up with downward collapse: using the
                 easy-hard technique to link {Boolean} and polynomial
                 hierarchy collapses",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "10--22",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300308",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "During the past decade, nine papers have obtained
                 increasingly strong consequences from the assumption
                 that boolean or bounded-query hierarchies collapse. The
                 final four papers of this nine-paper progression
                 actually achieve downward collapse---that is, they show
                 that high-level collapses induce collapses at (what
                 before-the-fact seemed to be) lower complexity levels.
                 For example, for each k {\&}ge; 2 it. is now known that
                 if one query to $ \sigma^p k $ is as powerful as two
                 queries to $ \sigma^p k $ (i.e., $ P^{\Sigma [1]} =
                 P^{\Sigma [2]}$), then PH = $ \sigma^p k$. This article
                 surveys the history, the results, and the method---the
                 so-called easy-hard technique---of the just-mentioned
                 nine-paper progression:1. J. Kadin. The polynomial time
                 hierarchy collapses if the boolean hierarchy collapses.
                 SIAM Journal on Computing, 17(6):1263--1282, 1988.
                 Erratum appears in the same journal. 20(2):404.2. K.
                 Wagner. Number-of-query hierarchies. Technical Report
                 158, Institut f{\"u}r Mathematik. Universit{\"a}t
                 Augsburg, Augsburg, Germany, October 1987.3. K. Wagner.
                 Number-of-query hierarchies. Technical Report 4.
                 Institut f{\"u}r Informatik. Universit{\"a}t
                 W{\"u}rzburg, W{\"u}rzburg, Germany, February 1989.4.
                 R. Chang and J. Kadin. The boolean hierarchy and the
                 polynomial hierarchy: A closer connection. SIAM Journal
                 on Computing. 25(2):340--354. 1996.5. R. Beigel. R.
                 Chang. and M. Ogiwara. A relationship between
                 difference hierarchies and relativized polynomial
                 hierarchies. Mathematical Systems Theory.
                 26(3):293--310, 1993.6. E. Hemaspaandra, L.
                 Hemaspaandra. and H. Hempel. An upward separation in
                 the polynomial hierarchy. Technical Report
                 Math/Inf/96/15, Institut f{\"u}r Informatik,
                 Friedrich-Schiller-Universit{\"a}t Jena, Jena, Germany,
                 June 1996.7. E. Hemaspaandra, L. Hemaspaandra, and H.
                 Hempel. A downward collapse within the polynomial
                 hierarchy. SIAM Journal on Computing, 28(2):383--393,
                 1999.8. H. Buhrman and L. Fortnow. Two queries. In
                 Proceedings of the 13th Annual IEEE Conference on
                 Computational Complexity. 13--19. IEEE Computer Society
                 Press, June 1998.9. E. Hemaspaandra, L. Hemaspaandra,
                 and H. Hempel. Translating equality downwards.
                 Technical Report TR-657. Department of Computer
                 Science, University of Rochester, Rochester, NY. April
                 1997.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1998:WEC,
  author =       "Lane A. Hemaspaandra and Alan L. Selman",
  title =        "Writing and editing complexity theory: tales and
                 tools",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "20--27",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306201",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Each researcher should have a full shelf---physical or
                 virtual---of books on writing and editing prose. Though
                 we make no claim to any special degree of expertise, we
                 recently edited a book of complexity theory surveys
                 [HS97], and in doing so we were brought into
                 particularly close contact with the subject of this
                 article, and with a number of the excellent resources
                 available to writers and editors. In this article, we
                 list some of these resources, and we also relate some
                 of the adventures we had as our book moved from concept
                 to reality.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Huang:1998:CKM,
  author =       "Andy Huang",
  title =        "Computation of the {Knuth--Morris--Pratt} skip
                 tables",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "59--61",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300313",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{James:1998:BRB,
  author =       "Jerry James",
  title =        "Book Review: {{\booktitle{Algorithms and Programming:
                 Problems and Solutions}}, by Alexander Shen
                 (Birkh{\"a}user Boston, 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "48--52",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040358",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shen:2008:APP,Shen:2010:APP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1998:BRB,
  author =       "Samir Khuller",
  title =        "Book Review: {{\booktitle{Selected Papers on Computer
                 Science}}, by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "21--26",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.1041952",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:1996:SPC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:1998:OP,
  author =       "Samir Khuller",
  title =        "Open problems: 16",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "15--17",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.281073",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Koblitz:1998:BRB,
  author =       "Neal Koblitz",
  title =        "Book Review: {{\booktitle{Discrete Mathematics in the
                 Schools}}. Edited by Joseph G. Rosenstein, Deborah S.
                 Franzblau, and Fred S. Roberts (American Mathematical
                 Society)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "8--12",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.1040353",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Rosenstein:1997:DMS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kostin:1998:YAR,
  author =       "Alexander E. Kostin and Svetlana A. Tchoudaikina",
  title =        "Yet another reachability algorithm for {Petri} nets",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "98--110",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306212",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/Contrib.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A new algorithm for the determination of reachability
                 of a marking in generalized Petri nets is proposed. The
                 algorithm is based on the matrix-equation approach.
                 Given a Petri net, a so called complemented Petri net
                 is created that consists of the given Petri net and a
                 complementary transition with input and output places
                 depending on the initial and target markings. Then the
                 reachability task is reduced to the investigation of
                 T-invariants of the complemented Petri net. Using a
                 technique of search for T-invariants, the algorithm
                 determines minimal-support T-invariants, that include
                 the complementary transition, and then calculates the
                 finite set of their linear combinations. For each
                 T-invariant, the algorithm tries to create sequentially
                 all reachability paths from the given initial marking
                 to the target marking or determines that there are no
                 such paths at all. During creation of the reachability
                 paths, the algorithm needs memory only for storing the
                 reachability path being created. If it is sufficient to
                 determine only one firing sequence that transforms the
                 initial marking into the target one, then the algorithm
                 may be terminated after successful creation of the
                 first reachability path.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lewis:1998:ETC,
  author =       "Harry R. Lewis and Christos H. Papadimitriou",
  title =        "Elements of the {Theory} of {Computation}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "62--78",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040360",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Longpre:1998:RC,
  author =       "Luc Longpr{\'e}",
  title =        "Report on {Complexity 1998}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "92--93",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300314",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Maklevitch:1999:BRB,
  author =       "Joseph Maklevitch",
  title =        "Book Review: {{\booktitle{Privacy on the Line}}, by
                 Whitfield Diffie and Susan Landau (MIT Press 1998)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "6--8",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1041970",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Diffie:1998:PLP,Diffie:2007:PLP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McNicholl:1999:BRB,
  author =       "Timothy H. McNicholl",
  title =        "Book Review: {{\booktitle{Stable Marriage and its
                 Relation to Other Combinatorial Problems: An
                 Introduction to Algorithm Analysis}}, by Donald E.
                 Knuth (American Mathematical Society 1996)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "2--4",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1040392",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:1997:SMR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{OHearn:1998:POA,
  author =       "Peter W. O'Hearn",
  title =        "Polymorphism, objects and abstract types",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "39--50",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306206",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1998:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 33",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "14--20",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288081",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Several recent SIGGRAPH papers on surface
                 simplification are described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:1998:EYW,
  author =       "Ian Parberry",
  title =        "Everything you wanted to know about the running time
                 of {Mergesort} but were afraid to ask",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "50--57",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288085",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Although mergesort is an algorithm that is frequently
                 glossed over in textbooks, it provides fertile ground
                 for planting ideas about algorithm analysis in the
                 minds of students. Why can we assume that $n$ is a
                 power of 2? How big is the increase in constant
                 multiple if we do? And how do we analyze it if we
                 don't? Here then is an excruciatingly detailed analysis
                 of mergesort for the student whose enquiring mind truly
                 wants to know.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Paredaens:1998:DTC,
  author =       "Jan Paredaens",
  title =        "Database theory column: report on {PODs} '98",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "23--26",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300309",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Postow:1998:BRB,
  author =       "Brian Postow",
  title =        "Book Review: {{\booktitle{Basic Simple Type Theory}},
                 by J. Roger Hindley (Cambridge University Press
                 1997)}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "5--8",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.1040352",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hindley:1997:BST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Postow:1999:BRB,
  author =       "Brian Postow",
  title =        "Book Review: {{\booktitle{A Theory of Objects}}, by
                 Martin Abadi and Luca Cardelli (Springer-Verlag, 1996):
                 Series--Monographs in Computer Science}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1041990",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Abadi:1996:TO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pruhs:1998:HDD,
  author =       "Kirk Pruhs",
  title =        "How to design dynamic programming algorithms sans
                 recursion",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "32--35",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.281075",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We describe a method, which we call the Pruning
                 Method, for designing dynamic programming algorithms
                 that does not require the algorithm designer to be
                 comfortable with recursion.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1998:EFR,
  author =       "Rocky Ross",
  title =        "Education Forum: Reflections on Turning Fifty",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "21--31",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.1040354",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1998:EFW,
  author =       "Rocky Ross",
  title =        "Education forum: {Web Enhanced Textbooks}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "51--57",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.1040365",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1998:GDW,
  author =       "Rocky Ross",
  title =        "Graduate degrees on the {Web}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "56--57",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300312",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1998:MW,
  author =       "Rocky Ross",
  title =        "Mathematics on the {Web}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "33--41",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288083",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Savage:1998:NAF,
  author =       "John E. Savage",
  title =        "A new approach to the first theory course",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "58--62",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306209",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article describes a novel first theory course,
                 entitled `Models of Computation', that I've been
                 teaching at Brown University for the last three years
                 with considerable success. In fact, many students tell
                 me that they enjoy it very much, a somewhat unusual
                 reaction for a required theory course. I believe its
                 appeal is due to my efforts to make the material
                 relevant to their experience and interests by
                 introducing new topics, namely, circuits, computer
                 organization, and programming, and covering the
                 standard material in an unusual order. Highlights of
                 the course are that students acquire a good
                 understanding of NP-complete languages by midsemester,
                 learn almost all of the material normally taught in a
                 theory course on formal languages and automata and
                 computability, and develop a very good appreciation for
                 the importance of reductions in theoretical (and
                 non-theoretical) computer science. More information on
                 the course can be found at
                 www.cs.brown.edu/courses/cs051.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1998:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "1",
  pages =        "13--14",
  month =        mar,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/281068.281071",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$43 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1998:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "27--28",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.1041953",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$43 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1998:RCRc,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "53--54",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.1040359",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$43 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1998:RCRd,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "15--16",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.1040364",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$43 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1999:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "12--13",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1041991",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$45 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sinha:1998:TRC,
  author =       "Rakesh K. Sinha",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "30--32",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288082",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Suciu:1998:OSD,
  author =       "Dan Suciu",
  title =        "An overview of semistructured data",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "4",
  pages =        "28--38",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/306198.306204",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tasic:1999:BRB,
  author =       "Vladimir Tasic",
  title =        "Book Review: {{\booktitle{The Limits of Mathematics}},
                 by G. J. Chaitin (Springer Verlag 1998)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "5",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1040393",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Chaitin:1998:LMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vollmer:1999:UCC,
  author =       "Heribert Vollmer",
  title =        "Uniform characterizations of complexity classes",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "17--27",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.309741",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the past few years, generalized operators (a.k.a.
                 leaf languages) in the context of polynomial-time
                 machines, and gates computing arbitrary groupoidal
                 functions in the context of Boolean circuits, have
                 raised much interest. We survey results from both
                 areas, point out connections between them, and present
                 relationships to a generalized quantifier concept from
                 finite model theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Volpano:1998:CPP,
  author =       "Dennis Volpano and Geoffrey Smith",
  title =        "Confinement properties for programming languages",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "3",
  pages =        "33--42",
  month =        sep,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/300307.300311",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weiss:1998:DSP,
  author =       "Mark Allen Weiss",
  title =        "Data structures and problem solving using {Java}",
  journal =      j-SIGACT,
  volume =       "29",
  number =       "2",
  pages =        "42--49",
  month =        jun,
  year =         "1998",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/288079.288084",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Riecke:1999:RP,
  author =       "Jon G. Riecke",
  title =        "Report on {POPL 1999}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "28--29",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.309742",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1999:EFT,
  author =       "Rocky Ross",
  title =        "Education forum: Taking the Pulse: Assessing Student
                 Perception of Learning",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "30--32",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.1041992",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreher:1999:CAG,
  author =       "Donald L. Kreher and Douglas R. Stinson",
  title =        "Combinatorial algorithms: generation, enumeration, and
                 search",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "33--35",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.309744",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cull:1999:TAF,
  author =       "Paul Cull",
  title =        "{Table-automata\slash} finite co-finite languages",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "1",
  pages =        "41",
  month =        mar,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/309739.309745",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1999:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "2--2",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568549",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1999:BRBa,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Algorithms and Theory of
                 Computation Handbook}}, edited by Mikhail Atallah}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "3--3",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568550",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Atallah:1999:ATC,Atallah:2009:ATC,Atallah:2010:ATC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1999:BRBb,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Handbook of Combinatorics}}
                 (in two volumes), edited by R. L. Graham, M.
                 Gr{\"o}tschel, L. Lov{\'a}sz}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "7--7",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568551",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Graham:1995:HC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krizanc:1999:BRB,
  author =       "Danny Krizanc",
  title =        "Book Review: {{\booktitle{Probabilistic Combinatorics
                 and Its Applications}}, edited by B{\'e}la
                 Bollob{\'a}s}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "12--14",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568552",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bollobas:1991:PCA,Bollobas:2001:RG}.",
  abstract =     "Probabilistic arguments have been applied in many
                 areas of combinatorics and theoretical computer science
                 ever since Erd{\H{o}}s first used one to prove bounds
                 on Ramsey numbers. Applications range from constructing
                 graphs with properties useful in building communication
                 networks to almost uniform generation of random
                 structures for the purpose of approximately solving
                 intractable counting problems. This book consists of a
                 series of introductory survey articles on topics in
                 probabilistic combinatorics and its applications. (The
                 articles are derived from lectures given in one of a
                 series of short courses sponsored by the American
                 Mathematical Society.) The topics covered include
                 random and random-like graphs, discrete isoperimetric
                 inequalities, rapidly mixing Markov chains, and finite
                 Fourier methods. The emphasis throughout the book is on
                 techniques, with sufficient examples to show their
                 usefulness.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lurie:1999:BRB,
  author =       "Jacob Lurie",
  title =        "Book Review: {{\booktitle{Spectral Graph Theory}}: by
                 Fan R. K. Chung}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "14--16",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568553",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Chung:1997:SGT}.",
  abstract =     "Specifying a graph is equivalent to specifying its
                 adjacency relation, which may be encoded in the form of
                 a matrix. This suggests that study of the adjacency
                 matrix from a linear-algebraic point of view might
                 yield valuable information about graphs. In particular,
                 any invariant associated to the matrix is also an
                 invariant associated to the graph, and might have
                 combinatorial meaning. Spectral graph theory is the
                 study of the relationship between a graph and the
                 eigenvalues of matrices (such as the adjacency matrix)
                 naturally associated to that graph. This book looks at
                 the subject from a geometric point of view, exploiting
                 an analogy between a graph and a Riemannian manifold:
                 Chung defines the Laplacian of a graph, a matrix
                 closely related to the adjacency matrix, in analogy
                 with the continuous case and studies the eigenvalues of
                 this Laplacian. There are several reasons that these
                 eigenvalues may be of interest. On the purely
                 mathematical level, the eigenvalues have the advantage
                 of being an extremely natural invariant which behaves
                 nicely under operations such as Cartesian product and
                 disjoint union. From a combinatorial point of view, the
                 eigenvalues of a graph are related to many other more
                 `discrete' invariants. From a geometric point of view,
                 there are many respects in which the eigenvalues of a
                 graph behave like the spectrum of a compact Riemannian
                 manifold. For the computationally-minded, the
                 eigenvalues of a graph are easy to compute, and their
                 relationship to other invariants can often yields good
                 approximations to less tractible computations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:1999:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "17--18",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568555",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers. SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects. Including models of
                 computation, formal languages. computational complexity
                 theory. analysis of algorithms and logics and semantics
                 of programs. ACM members can receive a subscription to
                 Computing Reviews for \$45 per year by writing to ACM
                 headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:1999:BCR,
  author =       "Lane A. Hemaspaandra",
  title =        "Biomolecular computing: recent theoretical and
                 experimental advances",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "22--30",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568557",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "And so summer comes around again. What a good time to
                 relax on the beach (with your theorem notebook), to go
                 on that long-planned family vacation (certainly with
                 your theorem notebook, and don't forget to bring the
                 family) and, above all, to catch up on all the papers
                 and progress that have been piling up during the
                 academic year on your `if only I had the time' list.
                 The current column may save you some time on this! In
                 1997, Mitsunori Ogihara and Animesh Ray, jointly with
                 Kimberly Smith, wrote a guest column on biomolecular
                 computing. Of course, this is an area of intense
                 activity, and in the current issue, they have
                 contributed a delightful column catching us all up on
                 some recent advances in biomolecular computing. (P.S.
                 Coming soon to a future issue will be a guest column by
                 Amnon Ta-Shma on classical versus quantum communication
                 complexity.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Riecke:1999:CGC,
  author =       "Jon G. Riecke",
  title =        "Computational geometry column 35",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "31--32",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568559",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The subquadratic algorithm of Kapoor for finding
                 shortest paths on a polyhedron is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Thielecke:1999:CFJ,
  author =       "Hayo Thielecke",
  title =        "Continuations, Functions and Jumps",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "33--42",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568561",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/logic.program.construction.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://www.cs.bham.ac.uk/~hxt/research/Logiccolumn8.ps",
  abstract =     "Practically all programming languages have some form
                 of control structure or jumping. The more advanced
                 forms of control structure tend to resemble function
                 calls, so much so that they are usually not even
                 described as jumps. Consider for example the library
                 function exit in C. Its use is much like a function, in
                 that it may be called with an argument; but the whole
                 point of exit is of course that its behaviour is
                 utterly non-functional, in that it jumps out of
                 arbitrarily many surrounding blocks and pending
                 function calls. Such a `non-returning function' or
                 `jump with arguments' is an example of a continuation
                 in the sense which we are interested in here. On the
                 other hand, a simple but fundamental idea in compiling
                 is that a function call is broken down into two jumps:
                 one from the caller to the callee for the call itself,
                 and another jump back from the callee to the caller
                 upon returning. (The return statement in C is in fact
                 listed among the `jump statements' [5].) This is most
                 obvious for void-accepting and -returning functions,
                 but it generalizes to other functions as well, if one
                 is willing to understand `jump' in the broader sense of
                 jump with arguments, i.e. continuation. In this view,
                 then, continuations are everywhere. Continuations have
                 been used in many different settings, in which they
                 appear in different guises, ranging from mathematical
                 functions to machine addresses. Rather than confine
                 ourselves to a definition of what a continuation is, we
                 will focus on continuation-passing style (CPS), as it
                 brings out the commonalities. The CPS transform
                 compresses a great deal of insight into three little
                 equations in \lambda -calculus. Making sense of it
                 intuitively, however, requires some background
                 knowledge and a certain fluency. The purpose of this
                 article, therefore, is to help the reader uncompress
                 the CPS transform by way of a rational reconstruction
                 from jumps. In the sequel, we will attempt to
                 illustrate the correspondence between continuations and
                 jumps (even in the guise of the abhorred goto). The
                 intent is partly historical, to retrace some of the
                 analysis of jumps that led to the discoveries of
                 continuations. At the same time, the language of choice
                 for many researchers during the (pre)history of
                 continuations, ALGOL 60, is not so different from
                 today's mainstream languages (i.e. C); we hope that
                 occasional snippets of C may be more easily accessible
                 to many readers than a functional language would be. So
                 in each of the four sections (Sections 2--5 below) that
                 make up the body of this paper, some C code will be
                 used to give a naive but concrete example of the issue
                 under consideration, before generalizing to a more
                 abstract setting.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1999:EFa,
  author =       "Ricky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "43--46",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568563",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This is not a column with a particular focus. It's
                 hard after all, to focus during finals week (or the
                 week or two immediately preceding it). These are, in
                 fact, the days when one wonders about the sanity of
                 having chosen a career in education and when one looks
                 forward to a summer's respite from direct involvement
                 in the process, not the days when one is overcome with
                 inspiration and desire to rush out and implement
                 innovations in the curriculum. No, this column is more
                 like campfire stew, a few things new mixed with a few
                 things old, lightly seasoned and warmed up over a fire
                 at twilight.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pasanen:1999:PDT,
  author =       "Tomi Pasanen",
  title =        "{Ph.D. Thesis}: In-place algorithms for sorting
                 problems",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "2",
  pages =        "61--61",
  month =        jun,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568547.568565",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An algorithm is said to operate in-place if it uses
                 only a constant amount of extra memory for storing
                 local variables besides the memory reserved for the
                 input elements. In other words, the size of the extra
                 memory does not grow as the number of input elements,
                 $n$, gets larger, but it is bounded by a constant. An
                 algorithm reorders the input elements stably if the
                 original relative order of equal elements is
                 retained.\par

                 In this thesis, we devise in-place algorithms for
                 sorting and related problems. We measure the efficiency
                 of the algorithms by calculating the number of element
                 comparisons and element moves performed in the worst
                 case in the following. The amount of index manipulation
                 operations is closely related to these quantities, so
                 it is omitted in our calculations. When no precise
                 figures are needed, we denote the sum of all operations
                 by a general expression `time'. The thesis consists of
                 five separate articles, the main contributions of which
                 are described below.\par

                 We construct algorithms for stable partitioning and
                 stable selection which are the first linear-time
                 algorithms being both stable and in-place concurrently.
                 Moreover, we define problems stable unpartitioning and
                 restoring selection and devise linear-time algorithms
                 for these problems. The algorithm for stable
                 un-partitioning is in-place while that for restoring
                 selection uses O($n$) extra bits. By using these
                 algorithms as subroutines we construct an adaption of
                 Quicksort that sorts a multiset stably in $
                 O(\Sigma^k_{i = 1} m_i \log (n / m_i))$ time where $
                 m_i$ is the multiplicity of $i$ th distinct element for
                 $ i = 1, \ldots {}, k$. This is the first in-place
                 algorithm that sorts a multiset stably in
                 asymptotically optimal time.\par

                 We present in-place algorithms for unstable and stable
                 merging. The algorithms are asymptotically more
                 efficient than earlier ones: the number of moves is $ 3
                 (n + m) + o(m)$ for the unstable algorithm, $ 5 n + 12
                 m + o(m)$ for the stable algorithm, and the number of
                 comparisons at most $ m(t + 1) + n / 2^t + o(m)$
                 comparisons where $ m \leq n$ and $ t = \lfloor \log (n
                 / m) \rfloor $. The previous best results were $ 1.125
                 (n + m) + o(n)$ comparisons and $ 5 (n + m) + o(n)$
                 moves for unstable merging, and $ 16.5 (n + m) + o(n)$
                 moves for stable merging.\par

                 Finally, we devise two in-place algorithms for sorting.
                 Both algorithms are adaptions of Mergesort. The first
                 performs $ n \log_2 n + O(n)$ comparisons and $
                 \epsilon n \log_2 n + O(n \log \log n)$ moves for any
                 fixed $ 0 < \epsilon \leq 2$. Our experiments show that
                 this algorithm performs well in practice The second
                 requires $ n \log_2 n + O(n)$ comparisons and fewer
                 than $ O(n \log n / \log \log n)$ moves. This is the
                 first in-place sorting algorithm that performs $ o(n
                 \log n)$ moves in the worst case while guaranteeing $
                 O(n \log n)$ comparisons.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  remark =       "This Ph.D. Thesis has been printed as TUCS
                 Dissertation number 15 (March 1999) of Turku Centre for
                 Computer Science, Turku Finland.",
}

@Article{Gasarch:1999:BRCc,
  author =       "William Gasarch and Samir Khuller",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "8",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.1042130",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dekhtyar:1999:BRBa,
  author =       "Michael Dekhtyar",
  title =        "Book review: {{\booktitle{Computational Geometry in
                 C}}, Second Edition, by Joseph O'Rourke (Cambridge
                 University Press 1988)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "8--13",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.1042131",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{ORourke:1994:CGCc}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fortnow:1999:BRB,
  author =       "Lance Fortnow",
  title =        "Book review: {{\booktitle{Bounded Queries in Recursion
                 Theory}}, by William A. Gasarch and Georgia A. Martin
                 (Birkh{\"a}user. Boston, Basel, Berlin, 1999)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "13--15",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.1042132",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gasarch:1999:BQR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dekhtyar:1999:BRBb,
  author =       "Alexander Dekhtyar",
  title =        "Book Review: {{\booktitle{Logic for Applications}},
                 Second Edition, by Anil Nerode and Richard A. Shore
                 (Springer Verlag 1997)}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "15--18",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.1042133",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Nerode:1993:LA,Nerode:1997:LA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stirling:1999:DBE,
  author =       "Colin Stirling",
  title =        "Decidability of bisimulation equivalence for normed
                 pushdown processes",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "19--21",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333624",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$45 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ta-Shma:1999:CVQ,
  author =       "Amnon Ta-Shma",
  title =        "Classical versus quantum communication complexity",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "25--34",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333628",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Classical communication complexity has been
                 intensively studied since its conception two decades
                 ago. Recently, its quantum analogue, the quantum
                 communication complexity model, was defined and
                 studied. In this paper we present some of the main
                 results in the area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:1999:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 36",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "35--38",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.335719",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Two results in `computational origami' are
                 illustrated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Demaine:1999:CGC,
  author =       "Erik D. Demaine and Joseph O'Rourke",
  title =        "Computational geometry column 37",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "39--42",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333625",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Open problems from the 15th Annual ACM Symposium on
                 Computational Geometry.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jiang:1999:SOP,
  author =       "Tao Jiang and Paul Kearney and Ming Li",
  title =        "Some open problems in computational molecular
                 biology",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "43--49",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333626",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Skiena:1999:WIA,
  author =       "Steven S. Skiena",
  title =        "Who is interested in algorithms and why?: lessons from
                 the {Stony Brook} algorithms repository",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "65--74",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333627",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present `market research' for the field of
                 combinatorial algorithms and algorithm engineering,
                 attempting to determine which algorithmic problems are
                 most in demand in applications. We analyze 1,503,135
                 WWW hits recorded on the Stony Brook Algorithms
                 Repository (http://www.cs.sunysb.edu/~algorith), to
                 determine the relative level of interest among 75
                 algorithmic problems and the extent to which publicly
                 available algorithm implementations satisfy this
                 demand.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Smith:1999:IR,
  author =       "Carl Smith",
  title =        "On the importance of refereeing",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "3",
  pages =        "75--76",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/333623.333629",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:1999:BRCd,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "3",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571184",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nehaniv:1999:BRB,
  author =       "Chrystopher L. Nehaniv",
  title =        "Book Review: {{\booktitle{Mathematical Support for
                 Molecular Biology}}, edited by Martin Farach-Colton,
                 Fred S. Roberts, Martin Vingron, and Michael
                 Waterman}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "4--7",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571183",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Farach-Colton:1999:MSM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ogihara:1999:BRB,
  author =       "Mitsunori Ogihara and Animesh Ray",
  title =        "Book Review: {{\booktitle{DNA Based Computers II}},
                 edited by Laura F. Landweber and Eric K. Baum}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "7--9",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571182",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Landweber:1999:DBC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Amos:1999:BRB,
  author =       "Martyn Amos",
  title =        "Book Review: {{\booktitle{DNA Based Computers III}},
                 edited by Harvey Rubin and David Harlan Wood}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "10--12",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571181",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Rubin:1999:DBC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Young:1999:BRB,
  author =       "Neal E. Young",
  title =        "Book Review: {{\booktitle{Online Computation and
                 Competitive Analysis}}, by Allan Borodin and Ran
                 El-Yaniv}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "13--17",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571180",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Borodin:2005:OCC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zalcstein:1999:NRT,
  author =       "Zeke Zalcstein",
  title =        "{NSF} report: theory of computing program",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "20--21",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337888",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Haglin:1999:TRC,
  author =       "David J. Haglin",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "22--24",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337889",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Beygelzimer:1999:OWF,
  author =       "Alina Beygelzimer and Lane A. Hemaspaandra and
                 Christopher M. Homan and J{\"o}rg Rothe",
  title =        "One-way functions in worst-case cryptography:
                 algebraic and security properties are on the house",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "25--40",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337891",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Libkin:1999:QLA,
  author =       "Leonid Libkin",
  title =        "Query languages with arithmetic and constraint
                 databases",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "41--50",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337894",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:1999:EFb,
  author =       "Rocky Ross",
  title =        "Education {Forum}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "51--52",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.571179",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rodger:1999:TAT,
  author =       "Susan H. Rodger",
  title =        "Teaching automata theory with {JFLAP}",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "53--56",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337896",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McGeoch:1999:HPP,
  author =       "Catherine C. McGeoch and Bernard M. E. Moret",
  title =        "How to present a paper on experimental work with
                 algorithms",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "85--90",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337899",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Venkatasubramanian:1999:TRW,
  author =       "Suresh Venkatasubramanian",
  title =        "A theory repository on the {Web}: a proposal",
  journal =      j-SIGACT,
  volume =       "30",
  number =       "4",
  pages =        "91--95",
  month =        dec,
  year =         "1999",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/337885.337901",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 09:45:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:2000:EL,
  author =       "Ian Parberry",
  title =        "{Editor}'s {Letter}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "1",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568462",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:BRCa,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "2--3",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herlihy:2000:BRB,
  author =       "Maurice Herlihy",
  title =        "Book Review: {{\booktitle{Distributed Computing}}, by
                 Attiya and Welch}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "3",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568464",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Attiya:1998:DCF,Attiya:2004:DCF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pruim:2000:BRB,
  author =       "Randall Pruim",
  title =        "Book Review: {{\booktitle{Hilbert's Tenth Problem}},
                 by Yttri Matiyasevich}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "4",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568465",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Matiyasevich:1993:HTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{League:2000:BRB,
  author =       "Christopher League",
  title =        "Book Review: {{\booktitle{Lambda Calculi: A Guide for
                 Computer Scientists}}, by Chris Hankin}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "8--13",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568490",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hankin:1994:LCG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Smith:2000:BRB,
  author =       "Carl Smith",
  title =        "Book Review: {{\booktitle{Systems that Learn}} (second
                 edition) by Jain, Osherson, Royer, Sharma}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "12--13",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568489",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Jain:1999:SLI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Haglin:2000:TRC,
  author =       "David J. Haglin",
  title =        "Technical {Report Column}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "14--15",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sudan:2000:LDA,
  author =       "Madhu Sudan",
  title =        "List decoding: algorithms and applications",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "16--27",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.346049",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2000:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 38",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "28--30",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.346050",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hofmann:2000:PLC,
  author =       "Martin Hofmann",
  title =        "Programming languages capturing complexity classes",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "31--42",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.346051",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2000:EFa,
  author =       "Rocky Ross",
  title =        "Education {Forum}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "43--48",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568486",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jarvinen:2000:TE,
  author =       "J. J{\"a}rvinen and T. Pasanen",
  title =        "Two exercises",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "75--76",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.346053",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:2000:HPP,
  author =       "Ian Parberry",
  title =        "How to Present a Paper in Theoretical Computer
                 Science: a Speaker's Guide for Students",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "77--86",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.346055",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  pdf-doc =      "00001414.pdf",
  pdf-url =      "http://hercule.csci.unt.edu/~ian/guides/postscript/speaker.pdf",
}

@Article{years:2000:BRC,
  author =       "Publication years",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "1",
  pages =        "101",
  month =        mar,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/346048.568463",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:BRCb,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "2",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042071",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krizanc:2000:BRB,
  author =       "Danny Krizanc",
  title =        "Book Review: {{\booktitle{Gems of Theoretical Computer
                 Science}}, by Uwe Sch{\"o}ning and Randall Pruim
                 (Springer-Verlag, 1998)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "2--5",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042072",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Schoning:1998:GTC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldengorin:2000:BRB,
  author =       "Boris Goldengorin",
  title =        "Book Review: {{\booktitle{Network Design: Connectivity
                 and Facilities Location. Proceedings from DIMACS
                 workshop in April 1997}} (AMS 1998)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "5--9",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042073",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pardalos:1998:NDC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:BRB,
  author =       "William Gasarch",
  title =        "Book review: {{\booktitle{Indiscrete Thoughts}}, by
                 Gina-Carlo Rota (Birkh{\"a}user, 1996)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "9--11",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042074",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Rota:1997:IT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2000:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "12--13",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042075",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$46 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hertrampf:2000:AAM,
  author =       "Ulrich Hertrampf",
  title =        "Algebraic acceptance mechanisms for polynomial time
                 machines",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "22--33",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.348215",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present several results, mainly taken from the
                 author's recent conference articles [Her97a, Her97b,
                 Her99], whose common theme is the application of (quite
                 basic) algebraic techniques to describe complexity
                 classes, which appear in the many ways nondeterministic
                 polynomial time machines can be used (or abused).One
                 possibility to motivate this is an exact
                 characterization of the (at first glance) rather weak
                 (2 out of 3)-P-set paradigm (see the Introduction for a
                 description), which we will prove to be as powerful as
                 PSPACE.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2000:EFb,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "34--38",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.348219",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Allender:2000:RAS,
  author =       "Eric Allender",
  title =        "Report on the annual summer meeting of the {New
                 Zealand} mathematics research institute",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "60--61",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.348223",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dunham:2000:PWC,
  author =       "Charles B. Dunham",
  title =        "Partially {Wrong Completions}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "2",
  pages =        "69",
  day =          "1",
  month =        jun,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/348210.1042070",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vitter:2000:ASA,
  author =       "Jeffery S. Vitter",
  title =        "{ACM SIGACT} 1999--2000 annual report",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "2--6",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.357669",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:BRCc,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "10",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.1008648",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldsmith:2000:BRB,
  author =       "Judy Goldsmith",
  title =        "Book Review: {{\booktitle{Theory of Computing: A
                 Gentle Introduction}}, by Kinber and Smith
                 (Prentice-Hall, 2001)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "19--22",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.1008649",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kinber:2001:TCG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2000:BRBa,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{Microsurveys in Discrete
                 Probability}}, edited by David Aldous and James Propp.
                 (AMS 1998)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "22--24",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.1008650",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Aldous:1998:MDP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Narendran:2000:BRB,
  author =       "Paliath Narendran",
  title =        "Book review: {{\booktitle{Term Rewriting and All
                 That}}, by Franz Baader and Tobias Nipkow (Cambridge
                 University Press, 313 pages)}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "24--26",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.1008651",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Baader:1998:TRA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2000:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "27--28",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.1008652",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$46 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2000:MPC,
  author =       "Lane A. Hemaspaandra and Christian Gla{\ss}er",
  title =        "A moment of perfect clarity {I}: the parallel census
                 technique",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "37--42",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.356459",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We discuss the history and uses of the parallel census
                 technique---an elegant tool in the study of certain
                 computational objects having polynomially bounded
                 census functions. A sequel [GH] will discuss advances
                 (including [CNS95] and Gla{\&}szlig;er [Gla00]), some
                 related to the parallel census technique and some due
                 to other approaches, in the complexity-class collapses
                 that follow if NP has sparse hard sets under reductions
                 weaker than (full) truth-table reductions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gottlob:2000:RP,
  author =       "Georg Gottlob",
  title =        "Report on {PODS} 2000",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "43--46",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.356460",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2000:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 39",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "47--49",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.356461",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The resolution of a decades-old open problem is
                 described: polygonal chains cannot lock in the plane.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2000:IEC,
  author =       "Rocky Ross",
  title =        "International efforts in computer science education",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "50--53",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.356462",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harfst:2000:PBA,
  author =       "Gregory C. Harfst and Edward M. Reingold",
  title =        "A potential-based amortized analysis of the union-find
                 data structure",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "3",
  pages =        "86--95",
  month =        sep,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/356458.356463",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a simple, new potential-based amortized
                 analysis for the standard union-find data structure.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:BRCd,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "3--4",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571194",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2000:RTB,
  author =       "William Gasarch",
  title =        "Reviews of {THREE} books on Fair Division of
                 Resources",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "4--10",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571193",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2000:BRBb,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{Computational Geometry:
                 Algorithms and Applications}} (2nd ed.) by Mark de
                 Berg, Marc van Kreveld, Mark Overmars, and Otfried
                 Schwarzkopf}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "10--12",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571192",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{deBerg:1997:CGA,deBerg:2000:CGA,deBerg:2008:CGA}.",
  abstract =     "Computational Geometry is a wide-ranging introductory
                 text which exposes readers to the main themes in modern
                 computational geometry. Each chapter introduces a
                 subfield of computational geometry, via natural
                 problems and basic algorithms; exercises and notes help
                 to flesh out the chapter material. This second edition
                 of the book is obviously the product of much effort by
                 the authors, and although some improvements are
                 possible, on the whole this book is worth considering
                 both as a text for a first computational geometry
                 course and as a refresher on basic concepts. Features
                 of interest include: Beginning each chapter with a
                 motivating real-world example, to naturally introduce
                 the algorithms. The solution of this example leads to
                 the key algorithmic idea of the chapter. Emphasis on
                 derivation of algorithms, as opposed to a
                 cookbook-style presentation. The authors often spend a
                 large amount of time to work through several suboptimal
                 solutions for a problem before presenting the final
                 one. While not suitable for the already-knowledgeable
                 practitioner, this gives the far-larger category of
                 students or other less-than-expert readers training in
                 the process of generating new algorithms. Good layout,
                 with wide margins containing intuition-generating
                 diagrams. The Notes and Comments section at the end of
                 each chapter also provides useful orientation to
                 further algorithms and context in each subfield. Wide
                 coverage of algorithms. As the authors say: ``In
                 general we have chosen the solution that is most easy
                 to understand and implement. This is not necessarily
                 the most efficient solution. We also took care that the
                 book contains a good mixture of techniques like
                 divide-and-conquer, plane sweep, and randomized
                 algorithms. We decided not to treat all sorts of
                 variations to the problems; we felt it is more
                 important to introduce all main topics in computational
                 geometry than to give more detailed information about a
                 smaller number of topics.''",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Istrate:2000:BRB,
  author =       "Gabriel Istrate",
  title =        "Book Review: {{\booktitle{Parameterized Complexity}},
                 by R. Downey and M. Fellows}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "13--15",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571191",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Downey:1999:PC}.",
  abstract =     "One of the most pervasive critiques of Computational
                 Complexity, coming from the applied Computer Science
                 community, is that it is an abstract, largely
                 irrelevant field, that fails to capture the various
                 intuitions concerning the complexity of ``real-world''
                 instances they have gathered through experiments. One
                 aspect of these intuitions is that while most problems
                 of practical interest tend to be intractable from a
                 standard complexity-theoretic point of view, in many
                 cases such problems have natural ``structural''
                 parameters, and practically relevant instances are
                 often associated with ``small'' values of these
                 parameters. Parameterized Complexity is an extension of
                 Complexity Theory that attempts to formalize and deal
                 with this intuition. It has already been applied to
                 fields such as Databases, Logic and Constraint
                 Programming, Computational Biology, Nonmonotonic
                 Reasoning, Natural Language Processing, Cognitive
                 Science, and Robotics. Some of its ideas have even been
                 discovered independently by practitioners working in
                 these areas. We do not attempt a further presentation
                 (the interested reader can consult two excellent
                 surveys [DF99, DFS99]), but want to illustrate this
                 point through a revealing example: it has long been
                 known that the register-allocation problem for
                 imperative programming language amounts to a coloring
                 problem on the associated control-flow graph, thus it
                 seems, at a first glance, hard even in an approximate
                 sense. On the other hand Thorup [Th98] has shown that
                 such graphs are characterized by a bounded value (at
                 most 10) of an intrinsic parameter called treewidth,
                 that guarantees the existence of an approximation
                 algorithm with substantially better performance than
                 the one available for general graphs. The present book
                 is an attempt to a first presentation of this emerging
                 area by two of its most active proponents.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2000:BRB,
  author =       "E. W. Cenek",
  title =        "Book Review: {{\booktitle{Modern Graph Theory}}, by
                 B{\'e}la Bollob{\'a}s}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "15--18",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571190",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bollobas:1998:MGT}.",
  abstract =     "Graph Theory is still a relatively young subject, and
                 debate still rages on what material constitutes the
                 core results that any introductory text should include.
                 Bollob{\'a}s has chosen to introduce graph theory ---
                 including recent results --- in a way that emphasizes
                 the connections between (for example) the Tutte
                 polynomial of a graph, the partition functions of
                 theoretical physics, and the new knot polynomials, all
                 of which are interconnected. On the other hand, graph
                 theory is also rooted strongly in computing science,
                 where it is applied to many different problems;
                 Bollob{\'a}s's treatment is completely theoretical and
                 does not address these applications. Or, in more
                 practical terms, he is concerned whether a solution
                 exists, rather than asking whether the solution can be
                 computed in a reasonably efficient manner. One of the
                 pleasures of working in graph theory is the abundance
                 of problems available to solve. Unlike many more
                 traditional areas of Mathematics, knowing the core
                 results and proofs is frequently insufficient. Often
                 solving a new problem requires a new approach, or a
                 subtle twist on an existing one, combined with some
                 bare knuckle work. Bollob{\'a}s emphasizes this in the
                 problems available at the end of each chapter; he
                 includes in total 639 problems, ranging from the
                 reasonably straightforward to the very difficult. I
                 spent time with friends working on these problems, and
                 was intrigued by the variety of the proofs that we came
                 up with.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreinovich:2000:BRB,
  author =       "Vladik Kreinovich",
  title =        "Book Review: {{\booktitle{$ A = B $}}, by Marko
                 Petkov{\v{s}}ek, Herbert S. Wilf, and Doron
                 Zeilberger}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "18--24",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571189",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Petkovsek:1996:AB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2000:BRB,
  author =       "Riccardo Pucella",
  title =        "Book Review: {{\booktitle{Communicating and Mobile
                 Systems: the $ \pi $-Calculus}}, by Robin Milner}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "24--26",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571188",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Milner:1999:CMS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2000:RCRc,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "27",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571187",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Richards:2000:NRT,
  author =       "Dana Richards",
  title =        "{NSF Report}: {Theory} of {Computing Program}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "37--38",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571186",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Glasser:2000:MPC,
  author =       "Christian Gla{\ss}er and Lane A. Hemaspaandra",
  title =        "A moment of perfect clarity {II}: consequences of
                 sparse sets hard for {NP} with respect to weak
                 reductions",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "39--51",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369838",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's column, Part II of the article started in
                 the preceding issue, is about progress on the question
                 of whether NP has sparse hard sets with respect to weak
                 reductions. Upcoming Complexity Theory Column articles
                 include A. Werschulz on information-based complexity;
                 J. Castro, R. Gavald{\`a}, and D. Guijarro on what
                 complexity theorists can learn from learning theory; S.
                 Ravi Kumar and D. Sivakumar on a to-be-announced topic;
                 M. Holzer and P. McKenzie on alternating stack
                 machines; and R. Paturi on the complexity of k -SAT.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2000:PDC,
  author =       "Sergio Rajsbaum",
  title =        "Principles of distributed computing: an exciting
                 challenge",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "52--61",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369843",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This is
                 the first Distributed Computing Column that I have
                 edited. It consists of four sections: A few thoughts on
                 the role of distributed computing theory, a reprint of
                 the PODC 2000 Influential-Paper Award to statement, a
                 review of the PODC 2000 Conference, and a summary of a
                 paper on robotics presented at the conference. The
                 column concludes with some news and acknowledgments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2000:CGCc,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 40",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "62--73",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369845",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It has recently been established by Below, De Loera,
                 and Richter-Gebert that finding a minimum size (or even
                 just a small) triangulation of a convex polyhedron is
                 NP-complete. Their 3SAT-reduction proof is discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2000:GBI,
  author =       "Rocky Ross",
  title =        "Going {Backwards}: {Introductory Programming
                 LAnguages}",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "65--73",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.571185",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:2000:RIM,
  author =       "Ian Parberry",
  title =        "Report on the 6th international meeting on {DNA}-based
                 computers",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "118--120",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369847",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kari:2000:HCA,
  author =       "Lila Kari",
  title =        "Half century of automata theory",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "121--124",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369849",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{years:2000:DM,
  author =       "Publication years",
  title =        "Death of a monster",
  journal =      j-SIGACT,
  volume =       "31",
  number =       "4",
  pages =        "130--133",
  month =        dec,
  year =         "2000",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/369836.369904",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2001:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "2--3",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568440",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2001:BRBa,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{Data Structures and
                 Algorithms in Java}} (2nd ed): Michael T Goodrich and
                 Roberto Tamassia}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "3--5",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568441",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Goodrich:1997:DSA,Goodrich:2001:DSA,Goodrich:2004:DSA,Goodrich:2006:DSA,Goodrich:2010:DSA}.",
  abstract =     "Data Structures is a first book on algorithms and data
                 structures, using an object-oriented approach. The
                 target audience for the book is a second-year CS class
                 introducing fundamental data structures and their
                 associated algorithms. This second edition of the book
                 has been corrected and revised, and is a substantial
                 improvement over the first edition. A companion web
                 site contains useful ancillary tools, including an
                 excellent set of slides. Despite several minor errors
                 and some questionable stylistic choices, I found this
                 version of the book to be well-written. The problem
                 sets are large, interesting, and thought-stimulating.
                 In several places connections are drawn between the
                 algorithm being discussed and important contemporary
                 real-world problems (e.g. search engines, DNA sequence
                 comparison, garbage collection), which students usually
                 appreciate.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McNicholl:2001:RBP,
  author =       "Timothy H. McNicholl",
  title =        "A review of {{\booktitle{Selected Papers on Analysis
                 of Algorithms}}: by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "5--8",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568442",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:2000:SPA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2001:BRBb,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{How to Solve It: Modern
                 Heuristics}}, by Zbigniew Michalewicz and David B.
                 Fogel}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "8--12",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568443",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Michalewicz:2002:HSI}.",
  abstract =     "How to Solve It is a friendly gem of a book which
                 introduces the basic principles of traditional
                 optimization, evolutionary optimization, neural nets,
                 and fuzzy methods. In the spirit of Polya's classic of
                 the same name, the authors emphasize the ``how and
                 why'' of the problem-solving process, constantly
                 prodding the reader to stop and solve subproblems, or
                 come up with new heuristics, or indeed question whether
                 or not the problem has been posed correctly in the
                 first place. This book is clear, concise, and fun to
                 read. It is not a handbook of heuristics, but rather an
                 accessible high-level overview of the pros, cons, and
                 applicability of the major categories of heuristic
                 methods, with particular emphasis on optimization
                 methods utilizing evolutionary computation. The
                 presentation is lucid, and the authors do a good job of
                 picking out key properties of algorithms and problem
                 domains. The only prerequisites are basic mathematics
                 and some problem-solving talent.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2001:BRBa,
  author =       "Riccardo Pucella",
  title =        "Book Review: {{\booktitle{Proof, Language, and
                 Interaction: Essays in Honour of Robin Milner}}, edited
                 by Plotkin, Stirling and Tofte}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "12--16",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568444",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Plotkin:2000:PLI}.",
  abstract =     "The field of theoretical computer science has had a
                 long tradition of providing wonderful edited books to
                 honor various prominent members of the community. The
                 idea behind such edited works is clear: celebrate the
                 work of a particular researcher by having co-authors
                 and colleagues write papers on subjects related to the
                 researcher's body of work. When successful, such a
                 project provides for a wonderful excursion through the
                 work of a researcher, often highlighting an underlying
                 coherence to that work. On that account, the book
                 Proof, Language, and Interaction: Essays in the Honor
                 of Robin Milner (edited by Plotkin, Stirling and Tofte)
                 is a success. In no small part this is due to Milner's
                 span of work from theory to practice. It is hard to
                 both briefly describe Milner's contributions and give
                 an idea of the breadth of his effort. Two major tracks
                 of research emerge. First, after some work with John
                 McCarthy's AI group at Stanford, he developed LCF
                 (specifically, Edinburgh LCF), a system for
                 computer-assisted theorem proving based on Dana Scott's
                 idea on continuous partial functions for denotational
                 semantics. Not only working on the implementation,
                 Milner also worried about the semantic foundations [1].
                 LCF came with a programming language, Edinburgh ML,
                 which evolved with Milner's help into standard ML, a
                 higher-order language that introduced many features now
                 standard in advanced programming language, features
                 such as polymorphism and type inference [4]. His second
                 track of research involves concurrency. He invented
                 CCS, the calculus of communicating systems [2]. Work on
                 the semantics of CCS went from the traditional
                 domain-theoretic approach to a new operational view of
                 processes equality based on the notion of bisimulation.
                 Subsequent work by Milner led to the development of
                 other calculi, most notably the $ \pi $-calculus, which
                 included a powerful notion of mobility [3]. His later
                 work in the area attempted to provide a unifying
                 framework for comparing calculi, and unifying
                 sequential and concurrent computation. This range of
                 interests is reflected in the table of contents of the
                 book. The book splits across different subjects:
                 semantic foundations, where we discover work aimed at
                 understanding computation, both sequential and
                 concurrent, programming logic, where we discover work
                 derived from Milner's work on LCF, and aimed at
                 understanding the role of formal mathematics,
                 programming languages, where we discover Standard ML,
                 and other languages based on Milner's idea about
                 concurrent calculi, concurrency, where we discover work
                 on Milner's early CCS approach and extensions, and
                 mobility, where we discover work related to the $ \pi
                 $-calculus.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2001:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "17--18",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568446",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2001:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 31",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "21--31",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568448",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's guest column, by Art Werschulz, is on
                 information-based computation. Given that this arrived
                 during the first half of December 2000, Art clearly
                 deserves a heroic focus award for making the time to
                 write such a wonderful column while every news cycle
                 was filled with the ups and downs of a presidential
                 post-election adventure the likes of which is not
                 likely to be seen again in any of our lifetimes.
                 Upcoming complexity theory columns include articles by:
                 J. Castro, R. Gavald{\`a}, and D. Guijarro; S. Ravi
                 Kumar and D. Sivakumar; R. Paturi; and M. Holzer and P.
                 McKenzie.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2001:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 2",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "32--32",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568450",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of two guest contributions: A review of
                 the DISC 2000 Conference by Lisa Higham, and a routing
                 survey by Cyril Gavoille. This survey focuses on
                 routing messages in distributed networks with efficient
                 data structures. After an overview of the various
                 results of the literature, some interestingly open
                 problems are described. Many thanks to Lisa and
                 Cyril!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Higham:2001:RD,
  author =       "Lisa Higham",
  title =        "Report on {DISC'00}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "32--36",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568449",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gavoille:2001:RDN,
  author =       "Cyril Gavoille",
  title =        "Routing in Distributed Networks: Overview and Open
                 Problems",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "36--52",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568451",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/equipe.graphs.LaBRI.UBordeaux.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "compact routing",
}

@Article{ORourke:2001:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 41",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "53--55",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568452",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The recent results that n congruent balls in
                 {\&}8477;$^d$ have at most 4 distinct geometric
                 permutations is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2001:EFa,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "56--59",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568454",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hopcroft:2001:IATa,
  author =       "John E. Hopcroft and Rajeev Motwani and Jeffrey D.
                 Ullman",
  title =        "{{\booktitle{Introduction to Automata Theory,
                 Languages, and Computation}}, 2nd edition}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "60--65",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568455",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hopcroft:2001:IATb,Hopcroft:2007:IAT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harel:2001:DL,
  author =       "David Harel and Dexter Kozen and Jerzy Tiuryn",
  title =        "Dynamic logic",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "66--69",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568456",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mitzenmacher:2001:CSC,
  author =       "Michael Mitzenmacher",
  title =        "Challenging students with creative assignments",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "70--73",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568457",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mitzenmacher:2001:EAR,
  author =       "Michael Mitzenmacher",
  title =        "An experimental assignment on random processes",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "74--78",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568458",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Although I still generally use standard problem sets
                 in my theory classes, I find myself experimenting more
                 and more with alternatives, including more open-ended
                 assignments. One big motivation for this change is to
                 put some science back in my computer science class, by
                 making assignments more like laboratory exercises in
                 chemistry and biology: students have to experiment to
                 find an answer. One of the great things about studying
                 randomness is that the results sometimes lend
                 themselves quite naturally to experimental assignments,
                 as is the case for the assignment I describe here.
                 Before going on, I will present the assignment.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiden:2001:CCP,
  author =       "Steve Seiden",
  title =        "Can a computer proof be elegant?",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "111--114",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568460",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In computer science, proofs about computer algorithms
                 are par for the course. Proofs by computer algorithms,
                 on the other hand, are not so readily accepted. We
                 present one viewpoint on computer assisted proofs, or
                 what we call proofs via the computational method [13].
                 While one might expect pure mathematicians to be a bit
                 leery of the computational method, one would hope that
                 computer scientists would be more receptive. In the
                 author's experience, this has not been the case. The
                 comment one often hears is ``Can't you find a better
                 proof''? One of the arguments given against the
                 computational method is that a computer assisted proof
                 cannot possibly be elegant. We question this argument
                 here. It is important to define precisely what the
                 computational method is. In the computational method we
                 seek to prove results using a computer program. More
                 specifically, given a theorem we want to prove, we
                 exhibit a computable Boolean function f and prove that
                 the truth of f implies the theorem. Next, we give an
                 algorithm for computing f. Finally, we execute this
                 algorithm on a computer. If all goes well, the theorem
                 is proven. The first (as far as we know) and most
                 famous use of the computational method was in the proof
                 of the four-color theorem by Appel and Haken [2]. This
                 should be contrasted with the use of a computer to find
                 a proof that is easily checked by hand. For instance, a
                 counter-example found via a computer search, as in [9,
                 10], is not an example of the computational method. As
                 the proof of the four-color theorem was the first use
                 of the computational method, it generated a large
                 amount of controversy. Foremost among the decryers of
                 the Appel and Haken proof was Halmos [7, page 578], who
                 states:By an explosion I mean a load noise, an
                 unexpected and exciting announcement, but not
                 necessarily a good thing. Some explosions open new
                 territories and promise great future developments;
                 others close a subject and seem to lead nowhere.
                 \ldots{} the four-color theorem [is] of the second
                 [kind].Halmos goes further, attacking the computational
                 method in general, stating ``Down with oracles, I
                 say---they are of no use in mathematics''. While we
                 cannot speak to the four-color theorem proof---the
                 author has not seen it---we disagree with Halmos'
                 assertion that computer proofs have no use in
                 mathematics. In [13], we tried to give some motivation
                 for using the computational method and address some of
                 the complaints against it. We tried to argue that, in
                 certain cases, a computer proof may be preferable to a
                 traditional one. However, we feel that one point
                 overlooked in [13], namely the question of elegance of
                 computer proofs, should be addressed. Other authors
                 have also addressed the question of computer aided
                 proofs. For some alternative viewpoints, see [3, 4, 5,
                 7, 11, 12, 14].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreinovich:2001:INB,
  author =       "Vladik Kreinovich",
  title =        "{Itanium}'s New Basic Operation of Fused Multiply-Add:
                 Theoretical Explanation and Theoretical Challenge",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "1",
  pages =        "115--117",
  month =        mar,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568438.568461",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 http://www.math.utah.edu/pub/tex/bib/intel-ia-64.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://www.cs.utep.edu/vladik/2000/tr00-42.pdf;
                 http://www.cs.utep.edu/vladik/2000/tr00-42.ps.gz",
  abstract =     "A new Intel's 64-bit chip Itanium has a new
                 instruction set which includes a fused multiply-add
                 instruction x 1 + x 2 $ \cdot $ x 3 (see, e.g., [7]).
                 In this short article, we explain the empirical reasons
                 behind the choice of this instruction, give possible
                 theoretical explanation for this choice, and mention a
                 related theoretical challenge.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  issue =        "118",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2001:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "3--4",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005761",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2001:BRBa,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{The Codebreakers: the Story
                 of Secret Writing}}, by David Kahn. Scribner}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "5--6",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005762",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Kahn:1967:CSSa,Kahn:1967:CSSb,Kahn:1974:C,Kahn:1996:CSS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Reeds:2001:BRB,
  author =       "Jim Reeds",
  title =        "Book Review: {{\booktitle{The Code Book: the Evolution
                 of Secrecy from Mary Queen Of Scots to Quantum
                 Cryptography}}, by Simon Singh. Anchor Books}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "6--11",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005763",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Singh:1999:CBE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ogihara:2001:BRB,
  author =       "Mitsunori Ogihara",
  title =        "Book Review: {{\booktitle{DNA Based Computers V}}, by
                 Eric Winfree and David K. Gifford. American Mathematics
                 Society}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "11--13",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005764",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Winfree:2000:DBC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McNicholl:2001:BRB,
  author =       "Timothy H. McNicholl",
  title =        "Book Review: {{\booktitle{Complexity and Real
                 Computation}}, by Blum, Cucker, Shub, and Smale.
                 Springer-Verlag}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "14--15",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005765",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Blum:1998:CRC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Avigad:2001:BRB,
  author =       "Jeremy Avigad",
  title =        "Book Review: {{\booktitle{Basic Proof Theory}}: second
                 edition, by A. S. Troelstra and H. Schwichtenberg.
                 Cambridge University Press}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "15--19",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005766",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Troelstra:1996:BPT,Troelstra:2000:BPT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2001:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "20--21",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005767",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$47 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2001:AC,
  author =       "Samir Khuller",
  title =        "Algorithms column",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "28--31",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.504193",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2001:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} complexity theory column 32",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "32--43",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.504194",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We describe some recent or not-so-recent results in
                 the model of learning known as exact learning from
                 queries. Some results are chosen because they led to a
                 result in complexity theory, and others are chosen
                 because they seem to indicate an interesting line of
                 research at the common ground of learning and
                 complexity. More precisely, we survey: (1) an
                 improvement of the Karp--Lipton collapse that stemmed
                 from a learning algorithm for Boolean circuits, (2)
                 recent advances in distinguishing information-theoretic
                 from complexity-theoretic difficulty of learning, and
                 (3) recent results on learning small-depth circuits
                 with modular gates that call for a systematic study of
                 the expressive power of so-called Multiplicity
                 Automata.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2001:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT News} distributed computing column 3",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "44--45",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005769",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. After
                 some announcements, this issue includes a contribution
                 by Idit Keidar and myself.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2001:CFT,
  author =       "Idit Keidar and Sergio Rajsbaum",
  title =        "On the cost of fault-tolerant consensus when there are
                 no faults: preliminary version",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "45--63",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.504195",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We consider the consensus problem in an asynchronous
                 model enriched with unreliable failure detectors and in
                 the partial synchrony model. We consider algorithms
                 that solve consensus and tolerate crash failures and/or
                 message omissions. We prove tight lower bounds on the
                 number of communication steps performed by such
                 algorithms in failure-free executions. We present in a
                 unified framework a number of related lower bound
                 results. Thus, we shed light on the relationships among
                 different known lower and upper bounds, and at the same
                 time, illustrate a general technique for obtaining
                 simple and elegant lower bound proofs. We also
                 illustrate matching upper bounds: we algorithms that
                 achieve the lower bound.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2001:MTL,
  author =       "Rocky Ross",
  title =        "Molasses and theories of learning",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "2",
  pages =        "64--71",
  month =        jun,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/504192.1005771",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2001:CT,
  author =       "Lane A. Hemaspaandra",
  title =        "Complexity theory",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "3",
  pages =        "40--52",
  day =          "1",
  month =        sep,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/500559.500560",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present high-level technical summaries of five
                 recent results on the computational complexity of the
                 shortest lattice vector problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2001:DC,
  author =       "Sergio Rajsbaum",
  title =        "Distributed {Computing}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "3",
  pages =        "53--62",
  day =          "1",
  month =        sep,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/500559.500561",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mitchell:2001:CG,
  author =       "Joseph S. B. Mitchell and Joseph O'Rourke",
  title =        "Computational geometry",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "3",
  pages =        "63--72",
  day =          "1",
  month =        sep,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/500559.500562",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A compendium of thirty previously published open
                 problems in computational geometry is presented",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2001:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "2--5",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568427",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2001:BRBb,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Proofs and Refutations}}, by
                 Imre Lakatos}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "6--8",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568428",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lakatos:1976:PRL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2001:BRBb,
  author =       "Riccardo Pucella",
  title =        "Book Review: {{\booktitle{Dynamic Logic (Foundations
                 of Computing)}}, by D. Harel, D. Kozen and J. Tiuryn}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "9--17",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568429",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Harel:2000:DL}.",
  abstract =     "In the 1960s, as programming languages were being used
                 to write larger programs, those programs became harder
                 to understand, and people began to worry about issues
                 such as correctness, that is, determining whether a
                 program computed what it was supposed to compute. As a
                 consequence, researchers started to look into the
                 pragmatics of programming, leading among others to a
                 criticism of the GOTO statement [2] and the development
                 of structured programming by Knuth and Wirth. These
                 greatly helped writing programs that were easier to
                 understand, but the issue of showing program correct
                 remained. Undoubtedly helped by the fact that programs
                 had a cleaner structure, researchers began
                 investigating formal approaches to proving programs
                 correct, or, in general, proving that programs
                 satisfied properties of interest. Most approaches
                 involved deriving the proof of a property as one was
                 writing the program, taking advantage of the structured
                 way these programs were written [3, 8]. These
                 approaches were formalized, leading to the total or
                 partial correctness assertions of Hoare [10] or the
                 weakest-precondition calculus of Dijkstra [3].
                 Essentially, the logic of Hoare dealt with assertions {
                 A } P { B } around a program P, indicating that if A
                 were true, executing program P would result in B being
                 true. Inference rules indicated how to transform
                 assertions about programs into assertions about larger
                 programs. For instance, if { A } P {1 B } and { B } P
                 {2 C } were true, then one could infer that { A } P 1;
                 P {2 B } was true, with the intuitive reading of P 1; P
                 2 as the sequential composition of P 1 and P 2. Many
                 more formal systems along such lines were devised, and
                 they collectively acquired the name logics of programs,
                 or program logics. In a 1976 landmark paper, Pratt
                 recognized that many such program logics could best be
                 understood as modal logics, by essentially associating
                 with every program a modal operator [13]. His idea was
                 developed and refined by Fischer and Ladner [6] and
                 others, culminating into a particular form of program
                 logic called Dynamic Logic. Basically, the recognition
                 of the relationship between program logic and modal
                 logic allowed researchers to make use of the vast array
                 of results on modal logics. The book ``Dynamic Logic'',
                 by Harel, Kozen, and Tiuryn, offers a self-contained
                 introduction to the subject. The earlier treatments on
                 the subject are either dated, such as the survey by
                 Harel [9] giving the state of the field in 1984, or
                 study Dynamic Logic as a non-trivial extension of modal
                 logic [7]. The latter approach is much more abstract
                 and technically involved. In this review, I hope to
                 give a taste for the subject by looking at its simplest
                 incarnation, the propositional variant of Dynamic
                 Logic, called PDL. (The book describes both the
                 propositional and the first-order variants.) Following
                 which, I will return to the structure of the book, and
                 some personal opinions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jennings:2001:BRB,
  author =       "Christopher G. Jennings",
  title =        "Book Review: {{\booktitle{Analysis of Algorithms: An
                 Active Learning Approach}}, by Jeffrey J. McConnell}",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "17--18",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568430",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{McConnell:2001:AAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2001:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 34",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "24--33",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568432",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's guest columnists are angels. The column
                 was faced with a last-minute cancellation, and they
                 prepared on very short notice a wonderful column. And
                 I'm sure that many readers of the column will want to
                 learn even more by, for example, reading their
                 monograph Complexity Classifications of Boolean
                 Constraint Satisfaction Problems [7].Future complexity
                 columns include Holzer/McKenzie on a familiar
                 complexity class turning up in a surprising context,
                 Gasarch (and a host of contributors) on the future of
                 NP, Schaeffer/Umans on completeness for higher levels
                 of the polynomial hierarchy, Nickelsen/Tantau on
                 partial information classes, and Paturi on the
                 complexity of k -SAT,Regarding the Schaeffer/Umans
                 column, their 2-part column will be in part a kind of
                 Garey and Johnson for completeness results for $ \Sigma
                 i^p $ and $ \pi i^p, i \geq 2 $. You can help their
                 project by, if you have proven natural sets complete
                 for NP$^{NP}$, coNP$^{NP}$, NP$^{NP NP}$, coNP$^{NP
                 NP}$, etc., letting them ({\tt
                 MSchaefer@cti.depaul.edu} and {\tt
                 umans@microsoft.com}) know of your result and its best
                 citation location. Thanks!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2001:ASNc,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 5",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "34--58",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568433",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification internet, and the web. This issue
                 consists of four parts:o a survey of SIROCCO'01 by
                 Pierre Fraigniaud,o a survey of POMC'01 by Rui Fan,o a
                 survey of PODC'01 by myself,o the paper ``Paxos Made
                 Simple'' by Leslie Lamport. This year was the 20-th
                 anniversary of PODC, and included a special celebration
                 honoring the work of Leslie Lamport, on the occasion of
                 his 60th birthday, and was collocated with the Workshop
                 on Principles of Mobile Computing (POMC). I briefly
                 describe the PODC conference, and reproduce the toast
                 by Fred Schneider in the honor of Leslie. The Business
                 Meeting report is by Gil Neiger. Finally, there is
                 Leslie's paper on his own algorithm which was discussed
                 in a few of the PODC lectures. I am very grateful to
                 the many people contributing to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2001:EFb,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "59--65",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568435",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2001:CTC,
  author =       "Lane A. Hemaspaandra and Mitsunori Ogihara",
  title =        "The complexity theory companion",
  journal =      j-SIGACT,
  volume =       "32",
  number =       "4",
  pages =        "66--68",
  month =        dec,
  year =         "2001",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/568425.568436",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "3--20",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507459",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2002:RCRa,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "21--22",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507461",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sloan:2002:NRTa,
  author =       "Robert Sloan",
  title =        "{NSF} report: theory of computing program",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "28--28",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507463",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2002:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 35",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "32--45",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507465",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I was surprised and delighted at a recent conference
                 when the complexity class \Theta 2$^p$ suddenly popped
                 up in a talk (by Markus Holzer on work by him and
                 Pierre McKenzie) where it is was not exactly something
                 one would have before-hand expected to come into play.
                 After hearing the rest of Markus's remarkable talk
                 (which he illustrated using toys from his daughter), I
                 was much hoping that the authors would be so kind as to
                 write a guest column; they very generously agreed to,
                 and that column appears below. So, what is \Theta 2$^p$
                 ? \Theta 2$^p$ is the class of languages acceptable via
                 parallel access to NP, and has many equivalent
                 alternate definitions and characterizations (see
                 [KSW87, Hem89, Wag90]), such as the one used in the
                 paper below. This class was first studied by
                 Papadimitriou and Zachos in 1983 [PZ83] (though in a
                 form that at that time was not known to be equivalent
                 to the definition just mentioned), and has played an
                 important role in complexity theory, e.g., Kadin
                 [Kad89] proved that the polynomial-time hierarchy
                 collapses to \Theta 2$^p$ if NP has sparse
                 Turing-complete sets. Recently, the class has turned
                 out to play other surprising roles, such as in
                 analyzing the complexity of electoral systems (see the
                 survey [HH00]) and in understanding the performance of
                 greedy algorithms [HR98, HRS01]. In fact, a survey
                 column a few years ago was devoted to overviewing such
                 raised-to- \Theta 2$^p$ lower bounds [HHR97]. Bill
                 Gasarch and SIGACT News need YOU! That is, the next
                 issue will contain a guest column edited by Bill
                 Gasarch, which will collection opinions on the future
                 of the P-versus-NP question. Bill very much wants a
                 broad range of opinions, and will be setting up a web
                 page (http://www.cs.umd.edu/~gasarch/pnp/) describing
                 how you can get your opinions to him. He may even put
                 up a series of polling questions there, so please go
                 there, vote early, and vote often!And in the issues
                 following that will be articles by M. Schaeffer and C.
                 Umans on complete sets at and beyond the polynomial
                 hierarchy's second level, by A. Nickelsen and T. Tantau
                 on partial information classes, and by R. Paturi on the
                 complexity of k -SAT.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2002:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news {Distributed Computing Column} 6",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "46--53",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507466",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of two parts: a survey of DISC'01 by
                 Panagiota Fatourou, and a survey of Self-Stabilization
                 at WSS'01 and DISC'01 by Ted Herman. Many thanks to
                 Gioula and Ted for contributing to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herman:2002:SSW,
  author =       "Ted Herman",
  title =        "Self-stabilization at {WSS'01} and {DISC'01}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "54--57",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507467",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2002:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 43",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "58--60",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507468",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The concept of pointed pseudo-triangulations is
                 defined and a few of its applications described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2002:APT,
  author =       "Rocky Ross",
  title =        "Accountability and the public trust",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "61--66",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507470",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hamburger:2002:LLM,
  author =       "Henry Hamburger and Dana Richards",
  title =        "Logic and language models for computer science",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "67--70",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507471",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:2002:CCL,
  author =       "Jeffrey Shallit",
  title =        "The computational complexity of the local postage
                 stamp problem",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "1",
  pages =        "90--94",
  month =        mar,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/507457.507473",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The well-studied local postage stamp problem (LPSP) is
                 the following: given a positive integer $k$, a set of
                 positive integers $ 1 = a_1 < a_2 < \ldots {} < a_k$
                 and an integer $ h \geq 1$, what is the smallest
                 positive integer which cannot be represented as a
                 linear combination $ \sum_{1 \leq i \leq k} x_i a_i$
                 where $ \sum_{1 \leq i \leq k} x_i \leq h$ and each $
                 x_i$ is a non-negative integer? In this note we prove
                 that LPSP is NP-hard under Turing reductions, but can
                 be solved in polynomial time if $k$ is fixed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "2--9",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564587",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mikolajczak:2002:BRB,
  author =       "Boleslaw Mikolajczak",
  title =        "Book Review: {{\booktitle{Petri Net Algebra}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "10--14",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564588",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Best:2001:PNA}.",
  abstract =     "Many contemporary computing systems are concurrent and
                 distributed. Many approaches to concurrency
                 formalization have been introduced over last forty
                 years. This monograph combines two theories of
                 concurrency: process algebras and Petri nets. One can
                 hope that combining several competing theories that are
                 mutually complementary can produce a formalism that
                 will be practically useful. This is the primary
                 motivation of the book. The book investigates
                 structural and behavioral aspects of these two models.
                 It also shows strong equivalence between these two
                 models. Process algebras have the following advantages:
                 allow study of connectives directly related to actual
                 programming languages, are compositional, come with a
                 variety of concomitant and derived logics that support
                 reasoning about important properties of systems, and
                 come with variety of algebraic laws that help in
                 systems' refinement and in proving correctness. Petri
                 nets clearly distinguish local states and local
                 activities of a system (places and transitions,
                 respectively), global states and activities can be
                 derived from basic concepts, Petri nets are graphical,
                 and as bipartite graphs have strong links to graph
                 theory and linear algebra. These last two facts can be
                 used for the verification of systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ivanov:2002:BRB,
  author =       "Ivelin Ivanov",
  title =        "Book Review: {{\booktitle{Combinatorial Optimization
                 --- Theory and Algorithms}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "14--16",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564589",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Korte:2000:COT,Korte:2002:COT,Korte:2006:COT,Korte:2008:COT,Korte:2012:COH}.",
  abstract =     "Rarely do mathematical disciplines have so direct
                 practical relevance as combinatorial optimizations,
                 which is why it is one of the most active areas of
                 discrete mathematics. It became a subject in its own
                 right only about 50 years ago, which makes it one of
                 the youngest also. This book covers most of the
                 important results and algorithms achieved in the field
                 to date. Most of the problems are formulated in terms
                 of graphs and linear programs. The book starts with
                 reviewing basic graph theory and linear and integer
                 programming. Next, the classical topics in the field
                 are studied: minimum spanning trees, shortest paths,
                 network flows, matching and matroids. Most of the
                 problems in Chapters 6--14 have polynomial time
                 (efficient) algorithms, while most of the problems
                 studied in Chapters 15--21 are NP-hard, i.e. polynomial
                 time algorithm is unlikely to exist. Although in many
                 cases approximation algorithms are offered which at
                 least have guaranteed performance. Some of the topics
                 include areas which have developed very recently, and
                 which have not appeared in a book before. Examples are
                 algorithms for multicommodity flows, network design
                 problems and the traveling salesman problem. The book
                 also contains some new results and new proofs for
                 previously known results. The authors have an unique
                 approach in the presentation of the topics. They
                 provided detailed proofs for almost all results,
                 including deep classical theorems (e.g. weighted
                 matching algorithm and Karmarkar-Karp bin-packing
                 algorithm) whose proofs are usually sketched in
                 previous works.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mavronicolas:2002:BRB,
  author =       "Marios Mavronicolas",
  title =        "Book Review: {{\booktitle{Introduction to Distributed
                 Algorithms}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "16--18",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564590",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Tel:2000:IDA}.",
  abstract =     "This book presents a view of several important topics
                 in the modern field of distributed algorithms. The book
                 is intended to provide useful background and reference
                 information for professional engineers dealing with
                 distributed systems, and for entering researchers who
                 wish to develop a sufficient background in distributed
                 algorithms. In addition, the book is suitable for
                 providing a textbook-style introduction to distributed
                 algorithms for advanced undergraduates or early
                 graduate students who are taking a relevant course or
                 consider pursuing research in the field. The reference
                 sources for this book include mainly research papers on
                 the modern theory of Distributed Computing that
                 routinely appear in conferences such as the ACM
                 Symposium on Principles of Distributed Computing
                 (PODC), or the International Symposium on DIStributed
                 Computing (DISC). Fundamental milestones of this theory
                 include also research papers from other major
                 conferences of Theoretical Computer Science that are of
                 wider interest, such as the ACM Symposium on Theory of
                 Computing (STOC), or from leading theory journals, such
                 as the Journal of the ACM or SIAM Journal on
                 Computing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BRB,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Calculated Bets}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "19--20",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564591",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Skiena:2001:CBC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2002:RCRb,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "21--23",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As a service to our readers, SIGACT News has an
                 agreement with Computing Reviews to reprint reviews of
                 books and articles of interest to the theoretical
                 computer science community. Computing Reviews is a
                 monthly journal that publishes critical reviews on a
                 broad range of computing subjects, including models of
                 computation, formal languages, computational complexity
                 theory, analysis of algorithms, and logics and
                 semantics of programs. ACM members can receive a
                 subscription to Computing Reviews for \$48 per year by
                 writing to ACM headquarters.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sloan:2002:NRTb,
  author =       "Robert Sloan",
  title =        "{NSF} report: theory of computing program",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "27--28",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564595",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Haglin:2002:TRC,
  author =       "David J. Haglin",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "29--30",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564596",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2002:ACV,
  author =       "Samir Khuller",
  title =        "Algorithms column: the vertex cover problem",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "31--33",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564598",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2002:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 36",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "34--47",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564599",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This current issue's guest column is by Bill Gasarch,
                 and reports on a poll he has conducted on the most
                 famous open question in complexity theory: P=?NP. If
                 Mitsunori Ogihara's prediction that P-vs-NP will not be
                 resolved until the year 3000 is correct, my guess is
                 more than a few students of the history of computer
                 theory will be visiting, long after all the
                 contributors are gone, Bill's column, which will
                 provide a time capsule into the thoughts of many in the
                 field. Who knows? Perhaps there will even be Ph.D.
                 theses devoted to figuring out who these people all
                 are, and just who the (as the students will know from
                 their history of science books)
                 then-Turing/Fields/Nobel-laureate Bill Gasarch was
                 making an exception of when he wrote below, ``Almost
                 all respondents are people whose opinions can be taken
                 seriously,'' and great debates may rage over whether he
                 actually meant, by ``almost all,'' ``all but a (large)
                 constant number.'' In light of the fascinating
                 opinions, though, I suspect that but little evidence
                 will be found for that view---even by Ken Regan's
                 Vegans. Surely some M.S. thesis will be written
                 claiming that it was this column---and in particular
                 the superfluous disjunct in Donald Knuth's claim that x
                 \leq 2048 V x \leq 4096---that led, in the year
                 2$^{10}$ + 2$^{11}$, to Donald Knuth's Turing Award
                 being posthumously rescinded and given to Bill Gasarch.
                 However, the Knuth Cult will discover that Donald
                 Knuth's words here are a numerical key that unlocks the
                 secret of the Art of Computer Programming, which, it
                 turns out, when decoded has nothing to do with
                 computers but rather is a skillful telling of the life
                 story of a Danish saint. Warmest thanks to Bill and the
                 dozens of contributors for their time, analyses, and
                 prognostications. Plugs for past and future issues: In
                 1996 and 1997, SIGACT News Complexity Theory Columns 14
                 and 15 collected various expert's opinions on the
                 future of computational complexity. If you have not
                 read those opinions already, they are worth a look. And
                 coming in the next few issues we'll have Marcus
                 Schaeffer and Chris Umans on completeness for higher
                 polynomial hierarchy levels, Arfst Nickelsen and Till
                 Tantau on partial information classes, and Ramamohan
                 Paturi on the complexity of k-SAT.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2002:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 7",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "48--51",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564600",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of some PODC announcements followed by
                 two papers:o Announcements about PODC 2002, 2003, 2004
                 and 2005 by Gil Neigero ``Brewer's Conjecture and the
                 Feasibility of Consistent, Available,
                 Partition-Tolerant Web Services'' by Seth Gilbert and
                 Nancy Lyncho ``Topology Control and Routing in Ad hoc
                 Networks: a Survey'' by Rajmohan RajaramanMany thanks
                 to Gil, Rajmohan, Seth and Nancy for contributing to
                 this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gilbert:2002:BCF,
  author =       "Seth Gilbert and Nancy Lynch",
  title =        "{Brewer}'s conjecture and the feasibility of
                 consistent, available, partition-tolerant {Web}
                 services",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "51--59",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564601",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "When designing distributed web services, there are
                 three properties that are commonly desired:
                 consistency, availability, and partition tolerance. It
                 is impossible to achieve all three. In this note, we
                 prove this conjecture in the asynchronous network
                 model, and then discuss solutions to this dilemma in
                 the partially synchronous model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajaraman:2002:TCR,
  author =       "Rajmohan Rajaraman",
  title =        "Topology control and routing in ad hoc networks: a
                 survey",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "60--73",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564602",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An ad hoc wireless network, or simply an ad hoc
                 network, consists of a collection of geographically
                 distributed nodes that communicate with one other over
                 a wireless medium. An ad hoc network differs from
                 cellular networks in that there is no wired
                 infrastructure and the communication capabilities of
                 the network are limited by the battery power of the
                 network nodes. One of the original motivations for ad
                 hoc networks is found in military applications. A
                 classic example of ad hoc networking is network of war
                 fighters and their mobile platforms in battlefields.
                 Indeed, a wealth of early research in the area involved
                 the development of packet-radio networks (PRNs) and
                 survivable radio networks [16]. While military
                 applications still dominate the research needs in ad
                 hoc networking, the recent rapid advent of mobile
                 telephony and plethora of personal digital assistants
                 has brought to the fore a number of potential
                 commercial applications of ad hoc networks. Examples
                 are disaster relief, conferencing, home networking,
                 sensor networks, personal area networks, and embedded
                 computing applications [37].The lack of a fixed
                 infrastructure in ad hoc networks implies that any
                 computation on the network needs to be carried out in a
                 decentralized manner. Thus, many of the important
                 problems in ad hoc networking can be formulated as
                 problems in distributed computing. However, there are
                 certain characteristics of ad hoc networks that makes
                 this study somewhat different than traditional work in
                 distributed computing. In this article, we review some
                 of the characteristic features of ad hoc networks,
                 formulate problems and survey research work done in the
                 area. We focus on two basic problem domains: topology
                 control, the problem of computing and maintaining a
                 connected topology among the network nodes, and
                 routing. This article is not intended to be a
                 comprehensive survey on ad hoc networking. The choice
                 of the problems discussed in this article are somewhat
                 biased by the research interests of the author. The
                 remainder of this article is organized as follows. In
                 Section 2, we describe various aspects relevant to
                 modeling ad hoc networks. In Section 3, we discuss
                 topology control. Since the nodes of an ad hoc network
                 are often associated with points in 2-dimensional
                 space, topology control is closely tied to
                 computational geometry; we will briefly review this
                 relationship and extant work in the area. In Section 4,
                 we discuss routing protocols for ad hoc networks. After
                 a brief overview of the many protocols that have been
                 proposed, we discuss alternative approaches based on
                 the adversarial network model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ferson:2002:CVI,
  author =       "Scott Ferson and Lev Ginzburg and Vladik Kreinovich
                 and Luc Longpr{\'e} and Monica Aviles",
  title =        "Computing Variance for Interval Data is {NP}-Hard",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "2",
  pages =        "108--118",
  month =        jun,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/564585.564604",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://www.cs.utep.edu/vladik/2002/tr02-13b.pdf",
  abstract =     "When we have only interval ranges $ [\underbar {x_i},
                 \overbar {x_i}] $ of sample values $ x_1, \ldots {},
                 x_n $, what is the interval $ [\underbar {V}, \overbar
                 {V}] $ of possible values for the variance $V$ of these
                 values? We prove that the problem of computing the
                 upper bound $ \overbar {V}$ is NP-hard. We provide a
                 feasible (quadratic time) algorithm for computing the
                 lower bound $ \underbar {V}$ on the variance of
                 interval data. We also provide a feasible algorithm
                 that computes $ \overbar {V}$ under reasonable easily
                 verifiable conditions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "6--6",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582478",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Taylor:2002:MCA,
  author =       "R. Gregory Taylor",
  title =        "Modern computer algebra",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "7--16",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582479",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2002:CCT,
  author =       "E. W. Cenek",
  title =        "Computability and complexity theory and the complexity
                 theory companion",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "17--19",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582480",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hestand:2002:MTD,
  author =       "P. Daniel Hestand",
  title =        "Mathematical theory of domains",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "19--22",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582481",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Seiferas:2002:RCRc,
  author =       "Joel Seiferas",
  title =        "Reprints from {{\booktitle{Computing Reviews}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "23--24",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582482",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2002:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory comun 37",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "32--49",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2002:ASNc,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 8",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "50--50",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582485",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of the paper ``Distributed Computing
                 Research Issues in Grid Computing'' by Henri Casanova.
                 Many thanks to Henri for contributing to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Casanova:2002:DCR,
  author =       "Henri Casanova",
  title =        "Distributed computing research issues in grid
                 computing",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "50--70",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582486",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Ensembles of distributed, heterogeneous resources, or
                 Computational Grids, have emerged as popular platforms
                 for deploying large-scale and resource-intensive
                 applications. Large collaborative efforts are currently
                 underway to provide the necessary software
                 infrastructure. Grid computing raises challenging
                 issues in many areas of computer science, and
                 especially in the area of distributed computing, as
                 Computational Grids cover increasingly large networks
                 and span many organizations. In this paper we briefly
                 motivate Grid computing and introduce its basic
                 concepts. We then highlight a number of distributed
                 computing research questions, and discuss both the
                 relevance and the short-comings of previous research
                 results when applied to Grid computing. We choose to
                 focus on issues concerning the dissemination and
                 retrieval of information and data on Computational Grid
                 platforms. We feel that these issues are particularly
                 critical at this time, and as we can point to
                 preliminary ideas, work, and results in the Grid
                 community and the distributed computing community. This
                 paper is of interest to distributing computing
                 researchers because Grid computing provides new
                 challenges that need to be addressed, as well as actual
                 platforms for experimentation and research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2002:SWO,
  author =       "Rocky Ross",
  title =        "Space wars and other things",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "71--74",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gupta:2002:CCF,
  author =       "Vijay Shivshanker Gupta",
  title =        "Communication complexity for file synchronization is
                 undecidable",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "3",
  pages =        "110--112",
  month =        sep,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/582475.582476",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Wide-area wireless mobile computing environments
                 present interesting challenges for the problem of file
                 synchronization between laptop computers and servers in
                 backbone networks. Wide-area wireless networks are
                 bandwidth-constrained and expensive, thereby making it
                 difficult to synchronize the files in an eager fashion.
                 The problem of file synchronization for laptop
                 computers has been actively studied for more than a
                 decade, and one of the most intriguing questions has
                 been ``how little communication is sufficient for file
                 synchronization?'' Technically, this is equivalent to
                 the question: ``what is the communication complexity
                 for file synchronization?'' This article proves the
                 undecidability of the communication complexity for
                 update propagation in a replicated file system if one
                 is willing to transmit operation-based updates.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BRCd,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601821",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2002:BML,
  author =       "William Gasarch",
  title =        "Bioinformatics: the machine learning approach",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "5--8",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601822",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2002:BRB,
  author =       "Maulik Dave",
  title =        "Book Review: {{\booktitle{The Clausal Theory of
                 Types}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "8--9",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601823",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wolfram:1993:CTT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Venkatasubramanian:2002:DMP,
  author =       "Suresh Venkatasubramanian",
  title =        "Discrete mathematical problems with medical
                 applications {DIMACS} volume 55",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "9--11",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601824",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ivanov:2002:PPP,
  author =       "Ivelin Ivanov",
  title =        "Parallel processing and parallel algorithms: theory
                 and computation",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "12--14",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601825",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parberry:2002:TCS,
  author =       "Ian Parberry",
  title =        "Things a computer scientist rarely talks about",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "14--15",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601826",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2002:BRB,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{A New Kind of Science}}}",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "15--21",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601827",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wolfram:2002:NKS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2002:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 38",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "22--36",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601829",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2002:ASNd,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 9",
  journal =      j-SIGACT,
  volume =       "33",
  number =       "4",
  pages =        "37--54",
  month =        dec,
  year =         "2002",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/601819.601830",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of the paper ``Incentives and Internet
                 Computation'' by Joan Feigenbaum and Scott Shenker.
                 Many thanks to them for contributing to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2003:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637440",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Saridis:2003:BRB,
  author =       "Prodromos Saridis",
  title =        "Book Review: {{\booktitle{Number Theory for
                 Computing}}}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "4--5",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637441",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Yan:2002:NTC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2003:BRB,
  author =       "Riccardo Pucella and Stephen Chong",
  title =        "Book Review: {{\booktitle{Type-Logical Semantics}}}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "6--17",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637442",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Carpenter:1998:TLS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2003:BRB,
  author =       "Lane A. Hemaspaandra",
  title =        "Book Review: {{\booktitle{The $ \pi $-Calculus: a
                 Theory of Mobile Processes}}}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "17--24",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637443",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Sangiorgi:2001:PCT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2003:PIC,
  author =       "Sergio Rajsbaum",
  title =        "Partial information classes",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "32--46",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637445",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this survey we present partial information classes,
                 which have been studied under different names and in
                 different contexts in the literature. They are defined
                 in terms of partial information algorithms. Such
                 algorithms take a word tuple as input and yield a small
                 set of possibilities for its characteristic string as
                 output. We define a unified framework for the study of
                 partial information classes and show how previous
                 notions fit into the framework. The framework allows us
                 to study the relationship of a large variety of partial
                 information classes in a uniform way. We survey how
                 partial information classes are related to other
                 complexity theoretic notions like advice classes,
                 lowness, bi-immunity, NP-completeness, and
                 decidability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2003:DP,
  author =       "Rocky Ross",
  title =        "Deconstructing {Paxos}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "47--67",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637447",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The celebrated Paxos algorithm of Lamport implements a
                 fault-tolerant deterministic service by replicating it
                 over a distributed message-passing system. This paper
                 presents a deconstruction of the algorithm by factoring
                 out its fundamental algorithmic principles within two
                 abstractions: an eventual leader election and an
                 eventual register abstractions. In short, the leader
                 election abstraction encapsulates the liveness property
                 of Paxos whereas the register abstraction encapsulates
                 its safety property. Our deconstruction is faithful in
                 that it preserves the resilience and efficiency of the
                 original Paxos algorithm in terms of stable storage
                 logs, message complexity, and communication steps. In a
                 companion paper, we show how to use our abstractions to
                 reconstruct powerful variants of Paxos.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2003:TRS,
  author =       "Rocky Ross",
  title =        "Teaching (and research) squeezed",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "68--77",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637449",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Huang:2003:PTA,
  author =       "Xiaofei Huang",
  title =        "A polynomial-time algorithm for solving {NP}-hard
                 problems in practice",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "1",
  pages =        "101--108",
  month =        mar,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/637437.637438",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Constraint-based optimization, which is NP-hard,
                 describes a large class of problems in many fields,
                 especially in formulating early perception tasks. For
                 example, Shape from shading of a polyhedron [12, 11] in
                 computer vision can be formulated under such a
                 paradigm. Some of the traditional problem-solving
                 methods, like the exhaustive search, guarantee finding
                 the global solution, but are too expensive in practice.
                 Local Search, Simulated Annealing, Tabu Search, and the
                 evolutionary algorithms have no general conditions to
                 stop searching when the global optimum is what we are
                 looking for. In this paper, we will present a
                 polynomial-time algorithm [5 ]for solving the practical
                 problems. The algorithm has many interesting
                 computational properties not possessed by the classic
                 ones. It is guaranteed to converge linearly,
                 insensitive to the perturbations to its initial
                 conditions and intermediate solutions. The closeness of
                 the solutions to the optimal ones in cost is always
                 provided by the algorithm so that we can stop search
                 when the gap is closed or is small enough. It has a
                 number of sufficient conditions for identifying optimal
                 solutions, and a number of necessary conditions for
                 reducing the search spaces. With 1,000 test problems
                 randomly generated by computer, the Local Search
                 algorithm with multiple restarts has a successful rate
                 of only 0.2\% after 25 iterations, and the Simulated
                 Annealing algorithm [7, 2 ] with a linear cooling
                 scheme has a successful rate of 1.5\% after 250,000
                 steps. In contrast, the new algorithm achieved a
                 successful rate of over 98\% after only 7.27 iterations
                 on average.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2003:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "2--2",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882119",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Widjaja:2003:BRB,
  author =       "Anthony Widjaja",
  title =        "Book Review: {{\booktitle{Algorithms Sequential \&
                 Parallel: a Unified Approach}}, by R. Miller \& L.
                 Boxer. Prentice Hall 2000}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "3--5",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882120",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Miller:2005:ASP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Masum:2003:BRB,
  author =       "Hassan Masum",
  title =        "Book Review: {{\booktitle{Algorithmics for Hard
                 Problems: Introduction to Combinatorial Optimization,
                 Randomization, Approximation, and Heuristics}}, by
                 Juraj Hromkovic. Springer 2001}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "6--8",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882121",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hromkovic:2003:AHP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weissman:2003:BRB,
  author =       "Vicky Weissman",
  title =        "Book Review: {{\booktitle{Modal and Temporal
                 Properties of Processes}}, by Colin Stirling. Springer
                 Verlag 2001}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "8--15",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882122",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Stirling:2001:MTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hestand:2003:BRB,
  author =       "P. Daniel Hestand",
  title =        "Book Review: {{\booktitle{Modal Logic}}: Cambridge
                 tracts in theoretical computer science \#53 by Patrick
                 Blackburn, Maarten de Rijke, and Yde Venema. Cambridge
                 University Press 2001}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "15--19",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882123",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Blackburn:2001:ML,Blackburn:2007:HML}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2003:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 40",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "27--41",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882125",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2003:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 11",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "42--57",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882126",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of the paper ``Reconstructing Paxos'' by
                 Romain Boichat, Partha Dutta, Svend Fr{\o}lund, and
                 Rachid Guerraoui. Many thanks to them for contributing
                 to this issue. The celebrated Paxos algorithm of
                 Lamport implements a fault-tolerant deterministic
                 service by replicating it over a distributed
                 message-passing system. In a companion paper [2], we
                 presented a deconstruction of the algorithm by
                 factoring out its fundamental algorithmic principles
                 within two abstractions: an eventual leader election
                 and an eventual register abstractions. Using those
                 abstractions, we show in this paper how to reconstruct,
                 in a modular manner, powerful variants of Paxos. In
                 particular, we show how to (1) alleviate the need for
                 stable storage access if some processes remain up for
                 sufficiently long, (2) augment the resilience of the
                 algorithm against unstable processes, (3) enable single
                 process decision with shared commodity disks, and (4)
                 reduce the number of communication steps during stable
                 periods of the system. The Island of Paxos used to host
                 a great civilisation which had developed a
                 sophisticated parttime parliament protocol. Paxons
                 codified various aspects of their parliament protocol
                 which enabled them to easily adapt the protocol to
                 specific functioning modes throughout the seasons. In
                 particular, during winter, the parliament was heated
                 and some legislators did never leave the chamber: their
                 guaranteed presence helped alleviate the need for the
                 writing of decrees on ledgers. This was easy to obtain
                 precisely because the subprotocol used to ``store and
                 lock'' decrees was precisely codified. In spring, and
                 with the blooming days coming, some legislators could
                 not stop leaving and entering the parliament. Their
                 indiscipline prevented progress in the protocol.
                 However, as the election subprotocol used to choose the
                 parliament president was also precisely codified, the
                 protocol could easily be adapted to cope with
                 indisciplined legislators. During summer, very few
                 legislators were in the parliament and it was hardly
                 possible to pass any decree because of the lack of the
                 necessary majority. Fortunately, it was easy to modify
                 the subprotocol used to store and lock decrees and
                 devise a powerful technique where a single legislator
                 could pass decrees by directly accessing the ledgers of
                 other legislators. Fall was a protest season and
                 citizens wanted a faster procedure to pass decrees.
                 Paxons noticed that, in most periods, messengers did
                 not loose messages and legislators replied in time.
                 They could devise a variant of the protocol that
                 reduced the number of communication steps needed to
                 pass decrees during those periods. Again, this
                 optimisation was obtained through a simple refinement
                 of the subprotocol used to propose new decrees.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2003:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 44",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "58--60",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882127",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The open problem of whether or not every pair of
                 equal-area polygons has a hinged dissection is
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cogliati:2003:MWP,
  author =       "Josh Cogliati and Rocky Ross",
  title =        "Mathematics on the {Web}: part {II}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "61--68",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882129",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Litow:2003:HCP,
  author =       "B. Litow",
  title =        "The {Hamiltonian} circuit problem and automaton
                 theory",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "2",
  pages =        "91--94",
  month =        jun,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/882116.882117",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We exhibit an elegant automaton-theoretic construction
                 that yields a $ 2^{O(n)}$-time algorithm to count the
                 number of Hamiltonian circuits in a graph with $n$
                 vertices.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2003:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "3--4",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945529",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Irwin:2003:BRBa,
  author =       "Robert J. Irwin",
  title =        "Book Review: {{\booktitle{Set Theory for Computing:
                 From Decision Procedures to Declarative Programming
                 with Sets}}, by Domenico Cantone, Eugenio Omodeo and
                 Alberto Policriti. Springer-Verlag 2001}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "4--11",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945530",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Cantone:2001:STC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2003:BRB,
  author =       "E. W. Cenek",
  title =        "Book Review: {{\booktitle{Theory of Computational
                 Complexity}}, by Ding-Zhu Du and Ker-I Ko. John Wiley
                 \& Sons}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "11--12",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945531",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Du:2000:TCC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Constantinides:2003:BRB,
  author =       "George A. Constantinides",
  title =        "Book Review: {{\booktitle{Computer Arithmetic
                 Algorithms}}, by Israel Koren. A.K. Peters}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "13--15",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945532",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Koren:1993:CAA,Koren:2002:CAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Marchini:2003:BRB,
  author =       "Andrea Marchini",
  title =        "Book Review: {{\booktitle{An Introduction to Quantum
                 Computing Algorithms}}, by Arthur O. Pittenger.
                 Birkh{\"a}user 2000}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "16--18",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945533",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pittenger:2000:IQC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2003:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} complexity theory column 41",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "26--39",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945535",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2003:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT News} distributed computing column 12",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "40--61",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945536",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, internet, and the web. This
                 issue consists of the paper ``Applications of Lattice
                 Theory to Distributed Computing'' by Vijay Garg, Neeraj
                 Mittal, and Alper Sen. Many thanks to them for
                 contributing to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2003:EFa,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "62--67",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945538",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Skiena:2003:PCP,
  author =       "Steven S. Skiena and Miguel A. Revilla",
  title =        "Programming challenges: the programming contest
                 training manual",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "68--74",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945539",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alagarsamy:2003:SMA,
  author =       "K. Alagarsamy",
  title =        "Some myths about famous mutual exclusion algorithms",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "3",
  pages =        "94--103",
  month =        sep,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/945526.945527",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Dekker's algorithm[9] is the historically first
                 software solution to mutual exclusion problem for
                 2-process case. The first software solution for n
                 -process case was subsequently proposed by Dijkstra[8].
                 These two algorithms have become de facto examples of
                 mutual exclusion algorithms, for their historical
                 importance. Since the publication of Dijkstra's
                 algorithm, there have been many solutions proposed in
                 the literature [24, 1, 2]. In that, Peterson's
                 algorithm [21] is one among the very popular
                 algorithms. Peterson's algorithm has been extensively
                 analyzed for its elegance and compactness. This paper
                 attempts to dispel the myths about some of the
                 properties of these three remarkable algorithms, by a
                 systematic analysis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knuth:2003:RWF,
  author =       "Donald E. Knuth",
  title =        "{Robert} {W Floyd}, {In Memoriam}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "3--13",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2003:BRCd,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "14--15",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954094",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column we review the books listed below. In
                 addition there is a comment by Oded Goldreich on the
                 review of his book Foundations of Cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:2003:BRBa,
  author =       "Andrew C. Lee",
  title =        "Book Review: {{\booktitle{Introduction to
                 Cryptography}}, by Johannes A. Buchmann. Springer
                 Verlag, 2001}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "15--17",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954095",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Buchmann:2001:IC,Buchmann:2004:IC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Irwin:2003:BRBb,
  author =       "Robert J. Irwin",
  title =        "Book Review: {{\booktitle{Coding Theory and
                 Cryptography: the Essentials}}, second edition, revised
                 and expanded by D.R. Hankerson, et al. Marcel Dekker,
                 2000}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "17--21",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954096",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hankerson:2000:CTC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Springer:2003:BRB,
  author =       "William M. {Springer II}",
  title =        "Book Review: {{\booktitle{Cryptography: Theory and
                 Practice}}, second edition by Douglas R. Stinson. CRC
                 Press}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "22--25",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954097",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Stinson:1995:CTP,Stinson:2002:CTP,Stinson:2006:CTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2003:JRB,
  author =       "Riccardo Pucella",
  title =        "Joint review of {{\booktitle{Foundations of
                 Cryptography: Basic Tools}}, by O. Goldreich. Cambridge
                 University Press, and \booktitle{Modelling and Analysis
                 of Security Protocols}, by P. Ryan and S. Schneider.
                 Addison Wesley}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "26--31",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954098",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Goldreich:2001:FCB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:2003:BRBb,
  author =       "Andrew C. Lee",
  title =        "Book Review: {{\booktitle{Modern Cryptography,
                 Probabilistic Proofs and Pseudorandomness Algorithms
                 and Combinatorics}}, vol 17, by Oded Goldreich.
                 Springer Verlag, 1999}",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "32--34",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954099",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Goldreich:1999:MCP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bohler:2003:PBB,
  author =       "E. B{\"o}hler and N. Creignou and S. Reith and H.
                 Vollmer",
  title =        "Playing with {Boolean} blocks, part {I}: {Post}'s
                 lattice with applications to complexity theory",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "38--52",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 16:33:55 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2003:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 42",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "38--52",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954101",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2003:ASNc,
  author =       "Sergio Rajsbaum",
  title =        "{ACM SIGACT} news distributed computing column 13",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "53--56",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954102",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue describes the PODC 20th anniversary Special Issue
                 published by Distributed Computing journal.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kumar:2003:ACS,
  author =       "Ravi Kumar and Ronitt Rubinfeld",
  title =        "Algorithms column: sublinear time algorithms",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "57--67",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954103",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2003:SNO,
  author =       "Ricky Ross",
  title =        "{SIGACT} news online algorithms column 1",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "68--77",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954104",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2003:EFb,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "34",
  number =       "4",
  pages =        "78--83",
  month =        dec,
  year =         "2003",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/954092.954106",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2004:BRCa,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "3--4",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970835",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Gasarch04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Simovici:2004:BRB,
  author =       "Dan A. Simovici",
  title =        "Book Review: {{\booktitle{The Classical Decision
                 Problem}}, by Egon B{\"o}rger, Erich Gr{\"a}del and
                 Yuri Gurevich. Springer-Verlag 1997}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "4--7",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970836",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Simovici04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Borger:1997:CDP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moss:2004:BRB,
  author =       "Lawrence S. Moss and Hans-J{\"o}rg Tiede",
  title =        "Book Review: {{\booktitle{Automata Theory and its
                 Applications}}, by Bakhadyr Khoussainov and Anil
                 Nerode. Birkh{\"a}user Boston, Inc. 2001.: and
                 \booktitle{Automata, Logics, and Infinite Games}, by E.
                 Gr{\"a}del, W. Thomas, and T. Wilke. Springer-Verlag}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "8--12",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970837",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#MossT04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Khoussainov:2001:ATA,Gradel:2002:ALI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Berstel:2004:BRB,
  author =       "Jean Berstel",
  title =        "Book Review: {{\booktitle{Automatic Sequences: Theory,
                 Applications, Generalizations}}, by Jean-Paul Allouche
                 and Jeffrey Shallit. Cambridge University Press}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "12--16",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970838",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Berstel04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Allouche:2003:AST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bohler:2004:PBB,
  author =       "E. B{\"o}hler and N. Creignou and S. Reith and H.
                 Vollmer",
  title =        "Playing with {Boolean} blocks, part {II}: constraint
                 satisfaction problems",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "22--35",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 16:33:55 2012",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2004:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 43",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "22--35",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970840",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Hemaspaandra04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:SNOa,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 2",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "38--48",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970841",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Chrobak04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:SNOa,
  author =       "Rocky Ross",
  title =        "{SIGACT} news online algorithms column 2",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "38--48",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970841",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:ST,
  author =       "Rocky Ross",
  title =        "Stability and theory",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "49--51",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970843",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ross04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fass:2004:LMO,
  author =       "Leona F. Fass",
  title =        "Language, mathematics and other dangerous things",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "74--79",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970832",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Fass04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We describe our original automata-theoretic, highly
                 mathematical perspective on language representation and
                 learning, and compare with some current research
                 advances and some that are proposed. We find benefits
                 of a mathematical approach to ``real life'' language
                 learning by humans and today's machines, and review
                 work of researchers who adapt such computational
                 techniques to complex system development and
                 language-related machine processes. Examples include
                 design of communicating agents and proposed development
                 of the Semantic Web. While emphasizing the success of a
                 mathematical perspective on language representation and
                 learning, we also note the danger of assuming that
                 ``perfect'' results will always be produced by a
                 mathematical approach.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Frost:2004:PPP,
  author =       "Christopher Frost and Michael Peck and David Evans",
  title =        "Pancakes, puzzles, and polynomials: cracking the
                 Cracker Barrel",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "1",
  pages =        "80--84",
  month =        mar,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/970831.970833",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#FrostPE04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Cracker Barrel peg game is a simple, one-player
                 game commonly found on tables at pancake restaurants.
                 In this paper, we consider the computational complexity
                 of the Cracker Barrel problem. We show that a variation
                 of a generalization of the problem is NP-complete.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2004:BRCb,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "3--4",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992290",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Gasarch04a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Petride:2004:BRB,
  author =       "Sabina Petride",
  title =        "Book Review: {{\booktitle{Concurrent and Real-Time
                 Systems: the CSP Approach}}, by Steve Schneider. Wiley
                 1999}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "4--12",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992291",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Petride04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Schneider:2000:CRT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{McNaughton:2004:BRB,
  author =       "Robert McNaughton",
  title =        "Book Review: {{\booktitle{Introduction to Languages,
                 Machines and Logic: Computable Languages, Abstract
                 Machines and Formal Logic}}, by Alan P. Parkes.
                 Springer-Verlag 2002}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "13--14",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992292",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#McNaughton04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Parkes:2002:ILM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Navrat:2004:BRB,
  author =       "Pavol N{\'a}vrat",
  title =        "Book Review: {{\booktitle{Algorithm Design:
                 Foundations, Analysis and Internet Examples}}, by
                 Michael T. Goodrich and Roberto Tamassia. John Wiley \&
                 Sons, Inc. 2001}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "14--16",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992293",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Navrat04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Goodrich:2002:ADF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fortnow:2004:BRB,
  author =       "Lance Fortnow",
  title =        "Book Review: {{\booktitle{Theory of Semi-Feasible
                 Algorithms}}, by Lane Hemaspaandra and Leen Torenvliet.
                 Springer}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "16--18",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992294",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Fortnow04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hemaspaandra:2003:TSF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ambainis:2004:QSA,
  author =       "Andris Ambainis",
  title =        "Quantum search algorithms",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "22--35",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992296",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ambainis04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We review some of quantum algorithms for search
                 problems: Grover's search algorithm, its generalization
                 to amplitude amplification, the applications of
                 amplitude amplification to various problems and the
                 recent quantum algorithms based on quantum walks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aguilera:2004:PST,
  author =       "Marcos Kawazoe Aguilera",
  title =        "A pleasant stroll through the land of infinitely many
                 creatures",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "36--59",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992298",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Aguilera04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2004:PST,
  author =       "Samir Khuller",
  title =        "A pleasant stroll through the land of infinitely many
                 creatures",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "36--59",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992298",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Many distributed algorithms are designed for a system
                 with a fixed set of n processes. However, some systems
                 may dynamically change and expand over time,so that the
                 number of processes may grow to infinity as time tends
                 to infinity. This paper considers such systems, and
                 gives algorithms that are new and simple (but not
                 necessarily efficient) for common problems. The reason
                 for simplicity is to better expose some of the
                 algorithmic techniques for dealing with infinitely many
                 processes. A brief summary of existing work in the
                 subject is also provided.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fakcharoenphol:2004:AMT,
  author =       "Jittat Fakcharoenphol and Satish Rao and Kunal
                 Talwar",
  title =        "Approximating metrics by tree metrics",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "60--70",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992300",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#FakcharoenpholRT04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2004:AMT,
  author =       "Joseph O'Rourke",
  title =        "Approximating metrics by tree metrics",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "60--70",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992300",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:CGC,
  author =       "Marek Chrobak",
  title =        "Computational geometry column 45",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "71--73",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992302",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The algorithm of Edelsbrunner for surface
                 reconstruction by ``wrapping'' a set of points in R$^3$
                 is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2004:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 45",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "71--73",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992302",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#ORourke04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:PSF,
  author =       "Marek Chrobak",
  title =        "A princess swimming in the fog looking for a monster
                 cow",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "74--78",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992304",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Chrobak04a;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:PSF,
  author =       "Rocky Ross",
  title =        "A princess swimming in the fog looking for a monster
                 cow",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "74--78",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992304",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:MM,
  author =       "Rockey Ross",
  title =        "Mental models",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "79--82",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992306",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ross04a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-Amram:2004:CTP,
  author =       "Amir M. Ben-Amram",
  title =        "A complexity-theoretic proof of a Recursion-Theoretic
                 Theorem",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "2",
  pages =        "111--112",
  month =        jun,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/992287.992288",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:26 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ben-Amram04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is well known that Complexity Theory inherited many
                 tools from Recursion Theory. This note is an example
                 where tools from Complexity Theory simplify the proof
                 of a Recursion Theoretical result, illustrating the
                 value of mingling the two subjects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2004:BRB,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{Handbook of Graph Theory}},
                 edited by Gross and Yellen. CRC, 2004}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "5--8",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027919",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Gasarch04b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gross:2004:HGT}.",
  abstract =     "One uses a handbook by looking up things that you
                 always wanted to know or that come up. Hence, I decided
                 to review this handbook by asking a random collection
                 of theorists (the editors of SIGACT NEWS and theorists
                 in the Maryland-Wash DC area) to email me questions
                 they are either curious about or think ought to be in a
                 handbook. I comment on how well the book does on
                 answering each one, and then summarize how well the
                 book did overall. For each question asked I looked
                 rather carefully in the table of contents and the
                 index; hence, if I say 'the book did not have anything
                 on topic X' and in reality it does, then the books
                 organization is at fault.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zhao:2004:BRB,
  author =       "Wenzhong Zhao",
  title =        "Book Review: {{\booktitle{Reasoning about
                 Uncertainty}}, by Joseph Y. Halpern. The MIT Press,
                 2003}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "8--12",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027920",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Zhao04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Halpern:2003:RAU}.",
  abstract =     "Dealing with uncertain and imprecise information has
                 been one of the major issues in almost all intelligent
                 systems. Uncertainty is a fundamental and unavoidable
                 feature of our daily life. It arises because agents
                 almost never have access to the whole truth about their
                 environment. It can also occur when the agents have
                 incomplete and/or incorrect information about the
                 properties of their environment.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wille:2004:BRB,
  author =       "Luc T. Wille",
  title =        "Book Review: {{\booktitle{Learning Kernel Classifiers:
                 Theory and Algorithms}}, by Ralf Herbrich. MIT Press,
                 Cambridge, Mass., 2002. ISBN 0-262-08306-X, 384 pages;
                 and \booktitle{Learning with Kernels: Support Vector
                 Machines, Regularization Optimization and Beyond} by
                 Bernhard Scholkopf and Alexander J. Smola. MIT Press,
                 Cambridge, Mass., 2002, ISBN 0-262-19475-9, 644
                 pages}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "13--17",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027921",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Wille04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Herbrich:2002:LKC,Scholkopf:2002:LKS}.",
  abstract =     "Pattern recognition is arguably the critical first
                 step in intelligence --- be it natural or artificial.
                 Science could not exist if humans were not able to spot
                 regularities. Only subsequently do we analyze and
                 classify them, and ultimately come up with underlying
                 descriptions, some of which eventually make it to the
                 lofty status of natural laws. Of course evolution did
                 NOT ENDOw humans (or animals for that matter) with the
                 ability to recognize patterns so we could build
                 grandiose scientific edifices, rather we need that
                 ability at the most elementary level. Humans simply
                 cannot function in everyday life without pattern
                 recognition capabilities and when those capabilities
                 are impaired, as in patients with Alzheimer's disease
                 for example, the result is nothing less than tragic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Oliveira:2004:BRBa,
  author =       "Carlos Oliveira",
  title =        "Book Review: {{\booktitle{Essentials of Constraint
                 Programming}}, by T. Fruhwirth and S. Abdennadher.
                 Springer-Verlag}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "17--20",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027922",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Oliveira04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Fruhwirth:2003:ECP}.",
  abstract =     "Constraint programming (CP) is an area of computer
                 science in which the considered problems can be
                 expressed as a set of logical rules, also known as
                 constraints. This results in a huge class of problems,
                 encompassing domains such as logic programming,
                 mathematical programming, and optimization.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guruswami:2004:GCE,
  author =       "Venkatesan Guruswami",
  title =        "Guest column: error-correcting codes and expander
                 graphs",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "25--41",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027924",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Guruswami04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2004:GCE,
  author =       "Joseph O'Rourke",
  title =        "Guest column: error-correcting codes and expander
                 graphs",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "25--41",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027924",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The central algorithmic problem in coding theory is
                 the construction of explicit error-correcting codes
                 with good parameters together with fast algorithms for
                 encoding a message and decoding a noisy received word
                 into the correct message. Over the last decade,
                 significant new developments have taken place on this
                 problem using graph-based/combinatorial constructions
                 that exploit the power of {\em expander graphs\/}. The
                 role of expander graphs in theoretical computer science
                 is by now certainly well-appreciated. Here, we will
                 survey some of the highlights of the use of expanders
                 in constructions of error-correcting codes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2004:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 46",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "42--45",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027926",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#ORourke04a;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2004:CGC,
  author =       "Sergio Rajsbaum",
  title =        "Computational geometry column 46",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "42--45",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027926",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The old problem of determining the chromatic number of
                 the plane is revisited. The question of the chromatic
                 number of the Euclidean plane E^2 has been unresolved
                 for over fifty years. Informally, the question asks:
                 How many colors are needed to paint the plane so that
                 no two points a unit distance apart are painted the
                 same color? If the same question is asked of the line,
                 the answer is 2: Coloring $ [0, 1) $ red, $ [1, 2) $
                 blue, etc., ensures that no two unit-separated points
                 have the same color. Here I report on a few new
                 developments, and some related open problems that are
                 perhaps easier. One can view the question as asking for
                 the chromatic number $ X(E^2) $ of the infinite {\em
                 unit-distance graph $G$}, with every point in the plane
                 a node, and an are between two nodes if they are
                 separated by a unit distance. Erd{\H{o}}s and de Bruijn
                 showed [EdB51] that the chromatic number of the plane
                 is attained for some finite subgraph of $G$. This
                 result led to narrowing the answer to $ 4 \leq X(E^2)
                 \leq 7$. For example, the lower bound of $4$ is
                 established by the ``Moser graph'' shown in Fig. 1,
                 which needs 4 colors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:ASN,
  author =       "Marek Chrobak",
  title =        "{ACM SIGACT} news distributed computing column 15",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "46--57",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027928",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue contains two items: o An eulogy in memory of
                 Shimon Even, who passed away on May 1st, 2004. He was a
                 highly influential educator, and played a major role in
                 establishing computer science education in Israel. He
                 did pioneering work in various areas, including
                 parallel and distributed computing. As Oded Goldreich
                 says in his PODC 2004 proceedings eulogy, Shimon Even
                 was a great scientist and a remarkable person. His
                 attitudes toward research have influenced anybody who
                 was fortunate to have an interaction with him, he
                 always followed his own judgment and understanding,
                 rather than the common trend or fashion. He sought
                 simple solutions that uncover the essence of the
                 problem. He spent much time seeking the best way to
                 present his own work as well as the work of others in
                 lectures and writing. This quote comes to mind, about
                 having found a good problem to work on. {\em Not that I
                 quite know indeed what situations the seeking fabulist
                 does ``find''; he seeks them enough assuredly, but he
                 discoveries are, like those of the navigator, the
                 chemist, the biologist, scarce more than alert
                 recognitions. He comes upon the interesting thing as
                 Columbus came upon the isle of San Salvador, because he
                 had moved in the right direction for it---also because
                 he knew, with the encounter, what ``making land'' then
                 and there represented.\/} Henry James o The 2004
                 G{\"o}del Prize is great news for the distributed
                 computing community: it is shared between two journal
                 papers that discovered a fundamental relation between
                 distributed computing and topology, by Maurice Herlihy
                 and Nir Shavit, and Michael Saks and Fotios Zaharoglou.
                 To celebrate this, I am happy to present personal
                 perspectives by the authors of these papers, and by
                 Elizabeth Borowsky and Eli Gafni, that coauthored a
                 third paper with the discovery, but only in a
                 conference and hence not eligible for the prize. I
                 include perspectives also by other people that produced
                 seminal work on the same subject: Soma Chaudhuri and
                 Shlomo Moran. The DISC conference is collocated this
                 year with GETCO, a workshop on topological methods in
                 concurrency and distributed computing. They will
                 dedicate a joint session to celebrate the prize. Many
                 thanks to the contributors of this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2004:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 15",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "46--57",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027928",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Rajsbaum04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:SNOb,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 4",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "58--66",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027930",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Chrobak04b;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:SNOb,
  author =       "Rocky Ross",
  title =        "{SIGACT} news online algorithms column 4",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "58--66",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027930",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "{\bf From the editor}: This issue's column contains an
                 expository article by Leah Eppstein and Rob Van Stee on
                 models and algorithms for buffer management in QofS
                 networks. This area has seen a flurry of activity in
                 the last four years. In spite of good progress, several
                 fundamental, easy-to-state problems remain open. Many
                 thanks to Leah and Rob for this timely contribution.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2004:CB,
  author =       "Rocky Ross",
  title =        "{Chicago} blues",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "69--71",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027932",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ross04b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I was at STOC this year. At least part of the time.
                 Chicago is a remarkable city, especially so when the
                 Blues Festival is underway. What a contrast! The
                 Chicago Hilton on South Michigan Avenue was the venue
                 of STOC; Grant Park across from the hotel on the shores
                 of Lake Michigan was the site of the Blues Festival---a
                 seething melting pot of languages, skin colors, smells,
                 street food, and the soul-tugging strains of the blues
                 wafting in from all angles. What to do? Listen to the
                 blues being chanted in the general monotone voice of
                 conference presentations (``well, we were able to prove
                 this much, but, by golly, the next step seems
                 elusive\ldots{} '') or the blues being sung on park
                 greens in deep, throaty tones to the accompaniment of a
                 wailing saxophone (``My wife left me for a rhinestone
                 cowboy and the dog just overdosed on asparagus\ldots{}
                 '')? The answer of course, was: A lot of both. Somehow,
                 as you might well imagine, the contrast between STOC
                 and the Blues Festival was almost enough to warp a
                 person's mind (were it not already warped). Ditto for
                 the contrast between the Chicago skyscrapers and the
                 cloud piercing peaks of the Rocky Mountains of
                 Bozeman.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ylikoski:2004:SSI,
  author =       "Antti Ylikoski",
  title =        "Some simple but interesting results concerning the {P}
                 ?= {NP} Problem",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "94--97",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027915",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Ylikoski04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper, I discuss some properties of two
                 functions, which I call f1() and f2(), which are
                 interesting from the point of view of the $P$ ?= $ N P$
                 problem. The both functions $f$1() and $f$2() concern
                 the problem of solving a nondeterministic
                 polynomial-time problem deterministically in a
                 polynomial time. Based on the results, I finally
                 outline a research program to study the $P$ ?= $ N P$
                 problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Li:2004:EAI,
  author =       "Dafa Li",
  title =        "The equality axioms are not independent",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "98--101",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027916",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Li04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "After computer experiments by using the ANDP prover we
                 showed that the five axioms for reflexivity, symmetry,
                 transitivity and substitutivity of equality can be
                 replaced by only two of the five axioms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shilova:2004:ETD,
  author =       "S. O. Shilova and Nikolay V. Shilov",
  title =        "Etude on theme of {Dijkstra}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "3",
  pages =        "102--108",
  month =        sep,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1027914.1027917",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#ShilovaS04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a tutorial for undergraduate students who
                 are interested in different programming contests like
                 National Programming Olympiads or regional ACM
                 International Collegiate Programming Contests (ACM
                 ICPC). It is based on a problem discussed by E. W.
                 Dijkstra in a public lecture in 1994. The tutorial was
                 a part of a special undergraduate course presented for
                 students of Novosibirsk State University in 2003-04
                 academic year during their preparation for ACM ICPC
                 Final at Prague (2004). The original problem is how to
                 couple $N$ black and $N$ white points on the plane by
                 intervals without intersections. E. W. Dijkstra
                 suggested a nice heuristic search algorithm and proved
                 its termination and correctness by the method of R. W.
                 Floyd. Unfortunately, the upper bound of his algorithm
                 was exponential. Due to this reason, he suggested to
                 audience investigation of the problem complexity and
                 development of an efficient algorithm. We demonstrate
                 that the problem is decidable in cubic time by
                 quadratic reduction to the classical assignment
                 problem. We also discuss how to solve the coupling
                 problem in pure geometric/topological way. We also
                 present some examples of utility of the coupling
                 problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2004:BRCc,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054921",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Gasarch04c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Taylor:2004:BRB,
  author =       "R. Gregory Taylor",
  title =        "Book Review: {{\booktitle{Boolean Functions and
                 Computation Models}}, by Peter Clote and Evangelos
                 Kranakis, Springer-Verlag, 2002}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "5--11",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054922",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Taylor04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Clote:2002:BFC}.",
  abstract =     "This wide-ranging monograph covers a number of
                 research areas including Boolean functions and Boolean
                 circuit families, propositional proof systems,
                 sequential and parallel models of computation, and
                 function algebras. If anything links them all together,
                 it is surely complexity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Oliveira:2004:BRBb,
  author =       "Carlos A. S. Oliveira",
  title =        "Book Review: {{\booktitle{Selected Papers on Discrete
                 Mathematics}}, by D. Knuth, CSLI (Center for the Study
                 of Language and Information Publication) paperback,
                 \$72.00}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "11--14",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054923",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Oliveira04a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:2003:SPD}.",
  abstract =     "The book ``Selected Papers in Discrete Mathematics''
                 is a compilation of work published (plus some
                 unpublished papers) by Donald E. Knuth, in the area of
                 discrete mathematics. Clearly, the author does not need
                 any introduction, and is well known by his
                 authoritative work in areas such analysis of algorithms
                 and digital typography. However, more than this, Knuth
                 is a great example of good expositor and writer. Thus,
                 even if your interests are not directly related to the
                 more mathematical areas of computer science, it is
                 greatly rewarding to read this book as a way of
                 learning how to write good papers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Oliveira:2004:BRBc,
  author =       "Carlos A. S. Oliveira",
  title =        "Book Review: {{\booktitle{Linear Optimization and
                 Extensions --- Problems and Solutions}}, by Dimitris
                 Alevras and Manfred Padberg, Springer-Verlag, 450
                 pages, \$54.95}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "15--18",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054924",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Oliveira04b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Alevras:2001:LOE,Padberg:2010:LOE}.",
  abstract =     "Linear Optimization and Extensions --- Problems and
                 Solutions --- is a solution manual for another book,
                 released in 2000, by the second author [1]. The
                 original book is a comprehensive introduction to the
                 topics of linear programming and combinatorial
                 optimization. The current book, therefore, has the
                 initial goal of providing hints, and solutions for the
                 problems there stated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fahle:2004:BRB,
  author =       "William Fahle",
  title =        "Book Review: {{\booktitle{Introduction to the Design
                 and Analysis of Algorithms}}, by Ananay Levitin,
                 Addison-Wesley}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "18--19",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054925",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Fahle04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Levitin:2007:IDA,Levitin:2012:IDA}.",
  abstract =     "This is a beginning algorithms book, suitable for the
                 late undergraduate or early graduate computer science
                 student. Subjects covered include an introduction of
                 the concept of algorithms, a taxonomy of various
                 algorithms and design techniques, up through a
                 preliminary discussion of the topics of complexity and
                 computability. The subject of algorithms is, of course,
                 well known and fundamental to the computer sciences.
                 This book provides an introduction to the subject
                 through the use of some well-known and not so
                 well-known puzzles and computing problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Codenotti:2004:CME,
  author =       "Bruno Codenotti and Sriram V. Pemmaraju and Kasturi R.
                 Varadarajan",
  title =        "The computation of market equilibria",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "23--37",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054927",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#CodenottiPV04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2004:CME,
  author =       "Sergio Rajsbaum",
  title =        "The computation of market equilibria",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "23--37",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054927",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The market equilibrium problem has a long and
                 distinguished history. In 1874, Walras published the
                 famous ``Elements of Pure Economics'', where he
                 describes a model for the state of an economic system
                 in terms of demand and supply, and expresses the supply
                 equals demand equilibrium conditions [62]. In 1936,
                 Wald gave the first proof of the existence of an
                 equilibrium for the Walrasian system, albeit under
                 severe restrictions [61]. In 1954, Nobel laureates
                 Arrow and Debreu proved the existence of an equilibrium
                 under milder assumptions [3]. This existence result,
                 along with the two fundamental theorems of welfare are
                 the pillars of modern equilibrium theory. The First
                 Fundamental Theorem of Welfare showed the Pareto
                 optimality of allocations at equilibrium prices,
                 thereby formally expressing Adam Smith's ``invisible
                 hand'' property of markets and providing important
                 social justification for the theory of equilibrium.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2004:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 16",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "38--38",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054929",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Rajsbaum04a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2004:LS,
  author =       "Sergio Rajsbaum",
  title =        "{Larry Stockmeyer: 1948--2004}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "39--39",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054930",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Rajsbaum04b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:DAS,
  author =       "Marek Chrobak",
  title =        "Distributed approximation: a survey",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "40--57",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054931",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Recently considerable progress was achieved in
                 designing efficient distributed approximation
                 algorithms, and in demonstrating hardness of
                 distributed approximation for various problems. In this
                 survey we overview the research in this area and
                 propose several directions for future research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Elkin:2004:DAS,
  author =       "Michael Elkin",
  title =        "Distributed approximation: a survey",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "40--57",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054931",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Elkin04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2004:CMC,
  author =       "Marek Chrobak and Elias Koutsoupias",
  title =        "Coordination mechanisms for congestion games",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "58--71",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054933",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#ChrobakK04;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2004:CMC,
  author =       "Riccardo Pucella",
  title =        "Coordination mechanisms for congestion games",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "58--71",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054933",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Recently there has been a lot of interest in problems
                 at the intersection of Game Theory, Economics, and
                 Computer Science. For example, there are interesting
                 developments concerning algorithms for equilibria and
                 cost sharing, algorithmic mechanism design, and the
                 efficiency of systems with selfish users [25]. In this
                 note, I will focus on the last area and in particular
                 on the price of anarchy of task allocation, selfish
                 routing, and congestion games. I will discuss the
                 issues of this area, mention the central results, and
                 suggest some open problems, some of them close in
                 spirit to competitive analysis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2004:SC,
  author =       "Riccardo Pucella",
  title =        "Specifying confidentiality",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "72--83",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054935",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Pucella04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I would like to start my tenure as editor of the Logic
                 Column by thanking Jon Riecke, who has edited this
                 column since 1998. The Logic Column serves as a
                 showcase of the many connections between logic and
                 computer science. Logic has been connected with
                 computer science since the early days of Turing. In the
                 past few decades, logical methods have had a
                 considerable impact. To get a sense of the range of
                 applications, consider the 2001 NSF/CISE Workshop on
                 The Unusual Effectiveness of Logic in Computer Science
                 (see http: //www. cs. rice. edu/~vardi/logic/). An
                 article derived from the workshop appeared in the
                 Bulletin of Symbolic Logic [Halpern et al. 2001], and
                 it is an exceedingly good read. If you get a copy of
                 that issue of the Bulletin, make sure to also have a
                 look at the article by Buss et al. [2001], which
                 discusses the current state of mathematical logic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vandenBroek:2004:CTA,
  author =       "Pim van den Broek and Joost Noppen",
  title =        "Comparison of two approaches to dynamic programming",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "111--116",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054917",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#BroekN04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Both in mathematics and in computer science Dynamic
                 Programming is a well known concept. It is an
                 algorithmic technique, which can be used to write
                 efficient algorithms, based on the avoidance of
                 multiple executions of identical subcomputations. Its
                 definition in both disciplines is however quite
                 different. The aim of this paper is to compare both
                 definitions. It is shown that the computer science
                 approach is more efficient, since it avoids the
                 execution of unneeded subcomputations, whereas the
                 mathematical approach has greater possibilities of
                 reducing memory requirements.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coonce:2004:CSM,
  author =       "Harry B. Coonce",
  title =        "Computer science and the mathematics genealogy
                 project",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "117--117",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054918",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#Coonce04;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "From the book of Genesis to the TCS genealogy of Ian
                 Parberry [1] folks have been inquisitive about their
                 roots. In academic disciplines --- such as computer
                 science, mathematics, statistics, etc. --- people are
                 frequently interested in their academic heritage.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shilova:2004:AET,
  author =       "S. O. Shilova and Nikolay V. Shilov",
  title =        "Addendum to {Etude} on theme of {Dijkstra}",
  journal =      j-SIGACT,
  volume =       "35",
  number =       "4",
  pages =        "118--118",
  month =        dec,
  year =         "2004",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1054916.1054919",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact35.html#ShilovaS04a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "After publication of our paper Etude on theme of
                 Dijkstra in September issue of v.35 of SIGACT News [1],
                 we had a very interesting communication with Dr. John
                 Hershberger related to the topic of the paper. Etude
                 was not a research paper, but presented a tutorial for
                 undergraduate students who are engaged with programming
                 contests (like ACM ICPC). The tutorial was a part of a
                 special undergraduate course at Novosibirsk State
                 University (Russia) and was based on E. Dijkstra's
                 heuristic search solution of non-crossing matching
                 problem on the plane.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2005:BRBa,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{Proofs that Really Count:
                 The Art of Combinatorial Proof}}, by Arthur T. Benjamin
                 and Jennifer J. Quinn; MAA, 2003}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "12--14",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052800",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Gasarch05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Benjamin:2003:PRC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kindahl:2005:BRB,
  author =       "Mats Kindahl",
  title =        "Book Review: {{\booktitle{Types and Programming
                 Languages}}, by Benjamin C. Pierce; The MIT Press,
                 2002}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "15--20",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052801",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Kindahl05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pierce:2002:TPL}.",
  abstract =     "Type systems and type checking are playing an
                 increasingly important role in the development of
                 programming languages. Almost every programming
                 language developed today are developed with type
                 systems as an integral part of the language.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moss:2005:JRB,
  author =       "Lawrence S. Moss",
  title =        "Joint review of {{\booktitle{Introduction To Natural
                 Computation}}, by Dana H. Ballard; MIT Press, 1997,
                 ISBN 0-262-52258-6 and \booktitle{Mathematical Methods
                 in Artificial Intelligence}, by Edward A. Bender, IEEE
                 Press, 1996, ISBN 0-8186-7200-5}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "21--24",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052802",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Moss05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Ballard:1997:INC}.",
  abstract =     "One of the interesting trends in theoretical computer
                 science in recent years is the turn towards new
                 application areas. It is not strange to see career
                 shifts from complexity theory to cryptography, from
                 type theory to security, from formal language theory to
                 computational biology. The trend is reflected in
                 journals as well. For example, the
                 newly-open-for-business electronic journal Logical
                 Methods in Computer Science has editors in the
                 ``emerging topics'' of quantum computation and logic,
                 and in computational systems in biology. Theoretical
                 Computer Science recently added to its two sections
                 (algorithms, automata, complexity and games; and logic,
                 semantics and theory of programming) a third section
                 entitled ``Natural Computing''. This ``is devoted to
                 the study of computing occurring in nature and
                 computing inspired by nature. \ldots{} it will contain
                 papers dealing with the theoretical issues in
                 evolutionary computing, neural networks, molecular
                 computing, and quantum computing.'' (Interestingly,
                 SIGACT News seems to be immune from this trend, at
                 least so far.) Finally, we turn from official journals
                 to decidedly unofficial sources: weblogs summaries of
                 panel discussions at conferences. On May 14, 2004, the
                 Columbia/IBM Research/NYU Theory Day held a panel on
                 ``The Future of CS Theory.'' As reported in Lance
                 Fornow's Computational Complexity Web Log, Richard Karp
                 ``highlighted three areas of interest for the future:
                 (1) the study of large scale distributed systems such
                 as the Web, incorporating ideas from economics and game
                 theory; (2) connections with areas of natural science,
                 ranging from statistical physics to quantum mechanics
                 to biology; and (3) the 'new face' of AI in which
                 stochastic and graphical models and statistical
                 inference are playing a big role.''",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aaronson:2005:GCN,
  author =       "Scott Aaronson",
  title =        "Guest Column: {NP}-complete problems and physical
                 reality",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "30--52",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052804",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Aaronson05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2005:GCN,
  author =       "Sergio Rajsbaum",
  title =        "Guest {Column}: {NP}-complete problems and physical
                 reality",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "30--52",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052804",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Can NP-complete problems be solved efficiently in the
                 physical universe? I survey proposals including soap
                 bubbles, protein folding, quantum computing, quantum
                 advice, quantum adiabatic algorithms,
                 quantum-mechanical nonlinearities, hidden variables,
                 relativistic time dilation, analog computing,
                 Malament-Hogarth spacetimes, quantum gravity, closed
                 timelike curves, and ``anthropic computing.'' The
                 section on soap bubbles even includes some
                 ``experimental'' results. While I do not believe that
                 any of the proposals will let us solve NP-complete
                 problems efficiently, I argue that by studying them, we
                 can learn something not only about computation but also
                 about physics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2005:SIF,
  author =       "Marek Chrobak",
  title =        "A short introduction to failure detectors for
                 asynchronous distributed systems",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "53--70",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052806",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Since the first version of Chandra and Toueg's seminal
                 paper titled ``Unreliable failure detectors for
                 reliable distributed systems'' in 1991, the failure
                 detector concept has been extensively studied and
                 investigated. This is not at all surprising as failure
                 detection is pervasive in the design, the analysis and
                 the implementation of a lot of fault-tolerant
                 distributed algorithms that constitute the core of
                 distributed system middleware. The literature on this
                 topic is mostly technical and appears mainly in
                 theoretically inclined journals and conferences. The
                 aim of this paper is to offer an introductory survey to
                 the failure detector concept for readers who are not
                 familiar with it and want to quickly understand its
                 aim, its basic principles, its power and limitations.
                 To attain this goal, the paper first describes the
                 motivations that underlie the concept, and then surveys
                 several distributed computing problems showing how they
                 can be solved with the help of an appropriate failure
                 detector. So, this short paper presents motivations,
                 concepts, problems, definitions, and algorithms. It
                 does not contain proofs. It is aimed at people who want
                 to understand basics of failure detectors.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Raynal:2005:SIF,
  author =       "M. Raynal",
  title =        "A short introduction to failure detectors for
                 Asynchronous Distributed Systems",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "53--70",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052806",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Distributed/wiesmann.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Since the first version of Chandra and Toueg's seminal
                 paper titled ``Unreliable failure detectors for
                 reliable distributed systems'' in 1991, the failure
                 detector concept has been extensively studied and
                 investigated. This is not at all surprising as failure
                 detection is pervasive in the design, the analysis and
                 the implementation of a lot of fault-tolerant
                 distributed algorithms that constitute the core of
                 distributed system middleware. The literature on this
                 topic is mostly technical and appears mainly in
                 theoretically inclined journals and conferences. The
                 aim of this paper is to offer an introductory survey to
                 the failure detector concept for readers who are not
                 familiar with it and want to quickly understand its
                 aim, its basic principles, its power and limitations.
                 To attain this goal, the paper first describes the
                 motivations that underlie the concept, and then surveys
                 several distributed computing problems showing how they
                 can be solved with the help of an appropriate failure
                 detector. So, this short paper presents motivations,
                 concepts, problems, definitions, and algorithms. It
                 does not contain proofs. It is aimed at people who want
                 to understand basics of failure detectors.",
  acknowledgement = ack-nhfb,
  date-added =   "2005-09-20 10:46:44 +0900",
  date-modified = "2005-11-02 15:24:18 +0900",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  keywords =     "failure detection",
  language =     "English",
}

@Article{Reynal:2005:SIF,
  author =       "Michel Reynal",
  title =        "A short introduction to failure detectors for
                 asynchronous distributed systems",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "53--70",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052806",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Reynal05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jawor:2005:TDP,
  author =       "Wojciech Jawor",
  title =        "Three dozen papers on online algorithms",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "71--85",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052808",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Jawor05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:TDP,
  author =       "Riccardo Pucella",
  title =        "Three dozen papers on online algorithms",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "71--85",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052808",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column contains a summary of last year's research
                 on online algorithms presented at the STOC, FOCS,
                 ICALP, ESA, and STACS conferences. Unfortunately, due
                 to space constraints, the report could not be entirely
                 exhaustive, and results from other conferences or
                 journal articles are not covered. We hope that all
                 readers will find in the survey something of interest,
                 to fill those long winter evenings. The papers in the
                 report are organized roughly by applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:FIT,
  author =       "Riccardo Pucella",
  title =        "The finite and the infinite in temporal logic",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "86--99",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052810",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Pucella05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "At the last TACAS in Barcelona, already almost a year
                 ago, Alur, Etessami, and Madhusudan [2004] introduced
                 CaRet, a temporal logic framework for reasoning about
                 programs with nested procedure calls and returns. The
                 details of the logic were themselves interesting (I
                 will return to them later), but a thought struck me
                 during the presentation, whether an axiomatization
                 might help understand the new temporal operators
                 present in CaRet. Thinking a bit more about this
                 question quickly led to further questions about the
                 notion of finiteness and infinity in temporal logic as
                 it is used in Computer Science. This examination of the
                 properties of temporal logic operators under finite and
                 infinite interpretations is the topic that I would like
                 to discuss here. I will relate the discussion back to
                 CaRet towards the end of the article, and derive a
                 sound and complete axiomatization for an important
                 fragment of the logic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Feitelson:2005:DLJ,
  author =       "Dror G. Feitelson and Ahuva W. Mu'alem",
  title =        "On the Definition of ``On-Line'' in Job Scheduling
                 Problems",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "122--131",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052797",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#FeitelsonM05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/wlmod.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/workload.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The conventional model of on-line scheduling
                 postulates that jobs have non-trivial release dates,
                 and are not known in advance. However, it fails to
                 impose any stability constraints, leading to algorithms
                 and analyses that must deal with unrealistic load
                 conditions arising from trivial release dates as a
                 special case. In an effort to make the model more
                 realistic, we show how stability can be expressed as a
                 simple constraint on release times and processing
                 times. We then give empirical and theoretical
                 justifications that such a constraint can close the gap
                 between the theory and practice. As it turns out, this
                 constraint seems to trivialize the scheduling
                 problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ylikoski:2005:HPF,
  author =       "Antti Ylikoski",
  title =        "The halting problem on finite and infinite computers",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "1",
  pages =        "132--138",
  month =        mar,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1052796.1052798",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ylikoski05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper discusses some points originally raised by
                 Robert L. Massey of Colorado, USA, and some
                 consequences of that discussion. Firstly, earthly (ie.
                 realistic) computers are finite because the number of
                 atoms on Earth is finite. Secondly, and the main result
                 of the paper is that, the famous Halting Problem is
                 unsolvable only for infinite machines. In the end of
                 the paper there are some thoughts about the
                 consequences of these results, such as a suggestion to
                 improve the classical Linear Bounded Automaton model.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2005:BRCa,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "3--4",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067313",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Gasarch05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2005:BRBb,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{Cryptological Mathematics}},
                 by Robert Lewand; MAA, 2000, \$33.95, Softcover}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "4--7",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067314",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Gasarch05b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lewand:2000:CM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papanikolaou:2005:BRBa,
  author =       "Nikolaos Papanikolaou",
  title =        "Book Review: {{\booktitle{Data Privacy and Security}},
                 by David Salomon; Spring-Verlag, 2003, \$51.48,
                 Hardcover}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "8--13",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067315",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Papanikolaou05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Salomon:2003:DPS}.",
  abstract =     "The field of cryptology and data security hardly needs
                 any introduction; numerous popular accounts of the
                 subject have appeared over the years, and it is already
                 a core topic in undergraduate computer science. The
                 very term ``cryptology'' is testimony to the long
                 history of the field; the term is derived from the
                 words \kappa \sigma \nu \pi \tau {\'o}s (meaning
                 hidden), and \lambda {\'o} \gamma os (meaning speech),
                 which have retained their meaning in the Greek language
                 for many centuries.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2005:CBR,
  author =       "Jonathan Katz",
  title =        "Comparative book review: {{\booktitle{Cryptography: An
                 Introduction}}, by V. V. Yaschenko (American
                 Mathematical Society, 2002); \booktitle{Cryptanalysis
                 of Number Theoretic Ciphers}, by S. S. Wagstaff, Jr.
                 (Chapman \& Hall\slash CRC Press, 2003); \booktitle{RSA
                 and Public-Key Cryptography}, by R. A. Mollin (Chapman
                 \& Hall/CRC Press, 2003); \booktitle{Foundations of
                 Cryptography, vol. 1: Basic Tools}, by O. Goldreich,
                 (Cambridge University Press, 2001)}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "14--19",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067316",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Katz05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Goldreich:2001:FCB,Wagstaff:2003:CNT,Mollin:2003:RPK}.",
  abstract =     "With the growing interest in cryptography --- from
                 students and researchers as well as from the general
                 public --- there has been a corresponding increase in
                 the number of cryptography textbooks available. Many of
                 these, however, remain somewhat mired in the past, and
                 present cryptography from a pre-1980s point of view.
                 Indeed, there are very few published books which even
                 make an attempt (let alone a successful one) at
                 covering modern cryptography. This unfortunate state of
                 affairs results in a serious lack of books describing
                 the fundamental advances in the field that have taken
                 place since the mid-1980's; this is especially true at
                 the undergraduate and beginning graduate levels, where
                 there is a severe need for suitable texts in this area.
                 The central contributions of modern (i.e., post-1980)
                 cryptography include an emphasis on precise
                 definitions, formalizations of cryptographic goals, and
                 provably-secure constructions of higher-level tasks
                 (e.g., signatures) from lower-level primitives (e.g.,
                 one-way functions). Without precise definitions and
                 rigorous proofs of security, cryptography is reduced to
                 a ``game'' in which the goal is merely to design a
                 scheme that one's friend or colleague cannot ``break''.
                 Any exposition of cryptography failing to recognize and
                 emphasize the difference between the former and the
                 latter approaches misses a substantial fraction of what
                 current cryptographic research is about, and is a
                 disservice to the field. Sadly, however, almost all
                 cryptography textbooks of which I am aware fall into
                 this category. A classic example of the problems with
                 an ``ad-hoc'' approach to cryptography is the following
                 simple test I often use to discriminate ``good''
                 cryptography books from ``poor'' ones: flip to the
                 section on digital signatures and see whether it is
                 stated anywhere that ``textbook RSA'' signatures are
                 completely insecure. It is a simple exercise to show
                 that this is the case (the same holds for ``textbook
                 RSA'' encryption, but it is somewhat more difficult to
                 demonstrate), yet most books make no mention of this
                 (central!) fact, and instead leave the reader with the
                 impression that secure signature schemes based on the
                 RSA problem are easy to design. Some might argue that
                 there is no place for rigorous definitions and proofs
                 in a book directed toward undergraduates, but I take
                 this misconception as a thinly-guised insult to
                 undergraduate computer science majors. Undergraduates
                 in other majors are taught quantum mechanics,
                 thermodynamics, analysis, and abstract algebra, to name
                 a few, all difficult subjects that are taught
                 rigorously (to varying degrees, perhaps). Why should an
                 undergraduate course on cryptography be expected to be
                 any less rigorous than these? Continuing the
                 disappointing trend discussed above, neither of the
                 first three books reviewed here qualify as (what I
                 would consider) appropriate for introducing the
                 interested reader to the field of cryptography.
                 Cryptography: An Introduction gets a number of things
                 right, but overall is a muddled, poorly written, and
                 disorganized text whose intended audience is unclear.
                 Cryptanalysis\ldots{} is a useful book which I am glad
                 to have on my shelf, but it fails at its stated goal of
                 serving as a suitable text for an introductory
                 cryptography course. It would serve better as a book on
                 elementary number theory (with applications to
                 cryptography, perhaps), and I wish it had been
                 advertised and organized as such. A somewhat similar
                 book, RSA and Public-Key Cryptography suffers from the
                 same criticisms; furthermore, I found its treatment of
                 number theory to be not quite on par with that in
                 Wagstaff's book. In contrast to these, Foundations of
                 Cryptography presents a clear and accurate picture of
                 the foundations underlying modern cryptography; in
                 fact, it is currently the only published book I am
                 aware of which does so. Its primary drawback is that it
                 is likely to be inaccessible to the beginning student;
                 it is more appropriate for a researcher or an advanced
                 graduate student who has previously been exposed to the
                 basics of cryptography, either of whom would benefit
                 from a careful reading of this book cover-to-cover.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khot:2005:GCI,
  author =       "Subhash Khot",
  title =        "Guest column: inapproximability results via {Long
                 Code} based {PCPs}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "25--42",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067318",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Khot05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2005:GCI,
  author =       "Samir Khuller",
  title =        "Guest column: inapproximability results via {Long
                 Code} based {PCPs}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "25--42",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067318",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Summer has come again. And what better way is there to
                 spend a summer than to relax on a sandy beach, on a
                 mountain top, or at a park's picnic tables, and\ldots{}
                 think theory! Summer is a particularly good time to
                 attack the big questions whose openness just plain
                 annoys you. In light of Reingold's L = SL result, does
                 L-vs.-RL tempt you? If so, take it on! (But perhaps
                 peek first at Reingold--Trevisan--Vadhan's ECCC
                 TR05-022.) Are you convinced that UP = NP should imply
                 the collapse of the polynomial hierarchy? Make it so!
                 (But if you hope to do so via showing that UP is
                 contained in the low hierarchy, peek first at
                 Long--Sheu's 1996 MST article.) You know that S2
                 \subseteq S$^{NP \cap coNP}$ 2 \subseteq ZPP$^{NP}$ and
                 S$^{NP}$ 2 \subseteq ZPP$^{NP NP}$, but believe that
                 some of those ``\subseteq''s are ``=''s or are (gasp!)
                 provably strict containments (thus giving some insight
                 into whether recent improvements (Cai in FOCS 2001; Cai
                 et al. in Information and Computation 2005) in the
                 collapses of the polynomial hierarchy from assumptions
                 that NP is in P/poly, (NP \cap coNP)/poly, or coNP/poly
                 are strict improvements)? Well, prove an ``='' or find
                 evidence for a strict containment\ldots{} or to really
                 make this a summer for us all to remember, prove a
                 strict containment! Wishing you happy theorems. This
                 article gives an overview of recent PCP constructions
                 based on the Long Code and the inapproximability
                 results implied by these constructions. We cover the
                 inapproximability results for (1) MAX-3SAT and CLIQUE
                 (2) Results for SPARSEST CUT, VERTEX COVER and MAX-CUT
                 implied by the Unique Games Conjecture and (3)
                 HYPERGRAPH VERTEX COVER and coloring problems on
                 hypergraphs. The article aims at explaining the general
                 framework that, loosely speaking, incorporates all the
                 above results.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2005:FCS,
  author =       "Samir Khuller",
  title =        "Four colors suffice!",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "43--44",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067320",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Khuller05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2005:FCS,
  author =       "Sergio Rajsbaum",
  title =        "Four colors suffice!",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "43--44",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067320",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is a review of the recent book
                 \booktitle{Four Colors Suffice}, by Robin Wilson (used
                 copies available on Amazon for \$11.50) that might
                 interest the readers of this column since it's almost
                 three decades since the result was proven by Appel and
                 Haken.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2005:AFI,
  author =       "Marek Chrobak",
  title =        "Algorithmic foundations of the {Internet}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "45--62",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067322",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this paper we survey the field of Algorithmic
                 Foundations of the Internet, which is a new area within
                 theoretical computer science. We consider six sample
                 topics that illustrate the techniques and challenges in
                 this field.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lopez-Ortiz:2005:AFI,
  author =       "Alejandro L{\'o}pez-Ortiz",
  title =        "Algorithmic foundations of the internet",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "45--62",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067322",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Lopez-Ortiz05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Irani:2005:APP,
  author =       "Sandy Irani and Kirk Pruhs",
  title =        "Algorithmic problems in power management",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "63--76",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067324",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#IraniP05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:APP,
  author =       "Riccardo Pucella",
  title =        "Algorithmic problems in power management",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "63--76",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067324",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We survey recent research that has appeared in the
                 theoretical computer science literature on algorithmic
                 problems related to power management. We will try to
                 highlight some open problem that we feel are
                 interesting. This survey places more concentration on
                 lines of research of the authors: managing power using
                 the techniques of speed scaling and power-down which
                 are also currently the dominant techniques in
                 practice.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:LVE,
  author =       "Riccardo Pucella",
  title =        "Logical verification and equational verification",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "77--88",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067326",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Pucella05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There were some errors in the last article of the
                 Logic Column. Thanks to Claudia Zepeda for spotting
                 them. They have been corrected in the online version of
                 the article, available from the CORR archive at
                 http://arxiv.org/abs/cs.LO/0502031. All articles
                 published in this column are archived at CORR; the
                 following URL will return them all:
                 http://arxiv.org/find/grp_cs/1/ti:+AND+logic+column.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ferreira:2005:SRC,
  author =       "Ulisses Ferreira",
  title =        "The sets of real and complex numbers are denumerable",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "126--130",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067310",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ferreira05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This short article demonstrates that both the sets of
                 real and complex numbers are actually denumerable,
                 which means that those numeric sets, as well as the set
                 of natural numbers, actually have the same cardinality,
                 hence there exists a unique transfinite number.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tay:2005:WSC,
  author =       "Y. C. Tay",
  title =        "What should computer science students learn from
                 mathematics?",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "2",
  pages =        "131--143",
  month =        jun,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1067309.1067311",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Tay05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There is an important difference between the title and
                 ``What Mathematics should Computer Science students
                 learn?'' This talk addresses both questions. To do so,
                 it brings together some examples that illustrate the
                 current state of computer science and information
                 technology.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2005:BRCb,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "4--5",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086653",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Gasarch05c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papanikolaou:2005:BRBb,
  author =       "Nikolaos Papanikolaou",
  title =        "Book Review: {{\booktitle{Classical and Quantum
                 Computing with C++ and Java Simulations}}, by Yorick
                 Hardy and Willi-Hans Steeb, Birkh{\"a}user Verlag,
                 2001}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "5--9",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086654",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Papanikolaou05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hardy:2001:CQC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chapin:2005:BRB,
  author =       "E. Jonathan Chapin",
  title =        "Book Review: {{\booktitle{Integer Programming}}, by
                 Laurence A. Wolsey, Wiley and Sons 1998}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "10--12",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Chapin05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wolsey:1998:IP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Essl:2005:BRB,
  author =       "Georg Essl",
  title =        "Book Review: {{\booktitle{Computational Line
                 Geometry}}, by H. Pottmann and J. Wallner, Springer
                 Verlag, 2001}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "13--17",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086656",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Essl05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pottmann:2001:CLG,Pottmann:2009:CLG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:BRB,
  author =       "Riccardo Pucella",
  title =        "Book Review: {{\booktitle{Logic for Computer
                 Scientists}}, by Uwe Sch{\"o}ning, Birkh{\"a}user,
                 1994}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "17--19",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086657",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Pucella05b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Schoning:2008:LCS,Schoning:1989:LCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Glenn:2005:BRB,
  author =       "James Glenn",
  title =        "Book Review: {{\booktitle{Teaching Statistics Using
                 Baseball}}, by Jim Albert, MAA, 2003}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "19--21",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086658",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Glenn05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Albert:2003:TSU}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2005:TRC,
  author =       "Lane Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "22--23",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086660",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2005:TRC,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "22--23",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086660",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Kelley05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2005:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 48",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "24--38",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086662",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Hemaspaandra05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Viann:2005:SNC,
  author =       "Victor Viann",
  title =        "{SIGACT} news complexity theory column 48",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "24--38",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086662",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Here is a real gift to the field from David Johnson:
                 After a thirteen year intermission, David is restarting
                 his NP-completeness column. His column will now appear
                 about twice yearly in ACM Transactions on Algorithms.
                 Welcome back David, and thanks! And for those for whom
                 a diet of two per year wont do, meals past can be found
                 at http://www.research.att.com/~dsj/columns.html.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Afrati:2005:RP,
  author =       "Foto N. Afrati",
  title =        "Report on {PODS 2005}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "39--40",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086664",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Afrati05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2005:RP,
  author =       "Sergio Rajsbaum",
  title =        "Report on {PODS} 2005",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "39--40",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086664",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:ASN,
  author =       "Riccardo Pucella",
  title =        "{ACM SIGACT} news distributed computing column 19",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "41--50",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue consists of:o ``A review of the SIROCCO 2005
                 conference,'' by Corentin Travers. Many thanks to
                 Corentin for his contribution to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2005:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 19",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "41--50",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Rajsbaum05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2005:SNL,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news logic column 13",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "51--66",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For this issue, Nick Papanikolaou brings us an
                 introduction to the subject of quantum logic and a
                 survey of the relevant literature, including a
                 discussion of logics for specification and analysis of
                 quantum information systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:SNLa,
  author =       "Riccardo Pucella",
  title =        "{SIGACT} news logic column 13",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "51--66",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Pucella05c;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2005:SNO,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 8",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "67",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Chrobak05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dorrigiv:2005:SPM,
  author =       "Reza Dorrigiv and Alejandro L{\'o}pez-Ortiz",
  title =        "A Survey of Performance Measures for On-line
                 Algorithms",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "67--81",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Chrobak05;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2005:SNO,
  author =       "Rocky Ross",
  title =        "{SIGACT} news online algorithms column 8",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "67--81",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Pros and cons of the competitive analysis have been
                 discussed in the literature by many authors. Continuing
                 this discussion in this quarter's column, Reza Dorrigiv
                 and Alejandro Lopez-Ortiz review and compare various
                 performance measures for online algorithms,
                 highlighting their differences with respect to the
                 competitive ratio. Many thanks to Reza and Alejandro
                 for contributing this article.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2005:EFT,
  author =       "Rocky Ross",
  title =        "Education forum: trying again with {MathML}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "82--84",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086672",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ross05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Every so often I revisit the state of the art with
                 respect to the creation of web pages that include
                 mathematics, and the rendering of those pages in
                 standard browsers. I think that the last full treatment
                 I gave to the topic was in the spring 2003 column.
                 There is some good news to report.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2005:T,
  author =       "Rocky Ross",
  title =        "Textbooks",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "84--93",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086674",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ross05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Two textbooks are previewed this time. One is Logic in
                 Computer Science: Modelling and Reasoning about
                 Systems, Second Edition by Michael Huth and Mark Ryan
                 of the Imperial College of Science, Technology, and
                 Medicine, London and the University of Birmingham,
                 respectively. Michael helped me get the format right
                 for the News, which was greatly appreciated. The other
                 is A Computational Introduction to Number Theory and
                 Algebra by Victor Shoup of New York University.
                 Enjoy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreinovich:2005:KCL,
  author =       "Vladik Kreinovich and Luc Longpr{\'e}",
  title =        "{Kolmogorov} complexity leads to a representation
                 theorem for idempotent probabilities (sigma-maxitive
                 measures)",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "107--112",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086650",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#KreinovichL05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In many application areas, it is important to consider
                 maxitive measures (idempotent probabilities), i.e.,
                 mappings $m$ for which $ m(A \cup B) = \max (m(A),
                 m(B))$. In his papers, J. H. Lutz has used Kolmogorov
                 complexity to show that for constructively defined sets
                 $A$, one maxitive measure --- fractal dimension --- can
                 be represented as $ m(A) = \sup f(x)$. We show that a
                 similar representation is possible for an arbitrary
                 maxitive measure.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-Amram:2005:CTT,
  author =       "Amir M. Ben-Amram",
  title =        "The {Church--Turing} thesis and its look-alikes",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "3",
  pages =        "113--114",
  month =        sep,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1086649.1086651",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:27 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ben-Amram05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A function is mechanically computable (that is:
                 computable by means of a machine) if and only if it is
                 Turing-computable.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2005:BRCc,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107528",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Gasarch05d;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2005:BRB,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Data Structures, Near
                 Neighbor Searches, and Methodology: Fifth and Sixth
                 DIMACS Implementation Challenge}}, by Michael H.
                 Goldwasser, David S. Johnson, Catherine C. McGeoch,
                 American Mathematical Society 2002}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "5--8",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107529",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Dave05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Goldwasser:2002:DSN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wan:2005:BRB,
  author =       "Raymond Wan",
  title =        "Book Review: {{\booktitle{Genomic Perl From
                 Bioinformatics Basics to Working Code}}, by Rex A.
                 Dwyer, Cambridge University Press 2003,
                 0-521-80177-X}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "9--12",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107530",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Wan05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dwyer:2003:GPB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fahle:2005:BRB,
  author =       "William Fahle",
  title =        "Book Review: {{\booktitle{Graphs, Networks, and
                 Algorithms}} (second edition) by Dieter Jungnickel,
                 Springer-Verlag 2005}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "12--14",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107531",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Fahle05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Jungnickel:1999:GNA,Jungnickel:2005:GNA,Jungnickel:2008:GNA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zhao:2005:BRB,
  author =       "Wenzhong Zhao",
  title =        "Book Review: {{\booktitle{Immunocomputing: Principles
                 and Applications}}, by Alexander O. Tarakanov, Victor
                 A. Skormin, Svetlana P. Sokolova, Springer-Verlag New
                 York, Inc. 2003}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "14--17",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107532",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Zhao05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Tarakanov:2003:IPA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Loulergue:2005:BRB,
  author =       "Fr{\'e}d{\'e}ric Loulergue",
  title =        "Book Review: {{\booktitle{Term Rewriting Systems}}, by
                 Terese, Cambridge University Press 2003,
                 0-521-39115-6}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "17--20",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107533",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Loulergue05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bezem:2003:TRS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2005:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 49",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "24--35",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107535",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Hemaspaandra05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Warmest thanks to Neil Immerman for this issue's
                 column, which is on Progress in Descriptive Complexity.
                 (As you can see in this column, Neil is the rare writer
                 whose italic lines truly deserve the italics.) This
                 issue should reach your hands shortly before winter
                 intersession, and I'd highly recommend that, if you
                 don't already own Neil's wonderful book Descriptive
                 Complexity ([I] in this column's bibliography), you
                 consider visiting your school's library and bringing it
                 home for holidays.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2005:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 20",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "36--46",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107536",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Rajsbaum05a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue consists of:o ``A review of the DISC 2005
                 conference,'' by Dariusz Kowalski. Many thanks to
                 Dariusz for his contribution to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2005:SNLb,
  author =       "Riccardo Pucella",
  title =        "{SIGACT} news logic column 14",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "47--69",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107537",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Pucella05d;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For this issue, James Cheney describes nominal logic,
                 an approach to solve the problems involved with
                 reasoning about bindings in formal languages that has
                 been gaining in popularity in recent years, and surveys
                 its major application areas.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ross:2005:EF,
  author =       "Rocky Ross",
  title =        "Education forum",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "70--71",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107539",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Ross05b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It's happened to all of us. The moment to log out just
                 kind of sneaks up on us, not paying much heed to any
                 timing of our own. One instant we are logged on, the
                 next instant we're off.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dantsin:2005:QVR,
  author =       "Evgeny Dantsin and Vladik Kreinovich and Alexander
                 Wolpert",
  title =        "On quantum versions of record-breaking algorithms for
                 {SAT}",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "103--108",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107524",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#DantsinKW05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is well known that a straightforward application of
                 Grover's quantum search algorithm enables to solve SAT
                 in $ O(2^{n / 2}) $ steps. Ambainis (SIGACT News, 2004)
                 observed that it is possible to use Grover's technique
                 to similarly speed up a sophisticated algorithm for
                 solving 3-SAT. In this note, we show that a similar
                 speed up can be obtained for all major record-breaking
                 algorithms for satisfiability. We also show that if we
                 use Grover's technique only, then we cannot do better
                 than quadratic speed up.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kantorovitz:2005:NTM,
  author =       "Isaiah Pinchas Kantorovitz",
  title =        "A note on {Turing} machine computability of rule
                 driven systems",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "109--110",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107525",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Kantorovitz05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An abstract rule driven system is described. We prove
                 that it is calculated by a restricted Turing Machine.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Roughgarden:2005:IVT,
  author =       "Tim Roughgarden",
  title =        "An interview with {Vladimir Trifonov 2005 Danny Lewin
                 Best Student Paper Award} winner",
  journal =      j-SIGACT,
  volume =       "36",
  number =       "4",
  pages =        "111--114",
  month =        dec,
  year =         "2005",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1107523.1107526",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Roughgarden05;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2005 Danny Lewin Prize for the best student paper
                 at STOC was awarded to Vladimir Trifonov, of the
                 University of Texas at Austin, for his paper ``An $
                 O(\log n \log \log n) $ Space Algorithm for Undirected
                 st-Connectivity'' [1]. Hal Gabow recently started the
                 tradition of interviewing the Danny Lewin Prize winner
                 and publishing the interview in SIGACT News. (An
                 interview with the 2003 winner Tom Hayes can be found
                 in the September 2003 issue.) I had the pleasure of
                 (electronically) chatting with Vladimir about his work;
                 a transcript of our conversation follows.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:BRCa,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122482",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Gasarch06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2006:BRBa,
  author =       "Jonathan Katz",
  title =        "Book Review: {{\booktitle{A Computational Introduction
                 to Number Theory and Algebra}}, by Victor Shoup,
                 Cambridge University Press, 2005}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "12--13",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122483",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Katz06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shoup:2005:CIN,Shoup:2009:CIN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2006:BRBb,
  author =       "Jonathan Katz",
  title =        "Book Review: {{\booktitle{Primality Testing in
                 Polynomial Time}}, by Martin Dietzfelbinger,
                 Springer-Verlag, 2004}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "14--15",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Katz06a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dietzfelbinger:2004:PTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Springer:2006:BRB,
  author =       "William M. {Springer II}",
  title =        "Book Review: {{\booktitle{Introduction to Coding
                 Theory}}, by Juergen Bierbrauer, Chapman and Hall\slash
                 CRC, 2005, ISBN 1-58488-421-5}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "16--18",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122485",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Springer06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bierbrauer:2005:ICT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bender:2006:BRB,
  author =       "Adam Bender",
  title =        "Book Review: {{\booktitle{Codes: The Guide to Secrecy
                 from Ancient to Modern Times}}, by Richard A. Mollin,
                 Chapman \& Hall\slash CRC, 2005}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "18--21",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122486",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Bender06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mollin:2005:CGS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Oliveira:2006:BRB,
  author =       "Carlos A. S. Oliveira",
  title =        "Book Review: {{\booktitle{Computational Complexity: a
                 Quantitative Perspective}}, by Marius Zimand, Elsevier,
                 ISBN 0-444-82841-9}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "21--25",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122487",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Oliveira06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Zimand:2004:CCQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2006:BRBa,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Secure Communicating
                 Systems: Design, analysis, and implementation}}, by
                 Michael R. A. Huth, Cambridge University Press, 2001}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "26--27",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Dave06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Huth:2001:SCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lescanne:2006:BRB,
  author =       "Pierre Lescanne",
  title =        "Book Review: {{\booktitle{Alfred Tarski: Life and
                 Logic}}, by Anita Burdman Feferman and Solomon
                 Feferman, Cambridge University Press 2004}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "27--28",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122489",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Lescanne06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Feferman:2004:ATL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2006:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "29--32",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kelley06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2006:TRC,
  author =       "Samir Khuller",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "29--32",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2006:AAS,
  author =       "Lane Hemaspaandra",
  title =        "Approximation algorithms for $2$-stage stochastic
                 optimization problems",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "33--46",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Uncertainty is a facet of many decision environments
                 and might arise for various reasons, such as
                 unpredictable information revealed in the future, or
                 inherent fluctuations caused by noise. Stochastic
                 optimization provides a means to handle uncertainty by
                 modeling it by a probability distribution over possible
                 realizations of the actual data, called scenarios. The
                 field of stochastic optimization, or stochastic
                 programming, has its roots in the work of Dantzig [4]
                 and Beale [1] in the 1950s, and has since increasingly
                 found application in a wide variety of areas, including
                 transportation models, logistics, financial
                 instruments, and network design. An important and
                 widely-used model in stochastic programming is the
                 2-stage recourse model: first, given only
                 distributional information about (some of) the data,
                 one commits on initial (first-stage) actions. Then,
                 once the actual data is realized according to the
                 distribution, further recourse actions can be taken (in
                 the second stage) to augment the earlier solution and
                 satisfy the revealed requirements. The aim is to choose
                 the initial actions so as to minimize the expected
                 total cost incurred. The recourse actions typically
                 entail making decisions in rapid reaction to the
                 observed scenario, and are therefore more costly than
                 decisions made ahead of time. Thus there is a trade-off
                 between committing initially, having only imprecise
                 information while incurring a lower cost, and deferring
                 decisions to the second-stage, when we know the input
                 precisely but the costs are higher. Many applications
                 can be modeled this way, and much of the textbook of
                 Birge and Louveaux [2] is devoted to models and
                 algorithms for this class of problems. A commonly cited
                 example involves a setting where a company has to
                 decide where to set up facilities to serve client
                 demands. Typically the demand pattern is not known
                 precisely at the outset, but one might be able to
                 obtain, through simulation models or surveys,
                 statistical information about the demands. This
                 motivates the following 2-step decision process: in the
                 first-stage, given only distributional information
                 about the demands (and deterministic data for the
                 facility opening costs), one must decide which
                 facilities to open initially; once the client demands
                 are realized according to this distribution, we can
                 extend the solution by opening more facilities,
                 incurring a recourse cost, and we have to assign the
                 realized demands to open facilities. This is the
                 2-stage stochastic uncapacitated facility location
                 problem. The recourse costs are usually higher than the
                 original ones (because opening a facility later would
                 involve deploying resources with a small lead time);
                 these costs could be different for the different
                 facilities, and could even depend on the realized
                 scenario.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Swamy:2006:ACA,
  author =       "Chaitanya Swamy and David B. Shmoys",
  title =        "Algorithms Column: Approximation algorithms for
                 $2$-stage stochastic optimization problems",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "33--46",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#SwamyS06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Faliszewski:2006:OQT,
  author =       "Piotr Faliszewski and Lane A. Hemaspaandra",
  title =        "Open questions in the theory of semifeasible
                 computation",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "47--65",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122495",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#FaliszewskiH06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2006:OQT,
  author =       "Sergio Rajsbaum",
  title =        "Open questions in the theory of semifeasible
                 computation",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "47--65",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122495",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The study of semifeasible algorithms was initiated by
                 Selman's work a quarter of century ago
                 [Sel79,Sel81,Sel82]. Informally put, this research
                 stream studies the power of those sets L for which
                 there is a deterministic (or in some cases, the
                 function may belong to one of various nondeterministic
                 function classes) polynomial-time function f such that
                 when at least one of x and y belongs to L, then f(x, y)
                 \in L \cap {x, y}. The intuition here is that it is
                 saying: ``Regarding membership in L, if you put a gun
                 to my head and forced me to bet on one of x or y as
                 belonging to L, my money would be on f(x, y).''In this
                 article, we present a number of open problems from the
                 theory of semifeasible algorithms. For each we present
                 its background and review what partial results, if any,
                 are known.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2006:TTW,
  author =       "Marek Chrobak",
  title =        "Travelling through wormholes: a new look at
                 distributed systems models",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "66--81",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122497",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The evolution of distributed computing and
                 applications has put new challenges on models,
                 architectures and systems. To name just one,
                 'reconciling uncertainty with predictability' is
                 required by today's simultaneous pressure on increasing
                 the quality of service of applications, and on
                 degrading the assurance given by the infrastructure.
                 This challenge can be mapped onto more than one facet,
                 such as time or security or others. In this paper we
                 explore the time facet, reviewing past and present of
                 distributed systems models, and making the case for the
                 use of hybrid (vs. homogeneous) models, as a key to
                 overcoming some of the difficulties faced when
                 asynchronous models (uncertainty) meet timing
                 specifications (predictability). The Wormholes paradigm
                 is described as the first experiment with hybrid
                 distributed systems models.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Verissimo:2006:TTW,
  author =       "Paulo Ver{\'i}ssimo",
  title =        "Travelling through wormholes: a new look at
                 distributed systems models",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "66--81",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122497",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Verissimo06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2006:OP,
  author =       "Marek Chrobak",
  title =        "2005: an offline persepctive",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "1",
  pages =        "82--98",
  month =        mar,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1122480.1122499",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Chrobak06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This quarter's column contains a survey of work on
                 online algorithms from last year. It covers papers from
                 the following conferences: SODA, STACS, STOC, ICALP,
                 ESA, WADS, COCOON, ISAAC, FCT, FOCS and MFCS. The
                 bibliography of online algorithms (see
                 www.cs.ucr.edu/~marek/pubs/online.bib) has been
                 updated, and it now contains all the papers discussed
                 in this survey --- and more.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:BRCb,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "10--12",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140614",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Gasarch06a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dani:2006:BRB,
  author =       "Varsha Dani",
  title =        "Book Review: {{\booktitle{Fair Division and Collective
                 Welfare}}, by Herv{\'e} Moulin, MIT Press, 2003}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "12--17",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140615",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Dani06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Moulin:2003:FDC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schmeister:2006:BRB,
  author =       "William Schmeister",
  title =        "Book Review: {{\booktitle{Algorithms: Sequential,
                 Parallel, and Distributed}}, by Kenneth A. Berman and
                 Jerome L. Paul, Thomson Course Technology, 2005}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "17--22",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140616",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Schmeister06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Berman:2005:ASP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{To:2006:BRB,
  author =       "Anthony Widjaja To",
  title =        "Book Review: {{\booktitle{Algebraic Complexity
                 Theory}}, by Peter B{\"u}rgisser, Michael Clausen and
                 Amin Shokrollahi, Springer 1997}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "22--27",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140617",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#To06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Burgisser:1997:ACT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2006:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "28--30",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140619",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kelley06a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2006:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 51",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "31--31",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140621",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Hemaspaandra06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Warmest thanks to guest columnist Oded Goldreich for
                 this issue's article. Also, I'd like to commend to all
                 readers the web directory, {\tt
                 www.wisdom.weizmann.ac.il/~oded/cc-texts.html}, that
                 appears as reference [15] of Oded's column. This
                 directory is a real treasure trove.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:2006:GCB,
  author =       "Oded Goldreich",
  title =        "Guest Column: Bravely, Moderately --- a Common Theme
                 in Four Recent Works",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "31--46",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140621",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2006:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 47",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "47--49",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140623",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#ORourke06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2006:CGCa,
  author =       "Sergio Rajsbaum",
  title =        "Computational geometry column 47",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "47--49",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140623",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A remarkable theorem is described: ``It is possible to
                 tile the plane with non-overlapping squares using
                 exactly one square of each integral dimension.'' Thus,
                 one can ``square the plane.''",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2006:ASN,
  author =       "Riccardo Pucella",
  title =        "{ACM SIGACT} news distributed computing column 22",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "50--56",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140625",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue consists of: ``Distributed Computing in India,''
                 by Sukumar Ghosh. Many thanks to Sukumar for his
                 contribution to this issue. Notice that ICDCN {\tt
                 www.icdcn.org} (International Conference on Distributed
                 Computing and Networks), formerly known as IWDC (Intl.
                 Workshop on Distributed Computing), held in India, is
                 trying to attract more PODC/DISC like papers this year.
                 The paper Submission Deadline is May 15, 2006.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2006:ASNa,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 22",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "50--56",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140625",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Rajsbaum06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2006:SNL,
  author =       "Riccardo Pucella",
  title =        "{SIGACT} news logic column 15",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "57--57",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140627",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Pucella06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Some comments about the last Logic Column, on nominal
                 logic. Pierre Lescanne points out that the terminology
                 ``de Bruijn levels'' was introduced in the paper
                 Explicit Substitutions with de Bruijn's Levels, by
                 Pierre Lescanne and Jocelyne Rouyer-Degli, presented at
                 the 1995 RTA conference. He also points out that Stoy
                 diagrams were probably invented by Stoy, but appear in
                 work by Bourbaki as early as 1939 (published in 1954).
                 Merci, Pierre. That article also initiated what is
                 bound to be an interesting discussion. The critique of
                 higher-order abstract syntax in that article prompted
                 Karl Crary and Robert Harper to prepare a response to
                 the leveled criticisms. The response should appear in
                 an upcoming Column. In this issue, Alexander Kurz
                 describes recent work on the topic of specifying
                 properties of transition systems. It turns out that by
                 giving a suitably abstract description of transition
                 systems as coalgebras, we can derive logics for
                 capturing properties of these transition systems in a
                 rather elegant way.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kurz:2006:CTL,
  author =       "Alexander Kurz",
  title =        "Coalgebras and their logics",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "2",
  pages =        "57--77",
  month =        jun,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1140612.1140628",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kurz06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:BRCc,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "14--17",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165558",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Gasarch06b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:JRB,
  author =       "William I. Gasarch",
  title =        "A joint review of {{\booktitle{Reality Conditions:
                 Short Mathematical Fiction}}, by Alex Kasman, MAA 2005;
                 \booktitle{Numb3rs}, TV show. CBS, Free. Currently
                 running Fridays at 10:00PM; \booktitle{Mathematical
                 Apocryphia: Stories and Anecdotes of Mathematicians and
                 the Mathematical}, by Steven Kranz, MAA, 2002;
                 \booktitle{Mathematical Apocryphia Redux: More Stories
                 and Anecdotes of Mathematicians and the Mathematical},
                 by Steven Kranz, MAA, 1999}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "17--19",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165559",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Gasarch06c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kasman:2005:RCS}.",
  abstract =     "I once asked a lesbian friend of mine ``what is your
                 favorite TV show?'' She said it is ``The L word'' (a
                 lesbian-themed show on HBO). She admitted that it
                 really wasn't that good, but it was about people like
                 her, and it was one of the few such shows. I approach
                 fiction (and even nonfiction) about mathematicians in
                 the same light. I give it some credit just for relating
                 to us. In this review I consider three such works and
                 ask the following questions: (1) is it fun to read (or
                 view) independent of the math? (2) does the math fit in
                 well? (3) will it get people interested in math? (4)
                 does it portray mathematics and mathematicians in an
                 accurate light (and is that a good thing)?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Blank:2006:JRB,
  author =       "Brian Blank",
  title =        "A Joint Review of {{\booktitle{A History of Pi}}, by
                 Petr Beckmann, St. Martins's Press, 1976, Barnes and
                 Noble Books, 1989; \booktitle{The Joy of Pi}, by David
                 Blatner, Walker \& Co., 1997; \booktitle{The Nothing
                 That Is}, by Robert Kaplan, Oxford University Press,
                 1999; \booktitle{$e$: The Story of a Number}, by Eli
                 Maor, Princeton University Press, 1998; \booktitle{An
                 Imaginary Tale}, by Paul Nahin, Princeton University
                 Press, 1998; \booktitle{Zero: The Biography of a
                 Dangerous Idea}, by Charles Seife, Viking Press,
                 2000}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "19--26",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165560",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Blank06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Blatner:1997:JP,Kaplan:1999:NNH,Maor:1994:SN,Nahin:1998:ITS}.",
  abstract =     "We are in the midst of an onslaught of books devoted
                 to particular numbers. In this article we will be
                 concerned with several recent and not-so-recent books
                 about pi, e, i, and 0; of the quantities in the famous
                 equation e(pi)i + 1 = 0, only 1 does not yet have its
                 book. Given the trend, we can look forward to its
                 appearance, possibly followed by volumes on ``+'' and
                 ``=''.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:BRB,
  author =       "William I. Gasarch and Alexander Kruskal and Justin
                 Kruskal and Rebecca Kruskal",
  title =        "Book Review: {{\booktitle{The Square Root of 2: A
                 Dialogue Concerning a Number and a Sequence}}, by David
                 Flannery, Copernicus Books, 2006}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "27--32",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165561",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#GasarchKKK06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Flannery:2005:SRD}.",
  abstract =     "Professor Clyde Kruskal, who works in parallelism, has
                 triplets: Alexander, Justin, and Rebecca Kruskal. They
                 are in 9th grade, have already taken elementary
                 algebra, and are taking Geometry now (this was written
                 in Spring 2006). Professor William Gasarch spoke to
                 them about the square root of 2. What follows is an
                 interpretation of their conversation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2006:TRC,
  author =       "Lane Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "33--35",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165563",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2006:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "33--35",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165563",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kelley06b;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2006:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 52",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "36--54",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165565",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Hemaspaandra06a;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2006:SNC,
  author =       "Joseph O'Rourke",
  title =        "{SIGACT} news complexity theory column 52",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "36--54",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165565",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For those who are big fans of the fantastic complexity
                 textbook by Daniel Bovet and Pierluigi Crescenzi [BC93]
                 (and I myself certainly am), there is great news. The
                 authors have made their book available online, free of
                 charge for noncommercial use. It can be found at via
                 Pilu's web site (start at {\tt
                 http://www.algoritmica.org/piluc}, then click on the
                 ``Books'' section, and then click on ``Introduction to
                 the Theory of Complexity'').",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2006:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 48",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "55--57",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165567",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#ORourke06a;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2006:CGCb,
  author =       "Sergio Rajsbaum",
  title =        "Computational geometry column 48",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "55--57",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165567",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A new class of art gallery-like problems inspired by
                 wireless localization is discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2006:WSC,
  author =       "Idit Keidar and Assaf Schuster",
  title =        "Want scalable computing?: speculate!",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "59--66",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165569",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#KeidarS06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Distributed computing is currently undergoing a
                 paradigm shift, towards large-scale dynamic systems,
                 where thousands of nodes collaboratively solve
                 computational tasks. Examples of such emerging systems
                 include autonomous sensor networks, data-grids,
                 wireless mesh network (WMN) infrastructures, and more.
                 We argue that speculative computations will be
                 instrumental to successfully performing meaningful
                 computations in such systems. Moreover, solutions
                 deployed in such platforms will need to be as local as
                 possible.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Canetti:2006:SCC,
  author =       "Ran Canetti",
  title =        "Security and composition of cryptographic protocols: a
                 tutorial (part {I})",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "67--92",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165570",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Canetti06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  added-at =     "Wed Sep 12 09:24:11 2007",
  added-by =     "msteiner",
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  online =       "Available also at the Cryptology ePrint Archive,
                 Report 2006/465 (\url{http://eprint.iacr.org/2006})",
}

@Article{Pucella:2006:SCC,
  author =       "Riccardo Pucella",
  title =        "Security and composition of cryptographic protocols: a
                 tutorial {(Part I)}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "67--92",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165570",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "What does it mean for a cryptographic protocol to be
                 ``secure''? Capturing the security requirements of
                 cryptographic tasks in a meaningful way is a slippery
                 business: On the one hand, we want security criteria
                 that prevent ``all potential attacks'' against a
                 protocol; on the other hand, we want our criteria not
                 to be overly restrictive and accept ``reasonable
                 protocols''. One of the main reasons for flaws is the
                 often unexpected interactions among different protocol
                 instances that run alongside each other in a composite
                 system. This tutorial studies a general methodology for
                 defining security of cryptographic protocols. The
                 methodology, often dubbed the ``trusted party
                 paradigm'', allows for defining the security
                 requirements of a large variety of cryptographic tasks
                 in a unified and natural way. We first review more
                 basic formulations that capture security in isolation
                 from other protocol instances. Next we address the
                 security problems associated with protocol composition,
                 and review formulations that guarantee security even in
                 composite systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Crary:2006:HOA,
  author =       "Karl Crary and Robert Harper",
  title =        "Higher-order abstract syntax: setting the record
                 straight",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "93--96",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165572",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#CraryH06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A recent SIGACT News Logic column, guest-written by
                 James Cheney DOI = 10.1145/1107523.1107537, discussed
                 nominal logic [1], an approach to abstract syntax with
                 binding structure. In addition to providing a worthy
                 tutorial on nominal logic, that column leveled five
                 criticisms at higher-order abstract syntax, an
                 alternative approach for dealing with binding structure
                 in abstract syntax. We argue below that three of those
                 criticisms are factually inaccurate, and the other two
                 are misguided.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreinovich:2006:ANH,
  author =       "Vladik Kreinovich and Max Shpak",
  title =        "Aggregability is {NP}-hard",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "3",
  pages =        "97--104",
  month =        sep,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1165555.1165556",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#KreinovichS06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Many dynamical systems are aggregable in the sense
                 that we can divide their variables x 1,\ldots{}, x n
                 into several ($k$) non-intersecting groups and find
                 combinations $ y_1, \ldots {}, y_k$ of variables from
                 these groups (macrovariables) whose dynamics depend
                 only on the initial values of the macrovariables. For
                 very large systems, finding such an aggregation is
                 often the only way to perform a meaningful analysis of
                 such systems. Since aggregation is important,
                 researchers have been trying to find a general
                 efficient algorithm for detecting aggregability. In
                 this paper, we show that in general, detecting
                 aggregability is NP-hard even for linear systems, and
                 thus (unless P=NP), we can only hope to find efficient
                 detection algorithms for specific classes of systems.
                 We also show that in the linear case, once the groups
                 are known, it is possible to efficiently find
                 appropriate combinations ya.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pudlak:2006:GCA,
  author =       "Pavel Pudl{\'a}k",
  title =        "{G{\"o}del} and computations: a 100th anniversary
                 retrospective",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "13--21",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189058",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Pudlak06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I will start with a brief biographical sketch. Kurt
                 G{\"o}del was born in Brno (Br{\"u}n in German) in
                 April 28, 1906. At that time it was in the Czech
                 Kingdom which was a part of Austro-Hungarian Monarchy.
                 Not much later, in 1918, Brno was a city in the new
                 formed Czechoslovakia. His family belonged to a large
                 German-speaking population in Brno.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Feigenbaum:2006:TTN,
  author =       "Joan Feigenbaum and Michael Mitzenmacher",
  title =        "Towards a theory of networked computation",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "22--26",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189059",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#FeigenbaumM06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The increasing prominence of the Internet, the Web,
                 and large data networks in general has profoundly
                 affected social and commercial activity. It has also
                 wrought one of the most profound shifts in Computer
                 Science since the field's inception. Traditionally,
                 Computer-Science research focused primarily on
                 understanding how best to design, build, analyze, and
                 program computers. Research focus has now shifted to
                 the question of how best to design, build, analyze, and
                 operate networks. How can one ensure that a network
                 created and used by many autonomous organizations and
                 individuals functions properly, respects the rights of
                 users, and exploits its vast shared resources fully and
                 fairly?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2006:BRCd,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "27--29",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189061",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Gasarch06d;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kindahl:2006:BRB,
  author =       "Mats Kindahl",
  title =        "Book Review: {{\booktitle{Types and Programming
                 Languages}}, by Benjamin C. Pierce, MIT Press, 2002}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "29--34",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189062",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kindahl06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pierce:2002:TPL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2006:BRBb,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Verification of Reactive
                 Systems: Formal Methods and Algorithms}}, by Klaus
                 Schneider, Springer-Verlag Berlin Heidelberg, 2004}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "36--37",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189064",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Dave06b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Schneider:2004:VRS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Law:2006:BRB,
  author =       "James Law",
  title =        "Book Review: {{\booktitle{Algorithmic Learning in a
                 Random World}}, by Vovk, Gammerman and Shafer,
                 Springer, 2005, ISBN 0-387-00152-2}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "38--40",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189065",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Law06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Vovk:2005:ALR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Srinivasan:2006:BRB,
  author =       "Aravind Srinivasan",
  title =        "Book Review: {{\booktitle{The Random Projection
                 Method}}, by Santosh Vempala}",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "41--43",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189066",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Srinivasan06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Vempala:2004:RPM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2006:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "44--46",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189068",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Kelley06c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2006:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 53",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "47--55",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189070",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Hemaspaandra06b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A way-cool new project and web site has been created
                 by Greg Kuperberg. Greg is trying to graphically
                 capture the known (for now, relativizable)
                 relationships between classes, and to make clear to
                 everyone what open questions remain. The starting point
                 for Greg's ``Complexity Zoology'' site is
                 www.math.ucdavis.edu/~greg/zoology/. Greg welcomes
                 feedback, corrections, and (best of all) new or missed
                 results.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{denBussche:2006:DTC,
  author =       "Jan Van den Bussche",
  title =        "Database theory column: report on {PODS} 2006",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "56--57",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189072",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 25th edition of the ACM SIGMOD-SIGACT-SIGART
                 Symposium on Principles of Databases (PODS), took place
                 from 26 to 29 June 2006, at the Renaissance Chicago
                 Hotel in Chicago. As usual since 1991, the symposium
                 was organized jointly with the ACM SIGMOD International
                 Conference on Management of Data. While SIGMOD focuses
                 on practical aspects of database systems, PODS focuses
                 on the theory of such systems. The joint organization
                 stimulates interaction between systems and theory
                 research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{VandenBussche:2006:DTC,
  author =       "Jan {Van den Bussche}",
  title =        "Database theory column: report on {PODS} 2006",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "56--57",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189072",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Bussche06;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2006:ASNb,
  author =       "Sergio Rajsbaum",
  title =        "{ACM} {SIGACT} news distributed computing column 24",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "58--84",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189074",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Rajsbaum06a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue consists of:o ``Security and Composition of
                 Cryptographic Protocols: A Tutorial (Part II)'' by Ran
                 Canetti. The first part appeared in the previous SIGACT
                 News, the September 2006 issue. Many thanks to Ran for
                 his contributions to this column.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2006:RLC,
  author =       "Hubie Chen",
  title =        "A rendezvous of logic, complexity, and algebra",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "85--114",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189076",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Chen06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I am always looking for contributions. If you have any
                 suggestion concerning the content of the Logic Column,
                 or if you would like to contribute by writing a column
                 yourself, feel free to get in touch with me.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2006:SNO,
  author =       "Marek Chrobak and Claire Kenyon-Mathieu",
  title =        "{SIGACT} news online algorithms column 10:
                 competitiveness via doubling",
  journal =      j-SIGACT,
  volume =       "37",
  number =       "4",
  pages =        "115--126",
  month =        dec,
  year =         "2006",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1189056.1189078",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:28 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#ChrobakK06;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We discuss what we refer to, tentatively, as the
                 ``doubling'' method for designing online and offline
                 approximation algorithms. The rough idea is to use
                 geometrically increasing estimates on the optimal
                 solution to produce fragments of the algorithm's
                 solution. The term ``doubling'' is a little misleading,
                 for often factors other than 2 are used, and
                 suggestions for a better name will be appreciated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:JBN,
  author =       "William Gasarch",
  title =        "The joys of being an {NSF} program director",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It is once again the season when our community needs
                 to find a new volunteer to serve as program director
                 for the ``Theory of Computing program'' or
                 ``Theoretical Foundations cluster'' or whatever name
                 our home insid{\'e} CISE at NSF may have in the future.
                 It feels to me as if I only recently finished my
                 service in that role, but in fact I served from January
                 2001 through August of 2002, and it is now time for us
                 to find a replacement for the redoubtable William
                 Steiger, my successor's successor.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sloan:2007:JBN,
  author =       "Robert H. Sloan",
  title =        "The joys of being an {NSF} program director",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Sloan07;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRBa,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{Excellence Without a Soul:
                 How a Great University Forgot Education}}, by Harry
                 Lewis, Public Affairs, 290 pages}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "9--13",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233486",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lewis:2006:ESH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{deWolf:2007:JRB,
  author =       "Ronald de Wolf",
  title =        "Joint review of {{\booktitle{An Introduction to
                 Quantum Computing Algorithms}}, by Arthur O. Pittenger,
                 Birkh{\"a}user, ISBN 0-8176-4127-0; \booktitle{Quantum
                 Computing}, by Mika Hirvensalo, Springer, ISBN
                 3-540-66783-0; and \booktitle{Classical and Quantum
                 Computation}, by A. Yu. Kitaev, A. Shen, and M. N.
                 Vyalyi, American Mathematical Society, ISBN
                 0-8218-2161-X}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "14--17",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233487",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Wolf07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Hirvensalo:2001:QC,Kitaev:2002:CQC,Pittenger:2000:IQC}
                 and review \cite{Viola:2004:BRB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cohen:2007:BRB,
  author =       "Jonathan Cohen",
  title =        "Book Review: {{\booktitle{Introduction to Lattices and
                 Order}}, by B. A. Davey and H. A. Priestley, Cambridge
                 University Press}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "17--23",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Cohen07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Davey:1990:ILO,Davey:2002:ILO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kreinovich:2007:BRB,
  author =       "Vladik Kreinovich",
  title =        "Book Review: {{\booktitle{Computational Techniques for
                 the Summation of Series}}, by Anthony Sofo, Kluwer
                 Academic Publishers, 2003}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "24--27",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233489",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kreinovich07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Sofo:2003:CTS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2007:TRCa,
  author =       "Lane A. Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "28--30",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2007:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "28--30",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kelley07;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guo:2007:IDR,
  author =       "Jiong Guo and Rolf Niedermeier",
  title =        "Invitation to data reduction and problem
                 kernelization",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "31--45",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#GuoN07;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2007:IDR,
  author =       "Sergio Rajsbaum",
  title =        "Invitation to data reduction and problem
                 kernelization",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "31--45",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "To solve NP-hard problems, polynomial-time
                 preprocessing is a natural and promising approach.
                 Preprocessing is based on data reduction techniques
                 that take a problem's input instance and try to perform
                 a reduction to a smaller, equivalent problem kernel.
                 Problem kernelization is a methodology that is rooted
                 in parameterized computational complexity. In this
                 brief survey, we present data reduction and problem
                 kernelization as a promising research field for
                 algorithm and complexity theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dolev:2007:RDC,
  author =       "Shlomi Dolev",
  title =        "A review of the {DISC 2006} conference",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "46--52",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233495",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Dolev07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Charron-Bost:2007:HDF,
  author =       "Bernadette Charron-Bost and Andr{\'e} Schiper",
  title =        "Harmful dogmas in fault tolerant distributed
                 computing",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "53--61",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233496",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Charron-BostS07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Consensus is a central problem in fault tolerant
                 distributed computing. A vast number of (positive and
                 negative) results for consensus in various system
                 models have been established. In this paper we isolate
                 three features that all these system models share, and
                 we show that inappropriate modelling choices have led
                 to overcomplicate the approaches to studying the
                 consensus problem, thus yielding too restrictive
                 solutions for real systems. It is hard to question
                 these modelling choices, as they have gained the status
                 of dogmas. Nevertheless, we propose a simpler and more
                 natural approach that allows us to get rid of these
                 dogmas, and to handle all types of benign fault, be it
                 static or dynamic, permanent or transient, in a unified
                 framework.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Razborov:2007:EMM,
  author =       "Alexander (Sasha) A. Razborov",
  title =        "Eulogy: {Michael (Misha) Alekhnovich 1978--2006}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "1",
  pages =        "70--71",
  month =        mar,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1233481.1233482",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Razborov07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Misha Alekhnovich was born in Moscow, USSR, on October
                 26, 1978. In 1995 Misha began his studies at Moscow
                 State University and graduated in 2000 with the
                 equivalent of a B.A. in mathematics. In 2000--2001
                 Misha participated in the Special Year on Computational
                 Complexity at the Institute for Advanced Study, and in
                 2001--2003 he attended graduate school at MIT. Upon
                 receiving his PhD in 2003, Misha returned to IAS as a
                 postdoctoral member and spent the next two years,
                 2003--2005, there. In 2005 he moved on to a faculty
                 position at the University of California San Diego.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRCa,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "8--10",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272733",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Beaumont:2007:BRB,
  author =       "James C. Beaumont",
  title =        "Book Review: {{\booktitle{Symbolic Asymptotics}}, by
                 John R. Shackell, Springer Verlag, 243 pages,
                 \$79.95}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "11--16",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272734",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Beaumont07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shackell:2004:SA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rothe:2007:BRB,
  author =       "J{\"o}rg Rothe",
  title =        "Book Review: {{\booktitle{Complexity and Cryptography:
                 An Introduction}}, by John Talbot and Dominic Welsh,
                 Cambridge University Press, 2006, 292 pages}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "16--20",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272735",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Rothe07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Talbot:2006:CCI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Faliszewski:2007:BRB,
  author =       "Piotr Faliszewski",
  title =        "Book Review: {{\booktitle{Complexity Theory and
                 Cryptology: An Introduction to Cryptocomplexity}}, by
                 J{\"o}rg Rothe, Springer, 2005, 484 pages}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "20--22",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272736",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Faliszewski07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Rothe:2005:CTC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:JRB,
  author =       "William I. Gasarch",
  title =        "Joint review of {{\booktitle{Three Blogs by Theorists:
                 Computational Complexity ({\tt weblog.fortnow.com})}},
                 by Lance Fortnow, \booktitle{Shtetl-Optimized ({\tt
                 www.scottaaronson.com/blog/})}, by Scott Aaronson,
                 \booktitle{In theory} ({\tt in-theory.blogspot.com}) by
                 Luca Trevisan}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "23--25",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272737",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2007:TRCb,
  author =       "Lane A. Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "26--28",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272730",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2007:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "26--28",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272730",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kelley07a;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bera:2007:SDQ,
  author =       "Debajyoti Bera and Frederic Green and Steven Homer",
  title =        "Small depth quantum circuits",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "35--50",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272739",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#BeraGH07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Small depth quantum circuits have proved to be
                 unexpectedly powerful in comparison to their classical
                 counterparts. We survey some of the recent work on this
                 and present some open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2007:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 49",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "51--55",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272740",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#ORourke07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The new algorithm of Bobenko and Izmestiev for
                 reconstructing the unique polyhedron determined by
                 given gluings of polygons is described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sivilotti:2007:CKL,
  author =       "Paolo A. G. Sivilotti and Scott M. Pike",
  title =        "A collection of kinesthetic learning activities for a
                 course on distributed computing: {ACM} {SIGACT} news
                 distributed computing column 26",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "56--74",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272741",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#SivilottiP07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Kinesthetic learning is a process where students learn
                 by actively carrying out physical activities rather
                 than by passively listening to lectures. Pedagogical
                 research has indicated that kinesthetic learning is a
                 fundamental, powerful, and ubiquitous learning style.
                 It resonates with many students across all disciplines
                 and levels of education. The adoption of kinesthetic
                 approaches in college classrooms, however, has been
                 hampered by the difficulty of designing effective
                 activities, as well as the perceived challenges of
                 coordinating these activities. On the other hand,
                 courses on distributed computing, by the very nature of
                 the material they cover, are uniquely suited to
                 exploiting this learning technique. We have developed
                 and piloted a collection of kinesthetic activities for
                 a senior undergraduate or graduate-level course on
                 distributed systems. We give detailed descriptions of
                 these exercises and discuss factors that contribute to
                 their success (or failure). Our hope is that others
                 will adopt these particular activities in their own
                 distributed systems courses as well as use these
                 examples as a pattern for developing new activities.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2007:ALB,
  author =       "Riccardo Pucella",
  title =        "Alternative Logics: a book review: {SIGACT} news logic
                 column 18",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "75--86",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272742",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Pucella07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A few years ago, Bill Gasarch, editor of the Book
                 Review Column, sent me a copy of the book Alternative
                 Logics: Do Sciences Need Them? [28], edited by Paul
                 Weingartner, and asked if I was interested in reviewing
                 it. The book is a collection of essays discussing
                 whether there is a need for logics other than classical
                 logic in various areas of science. Interestingly, I had
                 just finished reading a copy of philosopher Susan
                 Haack's Deviant Logic [13], concerning the
                 philosophical foundation of alternative logics. This
                 was fortuitous, because Haack's monograph provided a
                 wonderful introduction to the essays collected in
                 Weingartner's volume.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hill:2007:HCD,
  author =       "Robin K. Hill",
  title =        "How close did Kurt {G}{\"o}del get to the University
                 of Wyoming?",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "2",
  pages =        "87--90",
  month =        jun,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1272729.1272731",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Hill07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRCb,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "14--16",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324218",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mitzenmacher:2005:PCR}.",
  abstract =     "In this column we review the following books. 1. The
                 Political Mapping of Cyberspace by Jeremy W. Crampton.
                 Reviewed by Rajesh Natarajan. 2. Probability and
                 Computing: Randomized Algorithms and Probabilitic
                 Analysis by Michael Mitzenmacher and Eli Upfal. There
                 are two reviews, one by Jonathan Katz and one by Yannis
                 C. Stamatiou. 3. Computational Techniques of the
                 Simplex Method by Istv{\'a}n Maros. Review by Brian
                 Borchers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Natarajan:2007:BRB,
  author =       "Rajesh Natarajan",
  title =        "Book Review: {{\booktitle{The Political Mapping of
                 Cyberspace}}, by Jeremy W. Crampton, The University of
                 Chicago Press, 2003}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "17--20",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324219",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Natarajan07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Crampton:2003:PMCa,Crampton:2003:PMCb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2007:BRB,
  author =       "Jonathan Katz",
  title =        "Book Review: {{\booktitle{Probability and Computing:
                 Randomized Algorithms and Probabilistic Analysis}}, by
                 Michael Mitzenmacher and Eli Upfal, Cambridge
                 University Press, 2005}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "20--22",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324220",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Katz07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mitzenmacher:2005:PCR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stamatiou:2007:BRB,
  author =       "Yannis C. Stamatiou",
  title =        "Book Review: {{\booktitle{Probability and Computing:
                 Randomized Algorithms and Probabilistic Analysis}}, by
                 Michael Mitzenmacher and Eli Upfal, Cambridge
                 University Press, 2005}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "22--27",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324221",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Stamatiou07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mitzenmacher:2005:PCR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Borchers:2007:BRB,
  author =       "Brian Borchers",
  title =        "Book Review: {{\booktitle{Computational Techniques of
                 the Simplex Method}}, by Istv{\'a}n Maros, Kluwer
                 Academic Publishers, 2003}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "27--30",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324222",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Borchers07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Maros:2003:CTS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2007:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "31--33",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324216",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kelley07b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2007:Ia,
  author =       "Lane A. Hemaspaandra",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "34--38",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324224",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Hemaspaandra07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Warmest thanks to Salil Vadhan for this issue's
                 wonderful guest column on pseudorandomness. (His column
                 begins in a few pages.) Future columns include Arnaud
                 Durand, Clemens Lautemann, and Malika More on A Simple
                 Proof of Polylog Counting Ability of First-Order Logic,
                 Jonathan Buss and Tarique Islam on Complexity of
                 Fixed-Parameter Problems, and Jin-Yi Cai on holographic
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vadhan:2007:UTP,
  author =       "Salil P. Vadhan",
  title =        "The unified theory of pseudorandomness: guest column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "39--54",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324225",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Vadhan07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We survey the close connections between a variety of
                 ``pseudorandom objects,'' namely pseudorandom
                 generators, expander graphs, list-decodable
                 error-correcting codes, randomness extractors,
                 averaging samplers, and hardness amplifiers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2007:I,
  author =       "Sergio Rajsbaum",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "55--55",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324227",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Rajsbaum07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Distributed Computing Column covers the theory of
                 systems that are composed of a number of interacting
                 computing elements. These include problems of
                 communication and networking, databases, distributed
                 shared memory, multiprocessor architectures, operating
                 systems, verification, Internet, and the Web. This
                 issue consists of: ``Delayed Password Disclosure,'' by
                 Markus Jakobsson and Steven Myers. Many thanks to them
                 for their contribution to this issue.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jakobsson:2007:DPD,
  author =       "Markus Jakobsson and Steven Myers",
  title =        "Delayed password disclosure",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "56--75",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324228",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#JakobssonM07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a new authentication protocol called
                 Delayed Password Disclosure. Based on the traditional
                 username and password paradigm, the protocol's goal is
                 aimed at reducing the effectiveness of
                 phishing/spoofing attacks that are becoming
                 increasingly problematic for Internet users. This is
                 done by providing the user with dynamic feedback while
                 password entry occurs. While this is a process that
                 would normally be frowned upon by the cryptographic
                 community, we argue that it may result in more
                 effective security than that offered by currently
                 proposed ``cryptographically acceptable'' alternatives.
                 While the protocol cannot prevent partial disclosure of
                 one's password to the phisher, it does provide a user
                 with the tools necessary to recognize an ongoing
                 phishing attack, and prevent the disclosure of his/her
                 entire password, providing graceful security
                 degradation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2007:Ia,
  author =       "Riccardo Pucella",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "76--76",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324230",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Pucella07a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this issue, Lomuscio and Penczek survey some of the
                 recent work in verification of temporal-epistemic logic
                 via symbolic model checking, focusing on OBDD-based and
                 SAT-based approaches for epistemic logics built on
                 discrete and real-time branching time temporal
                 logics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lomuscio:2007:SMC,
  author =       "Alessio Lomuscio and Wojciech Penczek",
  title =        "Symbolic model checking for temporal-epistemic
                 logics",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "77--99",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324231",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#LomuscioP07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2007:CPD,
  author =       "Marek Chrobak",
  title =        "Competitiveness via primal-dual",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "100--105",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324233",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Chrobak07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "From the editor: So you are reading this paper on
                 online algorithms. At first the paper reads well, and
                 you get through the first few pages in no time ---
                 until the authors pull a rabbit out of a hat: the
                 online algorithm. Fine, you say to yourself, patience,
                 it all will start making sense when I get to the
                 analysis, just keep reading. But it doesn't --- the
                 proof is by an even more mysterious trick, and this
                 time out of the hat comes a humpback whale: yes, a
                 potential function. Sound familiar?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2007:I,
  author =       "Samir Khuller",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "106--106",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324235",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Khuller07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's column is written by guest columnist,
                 Chandra Chekuri. I am delighted that he agreed to write
                 this column on a topic related to robust network design
                 that has received considerable attention recently. His
                 column introduces the reader to several recent results
                 and provides references for further readings.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chekuri:2007:RND,
  author =       "Chandra Chekuri",
  title =        "Routing and network design with robustness to changing
                 or uncertain traffic demands",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "3",
  pages =        "106--129",
  month =        sep,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1324215.1324236",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Chekuri07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A new class of network design problems were introduced
                 by Fingerhut et al. [26], and independently by Duffield
                 et al. [20], to address, among other things, the issue
                 of uncertainty in the demand matrix. The so-called hose
                 model (the term was coined in [20]) for demand matrices
                 from [26, 20] was subsequently generalized to the
                 polyhedral model by Ben-Ameur and Kerivin [11, 10]. In
                 a different direction, R{\"a}acke [51] showed the
                 existence of good randomized oblivious routings in all
                 undirected graphs. This was followed by a proof of the
                 polynomial time solvability of an optimal oblivious
                 routing scheme [7]. One can view the above developments
                 in a common framework of robust optimization. We give a
                 survey of these developments and related work with the
                 aim of providing a unified picture. We also highlight
                 the remaining open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRCc,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "16--18",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345191",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07d;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Willinsky:2006:APC,Fredriksson:2001:CSP}.",
  abstract =     "In this column we review the following books. 1. The
                 Access Principle by John Willinsky. Review by Scott
                 Aaronson. The book is about how journals should be more
                 available on-line and other issues about journals. I
                 invited Scott Aaronson to do a review but also told him
                 he could make it into an opinion piece on the issue. He
                 has done so. At the end I have a rebuttal --- sort of.
                 2. A Century of Scientific Publishing: A collection of
                 essays Edited by Fredriksson. Review by William
                 Gasarch. This is a collection of essays about how
                 scientific information has been published and
                 distributed over the last century. Can the past be
                 helpful in understanding and dealing with our current
                 problems? 3. Mathematics of Physics and Engineering by
                 Edward K. Blum and Sergey V. Lototsky. Review by
                 Frederic Green. This is a textbook for a 1-semester
                 course in physics that covers much of the interplay of
                 math and physics. 4. Research Problems in Discrete
                 Geometry by Brass, Moser, Pach. Review by William
                 Gasarch. This is a collection of research problems in
                 discrete geometry, together with their history,
                 context, and (lots of) references. Problems deal with
                 points and lines in the plane, convex polygons, and
                 many other geometrical objects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aaronson:2007:BRB,
  author =       "Scott Aaronson",
  title =        "Book Review: {{\booktitle{The Access Principle}}, by
                 John Willinsky, MIT Press, 2005}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "19--23",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345192",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Aaronson07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Willinsky:2006:APC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRBb,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{A Century of Scientific
                 Publishing: A collection of essays}}, edited by
                 Fredriksson, IOS Press}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "23--24",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345193",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07e;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Fredriksson:2001:CSP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2007:BRB,
  author =       "Frederic Green",
  title =        "Book Review: {{\booktitle{Mathematics of Physics and
                 Engineering}}, by Edward K. Blum and Sergey V.
                 Lototsky, World Scientific}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "25--30",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345194",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Green07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Blum:2006:MPE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2007:BRBc,
  author =       "William I. Gasarch",
  title =        "Book Review: {{\booktitle{Research Problems in
                 Discrete Geometry}}, by Brass, Moser, Pach,
                 Springer-Verlag}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "31--34",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345195",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Gasarch07f;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Brass:2005:RPD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2007:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "35--38",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345196",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kelley07c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2007:Ib,
  author =       "Lane A. Hemaspaandra",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "39--40",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345198",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Hemaspaandra07a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Warmest thanks to Arnaud and Malika both for making
                 available here their work with Clemens and especially
                 for sharing their moving memories of Clemens, the
                 extreme beauty of whose research will via the
                 literature remain forever available to all.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Durand:2007:SPP,
  author =       "Arnaud Durand and Clemens Lautemann and Malika More",
  title =        "A simple proof of the polylog counting ability of
                 first-order logic: guest column",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "40--45",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345199",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#DurandLM07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The counting ability of weak formalisms (e.g.,
                 determining the number of 1's in a string of length
                 $N$) is of interest as a measure of their expressive
                 power, and also resorts to complexity-theoretic
                 motivations: the more we can count the closer we get to
                 real computing power. The question was investigated in
                 several papers in complexity theory and in weak
                 arithmetic around 1985. In each case, the considered
                 formalism (AC$^0$-circuits, first-order logic, $
                 \Delta_0$) was shown to be able to count up to a
                 polylogarithmic number. An essential part of the proofs
                 is the construction of a 1--1 mapping from a small
                 subset of $ \{ 0, \ldots {}, N - 1 \} $ into a small
                 initial segment. In each case the expressibility of
                 this mapping depends on some strong argument
                 (group-theoretic device or prime number theorem) or
                 intricate construction. We present a coding device
                 based on a collision-free hashing technique, leading to
                 a completely elementary proof.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2007:I,
  author =       "Idit Keidar",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "46--49",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345201",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Keidar07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bortnikov:2007:RD,
  author =       "Edward Bortnikov",
  title =        "Review of {DISC '07}",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "49--53",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1386170",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuhn:2007:TCC,
  author =       "Michael Kuhn and Roger Wattenhofer",
  title =        "The theoretic center of computer science",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "54--63",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345202",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#0002W07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this article we examine computer science in
                 general, and theory and distributed computing in
                 particular. We present a map of the computer science
                 conferences, speculating about the center of computer
                 science. In addition we present some trends and
                 developments. Finally we revisit centrality, wondering
                 about the central actors in computer science. This
                 article is a printed version of a frivolous PODC 2007
                 business meeting talk, held by the second author. In an
                 attempt to address a broader audience we have extended
                 the content by data about theory conferences and
                 computer science in general. Still, the character of
                 the information remains the same, meaning our
                 investigations should not be taken too seriously.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2007:Ib,
  author =       "Riccardo Pucella",
  title =        "Introduction",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "64--64",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345204",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Pucella07b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A short column this time around. Simon Kramer sent me
                 a synopsis of his Ph.D. thesis, defended earlier this
                 year at l'{\'E}cole Polytechnique F{\'e}d{\'e}rale de
                 Lausanne. He introduces a new logic for reasoning about
                 cryptographic protocol called CPL (Cryptographic
                 Protocol Logic). The result is an intriguing blend of
                 modal logic and process algebra, reminiscent of spatial
                 logics for process calculi, but extended with
                 knowledge, belief, and provability operators.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kramer:2007:LCC,
  author =       "Simon Kramer",
  title =        "Logical concepts in cryptography",
  journal =      j-SIGACT,
  volume =       "38",
  number =       "4",
  pages =        "65--66",
  month =        dec,
  year =         "2007",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1345189.1345205",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:29 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kramer07;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The thesis is about a breadth-first exploration of
                 logical concepts in cryptography and their linguistic
                 abstraction and model-theoretic combination in a
                 comprehensive logical system, called CPL (for
                 Cryptographic Protocol Logic). We focus on two
                 fundamental aspects of cryptography. Namely, the
                 security of communication (as opposed to security of
                 storage) and cryptographic protocols (as opposed to
                 cryptographic operators). The logical concepts explored
                 are the following. Primary concepts: the modal concepts
                 of belief, knowledge, norms, provability, space, and
                 time. Secondary concepts: belief with error control,
                 individual and propositional knowledge, confidentiality
                 norms, truth-functional and relevant (in particular,
                 intuitionistic) implication, multiple and complex truth
                 values, and program types. The distinguishing feature
                 of CPL is that it unifies and refines a variety of
                 existing approaches. This feature is the result of our
                 holistic conception of property-based (modal logics)
                 and model-based (process algebra) formalisms. We
                 illustrate the expressiveness of CPL on representative
                 requirements engineering case studies. Further, we
                 extend (core) CPL (qualitative time) with
                 rational-valued time, i.e., time stamps, timed keys,
                 and potentially drifting local clocks, to tCPL
                 (quantitative time). Our extension is conservative and
                 provides further evidence for Lamport's claim that
                 adding real time to an untimed formalism is really
                 simple. Furthermore, we sketch an extension of (core)
                 CPL with a notion of probabilistic polynomial-time (PP)
                 computation. We illustrate the expressiveness of this
                 extended logic (ppCPL) on tentative formalisation case
                 studies of fundamental and applied concepts.
                 Fundamental concepts: (1) one-way function, (2)
                 hard-core predicate, (3) computational
                 indistinguishability, (4) ($n$-party) interactive
                 proof, and (5) ($n$-prover) zero-knowledge. Applied
                 concepts: (1) security of encryption schemes, (2)
                 unforgeability of signature schemes, (3) attacks on
                 encryption schemes, (4) attacks on signature schemes,
                 and (5) breaks of signature schemes. In the light of
                 logic, adding PP to a formalism for cryptographic
                 protocols is perhaps also simple and can be achieved
                 with an Ockham's razor extension of an existing core
                 logic, namely CPL.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2008:BRCa,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "9--12",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360445",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Gasarch08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Terai:2008:BRB,
  author =       "S. Terai",
  title =        "Book Review: {{\booktitle{Cryptography in C and C++}},
                 by Michael Welschenbach, Apress, 2005}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "12--16",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360446",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Terai08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Welschenbach:2001:CCC,Welschenbach:2005:CCC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rauff:2008:BRB,
  author =       "James V. Rauff",
  title =        "Book Review: {{\booktitle{A Beginner's Guide to
                 Discrete Mathematics}}, by W. D. Wallis,
                 Birkh{\"a}user, 2003}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "16--18",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360447",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Rauff08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wallis:2003:BGD,Wallis:2012:BGD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Washington:2008:BRB,
  author =       "Lawrence C. Washington",
  title =        "Book Review: {{\booktitle{Handbook of Elliptic and
                 Hyperelliptic Curve Cryptography}}, by H. Cohen and G.
                 Frey, Chapman \& Hall\slash CRC, 2006, 1-58488-518-1}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "19--22",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360448",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Washington08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Cohen:2006:HEH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Krizanc:2008:BRB,
  author =       "Danny Krizanc",
  title =        "Book Review: {{\booktitle{The Game's Afoot: Game
                 Theory in Myth and Paradox}}, by Alexander Mehlmann,
                 American Mathematical Society, 2000, 0-8218-2121-0}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "22--24",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360449",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Krizanc08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mehlmann:2000:GAG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Springer:2008:BRB,
  author =       "William M. {Springer II}",
  title =        "Book Reviews: {{\booktitle{Introducing Game Theory and
                 Its Applications}}, by Elliott Mendelson, CRC Press,
                 and \booktitle{Game Theory and Strategy}, by Philip D.
                 Straffin, MAA Press}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "24--27",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360450",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Springer08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Straffin:1993:GTS,Mendelson:2004:IGT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2008:BRBa,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Semantic Integration of
                 Heterogeneous Software Specifications}}, by Martin
                 Gro{\ss}e-Rhode, Springer-Verlag, 2004}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "28--29",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360451",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Dave08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Grosse-Rhode:2004:SIH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2008:TRC,
  author =       "Lane A. Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "30--32",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360452",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2008:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "30--32",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360452",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Kelley08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Buss:2008:CFP,
  author =       "Jonathan F. Buss and Tarique Mesbaul Islam",
  title =        "The complexity of fixed-parameter problems: guest
                 column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "33--46",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360454",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#BussI08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2008:CFP,
  author =       "Idit Keidar",
  title =        "The complexity of fixed-parameter problems: guest
                 column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "33--46",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360454",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We describe how to found and develop the theory of
                 fixed-parameter complexity and hardness in a manner
                 both fully analogous to the classical theory of NP
                 -completeness and much simpler than the original
                 development. We present some recent advance made using
                 this approach.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2008:ASNa,
  author =       "Idit Keidar",
  title =        "{ACM SIGACT News Distributed Computing Column} 29",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "47--48",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1386169",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Felber:2008:TBT,
  author =       "Pascal Felber and Christof Fetzer and Rachid Guerraoui
                 and Tim Harris",
  title =        "Transactions are back---but are they the same?:
                 {{\booktitle{Le Retour de Martin Guerre}}
                 (Sommersby)}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "48--58",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360456",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#FelberFGH08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Davis:1982:RMG}.",
  abstract =     "Transactions are back in the spotlight! They are
                 emerging in concurrent programming languages under the
                 name of transactional memory (TM). Their new role?
                 Concurrency control on new multi-core processors. From
                 afar they look the same as good ol' database
                 transactions. But are they really? In this position
                 paper, we reflect about the distinguishing features of
                 these memory transactions with respect to their
                 database cousins. Disclaimer: By its very nature, this
                 position paper does not try to avoid subjectivity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Attiya:2008:NFT,
  author =       "Hagit Attiya",
  title =        "Needed: foundations for transactional memory",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "59--61",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360457",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Attiya08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Transactional memory is a leading paradigm for
                 designing concurrent applications for tomorrow's
                 multi-core architectures. It follows and draws much
                 inspiration from earlier research on concurrent data
                 structures and concurrency control. Quite remarkably,
                 it has succeeded in breaking out of the research
                 community, and is being seriously considered by the
                 industry---both as part of software solutions and as
                 the basis for novel hardware designs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herlihy:2008:DCM,
  author =       "Maurice Herlihy and Victor Luchangco",
  title =        "Distributed computing and the multicore revolution",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "62--72",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360458",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#HerlihyL08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Changes in technology can have far-reaching effects on
                 theory. For example, while Turing's work on
                 computability predated the first electronic computers,
                 complexity theory flowered only after computers became
                 a reality. After all, an algorithm's complexity may not
                 matter much in a mathematics journal, but matters quite
                 a bit in a FORTRAN program. We argue that something
                 similar is going on with parallel and concurrent
                 computation: after decades of being respected but not
                 taken seriously, research on multiprocessor algorithms
                 and data structures is going mainstream.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2008:CGCa,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 50",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "73--76",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360459",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#ORourke08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Two long-open problems have been solved: (1) every
                 sufficiently large planar point set in general position
                 contains the vertices of an empty hexagon; (2) every
                 finite collection of polygons of equal area have a
                 common hinged dissection.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2008:DTC,
  author =       "Marek Chrobak",
  title =        "Database theory column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "77--79",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360460",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 26th edition of the ACM SIGMOD-SIGACT-SIGART
                 Symposium on Principles of Databases (PODS), took place
                 from 11 to 13 June 2007. As usual since 1991, the
                 symposium was organized jointly with the ACM SIGMOD
                 International Conference on Management of Data. While
                 SIGMOD focuses on practical aspects of database
                 systems, PODS focuses on the theory of such systems.
                 The joint organization stimulates interaction between
                 systems and theory research. For the first time ever
                 the joint SIGMOD/PODS conference was held in Asia: it
                 took place in Beijing, China.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vianu:2008:DTC,
  author =       "Victor Vianu",
  title =        "Database theory column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "77--79",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360460",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Vianu08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Birnbaum:2008:LBM,
  author =       "Benjamin E. Birnbaum and Claire Mathieu",
  title =        "On-line bipartite matching made simple",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "1",
  pages =        "80--87",
  month =        mar,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1360443.1360462",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#BirnbaumM08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We examine the classic on-line bipartite matching
                 problem studied by Karp, Vazirani, and Vazirani [8] and
                 provide a simple proof of their result that the Ranking
                 algorithm for this problem achieves a competitive ratio
                 of 1 --- 1/ e.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aggarwal:2008:TRG,
  author =       "Gagan Aggarwal and Nir Ailon and Florin Constantin and
                 Eyal Even-Dar and Jon Feldman and Gereon Frahling and
                 Monika Rauch Henzinger and S. Muthukrishnan and Noam
                 Nisan and Martin P{\'a}l and Mark Sandler and
                 Anastasios Sidiropoulos",
  title =        "Theory research at {Google}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "10--28",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388242",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#AggarwalACEFFHMNPSS08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2008:TRG,
  author =       "William Gasarch",
  title =        "Theory research at {Google}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "10--28",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388242",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Through the history of Computer Science, new
                 technologies have emerged and generated fundamental
                 problems of interest to theoretical computer
                 scientists. From the era of telecommunications to
                 computing and now, the Internet and the web, there are
                 many such examples. This article is derived from the
                 emergence of web search and associated technologies,
                 and focuses on the problems of research interest to
                 theoretical computer scientists that arise, in
                 particular at Google.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2008:BRCb,
  author =       "William I. Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "29--31",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388244",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Gasarch08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rogers:2008:BRB,
  author =       "John D. Rogers",
  title =        "Book Review: {{\booktitle{The Art of Computer
                 Programming, Volume 4, Fascicles 2, 3, and 4}}, by
                 Donald E. Knuth, Pearson Education (Addison-Wesley),
                 2005}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "32--35",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388245",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Rogers08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Knuth:2011:ACP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2008:BRB,
  author =       "Timothy Kelley",
  title =        "Book Review: {{\booktitle{A Course in Computational
                 Algebraic Number Theory}}, by Henri Cohen, Springer,
                 2000}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "36--39",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388246",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Kelley08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Cohen:1993:CCA,Cohen:1995:CCA,Cohen:1996:CCA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jankowski:2008:BRBa,
  author =       "Richard Jankowski",
  title =        "Book Review: {{\booktitle{Foundations of Computer
                 Security}}, by David Salomon, Springer-Verlag, 2006}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "40--41",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388247",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Jankowski08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Salomon:2005:FCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Irwin:2008:BRB,
  author =       "Robert J. Irwin",
  title =        "Book Review: {{\booktitle{Derivation and Computation:
                 Taking the Curry--Howard Correspondence Seriously}}, by
                 Harold Simmons, Cambridge University Press, 2000}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "42--44",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388248",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Irwin08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Simmons:2000:DCT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2008:BRBb,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Theoretical and Experimental
                 DNA Computation}}, by M. Amos, Springer-Verlag Berlin
                 Heidelberg, 2005}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "45--46",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388249",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Dave08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Amos:2005:TED}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2008:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "47--49",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388251",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Kelley08b;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2008:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 59:
                 introduction",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "50--50",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388253",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Hemaspaandra08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I suspect that both those who have been lucky enough
                 to hear Jin-Yi Cai speak about holographic algorithms
                 and those who have not will find his article to be a
                 great survey and a real treat. Warmest thanks to
                 Jin-Yi, and more generally to all guest column writers,
                 for their tremendous labors of love.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cai:2008:HAG,
  author =       "Jin-yi Cai",
  title =        "Holographic algorithms: guest column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "51--81",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388254",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Cai08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Leslie Valiant recently proposed a theory of
                 holographic algorithms. These novel algorithms achieve
                 exponential speed-ups for certain computational
                 problems compared to naive algorithms for the same
                 problems. The methodology uses Pfaffians and (planar)
                 perfect matchings as basic computational primitives,
                 and attempts to create exponential cancellations in
                 computation. In this article we survey this new theory
                 of matchgate computations and holographic algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2008:DCP,
  author =       "Idit Keidar",
  title =        "On distributed computing principles in systems
                 research: introduction",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "82--83",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388256",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Keidar08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Distributed systems are increasingly deployed in the
                 real world nowadays. Concepts like high-availability,
                 disaster recovery, service-oriented architectures, grid
                 computing, and peer-to-peer are now a standard part of
                 a software engineer's vocabulary. Data is often stored
                 on remote servers or disks, and redundancy is employed
                 for fault-tolerance and high availability. Even
                 computations on a single machine are becoming
                 increasingly parallel due to the advent of multi-core
                 architectures, as discussed in the previous Distributed
                 Computing Column.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Clement:2008:DCS,
  author =       "Allen Clement",
  title =        "Distributed computing in {SOSP} and {OSDI}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "84--91",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388257",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Clement08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "SOSP, the ACM Symposium on Operating Systems
                 Principles, and OSDI, the USENIX Symposium no Operating
                 System Design and Implementation, are ``the world's
                 premier forum for researches, developers, programmers,
                 vendors, and teachers of operating systems technology''
                 according to the SOSP home page. While it may seem odd
                 to discuss operating systems conferences in a column
                 dedicated to distributed computing, the proceedings of
                 the last few SOSP and OSDI's have included numerous
                 papers focused on topics more traditionally associated
                 with distributed computing---primarily transactions,
                 Byzantine fault tolerance, and large distributed
                 systems. In this article we highlight papers from the
                 last 3 years of SOSP and OSDI that are especially
                 relevant to the distributed computing community,
                 identifying areas where the distributed computing
                 community was clearly ahead of its time and others
                 where it was not.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Friedman:2008:MFC,
  author =       "Roy Friedman and Anne-Marie Kermarrec and Michel
                 Raynal",
  title =        "Modularity: a first class concept to address
                 distributed systems",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "91--110",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388258",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#FriedmanKR08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vianu:2008:MFC,
  author =       "Victor Vianu",
  title =        "Modularity: a first class concept to address
                 distributed systems",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "91--110",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388258",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Decomposing distributed systems into modules, each
                 with a precise interface and a functional
                 implementation independent specification, is highly
                 effective both from a software engineering point of
                 view and for theoretical purposes. The usefulness of
                 this approach has been demonstrated in the past in
                 several areas of distributed computing. Yet, despite
                 its attractiveness, so far work on peer to peer systems
                 failed to do so. This paper argues in favor of this
                 approach and advocates such a decomposition for peer to
                 peer systems. This allows designers to understand and
                 explain both what a system does and how it does it.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Suciu:2008:PD,
  author =       "Dan Suciu",
  title =        "Probabilistic databases",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "2",
  pages =        "111--124",
  month =        jun,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1388240.1388260",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Suciu08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Many applications today need to manage large data sets
                 with uncertainties. In this paper we describe the
                 foundations of managing data where the uncertainties
                 are quantified as probabilities. We review the basic
                 definitions of the probabilistic data model and present
                 some fundamental theoretical results for query
                 evaluation on probabilistic databases.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Borcher:2008:BRB,
  author =       "Brian Borcher",
  title =        "Book Review: {{\booktitle{Combinatorial Optimization:
                 Packing and Covering}}, by G{\'e}rard Cornu{\'e}jols}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "16--18",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412702",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Cornuejols08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Cornuejols:2001:COP}.",
  abstract =     "This book is based on a series of ten lectures given
                 by Cornu{\'e}jols at a CBMS-NSF regional conference in
                 1999. It is a monograph on the polyhedral combinatorics
                 of packing and covering problems. The fundamental
                 approach is to formulate a combinatorial optimization
                 problem as an integer linear programming problem and
                 then determine conditions under which the feasible
                 region of the linear programming (LP) relaxation of the
                 problem has integral vertices. In such cases, the
                 problem can be solved efficiently by simply solving the
                 LP relaxation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schroder:2008:BRB,
  author =       "Bernd S. W. Schr{\"o}der",
  title =        "Book Review: {{\booktitle{Ordered Sets: An
                 Introduction}}}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "18--21",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412703",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Schroder08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Schroder:2003:OSI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cohen:2008:JRB,
  author =       "Jonathan A. Cohen",
  title =        "Joint review of {{\booktitle{General Lattice Theory}}
                 (second edition) and \booktitle{The Congruences of a
                 Finite Lattice: a Proof-by-Picture Approach}, by George
                 Gr{\"a}tzer}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "22--26",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412704",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Gratzer08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Gratzer:1978:GLTa,Gratzer:1978:GLTb,Gratzer:1998:GLT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gratzer:2008:BRJ,
  author =       "George Gr{\"a}tzer",
  title =        "A brief response to {J. A. Cohen}'s joint review",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "26--28",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412705",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Gratzer08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Cohen:2008:JRB}.",
  abstract =     "Would not call this a rebuttal. I agree with most
                 everything the reviewer writes, and I thank him for his
                 effort. Nevertheless, as the author of the two books
                 under review, I see some things differently.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2008:BRBc,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Applied Combinatorics on
                 Words}}}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "28--30",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412706",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Lothaire08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lothaire:2005:ACW}.",
  abstract =     "Text manipulations play an important part in various
                 kinds of computations. The subject of text
                 manipulations, is a well developed subject in computer
                 science. The book deals with algorithms, and
                 theoretical properties of texts. Most of algorithms are
                 expressed in pseudo code. They are accompanied by their
                 proofs of correctness, and complexity analysis. Some of
                 them are explained with discussions containing
                 examples, and diagrams. The stress is on combinatorial
                 properties. The book is a part of a series on
                 encyclopedia of mathematics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gopalakrishnan:2008:RCE,
  author =       "Ganesh Lalitha Gopalakrishnan",
  title =        "Review computation engineering: applied automata
                 theory and logic",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "30--32",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412707",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Gopalakrishnan08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2008:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "33--34",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412708",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Kelley08c;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:2008:CCCa,
  author =       "Oded Goldreich",
  title =        "Computational complexity: a conceptual perspective",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "35--39",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412710",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Goldreich08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This book is rooted in the thesis that complexity
                 theory is extremely rich in conceptual content, and
                 that this contents should be explicitly communicated in
                 expositions and courses on the subject. The desire to
                 provide a corresponding textbook is indeed the
                 motivation for writing the current book and its main
                 governing principle. The book offers a conceptual
                 perspective on complexity theory, and the presentation
                 is designed to highlight this perspective. It is
                 intended mainly for students that wish to learn
                 complexity theory and for educators that intend to
                 teach a course on complexity theory. The book is also
                 intended to promote interest in complexity theory and
                 make it accessible to general readers with adequate
                 background (which is mainly being comfortable with
                 abstract discussions, definitions and proofs). We
                 expect most readers to have a basic knowledge of
                 algorithms, or at least be fairly comfortable with the
                 notion of an algorithm. The book focuses on several
                 sub-areas of complexity theory (including, e.g.,
                 pseudorandomness and probabilistic proof systems). In
                 each case, the exposition starts from the intuitive
                 questions addresses by the sub-area, as embodied in the
                 concepts that it studies. The exposition discusses the
                 fundamental importance of these questions, the choices
                 made in the actual formulation of these questions and
                 notions, the approaches that underly the answers, and
                 the ideas that are embedded in these answers. Our view
                 is that these (\non-technical``) aspects are the core
                 of the field, and the presentation attempts to re ect
                 this view.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2008:RNI,
  author =       "Lane A. Hemaspaandra",
  title =        "Research {Notices}: {The} injectivity of the global
                 function of a cellular automaton in the hyperbolic
                 plane is undecidable",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "40--40",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412711",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Margenstern:2008:RNI,
  author =       "Maurice Margenstern",
  title =        "Research Notices: The injectivity of the global
                 function of a cellular automaton in the hyperbolic
                 plane is undecidable",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "40",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412711",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Dec 06 15:20:39 2003",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Margenstern08;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dinur:2008:PSS,
  author =       "Irit Dinur",
  title =        "{PCPs} with small soundness error",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "41--57",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412713",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Dinur08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The soundness error of a PCP verifier is the
                 probability (usually denoted $ \epsilon $) that the
                 verifier accepts an incorrect input. We are interested
                 in the smallest possible values of $ \epsilon $ for
                 which the PCP theorem holds, and in particular whether
                 the theorem holds when $ \epsilon $ is an inverse
                 polynomial function of the input length. We discuss the
                 'sliding scale conjecture' of [BGLR93, LY94] and
                 related questions. We then sketch some of the existing
                 approaches and constructions of PCPs with sub-constant
                 soundness error.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2008:CGCb,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 51",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "58--62",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412714",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#ORourke08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Can a simple spherical polygon always be triangulated?
                 The answer depends on the definitions of ``polygon''
                 and ``triangulate''. Define a spherical polygon to be a
                 simple, closed curve on a sphere $S$ composed of a
                 finite number of great circle arcs (also known as
                 geodesic arcs) meeting at vertices. Can every spherical
                 polygon be triangulated? Figure 1 shows an example of
                 what is intended. The planar analog is well-known and a
                 cornerstone of computational geometry: the interior of
                 every planar simple polygon can be triangulated (and
                 efficiently so). The situation for spherical polygons
                 is not so straightforward. There are three
                 complications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lenzerini:2008:DTC,
  author =       "Maurizio Lenzerini",
  title =        "Database theory column: report on {PODS} 2008",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "63--65",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412715",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Lenzerini08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2008:ASNb,
  author =       "Idit Keidar",
  title =        "{ACM} {SIGACT} News Distributed Computing Column 31:
                 quantum computers meet distributed computing",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "66--66",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412716",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Keidar08a;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Broadbent:2008:CQM,
  author =       "Anne Broadbent and Alain Tapp",
  title =        "Can quantum mechanics help distributed computing?",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "67--76",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412717",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#BroadbentT08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present a brief survey of results where quantum
                 information processing is useful to solve distributed
                 computation tasks. We describe problems that are
                 impossible to solve using classical resources but that
                 become feasible with the help of quantum mechanics. We
                 also give examples where the use of quantum information
                 significantly reduces the need for communication. The
                 main focus of the survey is on communication complexity
                 but we also address other distributed tasks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Denchev:2008:DQC,
  author =       "Vasil S. Denchev and Gopal Pandurangan",
  title =        "Distributed quantum computing: a new frontier in
                 distributed systems or science fiction?",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "77--95",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412718",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#DenchevP08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Quantum computing and distributed systems may enter a
                 mutually beneficial partnership in the future. On the
                 one hand, it is much easier to build a number of small
                 quantum computers rather than a single large one. On
                 the other hand, the best results concerning some of the
                 fundamental problems in distributed computing can
                 potentially be dramatically improved upon by taking
                 advantage of the superior resources and processing
                 power that quantum mechanics offers. This survey has
                 the purpose to highlight both of these benefits. We
                 first review the current results regarding the
                 implementation of arbitrary quantum algorithms on
                 distributed hardware. We then discuss existing
                 proposals for quantum solutions of leader election ---
                 a fundamental problem from distributed computing.
                 Quantum mechanics allows leader election to be solved
                 with no communication, provided that certain pre-shared
                 entanglement is already in place. Further, an
                 impossibility result from classical distributed
                 computing is circumvented by the quantum solution of
                 anonymous leader election --- a unique leader is
                 elected in finite time with certainty. Finally, we
                 discuss the viability of these proposals from a
                 practical perspective. Although, theoretically,
                 distributed quantum computing looks promising, it is
                 still unclear how to build quantum hardware and how to
                 create and maintain robust large-scale entangled
                 states. Moreover, it is not clear whether the costs of
                 creating entangled states and working with them are
                 smaller than the costs of existing classical
                 solutions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2008:SNO,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 13: 2007 --- an
                 offine perspective",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "3",
  pages =        "96--121",
  month =        sep,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1412700.1412719",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Chrobak08;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This is a survey of last year's work on online
                 competitive algorithms. The survey covers only
                 conference papers, including those from SODA, FOCS,
                 STOC, STACS, COCOON, ISAAC, ESA, ICALP, WAOA, and
                 ISAAC. I tried to focus on research directly dealing
                 with competitive analysis, and in many cases I had to
                 make judgment calls, whether to include them or not. My
                 initial intent was to cover only some highlights,
                 representative of the current trends in the field, but
                 somehow, over time, it grew to a much longer and
                 comprehensive document. I feel compelled to add that,
                 with the deadline approaching, I was not able to spend
                 as much time on debugging as I should, and some errors
                 and omissions are, I'm afraid, inevitable. If you spot
                 anything that should be corrected, please let me
                 know.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2008:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "15--17",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466392",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stinson:2008:CDC,
  author =       "Douglas R. Stinson",
  title =        "Combinatorial designs: constructions and analysis",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "17--21",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466393",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2008:CP,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Combinatorics of permutations",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "21--25",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466394",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Charalambides:2008:EC,
  author =       "Charalambos A. Charalambides",
  title =        "Enumerative combinatorics",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "25--27",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466395",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2008:BRB,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Book Review: {{\booktitle{Geometric Algebra for
                 Computer Science}}, by Leo Dorst, Daniel Fontijne, and
                 Stephen Mann (Morgan Kaufmann Publishers, 2007)}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "27--30",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466396",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dorst:2007:GAC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jankowski:2008:BRBb,
  author =       "Richard Jankowski",
  title =        "Book Review: {{\booktitle{Privacy on the Line: The
                 Politics of Wiretapping and Encryption}}, by Whitfield
                 Diffie and Susan Landau}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "30--32",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466397",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Diffie:1998:PLP,Diffie:2007:PLP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2008:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "33--34",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466398",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2008:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 61",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "35--36",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466400",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Williams:2008:APT,
  author =       "Ryan Williams",
  title =        "Applying practice to theory",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "37--52",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466401",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "How can complexity theory and algorithms benefit from
                 practical advances in computing? We give an overview of
                 some prior work using practical computing to attack
                 problems in computational complexity and algorithms,
                 informally describe how linear program solvers may be
                 used to help prove new lower bounds for satisfiability,
                 and suggest a research program for developing new
                 understanding in circuit complexity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2008:ASNc,
  author =       "Idit Keidar",
  title =        "{ACM SIGACT} news distributed computing column 32: the
                 year in review",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "53--54",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466402",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Castaneda:2008:RP,
  author =       "Armando Casta{\~n}eda",
  title =        "A review of {PODC} 2008",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "55--59",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466403",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Danek:2008:RD,
  author =       "Robert Danek and Wojciech Golab and Wojciech
                 Wawrzyniak",
  title =        "Review of {DISC 2008}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "60--65",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466404",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guz:2008:RS,
  author =       "Zvika Guz",
  title =        "Review of {SPAA'08}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "66--68",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466405",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kliot:2008:RD,
  author =       "Gabriel Kliot",
  title =        "Review of {DSN'08}",
  journal =      j-SIGACT,
  volume =       "39",
  number =       "4",
  pages =        "69--73",
  month =        dec,
  year =         "2008",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1466390.1466406",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "8--10",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515700",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRBa,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Blown to Bits: Your Life,
                 Liberty, and Happiness After the Digital Explosion}},
                 by Hal Abelson, Ken Ledeen, and Harry Lewis (Addison
                 Wesley, 2008)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "10--13",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515701",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Abelson:2008:BBY}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2009:BRBa,
  author =       "S. C. Coutinho",
  title =        "Book Review: {{\booktitle{Solving Polynomial Equation
                 Systems II: Macaulay's Paradigm and Gr{\"o}bner
                 Technology}}, by Teo Mora (Cambridge University Press
                 2005)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "14--17",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515702",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mora:2003:SPE,Mora:2005:SPE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Smith:2009:BRB,
  author =       "Brent Smith",
  title =        "Book Review: {{\booktitle{How to Prove It: a
                 Structured Approach}}, by Daniel J. Velleman (Cambridge
                 University Press, 2006)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "18--20",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515703",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Velleman:1994:HPI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Borchers:2009:BRB,
  author =       "Brian Borchers",
  title =        "Book Review: {{\booktitle{Practical Optimization:
                 Algorithms and Engineering Applications}}, by Andreas
                 Antoniou and Wu-Sheng Lu (Springer Verlag, 2007)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "20--22",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515704",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Antoniou:2007:POA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRBb,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Rock, Paper, Scissors: Game
                 Theory for Everyday Life}}, by Len Fisher (Basic Books,
                 2008)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "22--23",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515705",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Fisher:2008:RPS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "24--25",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515706",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2009:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 62",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "26--26",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515708",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Viola:2009:GCC,
  author =       "Emanuele Viola",
  title =        "Guest {Column}: correlation bounds for polynomials
                 over $ \{ 0, 1 \} $",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "27--44",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515709",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article is a unified treatment of the
                 state-of-the-art on the fundamental challenge of
                 exhibiting explicit functions that have small
                 correlation with low-degree polynomials over {0 1 }. It
                 discusses long-standing results and recent
                 developments, related proof techniques, and connections
                 with pseudorandom generators. It also suggests several
                 research directions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2009:ASNa,
  author =       "Idit Keidar",
  title =        "{ACM SIGACT} news distributed computing column 33
                 teaching concurrency",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "45--46",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515710",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hendler:2009:BRB,
  author =       "Danny Hendler",
  title =        "Book Review: {{\booktitle{Synchronization Algorithms
                 and Concurrent Programming}}, by Gadi Taubenfeld
                 (Pearson\slash Prentice Hall, 2006)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "47--50",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515711",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Taubenfeld:2006:SAC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fekete:2009:TAT,
  author =       "Alan D. Fekete",
  title =        "Teaching about threading: where and what?",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "51--57",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515712",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Trends in hardware and software are increasing the
                 importance of concurrent programming, in the skill set
                 expected of graduates. The curriculum is fairly full
                 already, so teachers face complicated trade-offs in
                 deciding how to incorporate additional material related
                 to concurrency. In this paper we discuss some of the
                 different ways to cover thread programming; we also
                 survey the literature on this topic from the Computing
                 Education community.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lamport:2009:TC,
  author =       "Leslie Lamport",
  title =        "Teaching concurrency",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "1",
  pages =        "58--62",
  month =        mar,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1515698.1515713",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "10--13",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556156",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sgarbas:2009:BRB,
  author =       "Kyriakos N. Kyriakos N. Sgarbas",
  title =        "Book Review: {{\booktitle{How to Think about
                 Algorithms}}, by Je Edmonds (Cambridge University
                 Press, 2008)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "13--17",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556157",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Edmonds:2008:HTA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:BRB,
  author =       "Dean Kelley",
  title =        "Book Review: {{\booktitle{A Programmer's Companion to
                 Algorithm Analysis}}, by Ernst Leiss (Chapman \&
                 Hall\slash CRC, 2007)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "18--22",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556158",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Leiss:2007:PCA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:JRB,
  author =       "Dean Kelley",
  title =        "Joint review of {{\booktitle{Algorithms}}, by Richard
                 Johnsonbaugh and Marcus Schaefer (Pearson\slash
                 Prentice-Hall, 2004) and \booktitle{Algorithms} by
                 Sanjoy Dasgupta, Christos Papadimitriou and Umesh
                 Vazirani (McGraw-Hill, 2008)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "23--25",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556159",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Johnsonbaugh:2003:A,Dasgupta:2008:A}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mavronicolas:2009:BRB,
  author =       "Marios Mavronicolas",
  title =        "Book Review: {{\booktitle{Design and Analysis of
                 Randomized Algorithms: Introduction to Design
                 Paradigms}}, by Juraj Hromkovic (Published by
                 Springer)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "25--27",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556160",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hromkovic:2003:AHP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Marecek:2009:BRB,
  author =       "Jakub Marecek",
  title =        "Book Review: {{\booktitle{Theoretical Aspects of Local
                 Search}}, by Wil P. A. J. Michiels, Emile H. L. Aarts,
                 and Jan H. M. Korst (Springer in the EATCS Series
                 Monographs in Theoretical Computer Science, 007)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "27--30",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556161",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Michiels:2007:TAL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Springer:2009:BRB,
  author =       "William M. {Springer II}",
  title =        "Book Review: {{\booktitle{The Traveling Salesman
                 Problem: a Computational Study}}, by Applegate, Bixby,
                 Chv{\'a}tal, and Cook (Princeton University Press)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "30--32",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556162",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Applegate:2006:TSP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dean:2009:BRB,
  author =       "Alice M. Dean",
  title =        "Book Review: {{\booktitle{Visibility Algorithms in the
                 Plane}}, by Subir Kumar Ghosh (Cambridge University
                 Press, 2007)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "33--35",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556163",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Ghosh:2007:VAP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schae:2009:BRB,
  author =       "Elisa Schae",
  title =        "Book Review: {{\booktitle{A Course on the Web Graph}},
                 by Anthony Bonato (American Mathematical Society,
                 Providence, Rhode Island, USA)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "35--37",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556164",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bonato:2008:CWG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2009:BRB,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Book Review: {{\booktitle{Higher Arithmetic: an
                 Algorithmic Introduction to Number Theory}}, by H. M.
                 Edwards (American Mathematical Society Student
                 Mathematical Library Vol. 45, 2008)}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "38--41",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556165",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Edwards:2008:HAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "42--44",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556166",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Demontis:2009:SNH,
  author =       "R. Demontis",
  title =        "A simple {NP}-hard problem",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "45--48",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556167",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2009:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 63",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "49--49",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556169",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Trevisan:2009:GCA,
  author =       "Luca Trevisan",
  title =        "Guest column: additive combinatorics and theoretical
                 computer science",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "50--66",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556170",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Additive combinatorics is the branch of combinatorics
                 where the objects of study are subsets of the integers
                 or of other abelian groups, and one is interested in
                 properties and patterns that can be expressed in terms
                 of linear equations. More generally, arithmetic
                 combinatorics deals with properties and patterns that
                 can be expressed via additions and multiplications. In
                 the past ten years, additive and arithmetic
                 combinatorics have been extremely successful areas of
                 mathematics, featuring a convergence of techniques from
                 graph theory, analysis and ergodic theory. They have
                 helped prove long-standing open questions in additive
                 number theory, and they offer much promise of future
                 progress. Techniques from additive and arithmetic
                 combinatorics have found several applications in
                 computer science too, to property testing,
                 pseudorandomness, PCP constructions, lower bounds, and
                 extractor constructions. Typically, whenever a
                 technique from additive or arithmetic combinatorics
                 becomes understood by computer scientists, it finds
                 some application. Considering that there is still a lot
                 of additive and arithmetic combinatorics that computer
                 scientists do not understand (and, the field being very
                 active, even more will be developed in the near
                 future), there seems to be much potential for future
                 connections and applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2009:ASNb,
  author =       "Idit Keidar",
  title =        "{ACM SIGACT} news distributed computing column 34:
                 distributed computing in the clouds",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "67--67",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556171",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Birman:2009:TCC,
  author =       "Ken Birman and Gregory Chockler and Robbert van
                 Renesse",
  title =        "Toward a cloud computing research agenda",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "68--80",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556172",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2008 LADIS workshop on Large Scale Distributed
                 Systems brought together leaders from the commercial
                 cloud computing community with researchers working on a
                 variety of topics in distributed computing. The dialog
                 yielded some surprises: some hot research topics seem
                 to be of limited near-term importance to the cloud
                 builders, while some of their practical challenges seem
                 to pose new questions to us as systems researchers.
                 This brief note summarizes our impressions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cachin:2009:TC,
  author =       "Christian Cachin and Idit Keidar and Alexander
                 Shraer",
  title =        "Trusting the cloud",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "81--86",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556173",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "More and more users store data in ``clouds'' that are
                 accessed remotely over the Internet. We survey
                 well-known cryptographic tools for providing integrity
                 and consistency for data stored in clouds and discuss
                 recent research in cryptography and distributed
                 computing addressing these problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bortnikov:2009:OSG,
  author =       "Edward Bortnikov",
  title =        "Open-source grid technologies for web-scale
                 computing",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "87--93",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556174",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Barga:2009:CCA,
  author =       "Roger Barga and Jose Bernabeu-Auban and Dennis Gannon
                 and Christophe Poulain",
  title =        "Cloud computing architecture and application
                 programming: {DISC'09} tutorial, half day, {Sept}. 22nd
                 2009",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "2",
  pages =        "94--95",
  month =        jun,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1556154.1556175",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "21--24",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRBc,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{The Mathematical Coloring
                 Book: Mathematics of Coloring and the Colorful Life of
                 Its Creators}}, by Alexander Soifer}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "24--31",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620494",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Soifer:2009:MCB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:JRP,
  author =       "William Gasarch",
  title =        "Joint review of {{\booktitle{Professor Stewart's
                 Cabinet of Mathematical Curiosities}}, by Ian Stewart
                 and \booktitle{Five Minute Mathematics}, by Ehrhard
                 Behrends and \booktitle{Aha Gotcha!-Aha Insight!} by
                 Martin Gardner and \booktitle{Origami, Eleusis, and the
                 Soma Cube}, by Martin Gardner and
                 \booktitle{Hexaexagons, Probability Paradoxes, and the
                 Tower of Hanoi}, by Martin Gardner and \booktitle{Group
                 Theory in the Bedroom and Other Mathematical
                 Diversions}, by Brian Hayes}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "32--37",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620495",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Gardner:2006:ATV,Behrends:2008:FMM,Gardner:2008:OES,Hayes:2008:GTB,Stewart:2009:PSC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2009:BRBa,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Combinatorics and Graph
                 Theory}}: (second edition) by John M. Harris, Jeffry L.
                 Hirst and Michael J. Mossinghoff}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "37--39",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620496",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Harris:2000:CGT,Harris:2008:CGT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2009:BRBb,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Algorithmic Combinatorics on
                 Partial Words}}, by Francine Blanchet-Sadri}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "39--41",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620497",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Blanchet-Sadri:2008:ACP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{El-Atawy:2009:BRB,
  author =       "Adel El-Atawy",
  title =        "Book Review: {{\booktitle{An Introduction to
                 Difference Equations}}: third edition by Saber
                 Elaydi}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "42--46",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620498",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Elaydi:1996:IDE,Elaydi:1999:IDE,Elaydi:2005:IDE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2009:BRBc,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Random Graphs}}: (second
                 edition) by B{\'e}la Bollob{\'a}s}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "46--48",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620499",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bollobas:1985:RG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2009:CEP,
  author =       "Eowyn Cenek",
  title =        "Chases and escapes by {Paul J}. {Nahin}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "48--50",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620500",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "51--52",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620501",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:2009:ODS,
  author =       "Oded Goldreich",
  title =        "On our duties as scientists",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "53--59",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620503",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Our primary duty as scientists is to contribute to the
                 progress of science. By doing so, we best fulfill our
                 duties to the society at large. Our primary duty is not
                 fulfilled by merely doing research, but rather by
                 communicating our findings to the relevant scientific
                 community. The role of this community in the scientific
                 process, entails some important (secondary) duties
                 towards this community (e.g., evaluation of scientific
                 work and education of future generations of
                 researchers). Needless to say, this essay presents my
                 own subjective opinions regarding the aforementioned
                 issues. I also seize the opportunity to express some
                 related and less related opinions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2009:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 64",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "60--76",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620505",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Autoreducibility and mitoticity express weak forms of
                 redundancy of information that a set might possess. We
                 describe many results known about these concepts.
                 Mitoticity always implies autoreducibility, but the
                 converse holds in some situations and fails in others.
                 Among the results we describe are that NP-complete sets
                 are many-one autoreducible and that every many-one
                 autoreducible set is many-one mitotic. In particular,
                 every infinite NPcomplete set splits by a set in P into
                 two disjoint, infinite NP-complete set.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2009:ASNc,
  author =       "Idit Keidar",
  title =        "{ACM SIGACT} news distributed computing column 35:
                 theory and practice in large distributed systems",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "77--77",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620506",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zhou:2009:BRL,
  author =       "Lidong Zhou",
  title =        "Building reliable large-scale distributed systems:
                 when theory meets practice",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "78--85",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620507",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2009:SNO,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 14",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "3",
  pages =        "86--98",
  month =        sep,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1620491.1620508",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2009:BRCd,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "8--10",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711477",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hacken:2009:QCQ,
  author =       "George Hacken",
  title =        "Quantum computation and quantum communication: theory
                 and experiments {Author} of book: {Mladen Pavicic}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "10--14",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711478",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2009:BRBb,
  author =       "S. C. Coutinho",
  title =        "Book Review: {{\booktitle{Quantum Computing for
                 Computer Scientists}}, by Noson S. Yanofsky and Mirco
                 A. Mannucci, Cambridge University Press, 2008}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "14--17",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711479",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Yanofsky:2008:QCC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kyer:2009:BRB,
  author =       "Brad G. Kyer",
  title =        "Book Review: {{\booktitle{Biologically Inspired
                 Algorithms for Financial Modelling}}, by Anthony
                 Brabazon, Michael O'Neill Springer-Verlag Berlin
                 Heidelberg, 2006}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "17--23",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711480",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Brabazon:2006:BIA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chakrabarti:2009:RBH,
  author =       "Kushal Chakrabarti",
  title =        "Book Review: {{\booktitle{The Handbook of Bioinspired
                 Algorithms and Applications}}, edited by Stephan Olariu
                 and Albert Y. Zomaya, Chapman \& Hall / CRC, 679 pages,
                 \$139.95}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "23--35",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711481",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Olariu:2006:HBA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2009:RTE,
  author =       "Maulik A. Dave",
  title =        "Review 17 of {{\booktitle{Theoretical and Experimental
                 DNA Computation}}, by M. Amos. Published in 2005 by
                 Springer-Verlag, Berlin, Heidelberg}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "35--36",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711482",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Amos:2005:TED}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Talib:2009:BRB,
  author =       "Fatima Talib",
  title =        "Book Review: {{\booktitle{Coding for Data and Computer
                 Communications}}, by David Salomon. Springer, 2005}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "36--41",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711483",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Salomon:2005:CDC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2009:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "42--44",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2009:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 65",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "45--45",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711486",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dvir:2009:GCR,
  author =       "Z. Dvir",
  title =        "Guest column: from randomness extraction to rotating
                 needles",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "46--61",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711487",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The finite field Kakeya problem deals with the way
                 lines in different directions can overlap in a vector
                 space over a finite field. This problem came up in the
                 study of certain Euclidean problems and, independently,
                 in the search for explicit randomness extractors. We
                 survey recent progress on this problem and describe
                 several of its applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Su:2009:DTC,
  author =       "Jianwen Su",
  title =        "Database theory column: report on {PODS} 2009",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "62--63",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711488",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2009:DCC,
  author =       "Idit Keidar",
  title =        "Distributed computing column 36: Distributed
                 Computing: 2009 edition",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "64--67",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711489",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rodrigues:2009:BLT,
  author =       "Rodrigo Rodrigues",
  title =        "{Barbara Liskov}'s {Turing} award",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "68--70",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711490",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Censor:2009:RP,
  author =       "Keren Censor and Christoph Lenzen",
  title =        "A review of {PODC} 2009",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "71--74",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711491",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tielmann:2009:RD,
  author =       "Andreas Tielmann",
  title =        "A review of {DISC} 2009",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "75--79",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711492",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gramoli:2009:WTT,
  author =       "Vincent Gramoli",
  title =        "What theory for transactional memory?",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "79--81",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711493",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuznetsov:2009:BWW,
  author =       "Petr Kuznetsov and Rodrigo Rodrigues",
  title =        "{BFTW} 3: Why? When? Where? Workshop on the theory and
                 practice of {Byzantine} fault tolerance",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "82--86",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711494",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The first BFTW3 workshop took place in Elche, Spain,
                 on the 22nd of September, just before the 23rd
                 International Symposium on Distributed Computing
                 (DISC). The workshop gathered researchers from both the
                 theory and systems communities and aimed at discussing
                 recent advances and understanding why the impressive
                 research activity in the area of Byzantine
                 fault-tolerance is not yet instantiated in practice.
                 Has the moment for a wide deployment of BFT systems
                 arrived, and if so, where BFT systems should be
                 deployed in the first place?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gilbert:2009:RSW,
  author =       "Seth Gilbert and Dariusz R. Kowalski",
  title =        "Reliability and security in wireless networks",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "86--87",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711495",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Baldoni:2009:TAD,
  author =       "Roberto Baldoni and Alexander A. Shvartsman",
  title =        "Theoretical aspects of dynamic distributed systems:
                 report on the workshop, {Elche}, {Spain}, {September}
                 26, 2009",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "87--89",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711496",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Georgiou:2009:GTA,
  author =       "Chryssis Georgiou",
  title =        "Game-theoretic aspects of distributed computing",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "89--92",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711497",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Das:2009:RS,
  author =       "Shantanu Das",
  title =        "Review of {SIROCCO 2009}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "93--97",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711498",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2009:ISN,
  author =       "Marek Chrobak",
  title =        "Introduction to the {SIGACT} news online algorithms
                 column",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "98",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1711499",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Pros and cons of competitive analysis have been
                 debated since its inception in mid 1980s. Much of this
                 discussion centered around the accuracy of performance
                 evaluation methods for paging, which is probably the
                 most central among online optimization problems studied
                 in the literature, and, at the same time, ironically,
                 the most prominent example of shortcomings of
                 competitive analysis. In this quarter's column, Reza
                 Dorrigiv and Alejandro Lopez-Ortiz review the history
                 of the problem, discuss several performance models from
                 the literature, and propose a new model that avoids
                 shortcomings of previous approaches. If you are
                 interested in contributing to the column as a guest
                 writer, feel free to contact me by email. All kinds of
                 contributions related to online algorithms and
                 competitive analysis are of interest: technical
                 articles, surveys, conference reports, opinion pieces,
                 and other.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dorrigiv:2009:DNM,
  author =       "Reza Dorrigiv and Alejandro L{\'o}pez-Ortiz",
  title =        "On {Developing New Models}, with {Paging} as a {Case
                 Study}",
  journal =      j-SIGACT,
  volume =       "40",
  number =       "4",
  pages =        "98--123",
  month =        dec,
  year =         "2009",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1711475.1714372",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 21 18:30:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As computer science has progressed, numerous models
                 and measures have been developed over the years. Among
                 the most commonly used in theoretical computer science
                 are the RAM model, the I/O model, worst case analysis,
                 space (memory) usage, average case analysis, amortized
                 analysis, adaptive analysis and the competitive ratio.
                 New models are added to this list every few years to re
                 ect varying constraints imposed by novel application or
                 advances in computer architectures. Examples of
                 alternative models are the transdichotomous RAM or
                 word-RAM, the data stream model, the MapReduce model,
                 the cache oblivious model and the smoothed analysis
                 model. New models and measures, when successful expand
                 our understanding of computation and open new avenues
                 of inquiry. As it is to be expected relatively few
                 models and paradigms are introduced every year, and
                 even less are eventually proven successful. In this
                 paper we discuss rst certain shortcomings of the online
                 competitive analysis model particularly as it concerns
                 paging, discuss existing solutions in the literature as
                 well as present recent progress in developing models
                 and measures that better re ect actual practice for the
                 case of paging. From there we proceed to a more general
                 discussion on how to measure and evaluate new models
                 within theoretical computer science and how to contrast
                 them, when appropriate, to existing models. Lastly, we
                 highlight certain ``natural' choices and assumptions of
                 the standard worst-case model which are often unstated
                 and rarely explicitly justified. We contrast these
                 choices to those made in the formalization of
                 probability theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "10",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753173",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jankowski:2010:BRBa,
  author =       "Richard Jankowski",
  title =        "Book Review: {{\booktitle{Data Structures and
                 Algorithms Using Python and C++}}, by David M. Reed and
                 John Zelle Franklin, Beedle and Associates 2009}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "13--15",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753174",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Reed:2009:DSA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{El-Atawy:2010:BRB,
  author =       "Adel El-Atawy",
  title =        "Book Review: {{\booktitle{An Introduction to Data
                 Structures and Algorithms}}, by James A. Storer,
                 Birkh{\"a}user}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "15--19",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753175",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Storer:2002:IDS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jankowski:2010:BRBb,
  author =       "Richard Jankowski",
  title =        "Book Review: {{\booktitle{Advanced Data Structures}},
                 by Peter Brass, Cambridge University Press 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "19--20",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753176",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Brass:2008:ADS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Neuburger:2010:BRB,
  author =       "Shoshana Neuburger",
  title =        "Book Review: {{\booktitle{The Burrows--Wheeler
                 Transform: Data Compression, Suffix Arrays, and Pattern
                 Matching}}, by Donald Adjeroh, Timothy Bell and Amar
                 Mukherjee Springer, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "21--24",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753177",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Adjeroh:2008:BWT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sottile:2010:BRB,
  author =       "Matthew J. Sottile",
  title =        "Book Review: {{\booktitle{Curve and Surface
                 Reconstruction: Algorithms with Mathematical
                 Analysis}}, by Tamal K. Dey, Cambridge University
                 Press}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "24--27",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753178",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dey:2007:CSR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Srinivasan:2010:BRB,
  author =       "Aravind Srinivasan",
  title =        "Book Review: {{\booktitle{Concentration of Measure for
                 the Analysis of Randomized Algorithms}}, by Devdatt P.
                 Dubhashi and Alessandro Panconesi, Cambridge University
                 Press, 2009}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "28--30",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753179",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dubhashi:2009:CMA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Griffin:2010:BRB,
  author =       "John S. Griffin",
  title =        "Book Review: {{\booktitle{The modern algebra of
                 information retrieval}} by Sandor Dominich,
                 Springer-Verlag, Berlin \slash Heidelberg}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "30--34",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753180",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2010:BRBa,
  author =       "Haris Aziz",
  title =        "Book Review: {{\booktitle{Multiagent Systems:
                 Algorithmic, Game-Theoretic, and Logical Foundations}},
                 by Y. Shoham and K. Leyton-Brown, Cambridge University
                 Press, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "34--37",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753181",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shoham:2009:MSA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Natarajan:2010:BRB,
  author =       "Rajesh Natarajan",
  title =        "Book Review: {{\booktitle{The Political Mapping of
                 Cyberspace}}, by Jeremy W. Crampton, Publisher: The
                 University of Chicago Press, 2003}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "38--41",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753182",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Crampton:2003:PMCa,Crampton:2003:PMCb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2010:BRBb,
  author =       "Haris Aziz",
  title =        "Book Review: {{\booktitle{The Princeton Companion to
                 Mathematics}}, by Timothy Gowers, June Barrow-Green and
                 Imre Leader, Princeton University Press, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "41--43",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753183",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gowers:2008:PCM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sanford:2010:BRB,
  author =       "Michael Sanford",
  title =        "Book Review: {{\booktitle{Computer Viruses and
                 Malware}}, by John Aycock}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "44--47",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753184",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Aycock:2006:CVM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stamatiou:2010:BRB,
  author =       "Yannis C. Stamatiou",
  title =        "Book Review: {{\booktitle{Formal Correctness of
                 Security Protocols}}, by Giampaolo Bella,
                 Springer-Verlag}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "47--50",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753185",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bella:2007:FCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calvert:2010:BRB,
  author =       "Wesley Calvert",
  title =        "Book Review: {{\booktitle{Computability of Julia
                 Sets}}, by Mark Braverman and Michael Yampolsky,
                 Publisher: Springer, 2009}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "51--53",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753186",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Braverman:2009:CJS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2010:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "54--56",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753187",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2010:DCCa,
  author =       "Idit Keidar",
  title =        "Distributed computing column 37: Reconfiguring state
                 machines \ldots{} and the history of common knowledge",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "57--57",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753189",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moses:2010:BSK,
  author =       "Yoram Moses",
  title =        "Behind the scenes of {K\&CK}: the undelivered speech
                 for the {2009 Dijkstra Prize}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "58--62",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753190",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lamport:2010:RSM,
  author =       "Leslie Lamport and Dahlia Malkhi and Lidong Zhou",
  title =        "Reconfiguring a state machine",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "63--73",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753191",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Reconfiguration means changing the set of processes
                 executing a distributed system. We explain several
                 methods for reconfiguring a system implemented using
                 the state-machine approach, including some new ones. We
                 discuss the relation between these methods and earlier
                 reconfiguration algorithms--especially view changing in
                 group communication.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pucella:2010:SNL,
  author =       "Riccardo Pucella",
  title =        "{SIGACT} news logic column 21",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "74--74",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753192",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kramer:2010:FDC,
  author =       "Simon Kramer and Rajeev Gor{\'e} and Eiji Okamoto",
  title =        "Formal definitions and complexity results for trust
                 relations and trust domains fit for {TTPs}, the web of
                 trust, {PKIs}, and {ID}-based cryptography",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "75--98",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753193",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We propose computational, declarative definitions of
                 the concepts of weak and strong trust relations between
                 interacting agents, and trust domains of trust-related
                 agents in distributed systems. Our definitions yield
                 computational complexity results for deciding potential
                 and actual trust relationships and membership in trust
                 domains. We instantiate our trust concepts in four
                 major applications of trust, namely: Trusted Third
                 Parties (TTPs), the Web of Trust, Public-Key
                 Infrastructures (PKIs), and Identity-Based
                 Cryptography. Finally, we point out computational means
                 for building trust, and by that, building up trust
                 relations and trust domains. Our defining principle for
                 weak and strong trust is (common) belief in and
                 knowledge of agent correctness, respectively",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2010:SNOa,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 16",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "99--99",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753194",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldwasser:2010:SBM,
  author =       "Michael H. Goldwasser",
  title =        "A survey of buffer management policies for packet
                 switches",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "1",
  pages =        "100--128",
  month =        mar,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1753171.1753195",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Over the past decade, there has been great interest in
                 the study of buffer management policies in the context
                 of packet transmission for network switches. In a
                 typical model, a switch receives packets on one or more
                 input ports, with each packet having a designated
                 output port through which it should be transmitted. An
                 online policy must consider bandwidth limits on the
                 rate of transmission, memory constraints impacting the
                 buffering of packets within a switch, and variations in
                 packet properties used to differentiate quality of
                 service. With so many constraints, a switch may not be
                 able to deliver all packets, in which case some will be
                 dropped In the online algorithms community, researchers
                 have used competitive analysis to evaluate the quality
                 of an online policy in maximizing the value of those
                 packets it is able to transmit. In this article, we
                 provide a detailed survey of the field, describing
                 various models of the problem that have been studied,
                 and summarizing the known results.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "7--10",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814372",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2010:BRBa,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Analytic Combinatorics}}, by
                 Philippe Flajolet and Robert Sedgewick, published by
                 Cambridge Press, 2009, 824 pages, hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "11--14",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814373",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Flajolet:2009:AC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mount:2010:BRB,
  author =       "John Mount",
  title =        "Book Review: {{\booktitle{Combinatorics: the Rota
                 Way}}, by Joseph P. S. Kung, Gian-Carlo Rota and
                 Catherine H. Yan, published by Cambridge Press, 2009
                 396 pages, softcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "14--17",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814374",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kung:2009:CRW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Boothe:2010:BRB,
  author =       "Peter Boothe",
  title =        "Book Review: {{\booktitle{A Course in Enumeration}},
                 by Martin Aigner, Springer, 2007 555 pages,
                 hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "17--19",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814375",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Aigner:2007:CE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2010:BRBb,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{A Combinatorial Approach to
                 Matrix Theory and Its Applications}}, by Richard
                 Brualdi and Drago{\v{s}} Cvetkovi{\'c}, Published by
                 Cambridge Press, 2009, 824 pages, hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "19--22",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814376",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Brualdi:2009:CAM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wilson:2010:BRBa,
  author =       "Kevin A. Wilson",
  title =        "Book Review: {{\booktitle{The Annotated Turing}}, by
                 Charles Petzold, Publisher Wiley, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "22--26",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814377",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Petzold:2008:ATG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBa,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Logicomix Text}}, by
                 Apostolos Doxiadis and Christos Papadimitriou Art by
                 Alecos Papadatos and Annie di Donna, published by
                 Bloomsbury, 2009 314 pages, softcover. comic book!}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "26--28",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814378",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Doxiadis:2009:LES}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pincock:2010:BRB,
  author =       "Christopher Pincock",
  title =        "Book Review: {{\booktitle{Proof and Other Dilemmas:
                 Mathematics and Philosophy}}, edited by Bonnie Gold \&
                 Roger A. Simons, Spectrum Series, MAA, 2008 346 pages,
                 hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "28--33",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814379",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Gold:2008:POD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2010:BRB,
  author =       "S. C. Coutinho",
  title =        "Book Review: {{\booktitle{Essays in Constructive
                 Mathematics}}, by Harold M. Edwards, published by
                 Springer, 2005 211 pages, hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "33--36",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814380",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Edwards:2005:ECM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guimaraes:2010:BRB,
  author =       "Jos{\'e} de Oliveira Guimar{\~a}es",
  title =        "Book Review: {{\booktitle{Is Mathematics Inevitable? A
                 Miscellany}}, by Underwood Dudley (editor), The
                 Mathematical Association of America, 2008 324 pages,
                 hardcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "36--37",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814381",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dudley:2008:MIM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Williams:2010:BRB,
  author =       "Mike Williams",
  title =        "Book Review: {{\booktitle{Introduction to Languages
                 and Machines}}, by Alan P. Parkes, Springer, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "37--40",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814382",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Parkes:2008:CIL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wilson:2010:BRBb,
  author =       "Kevin A. Wilson",
  title =        "Book Review: {{\booktitle{A Second Course in Formal
                 Languages and Automata Theory}}, by Jeffrey Shallit,
                 publisher: Cambridge University Press, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "40--43",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814383",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shallit:2009:SCF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sgarbas:2010:BRB,
  author =       "Kyriakos N. Sgarbas",
  title =        "Book Review: {{\booktitle{Automata Theory with Modern
                 Applications}}, by James A. Anderson, Cambridge
                 University Press, 2006, viii + 256 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "43--46",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814384",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Anderson:2006:ATM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Friedler:2010:BRB,
  author =       "Sorelle A. Friedler",
  title =        "Book Review: {{\booktitle{Change is Possible: Stories
                 of Women and Minorities in Mathematics}}, by Patricia
                 Clark Kenschaft, published by AMS, 2005 212 pages,
                 softcover}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "47--50",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814385",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kenschaft:2005:CPS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBb,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Riot at the Calc Exam and
                 Other Mathematically Bent Stories}}, by Colin Adams,
                 published by the AMS, 2009 271 pages, softcover and
                 {\booktitle{The Great Debate: Which Is the Best
                 Number?}}, by Colin Adams VS Thomas Garrity, moderated
                 by Edward Burger, published by the MAA, 2006 and
                 {\booktitle{The United States of Mathematics
                 Presidential Debate}}, by Colin Adams VS Thomas
                 Garrity, moderated by Edward Burger, published by the
                 MAA, 2009}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "50--51",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814386",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Adams:2009:RCE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2010:TRCa,
  author =       "Lane A. Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "53--56",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814387",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shaltiel:2010:TCD,
  author =       "Ronen Shaltiel",
  title =        "Typically-correct derandomization",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "57--72",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814389",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "A fundamental question in complexity theory is whether
                 every randomized polynomial time algorithm can be
                 simulated by a deterministic polynomial time algorithm
                 (that is, whether BPP=P). A beautiful theory of
                 derandomization was developed in recent years in
                 attempt to solve this problem. In this article we
                 survey some recent work on relaxed notions of
                 derandomization that allow the deterministic simulation
                 to err on some inputs. We use this opportunity to also
                 provide a brief overview to some results and research
                 directions in `classical derandomization'.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2010:DCCb,
  author =       "Idit Keidar",
  title =        "Distributed {Computing Column} 38: {Models} for
                 algorithm design in wireless networks",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "73--73",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814390",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lotker:2010:SAS,
  author =       "Zvi Lotker and David Peleg",
  title =        "Structure and algorithms in the {SINR} wireless
                 model",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "2",
  pages =        "74--84",
  month =        jun,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1814370.1814391",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The signal-to-interference {\&} noise ratio (SINR)
                 model is one of the most commonly studied physical (or
                 fading channel) models for wireless networks. We survey
                 some recent studies aiming at achieving a better
                 understanding of the SINR model and its structural
                 properties and developing efficient design algorithms
                 and communication protocols for it.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "15--17",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855120",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBc,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Random Curves: Journeys of a
                 Mathematician}}, by Neal Koblitz, published by
                 Springer, 2008, 390 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "18--25",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855121",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Koblitz:2008:RCJ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBd,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Games of No Chance}} (1998,
                 edited by Richard Nowakowski) and {\booktitle{More
                 Games of No Chance}} (2002, edited by Richard
                 Nowakowski) and {\booktitle{Games of No Chance III}}
                 (2009, edited by Michael Albert and Richard Nowakowski
                 published by Cambridge Press)}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "26--28",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855122",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Albert:2009:GNC,Nowakowski:2002:MGN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBe,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Mathematical Treks: from
                 Surreal Numbers to Magic Circles}}, by Ivars Peterson
                 published by the MAA, 2002 170 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "29--30",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855123",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Peterson:2002:MTS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pritchard:2010:BRB,
  author =       "David Pritchard",
  title =        "Book Review: {{\booktitle{Decisions and Elections:
                 Explaining the Unexpected}}, by Donald G. Saari,
                 Cambridge University Press, 2001, ISBN 0-521-80816-2}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "30--33",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855124",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Saari:2001:DEE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wilson:2010:BRBc,
  author =       "Mark C. Wilson",
  title =        "Book Review: {{\booktitle{The Mathematics of Voting
                 and Elections: a Hands-On Approach}}, by Jonathan K.
                 Hodge and Richard E. Klima, American Mathematical
                 Society (Mathematical World Series, volume 22) 226 +
                 xiv pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "34--36",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855125",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hodge:2005:MVE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Johnson:2010:BRB,
  author =       "Samuel Johnson",
  title =        "Book Review: {{\booktitle{Branching Programs and
                 Binary Decision Diagrams: Theory and Applications}}, by
                 Ingo Wegener, Society for Industrial and Applied
                 Mathematics, 2000, 408 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "36--38",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855126",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wegener:2000:BPB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rieffel:2010:BRB,
  author =       "Eleanor Rieffel",
  title =        "Book Review: {{\booktitle{Quantum Computer Science: an
                 Introduction}}, by N. David Mermin, Cambridge Press,
                 2007, 236 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "39--44",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855127",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mermin:2007:QCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:2010:BRB,
  author =       "Jeffrey Shallit",
  title =        "Book Review: {{\booktitle{Cryptographic Applications
                 of Analytic Number Theory: Lower Bounds and
                 Pseudorandomness}}, by Igor Shparlinski, Birk{\"a}user,
                 2003}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "44--45",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855128",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Shparlinski:2003:CAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Haralambous:2010:BRB,
  author =       "Yannis Haralambous",
  title =        "Book Review: {{\booktitle{History of Mathematics}},
                 Princeton University Press, 2004, xxvi + 372 pages}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "46--50",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855129",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Nahin:2004:WLB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
  remark =       "Which book is intended: No ISBN, no author, no title
                 that matches publisher Web site, or major library
                 catalogs??",
}

@Article{Papanikolaou:2010:BRB,
  author =       "Nick Papanikolaou",
  title =        "Book Review: {{\booktitle{The Space and Motion of
                 Communicating Agents}}, by Robin Milner, Cambridge
                 University Press, 2009, ISBN 978-0-521-73833-0}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "51--55",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855130",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Milner:2009:SMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2010:TRCb,
  author =       "Lane A. Hemaspaandra",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "56--58",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855131",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2010:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News Complexity Theory Column} 67",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "58",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chattopadhyay:2010:SSD,
  author =       "Arkadev Chattopadhyay and Toniann Pitassi",
  title =        "The story of set disjointness",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "59--85",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855133",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{VanGucht:2010:DTC,
  author =       "Dirk {Van Gucht}",
  title =        "Database theory column report on {PODS 2010}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "86--87",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855134",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2010:DCCc,
  author =       "Idit Keidar",
  title =        "Distributed {Computing Column} 39: {Byzantine
                 Generals}: {The Next Generation}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "88",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{King:2010:SBC,
  author =       "Valerie King and Jared Saia",
  title =        "Scalable {Byzantine} computation",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "89--104",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855136",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vukolic:2010:BEI,
  author =       "Marko Vukoli{\'c}",
  title =        "The {Byzantine Empire} in the intercloud",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "3",
  pages =        "105--111",
  month =        sep,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1855118.1855137",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The relevance of Byzantine fault tolerance in the
                 context of cloud computing has been questioned [3].
                 While arguments against Byzantine fault tolerance
                 seemingly makes sense in the context of a single cloud,
                 i.e., a large-scale cloud infrastructure that resides
                 under control of a single, typically commercial
                 provider, these arguments are less obvious in a broader
                 context of the Intercloud, i.e., a cloud of multiple,
                 independent clouds. In this paper, we start from
                 commonly acknowledged issues that impede the adoption
                 of Byzantine fault tolerance within a single cloud, and
                 argue that many of these issues fade when Byzantine
                 fault tolerance in the Intercloud is considered.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRCd,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "12--15",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907507",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2010:JRB,
  author =       "Daniel Apon",
  title =        "Joint review of {{\booktitle{Computational Complexity:
                 a Conceptual Perspective}}, by Oded Goldreich,
                 published by Cambridge University Press, 2008 and
                 \booktitle{Computational Complexity: a Modern
                 Approach}, by Sanjeev Arora and Boaz Barak, published
                 by Cambridge University Press, 2009}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "15--21",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907510",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Goldreich:2008:CCCb,Arora:2009:CCM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Levin:2010:BRB,
  author =       "Dave Levin",
  title =        "Book Review: {{\booktitle{Algorithmic Game Theory}},
                 edited by Noam Nisan, Tim Roughgarden, Eva Tardos,
                 Vijay V. Vazirani. Cambridge University Press, ISBN
                 978-0-521-87282-9}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "21--24",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907512",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Nisan:2007:AGT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBf,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{The P = NP question and
                 G{\"o}del's lost letter}}, by Richard J. Lipton,
                 Springer, 2010}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "25--29",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907513",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lipton:2010:PQG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2010:BRBg,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{The Pea and the Sun: a
                 Mathematical Paradox}}, by Leonard Wapner Published by
                 A. K. Peters, 2005}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "30--32",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907515",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wapner:2005:PSM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Werden:2010:BRB,
  author =       "David A. Werden",
  title =        "Book Review: {{\booktitle{Coding for Data and Computer
                 Communications}}, by David Salomon, Springer, 2005}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "32--34",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907516",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Salomon:2005:CDC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coleman:2010:BRB,
  author =       "Graham Coleman",
  title =        "Book Review: {{\booktitle{Binary Quadratic Forms: an
                 Algorithmic Approach}}, by Johannes Buchmann and Ulrich
                 Vollmer Springer 2007}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "34--35",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907518",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Buchmann:2007:BQF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2010:BRB,
  author =       "David Chen",
  title =        "Book Review: {{\booktitle{Elliptic Curves}}, by
                 Lawrence C. Washington 2008, Chapman and Hall}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "36--38",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907519",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Washington:2008:ECN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Upadhyay:2010:BRB,
  author =       "Sarvagya Upadhyay",
  title =        "Book Review: {{\booktitle{Concurrent Zero-Knowledge}},
                 by Alon Rosen, Springer-Verlag, 2006}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "38--42",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907521",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Rosen:2006:CZK}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Murphy:2010:BRB,
  author =       "Cillian Murphy",
  title =        "Book Review: {{\booktitle{Introduction to
                 Cryptography}}, by Hans Delfs and Helmut Knebl,
                 Publisher: Springer, 2007, ISBN 978-3-540-49243-6}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "42--44",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907523",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Delfs:2002:ICP,Delfs:2007:ICP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fulton:2010:BRB,
  author =       "Ben Fulton",
  title =        "Book Review: {{\booktitle{Introduction to Modern
                 Cryptography}}, by Jonathan Katz and Yehuda Lindell,
                 Publisher: Chapman \& Hall-CRC 2008 1-58488-551-3}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "44--47",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907525",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Katz:2008:IMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Meiklejohn:2010:BRB,
  author =       "Sarah Meiklejohn",
  title =        "Book Review: {{\booktitle{An Introduction to
                 Mathematical Cryptography}}, by Jeffrey Hoffstein, Jill
                 Pipher, and Joseph Silverman Springer-Verlag, 2008}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "47--50",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907527",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hoffstein:2008:IMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lee:2010:BRB,
  author =       "Andrew C. Lee",
  title =        "Book Review: {{\booktitle{Software Abstractions:
                 Logic, Language and Analysis}}, by Daniel Jackson, MIT
                 Press, 2006}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "50--54",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907528",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Jackson:2006:SAL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2010:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "55--57",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907529",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Clarke:2010:QAT,
  author =       "Dave Clarke and David Eppstein and Kaveh Ghasemloo and
                 Lev Reyzin and Andr{\'a}s Salamon and Peter Shor and
                 Aaron Sterling and Suresh Venkatasubramanian",
  title =        "Questions answered. in theory: {\tt
                 http://cstheory.stackexchange.com}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "58--60",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907532",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Koshelev:2010:AIT,
  author =       "Misha Koshelev and Luc Longpr{\'e}",
  title =        "Algorithmic information theory may explain the
                 pathogenic number of {DNA} repeats in myotonic
                 dystrophy type 1 (and in similar diseases)",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "61--64",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907534",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Myotonic Dystrophy Type 1 (DM1), the most common form
                 of adult-onset muscular dystrophy, is caused by an
                 abnormal number of repeats of the trinucleotide
                 sequence CTG outside of the protein-coding part of DNA
                 --- more than fifty repeats can cause disease. Several
                 other diseases are caused by similar repeats in
                 non-coding regions; in most of these diseases, up to
                 approximately fifty repeats is normal, while pathogenic
                 cases usually have > 50 repetitions. The fact that this
                 level of approximately fifty repeats can be seen in
                 many diseases, with different repeating sequences,
                 indicates that there may be a fundamental explanation
                 for this threshold. In this paper, we conjecture that
                 such an explanation may come from Algorithmic
                 Information Theory. Crudely speaking, this threshold
                 can be viewed as a measure of the redundancy in healthy
                 DNA; this indirect estimate of the measure of
                 redundancy is in good accordance with a more direct
                 estimate, based on the fact that approximately 1=50 of
                 DNA is directly functionally useful (e.g.,
                 protein-coding).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuller:2010:SNA,
  author =       "Samir Kuller and Michael W. Mahoney",
  title =        "{SIGACT} news algorithms column: Computation in
                 large-scale scientific and {Internet} data applications
                 is a focus of {MMDS 2010}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "65--72",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907538",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2010 Workshop on Algorithms for Modern Massive
                 Data Sets (MMDS 2010) was held at Stanford University,
                 June 15--18. The goals of MMDS 2010 were (1) to explore
                 novel techniques for modeling and analyzing massive,
                 high-dimensional, and nonlinearly-structured scientific
                 and Internet data sets; and (2) to bring together
                 computer scientists, statisticians, applied
                 mathematicians, and data analysis practitioners to
                 promote cross-fertilization of ideas. MMDS 2010
                 followed on the heels of two previous MMDS workshops.
                 The first, MMDS 2006, addressed the complementary
                 perspectives brought by the numerical linear algebra
                 and theoretical computer science communities to matrix
                 algorithms in modern informatics applications [1]; and
                 the second, MMDS 2008, explored more generally
                 fundamental algorithmic and statistical challenges in
                 modern large-scale data analysis [2]. The MMDS 2010
                 program drew well over 200 participants, with 40 talks
                 and 13 poster presentations from a wide spectrum of
                 researchers in modern large-scale data analysis. This
                 included both academic researchers as well as a wide
                 spectrum of industrial practitioners. As with the
                 previous meetings, MMDS 2010 generated intense
                 interdisciplinary interest and was extremely
                 successful, clearly indicating the desire among many
                 research communities to begin to distill out and
                 establish the algorithmic and statistical basis for the
                 analysis of complex large-scale data sets, as well as
                 the desire to move increasingly-sophisticated
                 theoretical ideas to the solution of practical
                 problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2010:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 68",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "73--94",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907540",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2010:DCCd,
  author =       "Idit Keidar",
  title =        "Distributed computing column 40: Annual review 2010",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "95--99",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907542",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Barenboim:2010:RP,
  author =       "Leonid Barenboim",
  title =        "A review of {PODC 2010}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "100--105",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907543",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bonnet:2010:RD,
  author =       "Fran{\c{c}}ois Bonnet",
  title =        "Review of {DISC 2010}",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "106--108",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907545",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ravi:2010:TML,
  author =       "Srivatsan Ravi and Vincent Gramoli and Victor
                 Luchangco",
  title =        "Transactional memory, linking theory and practice",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "109--115",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907546",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Transactional memory appears promising for
                 democratizing concurrent programming. Its potential
                 lies in producing code that is extensible as atomicity
                 is preserved under composition of transactions. This
                 new abstraction raises several challenges such as the
                 compliance of transactions with alternative
                 synchronization techniques of legacy code and memory
                 consistency models that favor transactional
                 programming. The objective of the Second Workshop on
                 the Theory of Transactional Memory was to discuss new
                 theoretical challenges and recent achievements in the
                 context of transactional computing. We report on some
                 of the issues raised during this workshop.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2010:SNOb,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 17",
  journal =      j-SIGACT,
  volume =       "41",
  number =       "4",
  pages =        "114--121",
  month =        dec,
  year =         "2010",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1907450.1907547",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "12--15",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959047",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:JRB,
  author =       "William Gasarch",
  title =        "Joint review of {{\booktitle{The Mathemagician and
                 Pied Puzzler: a Collection in Tribute to Martin
                 Gardner}}}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "16--22",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959048",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Berlekamp:1999:MPP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{LaTorra:2011:BRB,
  author =       "Sage LaTorra",
  title =        "Book Review: {{\booktitle{Comprehensive Mathematics
                 for Computer Scientists 1}}, by Guerino B. Mazzola,
                 Gerard Milmeister, Jody Weissmann}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "23--24",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959049",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mazzola:2006:CMC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dyer:2011:BRB,
  author =       "Jason Dyer",
  title =        "Book Review: {{\booktitle{Creative Mathematics}}, by
                 H. S. Wall}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "24--25",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959050",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Wall:1963:CM,Wall:2009:CM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Melvin:2011:BRB,
  author =       "Justin Melvin",
  title =        "Book Review: {{\booktitle{Nonlinear Integer
                 Programming}}, by Duan Li and Xiaoling Sun}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "26--29",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959051",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Li:2006:NIP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kingsford:2011:BRB,
  author =       "Carl Kingsford",
  title =        "Book Review: {{\booktitle{Complex Social Networks}},
                 by Fernando Vega-Redondo}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "29--31",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959052",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Vega-Redondo:2007:CSN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Furia:2011:BRB,
  author =       "Carlo A. Furia",
  title =        "Book Review: {{\booktitle{The Calculus of Computation:
                 Decision Procedures with Applications to
                 Verification}}, by Aaron R. Bradley and Zohar Manna}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "32--35",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959053",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bradley:2007:CCD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Adamopoulos:2011:BRB,
  author =       "Yiorgos Adamopoulos",
  title =        "Book Review: {{\booktitle{Algorithms on Strings}}, by
                 Crochemore, Hanchart and Lecroq. Published by Cambridge
                 2007, 392 pages, Hardcover, \$60.00}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "36--37",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959054",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Crochemore:2007:AS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Haralambous:2011:BRB,
  author =       "Yannis Haralambous",
  title =        "Book Review: {{\booktitle{A View from the Top:
                 Analysis, Combinatorics and Number Theory}}, by Alex
                 Iosevich}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "38--42",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959055",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Iosevich:2007:VTA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2011:BRB,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Book Review: {{\booktitle{Geometric Folding
                 Algorithms}}, by E. D. Demaine and J. O'Rourke}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "43--46",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959056",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Demaine:2007:GFA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Terese:2011:BRB,
  author =       "Brittany Terese and David L. Millman",
  title =        "Book Review: {{\booktitle{Geometric Algebra: an
                 Algebraic System for Computer Games and Animation}}, by
                 J. Vince}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "46--48",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959057",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Vince:2009:GAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRBa,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Dude, Can You Count?:
                 Stories, Challenges, and Adventures in Mathematics}},
                 by Christian Constanda}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "49--54",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959058",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Constanda:2009:DCY}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2011:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "55--57",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959059",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2011:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 69",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "58--58",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959061",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sudan:2011:GCT,
  author =       "Madhu Sudan",
  title =        "Guest column: Testing linear properties: Some general
                 theme",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "59--80",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959062",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The last two decades have seen enormous progress in
                 the development of sublinear-time algorithms --- i.e.,
                 algorithms that examine/reveal properties of `data' in
                 less time than it would take to read all of the data. A
                 large, and important, subclass of such properties turn
                 out to be `linear'. In particular, these developments
                 have contributed to the rich theory of
                 probabilistically checkable proofs (PCPs) and locally
                 testable codes (LTCs). In this survey, we focus on some
                 of the general technical themes at work behind the many
                 results in this area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2011:DCCa,
  author =       "Idit Keidar",
  title =        "Distributed computing column 41: Computing over
                 dynamic networks",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "81--81",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959063",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuhn:2011:DNM,
  author =       "Fabian Kuhn and Rotem Oshman",
  title =        "Dynamic networks: models and algorithms",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "82--96",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959064",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fotakis:2011:OIA,
  author =       "Dimitris Fotakis",
  title =        "Online and incremental algorithms for facility
                 location",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "1",
  pages =        "97--131",
  month =        mar,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1959045.1959065",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the online and incremental variants of Facility
                 Location, the demands arrive one-by-one and must be
                 assigned to an open facility upon arrival, without any
                 knowledge about future demands. In the online variant,
                 the decisions of opening a facility at a particular
                 location and of assigning a demand to some facility are
                 irrevocable. In the incremental variant, the algorithm
                 can also merge existing facilities (and the
                 corresponding demand clusters) with each other, and
                 only the decision of assigning some demands to the same
                 facility is irrevocable. The goal is to maintain,
                 either online or incrementally, a set of facilities and
                 an assignment of the demands to them that minimize the
                 total facility opening cost plus the assignment cost
                 for all demands. In this survey, we discuss the
                 previous work on online and incremental algorithms for
                 Facility Location. In addition to the main results,
                 namely that the competitive ratio for the online
                 variant is $ \Theta (\log n \log \log n) $, where $n$
                 is the number of demands, and that the competitive
                 ratio for the incremental variant is $ O(1)$, we
                 discuss all known online and incremental Facility
                 Location algorithms, sketch the intuition behind them
                 and the main ideas of their competitive analysis, and
                 discuss some applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "7--10",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998039",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Belle:2011:BRB,
  author =       "Vaishak Belle",
  title =        "Book Review: {{\booktitle{From Zero to Infinity: What
                 Makes Numbers Interesting}}, by Constance Reid}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "10--11",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998040",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Reid:2006:ZIW}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miksa:2011:BRB,
  author =       "Mladen Miksa",
  title =        "Book Review: {{\booktitle{Mathematics for the Analysis
                 of Algorithms}}, by Daniel H. Greene and Donald E.
                 Knuth}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "12--14",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998041",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Greene:1981:MAA,Greene:1982:MAA,Greene:1990:MAA,Greene:2007:MAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fitzsimons:2011:BRB,
  author =       "Joseph Fitzsimons",
  title =        "Book Review: {{\booktitle{Algebraic Cryptanalysis}},
                 by Gregory V. Bard}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "14--18",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998042",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bard:2009:AC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kopparty:2011:BRB,
  author =       "Swastik Kopparty",
  title =        "Book Review: {{\booktitle{Algebraic Function Fields
                 and Codes}}, by Henning Stichtenoth}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "19--24",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998043",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Stichtenoth:1993:AFF,Stichtenoth:2009:AFF}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRBb,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{Those Fascinating Numbers}},
                 by Jean-Marie De Koninck}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "24--27",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998044",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{deKoninck:2009:FN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Stanhope:2011:BRB,
  author =       "Stephen Stanhope",
  title =        "Book Review: {{\booktitle{P{\'o}lya Urn Models}}, by
                 Hosam Mahmoud}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "27--33",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998045",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mahmoud:2008:PUM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2011:BRB,
  author =       "S. C. Coutinho",
  title =        "Book Review: {{\booktitle{Not Always Buried Deep: A
                 Second Course in Elementary Number Theory}}, by Paul
                 Pollack}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "34--37",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998046",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Pollack:2009:ABD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Friedler:2011:BRB,
  author =       "Sorelle A. Friedler",
  title =        "Book Review: {{\booktitle{Pioneering Women in American
                 Mathematics: the pre-1940 PhD's}}, by Judy Green and
                 Jeanne LaDuke}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "37--41",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998047",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Green:2009:PWA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yan:2011:BRBa,
  author =       "Song Yan",
  title =        "Book Review: {{\booktitle{A Guide to Elementary Number
                 Theory}}, by Underwood Dudley}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "41--42",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998048",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Dudley:2009:GEN}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miettinen:2011:BRB,
  author =       "Pauli Miettinen",
  title =        "Book Review: {{\booktitle{Mathematical Tools for Data
                 Mining: Set Theory, Partial Orders, Combinatorics}}, by
                 Dan A. Simovici and Chabane Djeraba}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "43--46",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998049",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Simovici:2008:MTD}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2011:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "47--50",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998050",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2011:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 70",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "51--51",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998052",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Watrous:2011:GCI,
  author =       "John Watrous",
  title =        "Guest column: An introduction to quantum information
                 and quantum circuits 1",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "52--67",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998053",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2011:DCCb,
  author =       "Idit Keidar",
  title =        "Distributed computing column 42: Game theory and fault
                 tolerance in distributed computing",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "68--68",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998054",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abraham:2011:DCM,
  author =       "Ittai Abraham and Lorenzo Alvisi and Joseph Y.
                 Halpern",
  title =        "Distributed computing meets game theory: combining
                 insights from two fields",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "69--76",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998055",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2011:EF,
  author =       "Li Chen",
  title =        "Education Forum",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "77--81",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998056",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2011:SNO,
  author =       "Marek Chrobak",
  title =        "{SIGACT} news online algorithms column 19",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "82--82",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998057",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Im:2011:TAL,
  author =       "Sungjin Im and Benjamin Moseley and Kirk Pruhs",
  title =        "A tutorial on amortized local competitiveness in
                 online scheduling",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "2",
  pages =        "83--97",
  month =        jun,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/1998037.1998058",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "14--15",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034577",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parrish:2011:BRB,
  author =       "Andy Parrish",
  title =        "Book Review: {{\booktitle{Erd{\H{o}}s on Graphs: His
                 Legacy of Unsolved Problems}}, by Fan Chung and Ron
                 Graham}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "16--20",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034578",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Chung:1998:EGH}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2011:BRB,
  author =       "Eowyn Cenek",
  title =        "Book Review: {{\booktitle{Roots to Research}}, by
                 Judith D. Sally and Paul J. Sally, Jr.}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "20--22",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034579",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Sally:2007:RRV}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Faber:2011:BRB,
  author =       "Vance Faber",
  title =        "Book Review: {{\booktitle{Chromatic Graph Theory}}, by
                 Gary Chartrand and Ping Zhang}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "23--28",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034580",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Chartrand:2009:CGT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papamichail:2011:BRB,
  author =       "Dimitris Papamichail",
  title =        "Book Review: {{\booktitle{Applied Combinatorics}}, by
                 Fred S. Roberts and Barry Tesman}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "29--32",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034581",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Roberts:1984:AC,Roberts:2005:AC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2011:BRBa,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Applied Combinatorics}}, by
                 Fred S. Roberts and Barry Tesman}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "32--34",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034582",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Roberts:1984:AC,Roberts:2005:AC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2011:BRB,
  author =       "Micha{\"e}l Cadilhac",
  title =        "Book Review: {{\booktitle{Combinatorics: a Guided
                 Tour}}, by David R. Mazur}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "34--36",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034583",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mazur:2010:CGT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Reyzin:2011:BRB,
  author =       "Lev Reyzin",
  title =        "Book Review: {{\booktitle{Famous Puzzles of Great
                 Mathematicians}}, by Miodrag S. Petkovi{\'c}}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "36--39",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034584",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Petkovic:2009:FPG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abramson:2011:BRB,
  author =       "Myriam Abramson",
  title =        "Book Review: {{\booktitle{Combinatorics: A Problem
                 Oriented Approach}}, by Daniel A. Marcus}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "40--41",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034585",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Marcus:1998:CPO}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2011:BRBb,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Probability: Theory and
                 Examples}}, 4th edition, by Rick Durrett}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "42--45",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034586",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Durrett:2010:PTE}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2011:BRB,
  author =       "Daniel Apon",
  title =        "Book Review: {{\booktitle{Games, Puzzles, \&
                 Computation}}, by Robert A. Hearn and Erik D.
                 Demaine}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "45--49",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034587",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hearn:2009:GPC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2011:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "50--52",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034588",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2011:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 71",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "53--54",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034590",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Williams:2011:GCC,
  author =       "Ryan Williams",
  title =        "Guest column: a casual tour around a circuit
                 complexity bound",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "54--76",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034591",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I will discuss the recent proof that the complexity
                 class NEXP (nondeterministic exponential time) lacks
                 nonuniform ACC circuits of polynomial size. The proof
                 will be described from the perspective of someone
                 trying to discover it.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2011:DCCc,
  author =       "Idit Keidar",
  title =        "Distributed computing column 43: Using social networks
                 to overcome {Sybil} attacks",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "79--79",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034592",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yu:2011:SDS,
  author =       "Haifeng Yu",
  title =        "{Sybil} defenses via social networks: a tutorial and
                 survey",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "3",
  pages =        "80--101",
  month =        sep,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2034575.2034593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The sybil attack in distributed systems refers to
                 individual malicious users joining the system multiple
                 times under multiple fake identities. Sybil attacks can
                 easily invalidate the overarching prerequisite of many
                 fault-tolerant designs which assume that the fraction
                 of malicious nodes is not too large. This article
                 presents a tutorial and survey on effective sybil
                 defenses leveraging social networks. Since this
                 approach of sybil defenses via social networks was
                 introduced 5 years ago, it has attracted much more
                 attention from the research community than many other
                 alternatives. We will first explain the intuitions and
                 insights behind this approach, and then survey a number
                 of specific sybil defense mechanisms based on this
                 approach, including SybilGuard, SybilLimit, SybilInfer,
                 Gatekeeper, SumUp, Whanau, and Ostra. We will also
                 discuss some practical implications and deployment
                 considerations of this approach.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2011:BRCd,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "15--16",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078164",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Terai:2011:BRB,
  author =       "Saif Terai",
  title =        "Book Review: {{\booktitle{Foundations of Logic and
                 Mathematics Applications to Computer Science and
                 Cryptography}}, by Yves Nievergelt}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "17--21",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078165",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Nievergelt:2002:FLM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dave:2011:BRB,
  author =       "Maulik A. Dave",
  title =        "Book Review: {{\booktitle{Rippling: Meta-Level
                 Guidance for Mathematical Reasoning}} Cambridge Tracts
                 in Theoretical Computer Science 56 by Alan Bundy, David
                 Basin, Dieter Hutter, and Andrew Ireland}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "21--23",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078166",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bundy:2005:RML}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sterling:2011:BRBa,
  author =       "Aaron Sterling",
  title =        "Book Review: {{\booktitle{Handbook of Nature-Inspired
                 and Innovative Computing}}, by Albert Y. Zomaya}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "23--26",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078167",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Zomaya:2006:HNI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Elrod:2011:BRB,
  author =       "Hal C. Elrod",
  title =        "Book Review: {{\booktitle{Algorithms and Data
                 Structures: the Basic Toolbox}}, by Kurt Mehlhorn and
                 Peter Sanders}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "26--29",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078168",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mehlhorn:2008:ADS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kartha:2011:BRB,
  author =       "Neelakantan Kartha",
  title =        "Book Review: {{\booktitle{The Algorithm Design
                 Manual}}, second edition by Steven S. Skiena}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "29--31",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078169",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Skiena:1998:ADM,Skiena:2008:ADM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2011:BRB,
  author =       "Haris Aziz",
  title =        "Book Review: {{\booktitle{Graph Theory: a Problem
                 Oriented Approach}}, by Daniel Marcus}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "31--32",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078170",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Marcus:2008:GTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2011:BRBc,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{Proofs from THE BOOK}} (4th
                 edition) by Martin Aigner and G{\"u}nter M. Ziegler}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "32--37",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078171",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See
                 \cite{Aigner:1998:PB,Aigner:1999:PB,Aigner:2001:PB,Aigner:2004:PB,Aigner:2010:PB}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sterling:2011:BRBb,
  author =       "Aaron Sterling",
  title =        "Book Review: {{\booktitle{Handbook of Chemoinformatics
                 Algorithms}}, by Faulon}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "37--48",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078172",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Faulon:2010:HCA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yan:2011:BRBb,
  author =       "Song Yan",
  title =        "Book Review: {{\booktitle{Dynamic Fuzzy Logic and Its
                 Applications}}, by Fanzhang Li}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "48--49",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078173",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Li:2008:DFL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2011:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "50--52",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078174",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2011:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 72",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "53--53",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078176",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2011:GCC,
  author =       "X. Chen",
  title =        "Guest column: Complexity dichotomies of counting
                 problems",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "54--76",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078177",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The complexity of counting problems has been studied
                 intensively over the years. During the past decade,
                 significant progress has taken place and a series of
                 successively more powerful complexity dichotomies have
                 been discovered. Given a class of counting problems, a
                 dichotomy states that every problem in the class is
                 either in polynomial time or \#P-hard. In this guest
                 column, we briefly survey two threads of recent
                 developments in counting graph homomorphisms and the
                 counting constraint satisfaction problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2011:DCCd,
  author =       "Idit Keidar",
  title =        "Distributed computing column 44: 2011 in review",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "76--78",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078178",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Attiya:2011:SMR,
  author =       "Hagit Attiya",
  title =        "Sharing memories, robustly",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "79--82",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078179",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Helmi:2011:RP,
  author =       "Maryam Helmi",
  title =        "A review of {PODC 2011}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "83--86",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078180",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hakimi:2011:RD,
  author =       "Michael Hakimi and Adam Morrison",
  title =        "A review of {DISC 2011}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "87--91",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078181",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kosowski:2011:S,
  author =       "Adrian Kosowski and Dominik Pajak and Zuzanna
                 Stamirowska",
  title =        "{SIROCCO 2011}",
  journal =      j-SIGACT,
  volume =       "42",
  number =       "4",
  pages =        "92--95",
  month =        dec,
  year =         "2011",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2078162.2078182",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "7--9",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160651",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ayub:2012:BRB,
  author =       "Abu Mohammad Omar Shehab Uddin Ayub",
  title =        "Book Review: {{\booktitle{The Cryptoclub: Using
                 Mathematics to Make and Break Secret Codes}}, by Janet
                 Beissinger and Vera Pless}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "9--14",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160652",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Beissinger:2006:CUM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Irakliotis:2012:BRB,
  author =       "Leo Irakliotis",
  title =        "Book Review: {{\booktitle{Cryptanalytic Attacks on
                 RSA}}, by Song Y. Yan}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "14--16",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160653",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Yan:2007:CAR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rojat:2012:BRB,
  author =       "Antoine Rojat",
  title =        "Book Review: {{\booktitle{Cryptanalysis of RSA and its
                 variants}}, by Jason Hinek}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "16--18",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160654",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hinek:2010:CRV}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Barbay:2012:BRB,
  author =       "J{\'e}r{\'e}my Barbay",
  title =        "Book Review: {{\booktitle{Understanding and Applying
                 Cryptography and Data Security}}, by Adam J. Elbirt}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "18--21",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Elbirt:2009:UAC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2012:BRB,
  author =       "Jonathan Katz",
  title =        "Book Review: {{\booktitle{Efficient Secure Two-Party
                 Protocols: Techniques and Constructions}}, by Carmit
                 Hazay and Yehuda Lindell}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "21--23",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160656",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hazay:2010:EST}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2012:BRB,
  author =       "Daniel Apon",
  title =        "Book Review: {{\booktitle{Theory of Computation}}, by
                 Dexter C. Kozen}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "23--27",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160657",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Kozen:2006:TC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Low:2012:BRB,
  author =       "Robert J. Low",
  title =        "Book Review: {{\booktitle{Codes: an Introduction to
                 Information Communication and Cryptography}}, by Norman
                 L. Biggs}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "27--29",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160658",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Biggs:2008:CII}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:2012:BRB,
  author =       "Jeffrey Shallit",
  title =        "Book Review: {{\booktitle{Finite Fields and
                 Applications}}, by Gary L. Mullen and Carl Mummert}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "30--31",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160659",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Mullen:2007:FFA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2012:BRB,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Book Review: {{\booktitle{The Life and Times of the
                 Central Limit Theorem}}, by William J. Adams}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "32--33",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160660",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Adams:1974:LTC,Adams:2009:LTC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Szarka:2012:BRB,
  author =       "Robert Szarka",
  title =        "Book Review: {{\booktitle{Pearls of Discrete
                 Mathematics}}, by Martin Erickson}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "33--34",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160661",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Erickson:2010:PDM}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papamichail:2012:BRB,
  author =       "Dimitris Papamichail",
  title =        "Book Review: {{\booktitle{Design Theory}}, by C. C.
                 Lindner and C. A. Rodger}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "35--37",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160662",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Lindner:1997:DT}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:BRB,
  author =       "William Gasarch",
  title =        "Book Review: {{\booktitle{An Introduction to the
                 History of Algebra Solving Equations from Mesopotamian
                 Times to the Renaissance}}, by Jacques Sesiano}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "39--39",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160663",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Sesiano:2009:IHA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2012:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "40--43",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160664",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:2012:SCS,
  author =       "Oded Goldreich",
  title =        "On struggle and competition in scientic fields",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "43--60",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "What is the difference between struggling for
                 achievements and competing for success? What is the
                 effect of competitions on a scientic field? What are
                 the specific implications on TOC? In this opinionated
                 essay, I address these questions and related issues,
                 while rooting the discussion in an appropriate
                 theoretical framework.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2012:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 73",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "61--61",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moshkovitz:2012:GCA,
  author =       "Dana Moshkovitz",
  title =        "Guest column: Algebraic construction of projection
                 {PCPs}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "62--81",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160669",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In a projection PCP, also known as Label-Cover, the
                 verifier makes two queries to the proof, and the answer
                 to the first query determines at most one satisfying
                 answer to the second query. Projection PCPs with low
                 error probability are the basis of most NP-hardness of
                 approximation results known today. In this essay we
                 outline a construction of a projection PCP with low
                 error and low blow-up. This yields sharp approximation
                 thresholds and tight time lower bounds for
                 approximation of a variety of problems, under an
                 assumption on the time required for solving certain
                 NP-hard problems exactly. The approach of the
                 construction is algebraic, and it includes components
                 such as low error, randomness-efficient low degree
                 testing and composition of projection PCPs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ORourke:2012:CGC,
  author =       "Joseph O'Rourke",
  title =        "Computational geometry column 52",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "82--85",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Two art-gallery-like problems concerning transmitters
                 in polygons are described, and several open problems
                 posed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2012:DCCa,
  author =       "Idit Keidar",
  title =        "Distributed computing column 45: What theory for
                 transactional memory?",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "86--86",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160671",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuznetsov:2012:WTW,
  author =       "Petr Kuznetsov and Srivatsan Ravi",
  title =        "{WTTM 2011: The Third Workshop on the Theory of
                 Transactional Memory}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "1",
  pages =        "87--92",
  month =        mar,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2160649.2160672",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Mar 20 14:39:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "6--8",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261419",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hautamaki:2012:RBC,
  author =       "Ville Hautam{\"a}ki",
  title =        "Review of {{\booktitle{A Concise Introduction to Data
                 Compression}} by David Salomon}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "9--10",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261420",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pop:2012:RBA,
  author =       "Mihai Pop",
  title =        "Review of {{\booktitle{Parallel Algorithms}} by Henri
                 Casanova, Arnaud Legrand, and Yves Robert}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "11--14",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261421",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kumar:2012:RBR,
  author =       "Akash Kumar",
  title =        "Review of {{\booktitle{Polynomia and Related Realms}}
                 by Dan Kalman}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "15--20",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261422",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:2012:RBN,
  author =       "Jeffrey Shallit",
  title =        "Review of {{\booktitle{Biscuits of Number Theory}} by
                 Arthur T. Benjamin and Ezra Brown}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "21--24",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261423",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Istrate:2012:RBL,
  author =       "Gabriel Istrate",
  title =        "Review of {{\booktitle{Handbook of Large-Scale Random
                 Networks}} by Bela Bollob{\'a}s, Robert Kozma and
                 Desz{\"o} Mikl{\'o}s}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "25--28",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261424",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papanikolaou:2012:RBT,
  author =       "Nick Papanikolaou",
  title =        "Review of {{\booktitle{Algorithms and Theory of
                 Computation Handbook}} by Mikhail J. Atallah and Marina
                 Blanton}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "29--32",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261425",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2012:RBT,
  author =       "S. C. Coutinho",
  title =        "Review of {{\booktitle{Primality Testing and Integer
                 Factorization in Public Key Cryptography}} by Song Y.
                 Yan}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "33--35",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261426",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calvert:2012:RBA,
  author =       "Wesley Calvert",
  title =        "Review of {{\booktitle{Process Algebra: Equational
                 Theories of Communicating Processes}} by J. C. M.
                 Baeten, T. Basten, and M. A. Reniers}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "36--38",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261427",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Choo:2012:RBT,
  author =       "Kim-Kwang Raymond Choo",
  title =        "Review of {{\booktitle{Insider Threats in Cyber
                 Security}} by Probst, Hunker, Gollman, Bishop}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "38--40",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261428",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2012:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "41--44",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261429",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goldreich:2012:IIV,
  author =       "Oded Goldreich",
  title =        "On intellectual and instrumental values in science",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "45--50",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261431",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This opinionated essay discusses the role of
                 intellectual and instrumental values in scientific
                 fields, and the way these values evolve due to internal
                 and external forces. It identifies two sources of the
                 decline of intellectual values within a scientific
                 field: (1) the direct intervention of outsiders in the
                 dynamics of (successful) scientific fields, and (2) the
                 decline of intellectual values in the society at
                 large.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2012:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 74",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "51--52",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261433",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:GCS,
  author =       "William I. Gasarch",
  title =        "Guest {Column}: the second {P =? NP} poll",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "53--77",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261434",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2012:CGCa,
  author =       "Adrian Dumitrescu",
  title =        "Computational geometry column 53",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "78--83",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261435",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to partitions of point-sets
                 into convex subsets with interior-disjoint convex
                 hulls. We review some partitioning problems and
                 corresponding algorithms. At the end we list some open
                 problems. For simplicity, in most cases we remain at
                 the lowest possible interesting level, that is, in the
                 plane.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2012:DCCb,
  author =       "Idit Keidar",
  title =        "Distributed computing column 46: synthesizing
                 distributed and concurrent programs",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "84--84",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261436",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bonakdarpour:2012:AMR,
  author =       "Borzoo Bonakdarpour and Sandeep S. Kulkarni",
  title =        "Automated model repair for distributed programs",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "85--107",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261437",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Model repair is a formal method that aims at fixing
                 bugs in models automatically. Typically, these models
                 are finite state automata that can be compactly
                 represented using guarded commands or variations
                 thereof. The bugs in these models can be identified
                 using traditional techniques, such as verification,
                 testing, or runtime monitoring. However, these
                 techniques do not assist in fixing bugs automatically.
                 The goal in model repair is to automatically transform
                 an input model into another model that satisfies
                 additional properties (e.g., a property that the
                 original model fails to satisfy). Moreover, such
                 transformation should preserve the existing
                 specification of the input model. In this article, we
                 review the efforts in the past decade on developing
                 model repair algorithms in different domains. These
                 domains include distributed computing, fault-tolerance
                 and self-stabilization, and real-time systems. We
                 present the results on complexity analysis, techniques
                 for tackling intractability of the problem and
                 scalability, and related tools. The techniques and
                 tools discussed in this article demonstrate the
                 feasibility of automated synthesis of well-known
                 protocols such as Byzantine agreement, token ring,
                 fault-tolerant mutual exclusion, etc.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuperstein:2012:AIM,
  author =       "Michael Kuperstein and Martin Vechev and Eran Yahav",
  title =        "Automatic inference of memory fences",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "108--123",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261438",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We addresses the problem of automatic verification and
                 fence inference in concurrent programs running under
                 relaxed memory models. Modern architectures implement
                 relaxed memory models in which memory operations may be
                 reordered and executed non-atomically. Instructions
                 called memory fences are provided to the programmer,
                 allowing control of this behavior. To ensure
                 correctness of many algorithms, the programmer is often
                 required to explicitly insert memory fences into her
                 program. However, she must use as few fences as
                 possible, or the benefits of the relaxed architecture
                 may be lost. It is our goal to help automate the fence
                 insertion process. We present an algorithm for
                 automatic inference of memory fences in concurrent
                 programs, relieving the programmer from this complex
                 task. Given a finite-state program, a safety
                 specification and a description of the memory model our
                 algorithm computes a set of ordering constraints that
                 guarantee the correctness of the program under the
                 memory model. The computed constraints are maximally
                 permissive: removing any constraint from the solution
                 would permit an execution violating the specification.
                 These constraints are then realized as additional
                 fences in the input program. We implemented our
                 approach in a pair of tools called fender and blender
                 and used them to infer correct and efficient placements
                 of fences for several non-trivial algorithms, including
                 practical mutual exclusion primitives and concurrent
                 data structures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Li:2012:HFM,
  author =       "Chong-Zhang Li",
  title =        "{Hilbert}'s formalistic method and its development in
                 computer science",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "124--126",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261439",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2012:SNOa,
  author =       "Rob van Stee",
  title =        "{SIGACT} news online algorithms column 20: the power
                 of harmony",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "2",
  pages =        "127--136",
  month =        jun,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2261417.2261440",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Nov 6 17:32:01 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:BRCc,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "15--18",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421098",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2012:RBG,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Combinatorial Games:
                 Tic-Tac-Toe Theory}}, by Jozsef Beck}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "19--21",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421099",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Porreca:2012:RBA,
  author =       "Antonio E. Porreca",
  title =        "Review of {{\booktitle{Algorithmic Adventures: From
                 Knowledge to Magic}}, by Juraj Hromkovi{\'c}}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "22--24",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421100",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Xie:2012:RBA,
  author =       "Yulai Xie",
  title =        "Review of {{\booktitle{Applied Algebra: Codes, Ciphers
                 and Discrete Algorithms}}, by Darel W. Hardy, Fred
                 Richman, and Carol L. Walker}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "25--27",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421101",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Guimaraes:2012:RBC,
  author =       "Jos{\'e} de Oliveira Guimar{\~a}es",
  title =        "Review of {{\booktitle{Models of Computation: an
                 Introduction to Computability Theory}}, by Maribel
                 Fern{\'a}ndez}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "28--31",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421102",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2012:RBW,
  author =       "Micha{\"e}l Cadilhac",
  title =        "Review of {{\booktitle{Handbook of Weighted
                 Automata}}, edited by Manfred Droste, Werner Kuich and
                 Heiko Vogler}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "32--37",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421103",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2012:RBT,
  author =       "Haris Aziz",
  title =        "Review of {{\booktitle{Matching Theory}}, by
                 L{\'a}szl{\'o} Lov{\'a}sz and Michael D. Plummer}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "38--40",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421104",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Falke:2012:RBM,
  author =       "Stephan Falke",
  title =        "Review of {{\booktitle{Introduction to Mathematics of
                 Satisfiability}}, by Victor W. Marek}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "41--44",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421105",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kintali:2012:RBA,
  author =       "Shiva Kintali",
  title =        "Review of {{\booktitle{Elements of Automata Theory}},
                 by Jacques Sakarovitch, Translator (from French) Reuben
                 Thomas}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "45--47",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421106",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Labarre:2012:RBP,
  author =       "Anthony Labarre",
  title =        "Review of {{\booktitle{Combinatorial Pattern Matching
                 Algorithms in Computational Biology using Perl and R}},
                 by Gabriel Valiente}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "48--50",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421107",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2012:RBP,
  author =       "Haris Aziz",
  title =        "Review of {{\booktitle{In Pursuit of the Traveling
                 Salesman}}, by William J. Cook}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "51--53",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421108",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Soltys:2012:RBP,
  author =       "Karolina Soltys",
  title =        "Review of {{\booktitle{Permutation Patterns}}, edited
                 by Steve Linton, Nik Ru{\v{s}}kuc, Vincent Vatter}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "54--55",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421109",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2012:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "56--59",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421110",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dershowitz:2012:MIP,
  author =       "Nachum Dershowitz and Edward M. Reingold",
  title =        "Modulo intervals: a proposed notation",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "60--64",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421112",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2012:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 75",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "65--66",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421114",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yehudayoff:2012:PET,
  author =       "Amir Yehudayoff",
  title =        "Proving expansion in three steps",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "67--84",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421115",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This text is meant to be an introduction to a recent
                 strategy introduced by Bourgain and Gamburd (following
                 a work of Helfgott) for proving graph-expansion. The
                 strategy is designed for graphs H that are defined
                 using some underlying group G. The strategy consists of
                 three steps, which, in Sarnak's terminology, correspond
                 to the three steps of a chess game: opening,
                 middle-game and endgame. In the opening, the objective
                 is to prove that the girth of H is logarithmic. In the
                 middle-game, the goal is to prove a product-growth
                 theorem for subsets of G. The endgame consists of
                 establishing a ``mixing property'' for G. There are two
                 methods for proving a mixing property: using pairwise
                 independence and using basic representation theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Benedikt:2012:RP,
  author =       "Michael Benedikt",
  title =        "Report on {PODS} 2012",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "85--86",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421116",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2012:DCCc,
  author =       "Idit Keidar",
  title =        "Distributed computing column 47: distributed
                 computability",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "87--87",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421117",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herlihy:2012:CDC,
  author =       "Maurice Herlihy and Sergio Rajsbaum and Michel
                 Raynal",
  title =        "Computability in distributed computing: a {Tutorial}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "3",
  pages =        "88--110",
  month =        sep,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421096.2421118",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "What can and cannot be computed in a distributed
                 system is a complex function of the system's
                 communication model, timing model, and failure model.
                 This tutorial surveys some important results about
                 computability in the canonical distributed system
                 model, where processes execute asynchronously, they
                 communicate by reading and writing shared memory, and
                 they fail by crashing. It explains the fundamental role
                 that topology plays in the distributed computability
                 theory.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Anzala-Yamajako:2012:RBC,
  author =       "Alexandre Anzala-Yamajako",
  title =        "Review of {{\booktitle{Algorithmic Cryptanalysis}}, by
                 Antoine Joux}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "13--16",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421122",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sterling:2012:RBB,
  author =       "Aaron Sterling",
  title =        "Review of {{\booktitle{Algorithmic Bioprocesses}},
                 edited by Condon, Harel, Kok, Salomaa, Winfree}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "17--24",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421123",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wang:2012:RBN,
  author =       "Yu Wang",
  title =        "Review of {{\booktitle{Vehicular Networks, from Theory
                 to Practice}}, edited by Stephan Olariu and Michele C.
                 Weigle}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "25--29",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421124",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Silvestri:2012:RBT,
  author =       "Francesco Silvestri",
  title =        "Review of {{\booktitle{Graph Theory and
                 Interconnection Networks}}, by Lih-Hsing Hsu and
                 Cheng-Kuan Lin}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "30--34",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421125",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Falke:2012:RBT,
  author =       "Stephan Falke",
  title =        "Review of {{\booktitle{Transitions and Trees: an
                 Introduction to Structural Operational Semantics}}, by
                 Hans H{\"u}ttel}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "34--37",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421126",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kilov:2012:RBF,
  author =       "Haim Kilov",
  title =        "Review of {{\booktitle{Origins and Foundations of
                 Computing}}, by Friedrich L. Bauer}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "38--40",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421127",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fulton:2012:RBS,
  author =       "Ben Fulton",
  title =        "Review of {{\booktitle{Introduction to Scheduling}},
                 by Yves Robert and Fr{\'e}d{\'e}ric Vivien}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "41--43",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421128",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sgarbas:2012:RBT,
  author =       "Kyriakos N. Sgarbas",
  title =        "Review of {{\booktitle{Semantic Techniques in Quantum
                 Computation}}, edited by Simon Gay and Ian Mackie}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "44--48",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421129",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yan:2012:RBC,
  author =       "Song Yan",
  title =        "Review of {{\booktitle{Modern Computer Arithmetic}},
                 by Richard Brent and Paul Zimmermann}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "49--51",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421130",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chakrabarty:2012:RBA,
  author =       "Deeparnab Chakrabarty",
  title =        "Review of {{\booktitle{Design of Approximation
                 Algorithms}}, by David P. Williamson and David B.
                 Shmoys}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "52--54",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421131",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2012:TRCd,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "55--56",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421132",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Khuller:2012:ACO,
  author =       "Samir Khuller",
  title =        "Algorithms column: an overview of the recent progress
                 on matrix multiplication by {Virginia Vassilevska
                 Williams}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "57--59",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421134",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The exponent \omega of matrix multiplication is the
                 infimum over all real numbers c such that for all
                 \epsilon {$>$} 0 there is an algorithm that multiplies
                 n --- n matrices using at most O( n$^{c + \epsilon }$ )
                 arithmetic operations over an arbitrary field. A
                 trivial lower bound on \omega is 2, and the best known
                 upper bound until recently was \omega {$<$} 2.376
                 achieved by Coppersmith and Winograd in 1987. There
                 were two independent improvements on \omega , one by
                 Stothers in 2010 who showed that \omega {$<$} 2.374,
                 and one by myself that ultimately resulted in \omega
                 {$<$} 2.373. Here I discuss the road to these
                 improvements and conclude with some open questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2012:SNCd,
  author =       "Lane A. Hemaspaandra and Ryan Williams",
  title =        "{SIGACT News Complexity Theory Column} 76: an atypical
                 survey of typical-case heuristic algorithms",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "70--89",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421135",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Heuristic approaches often do so well that they seem
                 to pretty much always give the right answer. How close
                 can heuristic algorithms get to always giving the right
                 answer, without inducing seismic complexity-theoretic
                 consequences? This article first discusses how a series
                 of results by Berman, Buhrman, Hartmanis, Homer,
                 Longpr{\'e}, Ogiwara, Sch{\"o}ning, and Watanabe, from
                 the early 1970s through the early 1990s, explicitly or
                 implicitly limited how well heuristic algorithms can do
                 on NP-hard problems. In particular, many desirable
                 levels of heuristic success cannot be obtained unless
                 severe, highly unlikely complexity class collapses
                 occur. Second, we survey work initiated by Goldreich
                 and Wigderson, who showed how under plausible
                 assumptions deterministic heuristics for randomized
                 computation can achieve a very high frequency of
                 correctness. Finally, we consider formal ways in which
                 theory can help explain the effectiveness of heuristics
                 that solve NP-hard problems in practice.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2012:CGCb,
  author =       "Adrian Dumitrescu and Csaba D. T{\'o}th",
  title =        "Computational geometry column 54",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "90--97",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421136",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to non-crossing configurations
                 in the plane realized with straight line segments
                 connecting pairs of points from a finite ground set.
                 Graph classes of interest realized in this way include
                 matchings, spanning trees, spanning cycles, and
                 triangulations. We review some problems and results in
                 this area. At the end we list some open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2012:DCCd,
  author =       "Idit Keidar",
  title =        "Distributed computing column 48: annual review 2012",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "98--100",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421137",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herlihy:2012:TMB,
  author =       "Maurice Herlihy and Nir Shavit",
  title =        "Transactional memory: beyond the first two decades",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "101--103",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421138",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sen:2012:RB,
  author =       "Siddhartha Sen",
  title =        "Review of {{\booktitle{PODC 2012}}}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "104--111",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421139",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Goos:2012:RB,
  author =       "Mika G{\"o}{\"o}s",
  title =        "Review of {{\booktitle{DISC 2012}}}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "112--115",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421140",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gramoli:2012:WFW,
  author =       "Vincent Gramoli and Alessia Milani",
  title =        "{WTTM} 2012, the fourth workshop on the theory of
                 transactional memory",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "116--122",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421141",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In conjunction with PODC 2012, the TransForm project
                 (Marie Curie Initial Training Network) and EuroTM (COST
                 Action IC1001) supported the 4th edition of the
                 Workshop on the Theory of Transactional Memory (WTTM
                 2012). The objective of WTTM was to discuss new
                 theoretical challenges and recent achievements in the
                 area of transactional computing. The workshop took
                 place on July 19, 2012, in Madeira, Portugal. This
                 year's WTTM was a milestone event for two reasons.
                 First, because the same year, the two seminal articles
                 on hardware and software transactional memories [15,
                 21] were recognized as outstanding papers on principles
                 of distributed computing, whose significance and impact
                 on the theory and practice of distributed computing
                 have been evident for at least a decade. Second, the
                 winners of this prestigious ACM/EATCS Edsger W.
                 Dijkstra Prize, Maurice Herlihy, Eliot Moss, Nir Shavit
                 and Dan Touitou, were present at the workshop and three
                 of them discussed their current progress with other
                 outstanding researchers from the field. This report is
                 intended to give highlights of the problems discussed
                 during the workshop.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2012:SNOb,
  author =       "Rob van Stee",
  title =        "{SIGACT} news online algorithms column 21: {APPROX}
                 and {ALGO}",
  journal =      j-SIGACT,
  volume =       "43",
  number =       "4",
  pages =        "123--129",
  month =        dec,
  year =         "2012",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2421119.2421142",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:40 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For this column, I would like to report on some
                 conferences that I attended recently, with special
                 attention given (of course) to results in online
                 algorithms. Most of the papers discussed below consider
                 online scheduling, another favorite problem area of
                 mine. Generally, for a job j we will denote its
                 processing time by pj, its weight by wj (if
                 applicable), its release time by rj, and its deadline
                 by dj. In the discussion below, I have tried to point
                 out interesting open problems wherever possible.
                 Enjoy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "7--9",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447714",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2013:RBN,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{P, NP, and NP-Completeness}} by
                 Oded Goldreich}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "10--11",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447715",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2013:RBCa,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Review of {{\booktitle{Bijective Combinatorics}} by
                 Nicholas Loehr}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "12--14",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447716",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moran:2013:RBS,
  author =       "Tal Moran",
  title =        "Review of {{\booktitle{Surveillance or Security?}} by
                 Susan Landau}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "14--16",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447717",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Werden:2013:RBA,
  author =       "Dave Werden",
  title =        "Review of {{\booktitle{Spyware and Adware}} by John
                 Aycock}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "17--19",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447718",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lewis:2013:RBP,
  author =       "Harry Lewis",
  title =        "Review of {{\booktitle{Burdens of Proof}} by
                 Jean-Fran{\c{c}}ois Blanchette}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "19--21",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447719",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kaminski:2013:RBM,
  author =       "Marcin Kami{\'n}ski",
  title =        "Review of {{\booktitle{Boolean Models and Methods in
                 Mathematics, Computer Science, and Engineering}} by
                 Yves Crama and Peter L. Hammer}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "21--24",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447720",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Teutsch:2013:RBR,
  author =       "Jason Teutsch",
  title =        "Review of {{\booktitle{Algorithmic Randomness and
                 Complexity}} by Downey and Hirschfeldt}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "25--28",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447721",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rubin:2013:RBR,
  author =       "Paul Rubin",
  title =        "Review of {{\booktitle{Information Retrieval}} by
                 Buettcher, Clarke, Cormack}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "29--33",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447722",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Wilson:2013:RBC,
  author =       "Mark C. Wilson",
  title =        "Review of {{\booktitle{Models of Conflict and
                 Cooperation}} by Rick Gillman and David Housman}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "34--35",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447723",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zimand:2013:RBE,
  author =       "Marius Zimand",
  title =        "Review of {{\booktitle{Deterministic Extraction from
                 Weak Random Sources}} by Ariel Gabizon}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "36--37",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447724",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2013:RBI,
  author =       "Jonathan Katz",
  title =        "Review of {{\booktitle{Applied Information Security}}
                 by David Basin, Patrick Schaller, and Michael
                 Schl{\"a}pfer}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "38--40",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447725",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aznaveh:2013:RBB,
  author =       "Mohsen Mahmoudi Aznaveh",
  title =        "Review of {{\booktitle{Introduction to
                 Bio-Ontologies}} by Peter N. Robinson and Sebastian
                 Bauer}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "40--42",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447726",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shehab:2013:RBD,
  author =       "Omar Shehab",
  title =        "Review of {{\booktitle{The Dots and Boxes Game:
                 Sophisticated Child's Play}} by Elwyn Berlekamp}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "42--45",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447727",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2013:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "46--48",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447728",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2013:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 77",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "49--49",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447730",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chung:2013:GCP,
  author =       "Kai-Min Chung and Rafael Pass",
  title =        "Guest column: parallel repetition theorems for
                 interactive arguments",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "50--69",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447731",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We survey recent results on parallel repetition
                 theorems for computationally-sound interactive proofs
                 (a.k.a. interactive arguments).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Venkatasubramanian:2013:CGC,
  author =       "Suresh Venkatasubramanian",
  title =        "Computational geometry column 55: new developments in
                 nonnegative matrix factorization",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "70--78",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447732",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2013:DCCa,
  author =       "Idit Keidar",
  title =        "Distributed computing column 49: coding for
                 distributed storage",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "79--79",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447733",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cassuto:2013:WCC,
  author =       "Yuval Cassuto",
  title =        "What can coding theory do for storage systems?",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "80--88",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447734",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Storage systems and coding theory are two very
                 different but highly interdependent engineering
                 disciplines. The development of storage systems has
                 impacted research in coding theory, and
                 coding-theoretic contributions changed the way storage
                 systems work. The presentation aims to give a short
                 summary of the different problems solved by coding
                 theory at the service of storage systems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Datta:2013:OCT,
  author =       "Anwitaman Datta and Fr{\'e}d{\'e}rique Oggier",
  title =        "An overview of codes tailor-made for better
                 repairability in networked distributed storage
                 systems",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "89--105",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447735",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The increasing amount of digital data generated by
                 today's society asks for better storage solutions. This
                 survey looks at a new generation of coding techniques
                 designed specifically for the maintenance needs of
                 networked distributed storage systems (NDSS), trying to
                 reach the best compromise among storage space
                 efficiency, fault-tolerance, and maintenance overheads.
                 Four families of codes, namely, pyramid, hierarchical,
                 regenerating and locally repairable codes such as
                 self-repairing codes, along with a heuristic of
                 cross-object coding to improve repairability in NDSS
                 are presented at a high level. The code descriptions
                 are accompanied with simple examples emphasizing the
                 main ideas behind each of these code families. We
                 discuss their pros and cons before concluding with a
                 brief and preliminary comparison. This survey
                 deliberately excludes technical details and does not
                 contain an exhaustive list of code constructions.
                 Instead, it provides an overview of the major novel
                 code families in a manner easily accessible to a broad
                 audience, by presenting the big picture of advances in
                 coding techniques for maintenance of NDSS.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Thorup:2013:MPO,
  author =       "Mikkel Thorup",
  title =        "{Mihai P{\u{a}}trascu}: obituary and open problems",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "1",
  pages =        "110--114",
  month =        mar,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2447712.2447737",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun May 5 10:25:41 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:BRC,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "7--9",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491535",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vakilian:2013:JRB,
  author =       "Mohsen Vakilian",
  title =        "Joint review of {{\booktitle{How to solve it: a new
                 aspect of mathematical method}} by George Polya and
                 \booktitle{Street-fighting mathematics} by Sanjoy
                 Mahajan}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "10--12",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491536",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galle:2013:RBI,
  author =       "Matthias Gall{\'e}",
  title =        "Review of {{\booktitle{Grammatical Inference: Learning
                 Automata and Grammars}} by Colin de la Higuera}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "12--14",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491537",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Milchior:2013:RBF,
  author =       "Arthur Milchior",
  title =        "Review of {{\booktitle{Logical Foundation of Proof
                 Complexity}} by Stephen Cook and Phuong Nguyen}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "14--17",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491538",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lampis:2013:RBE,
  author =       "Michael Lampis",
  title =        "Review of {{\booktitle{Exact Exponential Algorithms}}
                 by Fedor V. Fomin and Dieter Kratsch}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "17--21",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491539",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Herrmann:2013:RBC,
  author =       "Sven Herrmann",
  title =        "Review of {{\booktitle{Bioinspired Computation in
                 Combinatorial Optimization}} by Frank Neumann and
                 Carsten Witt}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "22--26",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491540",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Murphy:2013:RBS,
  author =       "Michael Murphy",
  title =        "Review of {{\booktitle{Triangulations: Structure for
                 Algorithms and Applications}} by Jes{\'u}s A. De Lorea,
                 J{\"o}rg Rambau, and Francisco Santos}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "26--28",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491541",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cao:2013:RBN,
  author =       "Yixin Cao",
  title =        "Review of {{\booktitle{Flows in Networks}} by L. R.
                 Ford, Jr. and D. R. Fulkerson}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "28--30",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491542",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sgarbas:2013:RBC,
  author =       "Kyriakos N. Sgarbas",
  title =        "Review of {{\booktitle{Quantum Computing: a Gentle
                 Introduction}} by Eleanor Rieffel and Wolfgang Polak}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "31--35",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491543",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rogers:2013:RBA,
  author =       "John D. Rogers",
  title =        "Review of {{\booktitle{The Art of Computer
                 Programming}}: volume 4a by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "36--39",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491544",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:RBF,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Boolean Function Complexity:
                 Advances and Frontiers}} by Stasys Jukna}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "39--41",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491545",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2013:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "42--45",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491546",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2013:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} complexity theory column 78",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "45--46",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491548",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aharonov:2013:GCQ,
  author =       "Dorit Aharonov and Itai Arad and Thomas Vidick",
  title =        "Guest column: the quantum {PCP} conjecture",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "47--79",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491549",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The classical PCP theorem is arguably the most
                 important achievement of classical complexity theory in
                 the past quarter century. In recent years, researchers
                 in quantum computational complexity have tried to
                 identify approaches and develop tools that address the
                 question: does a quantum version of the PCP theorem
                 hold? The story of this study starts with classical
                 complexity and takes unexpected turns providing
                 fascinating vistas on the foundations of quantum
                 mechanics and multipartite entanglement, topology and
                 the so-called phenomenon of topological order, quantum
                 error correction, information theory, and much more; it
                 raises questions that touch upon some of the most
                 fundamental issues at the heart of our understanding of
                 quantum mechanics. At this point, the jury is still out
                 as to whether or not such a theorem holds. This survey
                 aims to provide a snapshot of the status in this
                 ongoing story, tailored to a general theory-of-CS
                 audience.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2013:CGCa,
  author =       "Adrian Dumitrescu and Minghui Jiang",
  title =        "Computational geometry column 56",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "80--87",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491550",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to maximum (respectively,
                 maximum weight) independent set problems in geometric
                 intersection graphs. We illustrate with one example in
                 each class: (I) The following question was asked by T.
                 Rado in 1928: What is the largest number c such that,
                 for any finite set $F$ of axis-parallel squares in the
                 plane, there exists an independent subset $ I \subseteq
                 F$ of pairwise disjoint squares with total area at
                 least c times the union area of the squares. (II) The
                 following question was asked by Erd{\H{o}}s in 1983:
                 What is the largest number $ H = H (n)$ with the
                 property that every set of $n$ non-overlapping unit
                 disks in the plane has an independent subset with at
                 least $H$ members?",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2013:DCCb,
  author =       "Idit Keidar",
  title =        "Distributed computing column 50: distributing trusted
                 third parties, innovation prize, and {SIROCCO} review",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "88--88",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491551",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Peleg:2013:PID,
  author =       "David Peleg",
  title =        "Prize for innovation in distributed computing: awarded
                 to {Roger Wattenhofer}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "89--91",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491552",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kupcu:2013:DTT,
  author =       "Alptekin K{\"u}p{\c{c}}{\"u}",
  title =        "Distributing trusted third parties",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "92--112",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491553",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Trusted Third Parties (TTPs) are widely employed in
                 various scenarios for providing fairness guarantees
                 (e.g., in fair exchange or e-commerce protocols,
                 including secure two-party computation), for
                 distributing secrets (e.g., in authentication or
                 secret-sharing protocols, as well as group signatures),
                 and for creating trust (e.g., as certificate
                 authorities). Such wide use of TTPs, as well as the
                 trust requirement that is put on them make them a prime
                 target for distributed systems and cryptography
                 research. There are some well-known and proven
                 solutions to the problem of distributing the trust put
                 on TTPs: Byzantine agreement or secure multi-party
                 computation techniques can be employed to distribute
                 the job of any TTP to multiple parties, tolerating up
                 to half or one-third of those parties being malicious.
                 Such techniques are not widely-employed in practice
                 possibly due to their quadratic complexity or
                 inter-operation requirements. This brings up the
                 question of distributing TTPs in a much more efficient
                 way, possibly via using autonomous agents, who do not
                 directly communicate with each other. In this paper, we
                 present various known techniques for distributing the
                 trust put on TTPs. Then, we concentrate on using
                 multiple autonomous parties, who do not communicate
                 with each other at all, to realize a single TTP. We
                 discuss the role of synchrony in such attempts, and
                 conclude with some open questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Arfaoui:2013:RS,
  author =       "Heger Arfaoui",
  title =        "A review of {SIROCCO 2012}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "113--118",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491554",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2013:EFD,
  author =       "Li Chen",
  title =        "Education forum: digital geometry and its algorithms:
                 an introduction",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "119--124",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491555",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper gives a brief introduction to digital
                 geometry and its relationships to algorithm analysis,
                 image processing, and computer graphics. Digital
                 geometry highly relates to graph theory, discrete
                 geometry, and computational geometry. We also suggest
                 that digital geometry can be taught as a chapter in
                 computational geometry or geometric methods for
                 computing sciences courses.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2013:SNO,
  author =       "Rob van Stee",
  title =        "{SIGACT News} online algorithms column 22",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "125--125",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491556",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dinitz:2013:RAM,
  author =       "Michael Dinitz",
  title =        "Recent advances on the matroid secretary problem",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "2",
  pages =        "126--142",
  month =        jun,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2491533.2491557",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:04 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The matroid secretary problem was introduced by
                 Babaioff, Immorlica, and Kleinberg in SODA 2007 as an
                 online problem that was both mathematically interesting
                 and had applications to online auctions. In this column
                 I will introduce and motivate this problem, and give a
                 survey of some of the exciting work that has been done
                 on it over the past 6 years. While we have a much
                 better understanding of matroid secretary now than we
                 did in 2007, the main conjecture is still open: does
                 there exist an O(1)-competitive algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:RBC,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Theoretical Computer Science:
                 Introduction to Automata, Computability, Complexity,
                 Algorithmics, Randomization, Communication, and
                 Cryptography}} by Juraj Hromkovic}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "7--8",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527750",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sterling:2013:RBM,
  author =       "Aaron Sterling",
  title =        "Review of {{\booktitle{The Mathematics of Life}} by
                 Ian Stewart}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "9--11",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527751",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calvert:2013:RBS,
  author =       "Wesley Calvert",
  title =        "Review of {{\booktitle{Universal Semantic
                 Communication}} by B. Juba}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "12--15",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527752",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Labarre:2013:RBA,
  author =       "Anthony Labarre",
  title =        "Review of {{\booktitle{Graph Algorithms}} (2nd
                 edition) by Shimon Even, edited by Guy Even}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "15--16",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527753",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2013:RBF,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Review of {{\booktitle{How to Fold It}} by J.
                 O'Rourke}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "17--19",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527754",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papamichail:2013:RBB,
  author =       "Dimitris Papamichail",
  title =        "Review of {{\booktitle{Bioinformatics for Biologists}}
                 edited by Pavel Pevzner and Ron Shamir}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "20--24",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527755",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2013:RBCb,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Review of {{\booktitle{Extremal Combinatorics with
                 Applications to Computer Science}} (2nd edition) by
                 Stasys Jukna}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "24--27",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527756",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hame:2013:RBC,
  author =       "Ang{\`e}le M. Hame",
  title =        "Review of {{\booktitle{Enumerative Combinatorics}},
                 volume 1, second edition by Richard P. Stanley}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "28--31",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527757",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kumar:2013:RBO,
  author =       "Akash Kumar",
  title =        "Review of {{\booktitle{Combinatorial Optimization}} by
                 B. Korte and J. Vygen}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "31--35",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527758",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{DiPaula:2013:RBG,
  author =       "Cynthia DiPaula and Andrew Wonnacott",
  title =        "Review of {{\booktitle{The Golden Ticket: P, NP, and
                 the Search for the Impossible}} by Lance Fortnow}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "35--37",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527759",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brule:2013:RBA,
  author =       "Joshua Brul{\'e}",
  title =        "Review of {{\booktitle{Probably Approximately
                 Correct}} by Leslie Valiant}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "38--39",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527760",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2013:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "40--41",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527761",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kulkarni:2013:GDT,
  author =       "Raghav Kulkarni",
  title =        "Gems in decision tree complexity revisited",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "42--55",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527763",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The decision tree model, aka the query model, perhaps
                 due to its simplicity and fundamental nature has been
                 extensively studied over decades. Yet there remain some
                 fascinating open questions about it. The purpose of
                 this paper is to revisit three such conjectures in
                 decision tree complexity and present related open
                 questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Venkatasubramanian:2013:MHE,
  author =       "Suresh Venkatasubramanian",
  title =        "Moving heaven and earth: distances between
                 distributions",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "56--68",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527764",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column comes in two parts. In the first, I
                 discuss various ways of defining distances between
                 distributions. In the second, Jeff Erickson (chair of
                 the SoCG steering committee) discusses some matters
                 related to the relationship between ACM and the
                 Symposium on Computational Geometry.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fan:2013:RP,
  author =       "Wenfei Fan",
  title =        "Report on {PODS 2013}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "69--71",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527765",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Keidar:2013:DCCc,
  author =       "Idit Keidar",
  title =        "Distributed computing column 51: large-scale
                 transaction replication",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "72--72",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527766",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Malkhi:2013:SCC,
  author =       "Dahlia Malkhi and Jean-Philippe Martin",
  title =        "{Spanner}'s concurrency control",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "73--77",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527767",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Spanner project reports that one can build
                 practical large-scale systems that combine strong
                 semantics with geo-distribution. In this review
                 manuscript, we provide insight on how Spanner's
                 concurrency control provides both read-only
                 transactions which avoid locking data, and strong
                 consistency.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Eyal:2013:FTT,
  author =       "Ittay Eyal",
  title =        "Fault tolerant transaction architectures",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "3",
  pages =        "78--84",
  month =        sep,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2527748.2527768",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Dec 2 17:43:09 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:JRH,
  author =       "William Gasarch",
  title =        "Joint review of the honor class:
                 {{\booktitle{Hilbert's problems and their solver}} by
                 Ben Yandell} and: {{\booktitle{Mathematical
                 developments arising from Hilbert's problems}} edited
                 by Felix Browder}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "18--24",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556665",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nasim:2013:RVL,
  author =       "Farhan Nasim",
  title =        "Review of {{\booktitle{Variable-length codes for data
                 compression}} by David Salomon}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "24--26",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2013:RHM,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{History of mathematics:
                 highways and byways}} by Amy Dahan-Dalmedico and Jeanne
                 Peiffer}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "27--28",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556667",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2013:RIB,
  author =       "Jon Katz",
  title =        "Review of {{\booktitle{Identity-based encryption}} by
                 Sanjit Chattarjee and Palash Sarkar}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "29--31",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abramson:2013:RRT,
  author =       "Myriam Abramson",
  title =        "Review of {{\booktitle{Resources for teaching discrete
                 mathematics: classroom projects, history modules, and
                 articles}} edited by Brian Hopkins}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "31--34",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556669",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2013:RPA,
  author =       "Micha{\"e}l Cadilhac",
  title =        "Review of {{\booktitle{Proofs and algorithms}} by
                 Gilles Dowek (translation by Maribel Fernandez)}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "35--37",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556670",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Papamichail:2013:RIC,
  author =       "Dimitris Papamichail",
  title =        "Review of {{\booktitle{Introduction to computational
                 proteomics}} by Golan Yona}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "38--41",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556671",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shallit:2013:RCC,
  author =       "Jeffrey Shallit",
  title =        "Review of {{\booktitle{Computability and complexity
                 theory}} by Steven Homer and Alan L. Selman}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "41--42",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556672",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2013:RQC,
  author =       "Frederic Green",
  title =        "Review: {{\booktitle{Quantum computing since
                 Democritus}} by Scott Aaronson}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "42--47",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556673",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2013:RAP,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Algorithmic puzzles}} by Anany
                 Levitin and Maria Levitin}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "47--48",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556674",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2013:TRC,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "49--51",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556675",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2013:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 80",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "52--52",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556677",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bhattacharyya:2013:GCT,
  author =       "Arnab Bhattacharyya",
  title =        "Guest column: On testing affine-invariant properties
                 over finite fields",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "53--72",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556678",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "An affine-invariant property over a finite field is a
                 property of functions over Fn/p that is closed under
                 all affine transformations of the domain. This class of
                 properties includes such well-known beasts as
                 low-degree polynomials, polynomials that nontrivially
                 factor, and functions of low spectral norm. The last
                 few years has seen rapid progress in characterizing the
                 affine-invariant properties which are testable with a
                 constant number of queries. We survey the current state
                 of this project.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2013:CGCb,
  author =       "Adrian Dumitrescu and Minghui Jiang",
  title =        "Computational geometry column 58",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "73--78",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556679",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to opaque sets also known as
                 barriers. A set of curves $ \Gamma $ that meet every
                 line which intersects a given convex body $B$ is called
                 an opaque set or barrier for $B$. Although the shape
                 and length of shortest barriers for simple bodies, such
                 as a unit equilateral triangle or a unit square are
                 seldom disputed, no proof of optimality is known or
                 appears to be even near in sight.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2013:DCC,
  author =       "Jennifer L. Welch",
  title =        "Distributed computing column 52: annual review 2013",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "79--80",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556680",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Anonymous:2013:DPD,
  author =       "Anonymous",
  title =        "{2013 Dijkstra Prize in Distributed Computing} to
                 {Nati Linial}: {2013 Principles of Distributed
                 Computing Doctoral Dissertation Award} to {Shiri
                 Chechik} and {Danupon Nanongkai}",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "81--82",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556681",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Braud-Santoni:2013:PR,
  author =       "Nicolas Braud-Santoni",
  title =        "{PODC 2013} review",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "83--86",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556682",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Timnat:2013:DR,
  author =       "Shahar Timnat",
  title =        "{DISC 2013} review",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "87--90",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556683",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Paz:2013:BWR,
  author =       "Ami Paz",
  title =        "{Bremen} workshop review",
  journal =      j-SIGACT,
  volume =       "44",
  number =       "4",
  pages =        "91--97",
  month =        dec,
  year =         "2013",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2556663.2556684",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 15 09:22:32 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kannan:2014:KPC,
  author =       "Ravindran Kannan",
  title =        "{14th Knuth prize}: call for nominations",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596585",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shehab:2014:RBP,
  author =       "Omar Shehab",
  title =        "Review of {{\booktitle{In pursuit of the unknown: 17
                 equations that changed the world}} by Ian Stewart}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "11--15",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596587",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lewis:2014:RUA,
  author =       "Harry Lewis",
  title =        "Review of {{\booktitle{Unauthorized access: the crisis
                 in online privacy and security}} by Robert H. Sloan and
                 Richard Warner}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "16--19",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596588",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2014:RBF,
  author =       "Haris Aziz",
  title =        "Review of {{\booktitle{boolean functions: theory,
                 algorithms, and applications}} by Yves Crama and Peter
                 L. Hammer}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "20--23",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596589",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tewari:2014:RAC,
  author =       "Raghunath Tewari",
  title =        "Review of {{\booktitle{Additive combinatorics}} by
                 Terence Tao and Van H. Vu}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "24--26",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596590",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2014:RDC,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Review of {{\booktitle{Discrete and computational
                 geometry}} by Satyan L. Devadoss and Joseph O'Rourke}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "27--30",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596591",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Li:2014:RIM,
  author =       "Yang D. Li",
  title =        "Review of {{\booktitle{Iterative methods in
                 combinatorial optimization}} by Lap Chi Lau, R. Ravi
                 and Mohit Singh}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "31--34",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596592",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2014:RPP,
  author =       "S. C. Coutinho",
  title =        "Review of {{\booktitle{Perspectives on projective
                 geometry}} by J{\"u}rgen Richter-Gebert}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "34--37",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mattei:2014:RWS,
  author =       "Nicholas Mattei",
  title =        "Review of {{\booktitle{Who's \#1?: the science of
                 ranking and rating}} by Amy N. Langville and Carl D.
                 Meyer}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "38--40",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596594",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kintali:2014:RBF,
  author =       "Shiva Kintali",
  title =        "Review of {{\booktitle{Boosting: foundations and
                 algorithms}} by Robert E. Schapire and Yoav Freund}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "41--43",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596595",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2014:TRCa,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "44--46",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596596",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2014:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 81",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "47--47",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596598",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Lampis:2014:GCE,
  author =       "Michael Lampis",
  title =        "Guest column: the elusive inapproximability of the
                 {TSP}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "48--65",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596599",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "After two decades of progress in hardness of
                 approximation we finally completely understand the
                 extent to which many optimization problems can be
                 approximated in polynomial time. Unfortunately,
                 however, and despite significant efforts, many
                 important problems continue to resist such an
                 understanding. One example is the famous Traveling
                 Salesman Problem, for which the best currently known
                 hardness of approximation bounds are strongly believed
                 to be quite far from the truth. In this article, we
                 describe the main tools and techniques used in the
                 currently best known approximation lower bounds for
                 this problem. Among them are expander-like graph
                 constructions called amplifiers and bounded-occurrence
                 instances of standard constraint satisfaction problems.
                 We also discuss how these ideas could be (modestly)
                 improved, how (and whether) they may prove useful in
                 eventually resolving the problem and what ingredients
                 are still missing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2014:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed computing column 53: {Dagstuhl} seminar
                 review: consistency in distributed systems",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "66--66",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596600",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kemme:2014:DSR,
  author =       "Bettina Kemme and Andr{\'e} Schiper and G. Ramalingam
                 and Marc Shapiro",
  title =        "{Dagstuhl} seminar review: consistency in distributed
                 systems",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "67--89",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596601",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2014:SNOa,
  author =       "Rob van Stee",
  title =        "{SIGACT} news online algorithms column 23",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "90--90",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596602",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chrobak:2014:OAP,
  author =       "Marek Chrobak",
  title =        "Online aggregation problems",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "1",
  pages =        "91--102",
  month =        mar,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2596583.2596603",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:11 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:BRCa,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "7--9",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636807",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2014:RSPa,
  author =       "Daniel Apon",
  title =        "Review of {{\booktitle{Selected papers on discrete
                 mathematics}} by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "10--13",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636808",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2014:RSPb,
  author =       "Daniel Apon",
  title =        "Review of {{\booktitle{Selected papers on design of
                 algorithms}} by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "14--16",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636809",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:RSPa,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Selected papers on fun {\&}
                 games}} by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "17--19",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636810",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:RCP,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Companion to the papers of
                 Donald Knuth}} by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "19--21",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636811",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:JRF,
  author =       "William Gasarch",
  title =        "Joint reviews of four articles",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "22--27",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636812",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galle:2014:RBR,
  author =       "Matthias Gall{\'e}",
  title =        "Review of {{\booktitle{Bayesian reasoning and machine
                 learning}} by David Barber}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "27--29",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636813",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2014:RIM,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Integrated methods for
                 optimization}}, second edition, 2012 by John Hooker}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "30--32",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636814",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Belle:2014:RPH,
  author =       "Vaishak Belle",
  title =        "Review of {{\booktitle{Programming with higher-order
                 logic}} by Dale Miller and Gopalan Nadathur}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "32--35",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636815",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:RPP,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{People, problems, and proofs}}
                 by Richard Lipton and Ken Regan}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "36--39",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636816",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mattei:2014:RWB,
  author =       "Nicholas Mattei",
  title =        "Review of {{\booktitle{Who's bigger?: where historical
                 figures really rank}} by Steven Skiena and Charles B.
                 Ward}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "40--42",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636817",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2014:TRCb,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "43--45",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636818",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2014:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 82",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "46--46",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636820",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Okhotin:2014:CID,
  author =       "Alexander Okhotin and Kai Salomaa",
  title =        "Complexity of input-driven pushdown automata",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "47--67",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636821",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2014:CGCa,
  author =       "Adrian Dumitrescu and Csaba D. T{\'o}th",
  title =        "Computational geometry column 59",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "68--72",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636822",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is about patrolling problems in a
                 geometric network. Mobile agents patrol a road network,
                 and have to visit every point in the network as
                 frequently as possible. The goal is finding a schedule
                 that minimizes the idle time, i.e., the maximum time
                 between two consecutive visits of some agent over all
                 points in the network.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2014:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed computing column 54: Transactional memory:
                 models and algorithms",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "73--73",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636823",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sharma:2014:TMM,
  author =       "Gokarna Sharma and Costas Busch",
  title =        "Transactional memory: models and algorithms",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "2",
  pages =        "74--103",
  month =        jun,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2636805.2636824",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:BRCb,
  author =       "William Gasarch",
  title =        "The book review column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "7--9",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670420",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moulick:2014:RUC,
  author =       "Subhayan Roy Moulick",
  title =        "Review of {{\booktitle{Understanding cryptography: a
                 textbook for students and practitioners}} by Christof
                 Paar and Jan Pelzl}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "10--12",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670421",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:RED,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{The Erd{\H{o}}s distance
                 problem}} by Julia Garibaldi, Alex Iosevich and Steven
                 Senger}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "13--14",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670422",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aznaveh:2014:RCB,
  author =       "Mohsen Mahmoudi Aznaveh",
  title =        "Review of {{\booktitle{Clustering in bioinformatics
                 and drug design}} by John D. MacCuish and Norah E.
                 MacCuish}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "15--17",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670423",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2014:RBC,
  author =       "Jonathan Katz",
  title =        "Review of {{\booktitle{The block cipher companion}} by
                 Lars R. Knudsen and Matthew J. B. Robshaw}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "18--20",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670424",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Katz:2014:RNL,
  author =       "Jonathan Katz",
  title =        "Review of {{\booktitle{Networked life: 20 questions
                 and answers}} by Mung Chiang}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "21--23",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670425",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2014:RGS,
  author =       "Micha{\"e}l Cadilhac",
  title =        "Review of {{\booktitle{Graph structure and monadic
                 second-order logic: a language-theoretic approach}} by
                 Bruno Courcelle and Joost Engelfriet}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "24--25",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670426",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fletez-Brant:2014:RBP,
  author =       "Kipper Fletez-Brant",
  title =        "Review of {{\booktitle{Basic phylogenetic
                 combinatorics}} by Andreas Dress, Katharina T. Huber,
                 Jacobus Koolen, Vincent Moulton and Andreas Spillner}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "26--28",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670427",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kilov:2014:RUCa,
  author =       "Haim Kilov",
  title =        "Review of {{\booktitle{The universal computer: the
                 road from Leibniz to Turing}} by Martin Davis}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "29--31",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670428",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bona:2014:RAC,
  author =       "Mikl{\'o}s B{\'o}na",
  title =        "Review of {{\booktitle{Analytic combinatorics in
                 several variables}} by Robin Pemantle and Mark
                 Wilson}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "32--33",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670429",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kozma:2014:RTH,
  author =       "L{\'a}szl{\'o} Kozma",
  title =        "Review of {{\booktitle{The tower of Hanoi: myths and
                 maths}} by Andreas M. Hinz, Sandi Klavzar, Uroz
                 Milutinovi{\'c} and Ciril Petr}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "34--36",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670430",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2014:TRCc,
  author =       "Dean Kelley",
  title =        "Technical report column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "37--46",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670431",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Scheid:2014:IMM,
  author =       "Paul T. Scheid and Ari J. Spilo and Ron K. Cytron",
  title =        "Inferring memory map instructions",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "47--52",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670433",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We describe the problem of inferring a set of memory
                 map instructions from a reference trace, with the goal
                 of minimizing the number of such instructions as well
                 as the number of unreferenced but mapped storage
                 locations. We prove the related decision problem
                 NP-complete. We then present and compare the results of
                 two heuristic approaches on some actual traces.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2014:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} news complexity theory column 83",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "53--53",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670435",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2014:BSA,
  author =       "Lane A. Hemaspaandra",
  title =        "Beautiful structures: an appreciation of the
                 contributions of {Alan Selman}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "54--70",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670436",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2014:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed computing column 55: {WTTM} 2013 review,
                 and lower bounds for distributed quantum computing",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "71--71",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670437",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Halldorsson:2014:MWA,
  author =       "Magn{\'u}s Halld{\'o}rsson and Calvin Newport",
  title =        "Making wireless algorithm theory more useful: five
                 ideas from the 2013 workshop on realistic models for
                 algorithms in wireless networks",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "72--74",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670438",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Capdevielle:2014:WFW,
  author =       "Claire Capdevielle and Sandeep Hans",
  title =        "{WTTM 2013, the Fifth Workshop on the Theory of
                 Transactional Memory}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "75--81",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670439",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In conjunction with DISC 2013, the TransForm project
                 (Marie Curie Initial Training Network) and EuroTM (COST
                 Action IC1001) supported the 5th edition of the
                 Workshop on the Theory of Transactional Memory (WTTM
                 2013). The objective of WTTM was to discuss new
                 theoretical challenges and recent achievements in the
                 area of transactional computing with emphasis on
                 transactional memory. The workshop took place on
                 October 14, 2013, in Jerusalem, Israel. This report is
                 intended to give highlights of the problems discussed
                 during the workshop.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Arfaoui:2014:WCC,
  author =       "Heger Arfaoui and Pierre Fraigniaud",
  title =        "What can be computed without communications?",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "82--104",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670440",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The main objective of this paper is to provide
                 illustrative examples of distributed computing problems
                 for which it is possible to design tight lower bounds
                 for quantum algorithms without having to manipulate
                 concepts from quantum mechanics, at all. As a case
                 study, we address the following class of 2-player
                 problems. Alice (resp., Bob) receives a boolean x
                 (resp., y) as input, and must return a boolean a
                 (resp., b) as output. A game between Alice and Bob is
                 defined by a pair (?, f) of boolean functions. The
                 objective of Alice and Bob playing game (?, f) is, for
                 every pair (x, y) of inputs, to output values a and b,
                 respectively, satisfying ?(a, b) = f(x, y), in absence
                 of any communication between the two players, but in
                 presence of shared resources. The ability of the two
                 players to solve the game then depends on the type of
                 resources they share. It is known that, for the
                 so-called CHSH game, i.e., for the game a ? b = x ? y,
                 the ability for the players to use entangled quantum
                 bits (qubits) helps. We show that, apart from the CHSH
                 game, quantum correlations do not help, in the sense
                 that, for every game not equivalent to the CHSH game,
                 there exists a classical protocol (using shared
                 randomness) whose probability of success is at least as
                 large as the one of any protocol using quantum
                 resources. This result holds for both worst case and
                 average case analysis. It is achieved by considering a
                 model stronger than quantum correlations, the
                 non-signaling model, which subsumes quantum mechanics,
                 but is far easier to handle.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2014:SNOb,
  author =       "Rob van Stee",
  title =        "{SIGACT} news online algorithms column 24: 2014 so
                 far",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "3",
  pages =        "105--111",
  month =        sep,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2670418.2670441",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:20 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column, I will discuss some recent papers in
                 online algorithms. It is pleasing to see there were a
                 number of papers about online algorithms in the top
                 conferences this year. If I have missed your paper and
                 you want to write about it or about any other topic in
                 online algorithms, don't hesitate to contact me!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:BRCc,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "14--16",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696083",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kilov:2014:RUCb,
  author =       "Haim Kilov",
  title =        "Review of {{\booktitle{The Universal Computer. The
                 Road from Leibniz to Turing}} by Martin Davis}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "17--20",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696084",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bane:2014:RZI,
  author =       "John Tucker Bane",
  title =        "Review of {{\booktitle{From Zero to Infinity}} by
                 Constance Reid}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "21--23",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696085",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Narayanan:2014:RLA,
  author =       "Krishnan Narayanan",
  title =        "Review of {{\booktitle{The LLL Algorithm}}, edited by
                 Phong Q. Nguyen and Brigitte Vall{\'e}e}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "24--31",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696086",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mazumdar:2014:RCP,
  author =       "Arya Mazumdar",
  title =        "Review of {{\booktitle{Classic Papers in Combinatorics
                 Edited}} by Ira Gessel and Gian-Carlo Rota}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "32--35",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696087",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bane:2014:RMT,
  author =       "John Tucker Bane",
  title =        "Review of {{\booktitle{Mathematical Treks}} by Ivars
                 Peterson}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "36--38",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696088",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2014:RSS,
  author =       "Eowyn Cenek",
  title =        "Review of {{\booktitle{Six Sources of Collapse}} by
                 Charles R. Hadlock}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "38--40",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696089",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Srinivasan:2014:RVI,
  author =       "Aravind Srinivasan",
  title =        "Review of {{\booktitle{Visions of Infinity: The Great
                 Mathematical Problems}} by Ian Stewart}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "41--45",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696090",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2014:RSPb,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{The Satisfiability Problem:
                 Algorithms and Analyses}} by Uwe Sch{\"o}ning and
                 Jacobo Tor{\'a}n}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "45--47",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696091",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2014:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "48--57",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696092",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2014:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 84",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "58--58",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696094",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Glasser:2014:DNP,
  author =       "C. Gla{\ss}er and A. Hughes and A. L. Selman and N.
                 Wisiol",
  title =        "Disjoint {NP}-Pairs and Propositional Proof Systems",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "59--75",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696095",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article surveys results on disjoint NP-pairs,
                 propositional proof systems, function classes, and
                 promise classes|including results that demonstrate
                 close connections that bind these topics together. We
                 illustrate important links between the questions of
                 whether these classes have complete objects and whether
                 optimal proof systems may exist.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2014:CGCb,
  author =       "Adrian Dumitrescu and Minghui Jiang",
  title =        "Computational Geometry Column 60",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "76--82",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696096",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to maximal empty axis-parallel
                 rectangles amidst a point set. In particular, among
                 these, maximum-area rectangles are of interest.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Grohe:2014:DTC,
  author =       "Martin Grohe",
  title =        "Database Theory Column Report on {PODS 2014}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "83--85",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696097",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2014:DCCd,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 56: Annual Review 2014",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "86--88",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696098",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Denysyuk:2014:RP,
  author =       "Oksana Denysyuk",
  title =        "Review of {PODC 2014}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "89--93",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696099",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Parter:2014:DR,
  author =       "Merav Parter and Edward Talmage",
  title =        "{DISC 2014} Review",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "94--99",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696100",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Radeva:2014:RBW,
  author =       "Mira Radeva",
  title =        "Review of {BDA Workshop 2014}",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "100--104",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696101",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Huang:2014:SNO,
  author =       "Zhiyi Huang",
  title =        "{SIGACT News} Online Algorithms Column 25: {Online}
                 Primal Dual: Beyond Linear Programs",
  journal =      j-SIGACT,
  volume =       "45",
  number =       "4",
  pages =        "105--119",
  month =        dec,
  year =         "2014",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2696081.2696102",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 10 19:05:24 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:BRC,
  author =       "William Gasarch",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "8--9",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744449",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moulick:2015:RDS,
  author =       "Subhayan Roy Moulick",
  title =        "Review of: {{\booktitle{Digital Signatures}} by
                 Jonathan Katz}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "10--12",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744450",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RWT,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{A Walk Through Combinatorics}}
                 by Mikl{\'o}s B{\'o}na}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "13--14",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744451",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shehab:2015:RWN,
  author =       "Omar Shehab",
  title =        "Review of: {A Wealth} of {Numbers}: {An Anthology} of
                 500 {Years} of {Popular Mathematics Writing} by
                 {Benjamin Wardhaugh}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "15--19",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744452",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Marcus:2015:RGE,
  author =       "Shoshana Marcus",
  title =        "Review of: {{\booktitle{A Guide to Experimental
                 Algorithmics}} by Catherine C. McGeoch}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "20--22",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744453",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chitnis:2015:RFP,
  author =       "Rajesh Chitnis",
  title =        "Review of: {{\booktitle{Fundamentals of Parameterized
                 Complexity}} by Rodney G. Downey and Michael R.
                 Fellows}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "23--26",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744454",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cenek:2015:RKI,
  author =       "Eowyn Cenek",
  title =        "Review of: {{\booktitle{The King of Infinite Space:
                 Euclid and his Elements}} by David Berlinski}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "27--27",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744455",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2015:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "28--38",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744456",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2015:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 85",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "39--39",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744458",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calude:2015:GCA,
  author =       "Cristian S. Calude and Elena Calude and Michael J.
                 Dinneen",
  title =        "Guest Column: Adiabatic Quantum Computing Challenges",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "40--61",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744459",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The paper presents a brief introduction to quantum
                 computing with focus on the adiabatic model which is
                 illustrated with the commercial D-Wave computer. We
                 also include new theory and experimental work done on
                 the D-Wave computer. Finally we discuss a hybrid method
                 of combining classical and quantum computing and a few
                 open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2015:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 57: Distributed
                 Algorithms as Combinatorial Structures",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "62--62",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744460",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Censor-Hillel:2015:DAC,
  author =       "Keren Censor-Hillel",
  title =        "Distributed Algorithms as Combinatorial Structures",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "1",
  pages =        "63--76",
  month =        mar,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2744447.2744461",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For many distributed computing problems there exists a
                 characterizing combinatorial structure. In other words,
                 the existence of an algorithm for solving the problem
                 on any graph G in time T(G) implies the existence of
                 the structure in G with some parameter related to T(G),
                 and vice versa. Such relations go back to classic
                 examples, such as synchronizers and sparse spanners,
                 and continue to emerge in recent studies of gossip
                 algorithms and multicast algorithms in different
                 communication settings. In this article, we give an
                 overview of both old and recent results that illustrate
                 these connections. We discuss how finding distributed
                 algorithms as well as proving lower bounds can be
                 reduced to studying combinatorial graph structures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2015:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "10--12",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789151",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RCP,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{The Cult of Pythagoras: Math
                 and Myths}} by Alberto A. Martinez}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "13--15",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789152",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RIH,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Infinitesimal: How a dangerous
                 mathematical theory shaped the modern world}} by Amir
                 Alexander}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "16--18",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789153",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RMGa,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Martin Gardner in the
                 Twenty-First Century}}: Edited by Michael Henle and
                 Brian Hopkins}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "19--20",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789154",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RAB,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Algorithmic Barriers Falling:
                 P=NP?}} by Donald E. Knuth and Edgar G. Daylight and
                 \booktitle{The Essential Knuth} by Donald E. Knuth and
                 Edgar G. Daylight}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "21--22",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789155",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RLM,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Love and Math: The Heart of
                 Hidden Reality}} by Edward Frenkel}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "23--24",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789156",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RSR,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Structure and Randomness:
                 Pages from Year One of a Mathematical Blog}} by Terence
                 Tao}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "25--27",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789157",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2015:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "28--39",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789158",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2015:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 86:
                 Introduction to Complexity Theory Column 86",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "40--40",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789160",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Weinstein:2015:ICQ,
  author =       "O. Weinstein",
  title =        "Information Complexity and the Quest for Interactive
                 Compression",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "41--64",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789161",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Information complexity is the interactive analogue of
                 Shannon's classical information theory. In recent years
                 this field has emerged as a powerful tool for proving
                 strong communication lower bounds, and for addressing
                 some of the major open problems in communication
                 complexity and circuit complexity. A notable
                 achievement of information complexity is the
                 breakthrough in understanding of the fundamental direct
                 sum and direct product conjectures, which aim to
                 quantify the power of parallel computation. This survey
                 provides a brief introduction to information
                 complexity, and overviews some of the recent progress
                 on these conjectures and their tight relationship with
                 the fascinating problem of compressing interactive
                 protocols.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Abrego:2015:CGC,
  author =       "Bernardo {\'A}brego and Adrian Dumitrescu and Silvia
                 Fern{\'a}ndez and Csaba D. T{\'o}th",
  title =        "Computational Geometry Column 61",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "65--77",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789162",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to the memory of Ferran Hurtado
                 who unexpectedly passed away in 2014. In writing this
                 column we remember some of the problems that he posed
                 or liked. From the many topics Ferran has worked on, we
                 only include a small sample, related to his joint work
                 with the authors of this column.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2015:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 58: {Maurice Herlihy}'s
                 60th Birthday Celebration",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "78--78",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789163",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hadzilacos:2015:QCW,
  author =       "Vassos Hadzilacos",
  title =        "A Quarter-Century of Wait-Free Synchronization",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "79--88",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789164",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harris:2015:HTC,
  author =       "Tim Harris",
  title =        "Hardware Trends: Challenges and Opportunities in
                 Distributed Computing",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "89--95",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789165",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This article is about three trends in computer
                 hardware, and some of the challenges and opportunities
                 that I think they provide for the distributed computing
                 community. A common theme in all of these trends is
                 that hardware is moving away from assumptions that have
                 often been made about the relative performance of
                 different operations (e.g., computation versus network
                 communication), the reliability of operations (e.g.,
                 that memory accesses are reliable, but network
                 communication is not), and even some of the basic
                 properties of the system (e.g., that the contents of
                 main memory are lost on power failure). Section 1
                 introduces ``rack-scale'' systems and the kinds of
                 properties likely in their interconnect networks.
                 Section 2 describes challenges in systems with shared
                 physical memory but without hardware cache coherence.
                 Section 3 discusses non-volatile byte-addressable
                 memory. The article is based in part on my talk at the
                 ACM PODC 2014 event in celebration of Maurice Herlihy's
                 sixtieth birthday.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Scott:2015:TMT,
  author =       "Michael Scott",
  title =        "Transactional Memory Today",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "96--104",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789166",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2015:SNO,
  author =       "Rob van Stee",
  title =        "{SIGACT News} Online Algorithms Column 26: Bin packing
                 in multiple dimensions",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "2",
  pages =        "105--112",
  month =        jun,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2789149.2789167",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:41 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2015:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "5--6",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818938",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Coutinho:2015:RGM,
  author =       "S. C. Coutinho",
  title =        "Review of: {{\booktitle{Games and Mathematics: Subtle
                 Connections}} by David Wells}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "7--10",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818939",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Marcus:2015:RJS,
  author =       "Shoshana Marcus",
  title =        "Review of: {{\booktitle{Jewels of Stringology}} by
                 Maxime Crochemore and Wojciech Rytter}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "11--14",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818940",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galle:2015:RAS,
  author =       "Matthias Gall{\'e}",
  title =        "Review of: {{\booktitle{Algorithms on Strings}} by
                 Maxime Crochemore, Christophe Hancart and Thierry
                 Lecroq}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "15--16",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818941",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fasy:2015:RPA,
  author =       "Brittany Terese Fasy and David L. Millman",
  title =        "Review of: {{\booktitle{Polyhedral and Algebraic
                 Methods in Computational Geometry}} by Michael Joswig
                 and Thorsten Theobald}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "17--20",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818942",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2015:RMO,
  author =       "S. V. Nagaraj",
  title =        "Review of: {{\booktitle{A Mathematical Orchard ---
                 Problems and Solutions}} by Mark Krusemeyer, George
                 Gilbert, and Loren Larson}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "21--22",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818943",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2015:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "23--35",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818944",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2015:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 87:
                 Introduction to Complexity Theory Column 87",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "36--36",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818946",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pighizzini:2015:GCO,
  author =       "Giovanni Pighizzini",
  title =        "Guest Column: One-Tape {Turing} Machine Variants and
                 Language Recognition",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "37--55",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818947",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We present two restricted versions of one-tape Turing
                 machines. Both characterize the class of context-free
                 languages. In the first version, proposed by Hibbard in
                 1967 and called limited automata, each tape cell can be
                 rewritten only in the first d visits, for a fixed
                 constant d {$>$}= 2. Furthermore, for d = 2
                 deterministic limited automata are equivalent to
                 deterministic pushdown automata, namely they
                 characterize deterministic context-free languages.
                 Further restricting the possible operations, we
                 consider strongly limited automata. These models still
                 characterize context-free languages. However, the
                 deterministic version is less powerful than the
                 deterministic version of limited automata. In fact,
                 there exist deterministic context-free languages that
                 are not accepted by any deterministic strongly limited
                 automaton.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2015:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 59: Resource-Competitive
                 Algorithms",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "56--56",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818948",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bender:2015:RCA,
  author =       "Michael A. Bender and Jeremy T. Fineman and Mahnush
                 Movahedi and Jared Saia and Varsha Dani and Seth
                 Gilbert and Seth Pettie and Maxwell Young",
  title =        "Resource-Competitive Algorithms",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "3",
  pages =        "57--71",
  month =        sep,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2818936.2818949",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The point of adversarial analysis is to model the
                 worst-case performance of an algorithm. Unfortunately,
                 this analysis may not always reflect performance in
                 practice because the adversarial assumption can be
                 overly pessimistic. In such cases, several techniques
                 have been developed to provide a more refined
                 understanding of how an algorithm performs e.g.,
                 competitive analysis, parameterized analysis, and the
                 theory of approximation algorithms. Here, we describe
                 an analogous technique called resource competitiveness,
                 tailored for distributed systems. Often there is an
                 operational cost for adversarial behavior arising from
                 bandwidth usage, computational power, energy
                 limitations, etc. Modeling this cost provides some
                 notion of how much disruption the adversary can inflict
                 on the system. In parameterizing by this cost, we can
                 design an algorithm with the following guarantee: if
                 the adversary pays T, then the additional cost of the
                 algorithm is some function of T. Resource
                 competitiveness yields results pertaining to secure,
                 fault tolerant, and efficient distributed computation.
                 We summarize these results and highlight future
                 challenges where we expect this algorithmic tool to
                 provide new insights.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2015:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852042",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2015:RIN,
  author =       "Frederic Green",
  title =        "Review of: {{\booktitle{Incredible Numbers}} by Ian
                 Stewart}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "6--8",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852043",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2015:RMGb,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Mathematics Galore: The First
                 Five Years of the St. Marks' Institute of Mathematics}}
                 by James Tanton}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "9--11",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852044",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bane:2015:RMB,
  author =       "John Tucker Bane",
  title =        "Review of: {{\booktitle{Math Bytes 5 of Math Bytes}}
                 by Tim Chartier}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "12--13",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852045",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kintali:2015:RAU,
  author =       "Shiva Kintali",
  title =        "Review of {{\booktitle{Algorithms Unplugged}} by B.
                 V{\"o}cking, H. Alt, M. Dietzfelbinger, R. Reischuk, C.
                 Scheideler, H. Vollmer, and D. Wagner: The Power of
                 Algorithms by Giorgio Ausiello and Rossella
                 Petreschi}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "14--16",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852046",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2015:RHF,
  author =       "S. V. Nagaraj",
  title =        "Review of: {{\booktitle{Handbook of Finite Fields}} by
                 Gary L. Mullen and Daniel Panario}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "17--18",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852047",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2015:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "19--30",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852048",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2015:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 88\slash 89:
                 Introduction to Complexity Theory Column 88\slash 89",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "31--31",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852050",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Forbes:2015:CTC,
  author =       "Michael A. Forbes and Amir Shpilka",
  title =        "Complexity Theory Column 88: Challenges in Polynomial
                 Factorization",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "32--49",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852051",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Algebraic complexity theory studies the complexity of
                 computing (multivariate) polynomials efficiently using
                 algebraic circuits. This succinct representation leads
                 to fundamental algorithmic challenges such as the
                 polynomial identity testing (PIT) problem (decide
                 nonzeroness of the computed polynomial) and the
                 polynomial factorization problem (compute succinct
                 representations of the factors of the circuit). While
                 the Schwartz-Zippel-DeMillo-Lipton Lemma
                 [Sch80,Zip79,DL78] gives an easy randomized algorithm
                 for PIT, randomized algorithms for factorization
                 require more ideas as given by Kaltofen [Kal89].
                 However, even derandomizing PIT remains a fundamental
                 problem in understanding the power of randomness. In
                 this column, we survey the factorization problem,
                 discussing the algorithmic ideas as well as the
                 applications to other problems. We then discuss the
                 challenges ahead, in particular focusing on the goal of
                 obtaining deterministic factoring algorithms. While
                 deterministic PIT algorithms have been developed for
                 various restricted circuit classes, there are very few
                 corresponding factoring algorithms. We discuss some
                 recent progress on the divisibility testing problem
                 (test if a given polynomial divides another given
                 polynomial) which captures some of the difficulty of
                 factoring. Along the way we attempt to highlight key
                 challenges whose solutions we hope will drive progress
                 in the area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rossman:2015:CTC,
  author =       "Benjamin Rossman and Rocco A. Servedio and Li-Yang
                 Tan",
  title =        "Complexity Theory Column 89: The Polynomial Hierarchy,
                 Random Oracles, and {Boolean} Circuits",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "50--68",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852052",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We give an overview of a recent result [RST15] showing
                 that the polynomial hierarchy is in finite relative to
                 a random oracle. Since the early 1980s it has been
                 known that this result would follow from a certain
                 ``average-case depth hierarchy theorem'' for Boolean
                 circuits. In this article we present some background
                 and history of related relativized separations; sketch
                 the argument showing how the polynomial hierarchy
                 result follows from the circuit lower bound; and
                 explain the techniques underlying the new circuit lower
                 bound.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cardinal:2015:CGC,
  author =       "Jean Cardinal",
  title =        "Computational Geometry Column 62",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "69--78",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852053",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column, we consider natural problems in
                 computational geometry that are polynomial-time
                 equivalent to finding a real solution to a system of
                 polynomial inequalities. Such problems are called $
                 \leftrightarrow $R-complete, and typically involve
                 geometric graphs. We describe the foundations of those
                 completeness proofs, in particular Mn{\"e}v's
                 Universality Theorem, as well as some known $
                 \leftrightarrow $R-completeness results, and recent
                 additions to the list. The results shed light on the
                 complex structure of those problems, beyond mere
                 NP-hardness.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Calvanese:2015:RP,
  author =       "Diego Calvanese",
  title =        "Report on {PODS 2015}",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "79--81",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852054",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2015:DCCd,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 60: Annual Review 2015",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "82--83",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852055",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Barenboim:2015:DSB,
  author =       "Leonid Barenboim",
  title =        "Distributed Symmetry: Breaking from a Local Point of
                 View",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "84--87",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852056",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bury:2015:SR,
  author =       "Marc Bury",
  title =        "{SIROCCO 2015} Review",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "88--93",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852057",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tseng:2015:PR,
  author =       "Lewis Tseng",
  title =        "{PODC 2015} Review",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "94--102",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852058",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Avni:2015:DR,
  author =       "Hillel Avni and Rati Gelashvili",
  title =        "{DISC 2015} Review",
  journal =      j-SIGACT,
  volume =       "46",
  number =       "4",
  pages =        "103--106",
  month =        dec,
  year =         "2015",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2852040.2852059",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Feb 16 11:18:42 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "4--5",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902947",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aziz:2016:RNC,
  author =       "Haris Aziz",
  title =        "Review of: {{\booktitle{The Nature of Computation}} by
                 Cristopher Moore and Stephan Mertens}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "6--8",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902948",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:RNC,
  author =       "Frederic Green",
  title =        "Review of: {{\booktitle{The Nature of Computation}} by
                 Cristopher Moore and Stephan Mertens}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902949",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelk:2016:RRA,
  author =       "Steven Kelk",
  title =        "Review of {{\booktitle{ReCombinatorics: The
                 Algorithmics of Ancestral Recombination Graphs and
                 Explicit Phylogenetic Networks}} by Dan Gusfield}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "12--15",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902950",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RWC,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{What is College For?: The
                 Public Purpose of Higher Education}} by Ellen Condliffe
                 Lagemann and Harry Lewis}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "16--20",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902951",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RST,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Slicing the Truth: On the
                 Computability Theoretic and Reverse Mathematical
                 Analysis of Combinatorial Principles}} by Denis
                 Hirschfeldt}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "21--24",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902952",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RSS,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{The Scholar and the State: In
                 Search of Van der Waerden}} by Alexander Soifer}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "25--28",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902953",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2016:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "29--40",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902954",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2016:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 90:
                 Introduction to Complexity Theory Column 90",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "41--41",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902956",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Teutsch:2016:BSD,
  author =       "Jason Teutsch and Marius Zimand",
  title =        "A Brief on Short Descriptions",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "42--67",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902957",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We discuss research developments on the complexity of
                 shortest programs since the turn of the millennium. In
                 particular, we will delve into the phenomenon of list
                 approximation: while it's impossible to compute the
                 shortest description for a given string, we can
                 efficiently generate a short list of candidates which
                 includes a (nearly) shortest description.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2016:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 61: Distributed
                 Algorithmic Foundations of Dynamic Networks",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "68--68",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902958",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Augustine:2016:DAF,
  author =       "John Augustine and Gopal Pandurangan and Peter
                 Robinson",
  title =        "Distributed Algorithmic Foundations of Dynamic
                 Networks",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "69--98",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902959",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2016:SNOa,
  author =       "Rob van Stee",
  title =        "{SIGACT} News Online Algorithms Column 27: Online
                 Matching on the Line, {Part 1}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "1",
  pages =        "99--110",
  month =        mar,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2902945.2902960",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "4--5",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951862",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:RPT,
  author =       "Frederic Green",
  title =        "Review of: {{\booktitle{Primality Testing for
                 Beginners}} by Lasse Rempe-Gillen and Rebecca
                 Waldecker}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "6--9",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951863",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RJF,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{The Joy of Factoring}} by
                 Samuel Wagstaff}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "10--11",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951864",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RAJ,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Asymptopia}} by Joel Spencer
                 and Laura Florescu}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "12--13",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951865",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RRT,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{{Ramsey} Theory over the
                 Integers}} (Second Edition) by Bruce M. Landman and
                 Aaron Robertson}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "14--17",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951866",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Upadhyay:2016:RDC,
  author =       "Jalaj Upadhyay",
  title =        "Review of: {{\booktitle{Distributed Computing Through
                 Combinatorial Topology}} by Maurice Herlihy and Dmitry
                 Kozlov and Sergio Rajsbaum}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "18--20",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951867",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2016:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "21--33",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951868",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Klein:2016:CGC,
  author =       "Rolf Klein and Elmar Langetepe",
  title =        "Computational Geometry Column 63",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "34--39",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951870",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Assume that a fire spreads inside a geometric
                 environment. The fire-fighter's task is to extinguish
                 the fire, or to build a barrier that encloses and stops
                 the fire. This problem has been considered in many
                 different models and variants. For example, the
                 spreading can occur in a discrete world or in the
                 continuous plane. Many computational questions arise.
                 How fast must the fighters be in comparison to the
                 fire's speed, in order to fulfill their task? How many
                 fire-fighters are necessary and sufficient? How can
                 they enclose the fire as efficiently as possible? Of
                 the wealth of existing results we present some
                 appetizers indicating the wide range of this topic, and
                 mention a number of open questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2016:SNOb,
  author =       "Rob van Stee",
  title =        "{SIGACT} News Online Algorithms Column 28: Online
                 Matching on the Line, {Part 2}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "40--51",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951871",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2016:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 62: Decidability in
                 Parameterized Verification",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "52--52",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951872",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bloem:2016:DPV,
  author =       "Roderick Bloem and Swen Jacobs and Ayrat Khalimov and
                 Igor Konnov and Sasha Rubin and Helmut Veith and Josef
                 Widder",
  title =        "Decidability in Parameterized Verification",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "53--64",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951873",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2016:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 91",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "65--65",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951874",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Razborov:2016:GCP,
  author =       "Alexander Razborov",
  title =        "Guest Column: Proof Complexity and Beyond",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "2",
  pages =        "66--86",
  month =        jun,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2951860.2951875",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jun 20 18:33:06 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This essay is a highly personal and biased account of
                 some main concepts and several research directions in
                 modern propositional proof complexity. Special
                 attention will be paid to connections with other
                 disciplines.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "5--6",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993751",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:RQA,
  author =       "Frederic Green",
  title =        "Review of: {{\booktitle{Quantum Algorithms via Linear
                 Algebra}} by Richard J. Lipton and Kenneth W. Regan}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "7--11",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993752",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moulick:2016:RQI,
  author =       "Subhayan Roy Moulick",
  title =        "Review of: {{\booktitle{Quantum Information Theory}}
                 by Mark M. Wilde}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "12--14",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993753",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelk:2016:RGS,
  author =       "Steven Kelk",
  title =        "Review of: {{\booktitle{Genome-Scale Algorithm
                 Design}} (Biological sequence analysis in the era of
                 high-throughput sequencing) by Veli M{\"a}kinen, Djamal
                 Belazzougui, Fabio Cunial and Alexandru I. Tomescu}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "15--18",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993754",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ledin:2016:RME,
  author =       "George {Ledin, Jr.}",
  title =        "Review of: {{\booktitle{The Mathematics of Encryption:
                 An Elementary Introduction}} by Margaret Cozzens and
                 Steven J. Miller}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "19--21",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993755",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2016:RME,
  author =       "S. V. Nagaraj",
  title =        "Review of: {{\booktitle{Mathematics Everywhere}} by
                 Martin Aigner and Ehrhard Behrends (Eds.)}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "22--24",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993756",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2016:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "25--38",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993757",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:OPA,
  author =       "William Gasarch",
  title =        "Open Problems About Grid Coloring and The Complexity
                 of Grid Colorings",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "39--43",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993758",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2016:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 93",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "44--45",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993760",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kopparty:2016:GCL,
  author =       "Swastik Kopparty and Shubhangi Saraf",
  title =        "Guest Column: Local Testing and Decoding of High-Rate
                 Error-Correcting Codes",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "46--66",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993761",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We survey the state of the art in constructions of
                 locally testable codes, locally decodable codes and
                 locally correctable codes of high rate.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tan:2016:DTC,
  author =       "Wang-Chiew Tan",
  title =        "Database Theory Column: Report on {PODS 2016}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "67--68",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993762",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2016:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 63: a Note on
                 Fault-tolerant Consensus in Directed Networks",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "69--69",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993763",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tseng:2016:NFT,
  author =       "Lewis Tseng and Nitin H. Vaidya",
  title =        "A Note on Fault-tolerant Consensus in Directed
                 Networks",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "70--91",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993764",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2016:SNO,
  author =       "Rob van Stee",
  title =        "{{\booktitle{SIGACT News}}} Online Algorithms Column
                 29",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "92--92",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993765",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Boyar:2016:OAA,
  author =       "Joan Boyar and Lene M. Favrholdt and Christian Kudahl
                 and Kim S. Larsen and Jesper W. Mikkelsen",
  title =        "Online Algorithms with Advice: a Survey",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "3",
  pages =        "93--129",
  month =        sep,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/2993749.2993766",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Online algorithms with advice is an area of research
                 where one attempts to measure how much knowledge of the
                 future is necessary to achieve a given competitive
                 ratio. The lower bound results give robust bounds on
                 what is possible using semi-online algorithms. On the
                 other hand, when the advice is of an obtainable form,
                 algorithms using advice can lead to semi-online
                 algorithms. There are strong relationships between
                 advice complexity and randomization, and advice
                 complexity has led to the introduction of the first
                 complexity classes for online problems. This survey
                 concerning online algorithms with advice explains the
                 models, motivates the study in general, presents some
                 examples of the work that has been carried out, and
                 includes a fairly complete set of references, organized
                 by problem studied.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:BRCd,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023857",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2016:RTC,
  author =       "William Gasarch",
  title =        "Review of: {{\booktitle{Turing Computability: Theory
                 and Applications}} by Robert Soare}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "6--8",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023858",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Apon:2016:RAB,
  author =       "Daniel Apon",
  title =        "Review of: {{\booktitle{Analysis of Boolean
                 Functions}} by Ryan O'Donnell}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "9--12",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023859",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vera:2016:RDS,
  author =       "Ramon de {Vera, Jr.}",
  title =        "Review of: {{\booktitle{Distributed Systems: an
                 Algorithmic Approach}} (2nd Edition) by Sukumar
                 Ghosh}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "13--14",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023860",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2016:RGR,
  author =       "Micha{\"e}l Cadilhac",
  title =        "Review of: {{\booktitle{The Golden Ratio and Fibonacci
                 Numbers}} by Richard A. Dunlap}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "15--17",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023861",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2016:RFW,
  author =       "Frederic Green",
  title =        "Review of: {{\booktitle{The Fascinating World of Graph
                 Theory}} by Arthur Benjamin, Gary Chartrand and Ping
                 Zhang}",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "18--21",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023862",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2016:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "22--32",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023863",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2016:DCCd,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 64: Annual Review 2016",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "33--34",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023865",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schwarzman:2016:PR,
  author =       "Gregory Schwarzman",
  title =        "{PODC 2016} Review",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "35--38",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023866",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Su:2016:DR,
  author =       "Lili Su",
  title =        "{DISC 2016} Review",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "39--43",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023867",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2016:CGC,
  author =       "Adrian Dumitrescu",
  title =        "Computational Geometry Column 64",
  journal =      j-SIGACT,
  volume =       "47",
  number =       "4",
  pages =        "44--47",
  month =        dec,
  year =         "2016",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3023855.3023868",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to minimum partitions of
                 colored point sets into monochromatic parts with
                 pairwise disjoint convex hulls. These partitions offer
                 compact color signatures that in principle could be
                 used for classification and retrieval of discretized
                 images.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "8--9",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061642",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:RAL,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Art in the Life of
                 Mathematicians}} by Anna Kepes Szemer{\'e}di}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "10--17",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061643",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miller:2017:RPD,
  author =       "Allan M. Miller",
  title =        "Review of {{\booktitle{Practical Data Science with R}}
                 by Nina Zumel and John Mount}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "18--22",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061644",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2017:RAC,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Algebraic Coding Theory}}
                 Revised Edition by Elwyn Berlekamp}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "23--26",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061645",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2017:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "27--37",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061646",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2017:OPCa,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "38--38",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061647",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Viola:2017:SCC,
  author =       "Emanuele Viola",
  title =        "Selected challenges in computational lower bounds",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "39--45",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061648",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2017:SNOa,
  author =       "Rob van Stee",
  title =        "{{\booktitle{SIGACT News}}} Online Algorithms Column
                 30: 2016 in review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "46--53",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061650",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column, I will discuss some recent papers in
                 online algorithms that appeared in 2016. Quite a number
                 of papers on online algorithms appeared during the
                 year, and I have had to make a selection; I am sure to
                 have overlooked some papers. If I have unaccountably
                 missed your favorite paper and you would like to write
                 about it or about any other topic in online algorithms,
                 please don't hesitate to contact me!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2017:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 65: Automatic Synthesis
                 of Distributed Protocols and {SIROCCO 2016} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "54--54",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061651",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alur:2017:ASD,
  author =       "Rajeev Alur and Stavros Tripakis",
  title =        "Automatic Synthesis of Distributed Protocols",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "55--90",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061652",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tseng:2017:SR,
  author =       "Lewis Tseng",
  title =        "{SIROCCO 2016} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "91--100",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061653",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 23rd International Colloquium on Structural
                 Information and Communication Complexity (SIROCCO '16)
                 was held on July 19-21, 2016, in Helsinki, Finland. The
                 conference took place at the Aalto University School of
                 Business, which is located in a lovely neighborhood
                 near the city center. The venue is one block away from
                 the Temppeliaukio Church, a magnificent church built
                 directly into solid rock. I was lucky enough to enjoy a
                 beautiful sacred music performance at the church on my
                 first day in Helsinki, which helped me get over my jet
                 lag. If you need some refreshing experiences while
                 visiting Helsinki, I would definitely recommend the
                 Temppeliaukio Church.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2017:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 93",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "101--101",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061654",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fenner:2017:GCP,
  author =       "Stephen Fenner and Rohit Gurjar and Thomas Thierauf",
  title =        "Guest Column: Parallel Algorithms for Perfect
                 Matching",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "1",
  pages =        "102--109",
  month =        mar,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3061640.3061655",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Mar 11 17:49:13 MST 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The perfect matching problem has a randomized
                 NC-algorithm based on the Isolation Lemma of Mulmuley,
                 Vazirani and Vazirani. We give an almost complete
                 derandomization of the Isolation Lemma for perfect
                 matchings in bipartite graphs. This gives us a
                 deterministic quasi-NC-algorithm for the bipartite
                 perfect matching problem. The outline presented here
                 emphasizes a geometric point of view. We think that
                 this will be useful also for the perfect matching
                 problem in general graphs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "4--6",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106702",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Belton:2017:RSS,
  author =       "Robin Belton and Brittany Terese Fasy",
  title =        "Review of {{\booktitle{The Structure and Stability of
                 Persistence Modules}} by Fr{\'e}d{\'e}ric Chazal, Vin
                 de Silva, Marc Glisse, and Steve Oudot}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "7--11",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106703",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:RQW,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Quantum Walks and Search
                 Algorithms}} by Renato Portugal}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "12--15",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106704",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:JRM,
  author =       "Frederic Green",
  title =        "Joint Review of {{\booktitle{The Magic of Math}} by
                 Arthur Benjamin and \booktitle{How to Bake} by Eugenia
                 Cheng}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "16--20",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106705",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2017:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "21--33",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106706",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2017:OPCb,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "34--39",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106707",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2017:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 94",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "40--40",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106709",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Arunachalam:2017:GCS,
  author =       "Srinivasan Arunachalam and Ronald de Wolf",
  title =        "Guest Column: a Survey of Quantum Learning Theory",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "41--67",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106710",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This paper surveys quantum learning theory: the
                 theoretical aspects of machine learning using quantum
                 computers. We describe the main results known for three
                 models of learning: exact learning from membership
                 queries, and Probably Approximately Correct (PAC) and
                 agnostic learning from classical or quantum examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Sharir:2017:CGC,
  author =       "Micha Sharir",
  title =        "Computational Geometry Column 65",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "68--85",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106711",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to a review of the recent
                 dramatic developments on many fronts of combinatorial
                 (and computational) geometry, caused by the
                 introduction of techniques from algebra and algebraic
                 geometry, pioneered by Guth and Katz about 10 years
                 ago. We review topics such as incidences, distinct and
                 repeated distances, joints, polynomials vanishing on
                 grids, range searching, repeated configurations, and
                 eliminating depth cycles for lines and triangles. We
                 also discuss briefly the new algebraic machinery, and
                 give a few examples of the way it is applied.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2017:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 66: Algorithmic
                 Foundations of Programmable Matter {Dagstuhl Seminar
                 16271}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "86--86",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106712",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fekete:2017:AFP,
  author =       "S{\'a}ndor P. Fekete and Andr{\'e}a Richa and Kay
                 R{\"o}mer and Christian Scheideler",
  title =        "Algorithmic Foundations of Programmable Matter
                 {Dagstuhl Seminar 16271}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "2",
  pages =        "87--94",
  month =        jun,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3106700.3106713",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:07 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In July 2016, the Dagstuhl Seminar 16271 considered
                 ``Algorithmic Foundations of Programmable Matter'', a
                 new and emerging field that combines theoretical work
                 on algorithms with a wide spectrum of practical
                 applications that reach all the way from small-scale
                 embedded systems to cyber-physical structures at
                 nano-scale. The aim of the Dagstuhl seminar was to
                 bring together researchers from the algorithms
                 community with selected experts from robotics and
                 distributed systems in order to set a solid base for
                 the development of models, technical solutions, and
                 algorithms that can control programmable matter. Both
                 communities benefited from such a meeting for the
                 following reasons: Meeting experts from other fields
                 provided additional insights, challenges and focus when
                 considering work on programmable matter. Interacting
                 with colleagues in a close and social manner gave many
                 starting points for continuing collaboration. Getting
                 together in a strong, large and enthusiastic group
                 provided the opportunity to plan a number of followup
                 activities. .",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "4--6",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138862",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:RST,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Set Theory: a First Course}} by
                 Daniel W. Cunningham}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "7--9",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138863",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Homer:2017:RCS,
  author =       "Steve Homer",
  title =        "Review of {{\booktitle{Crypto School}} by Joachim von
                 zur Gathen}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "10--13",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138864",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miller:2017:RRD,
  author =       "Allan M. Miller",
  title =        "Review of {{\booktitle{R for Data Science: Import,
                 Tidy, Transform, Visualize, and Model Data}} by Hadley
                 Wickham and Garrett Grolemund}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "14--19",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138865",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2017:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "20--31",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138866",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2017:OPCc,
  author =       "William Gasarch and Brittany Terese Fasy and Bei
                 Wang",
  title =        "Open Problems in Computational Topology",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "32--36",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138867",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{ODonnell:2017:GCP,
  author =       "Ryan O'Donnell and John Wright",
  title =        "Guest Column: a Primer on the Statistics of Longest
                 Increasing Subsequences and Quantum States (Shortened
                 Version)",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "37--59",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138869",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2017:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 67: Review of {2016 BIRS
                 CMO Workshop on Complexity and Analysis of Distributed
                 Algorithms}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "60--67",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138870",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The BIRS-CMO workshop on Complexity and Analysis of
                 Distributed Algorithms ran from November 27 to December
                 2, 2016, and was organized by Hagit Attiya, Sergio
                 Rajsbaum, and Philipp Woelfel. The objective of the
                 workshop was to bring together researchers to exchange
                 ideas on how to advance the design and analysis of
                 algorithms for problems in distributed systems. Topics
                 covered included theory of shared memory algorithms,
                 networks and message-passing systems, applications of
                 combinatorics and topology to concurrency. The
                 attendees were a mix of theoreticians and systems
                 researchers.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ambuhl:2017:SNO,
  author =       "Christoph Amb{\"u}hl",
  title =        "{{\booktitle{SIGACT News}}} Online Algorithms Column
                 31",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "68--82",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138871",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The list update problem is a well studied online
                 problem in the area of self-adjusting data structures.
                 Understanding the offline version of this problem is
                 crucial because of the role it plays in the competitive
                 analysis of online list update algorithms. In this
                 paper we settle a long-standing open problem by showing
                 that the offline list update problem is NP-hard.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Czumaj:2017:HHA,
  author =       "Artur Czumaj and Stefano Leonardi",
  title =        "{HALG}: Highlights of Algorithms",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "3",
  pages =        "83--86",
  month =        sep,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3138860.3138873",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sat Sep 16 11:34:08 MDT 2017",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Most of the conferences in theoretical computer
                 science (such as FOCS, ICALP, SODA and STOC) have the
                 following format: several days of talks selected by a
                 program committee, with all these talks, except for a
                 few invited presentations, presenting results that are
                 new and unpublished before. Most of us would agree that
                 if one attended all these conferences, then one would
                 get a very good overview of most of the important
                 results in theoretical computer science. However, once
                 a result has been presented in one of these
                 conferences, then it is hard to see it elsewhere,
                 making it quite challenging for the researchers to
                 follow the developments in the field, unless they go to
                 all the relevant conferences. The newly established
                 series of Highlights of Algorithms (HALG) conferences
                 is trying to address this challenge by taking a
                 different approach, drawing some inspiration from other
                 communities. HALG is designed to be a forum for
                 presenting the highlights of recent developments in
                 algorithms and for discussing potential further
                 advances in this area. The conference aims to provide a
                 broad picture of the latest research in algorithms
                 through a series of survey and invited talks. It also
                 includes a possibility for all researchers and students
                 to present their recent results via short talks and
                 poster presentations. HALG aims to be a venue one can
                 go to to catch up on the hottest results and topics at
                 the moment, as well as what one missed by not being
                 able to attend all the relevant algorithmic
                 conferences, such as STOC/FOCS/SODA/ICALP/ESA/ITCS,
                 that year. Attending HALG should also constitute an
                 opportunity for networking and meeting leading
                 researchers in algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2017:BRCd,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "4--6",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173129",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Liberatore:2017:RCN,
  author =       "Vincenzo Liberatore",
  title =        "Review of {{\booktitle{Communication Networks: an
                 Optimization, Control, and Stochastic Networks
                 Perspective}}, R. Srikant and L. Ying}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "7--12",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173130",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2017:RHC,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Handbook of Computational
                 Social Choice}} Edited by Felix Brandt, Vincent
                 Conitzer, Ulle Endriss, J{\'e}r{\^o}me Lang, and Ariel
                 D. Procaccia}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "13--17",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173131",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2017:RRT,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Ramsey Theory for Discrete
                 Structures}} by Hans J{\"u}rgen Pr{\"o}mel}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "18--21",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173132",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2017:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "22--34",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173133",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2017:OPCd,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "35--41",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173134",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2017:SNC,
  author =       "Lane Hemaspaandra",
  title =        "{SIGACT News} Complexity Theory Column 96",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "42--42",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173136",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Baumeister:2017:GCC,
  author =       "D. Baumeister",
  title =        "Guest Column: Complexity of Verification in Abstract
                 Argumentation Frameworks",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "43--56",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173137",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Abstract argumentation frameworks introduced by Dung
                 [Dun95] are a formal way of representing discussions de
                 ned through arguments and a binary attack relation
                 between them. In dynamic settings there is a need to
                 allow for uncertainty in such argumentation frameworks,
                 hence attack-incomplete and argument-incomplete
                 argumentation frameworks are considered as well.
                 Different semantics are de ned in order to identify a
                 set of acceptable arguments, and the verification
                 problem asks whether some given set is an extension for
                 a given semantics. This survey gives an overview of the
                 complexity of the verification problem for different
                 semantics in complete and incomplete argumentation
                 frameworks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Elbassioni:2017:CGC,
  author =       "Khaled Elbassioni and Adrian Dumitrescu",
  title =        "Computational Geometry Column 66",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "57--74",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173138",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The list update problem is a well studied online
                 problem in the area of self-adjusting data structures.
                 Understanding the offline version of this problem is
                 crucial because of the role it plays in the competitive
                 analysis of online list update algorithms. In this
                 paper we settle a long-standing open problem by showing
                 that the offline list update problem is NP-hard.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Geerts:2017:DTC,
  author =       "Floris Geerts",
  title =        "Database Theory Column Report on {PODS 2017}",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "75--77",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173139",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2017:DCCd,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 68",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "78--79",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173140",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Konrad:2017:SR,
  author =       "Christian Konrad",
  title =        "{SIROCCO 2017} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "80--86",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173141",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Assadi:2017:SR,
  author =       "Sepehr Assadi",
  title =        "{SPAA 2017} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "87--90",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173142",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Davies:2017:PR,
  author =       "Peter Davies",
  title =        "{PODC 2017} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "91--93",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173143",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fischer:2017:DR,
  author =       "Manuela Fischer and Yannic Maus",
  title =        "{DISC 2017} Review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "94--99",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173144",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2017:SNOb,
  author =       "Rob van Stee",
  title =        "{SIGACT News} Online Algorithms Column 32: 2017 in
                 review",
  journal =      j-SIGACT,
  volume =       "48",
  number =       "4",
  pages =        "100--109",
  month =        dec,
  year =         "2017",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3173127.3173145",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Mon Jan 22 17:29:44 MST 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2018:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197408",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rogers:2018:RAC,
  author =       "John D. Rogers",
  title =        "Review of {{\booktitle{The Art of Computer Programming
                 Fascicle 6 `Satisfiability'}} by Donald E. Knuth}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "12--15",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197409",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vera:2018:RRW,
  author =       "Ramon de {Vera Jr.}",
  title =        "Review of {{\booktitle{Real-World Algorithms: a
                 Beginner's Guide}} by Panos Louridas}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "16--19",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197410",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2018:JRQ,
  author =       "Frederic Green",
  title =        "Joint Review of {{\booktitle{Quadratic Residues and
                 Non-Residues}} by Steve Wright and \booktitle{The
                 Quadratic Reciprocity Law} by Oswald Baumgart. Edited
                 and translated by Franz Lemmermeyer}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "20--28",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197411",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2018:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "29--39",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197412",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2018:OPCa,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "40--54",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197413",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2018:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 97",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "54--54",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197415",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kayal:2018:GCP,
  author =       "Neeraj Kayal",
  title =        "Guest Column: a Paradigm for Arithmetic Circuit Lower
                 Bounds",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "55--65",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197416",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "How many operations are needed to compute a given
                 polynomial f(x1; x2; : : : ; xn)? Answering questions
                 of this form naturally leads us on a search for clever
                 algorithmic techniques to reduce the number of
                 operations required. Simultaneously, it also leads us
                 towards the complementary task of finding techniques
                 and paradigms for proving lower bounds on the minimum
                 number of operations required. In this survey we
                 describe one such paradigm for obtaining lower
                 bounds.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2018:SNOa,
  author =       "Rob van Stee",
  title =        "{SIGACT} News Online Algorithms Column 33",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "66--66",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197417",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Englert:2018:RBP,
  author =       "Matthias Englert",
  title =        "The reordering buffer problem on the line revisited",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "67--72",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197418",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2018:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 69 {Proving PACELC and
                 Concurrent Computing Summer School}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "72--72",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197419",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Golab:2018:PP,
  author =       "Wojciech Golab",
  title =        "Proving {PACELC}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "73--81",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197420",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Scalable distributed systems face inherent trade-offs
                 arising from the relatively high cost of exchanging
                 information between computing nodes. Brewer's CAP
                 (Consistency, Availability, Partition-Tolerance)
                 principle states that when communication becomes
                 impossible between isolated parts of the system (i.e.,
                 the network is partitioned), then the system must give
                 up either safety (i.e., sometimes return an incorrect
                 result) or liveness (i.e., sometimes fail to produce a
                 result). Abadi generalized Brewer's principle by
                 defining the PACELC (if Partition then Availability or
                 Consistency, Else Latency or Consistency) formulation,
                 which captures the observation that the trade-off
                 between safety and liveness is often made in practice
                 even while the network is reliable. Building on Gilbert
                 and Lynch's formal proof of the CAP principle, this
                 paper presents a formal treatment of Abadi's
                 formulation and connects this result to a body of prior
                 work on latency bounds for distributed objects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuznetsov:2018:FSS,
  author =       "Petr Kuznetsov",
  title =        "The {First Summer School on Practice and Theory of
                 Concurrent Computing SPTCC 2017}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "1",
  pages =        "81--90",
  month =        mar,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3197406.3197421",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2018:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "4--6",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232681",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "While the approaches are all different, there is at
                 least one thread running through the three books
                 reviewed in this column: the graph, and/or its more
                 complex relative as manifested in the real world, the
                 network: 1. Words and Graphs, by Sergey Kitaev and
                 Vadim Lozin. The mathematics connecting two ideas that
                 are more closely related than might at first appear.
                 Review by James V. Rauff. 2. Network Science, by
                 Albert-L{\`a}szl{\`o} Barab{\`a}asi. An introduction to
                 a burgeoning and exciting new field. Review by Panos
                 Louridas. 3. Trends in Computational Social Choice,
                 edited by Ulle Endriss. This collection of articles is
                 a follow-up to a title reviewed recently in this
                 column. Review by S.V. Nagaraj. Please let me know if
                 you are interested in reviewing any of the books listed
                 on the subsequent page are available for review.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rauff:2018:RWG,
  author =       "James V. Rauff",
  title =        "Review of {{\booktitle{Words and Graphs}} by Sergey
                 Kitaev and Vadim Lozin}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "7--9",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232682",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Two distinct letters x and y in a word alternate if,
                 after deleting all other letters in the word, the
                 resulting word is of the form xyxy : : : or yxyx : : :
                 . A graph G = (V;E) is word-representable if there
                 exists a word w over the alphabet V such that the
                 letters x and y alternate in w if and only if there is
                 an edge connecting x and y in G. If graphs can be
                 represented by words then exciting new possibilities
                 arise for investigating graph properties in terms of
                 the properties of the words that represent them. In
                 addition, words (i.e. strings) would offer an
                 additional way of storing and manipulating graph
                 structures in computation. This textbook is a
                 comprehensive survey of word-representable graphs and
                 the relationships between combinatorics on words and
                 graph properties. The contents are accessible to graph
                 theorists, formal language theorists, computer
                 scientists, and students who have some familiarity with
                 graph theory and words.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Louridas:2018:RNS,
  author =       "Panos Louridas",
  title =        "Review of {{\booktitle{Network Science}} by
                 Albert-L{\`a}aszl{\`o} Barab{\`a}asi}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "10--13",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232683",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Albert-L{\`a}aszl{\`o} Barab{\`a}asi can be credited
                 with bringing network science to the general public.
                 After a series of papers in such heavyweights as Nature
                 and Science, his book Linked gave a popular science
                 account of the field. With Network Science he turns his
                 attention to newcomer students who want to start from
                 scratch and go through a wide ranging, yet accessible,
                 introduction. The explosion of publications and
                 interest in network science makes it easy to forget how
                 new it is. True, the germs of network science were sown
                 many decades back (one can think of the work of Yule
                 and Zipf as early precursors), but it was not until the
                 end of the millennium that scientists from different
                 disciplines, ranging from computer science and
                 mathematics to physics and statistics, started paying
                 attention to what appear to be a set of unifying
                 principles and underlying phenomena. Barab{\`a}asi did
                 not invent the field, but his publications created a
                 lot of buzz in many places; and in a short while,
                 scientists all over were studying power laws, critical
                 phenomena, and networks-not computer networks, just
                 networks. (This reviewer remembers the period, when
                 describing a course on network science he had to always
                 add a proviso like ``this is not about computer
                 networks''; otherwise students would get the idea that
                 this was about hardcore computer science. The situation
                 has changed somewhat since then.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2018:RTC,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Trends in Computational Social
                 Choice}} Edited by Ulle Endriss}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "14--17",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232684",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Social choice theory is an area of economics that
                 studies collective decision making. Examples of
                 collective decision making include sharing a cake or a
                 resource among a group of people or friends, tallying
                 votes in an election, and aggregating opinions of
                 various experts. Computational social choice is a
                 discipline which may be considered to be at the
                 intersection of economics and computer science. This
                 book deals with recent trends related to computational
                 aspects of collective decision making. It contains
                 contributions of experts in computational social
                 choice. The book is divided into three parts that focus
                 on scenarios, techniques, and applications,
                 respectively. It has been published as a sequel to the
                 Handbook of Computational Social Choice, Cambridge
                 University Press, 2016, recently reviewed by me in this
                 column (SIGACT News 48(4), December 2017, pp. 13-17).
                 Ulle Endriss, the editor of this book, was also an
                 editor of the Handbook. This book has been published by
                 AI Access, a not-for-profit publisher. It is available
                 for free online at the URL
                 http://research.illc.uva.nl/COST-IC1205/Book/, and the
                 hard copy is very nominally priced. The book's
                 publication",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2018:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "18--28",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232685",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Complexity Theory, Game Theory, and Economics, Tim
                 Roughgarden, TR18-001. Which Distribution Distances are
                 Sublinearly Testable?, Constantinos Daskalakis, Gautam
                 Kamath, John Wright, TR18-002. Proving that prBPP = prP
                 is as hard as almost ``proving that P = NP, Roei Tell,
                 TR18-003. Circuit Complexity of Bounded Planar Cutwidth
                 Graph Matching, Aayush Ojha, Raghunath Tewari,
                 TR18-004. Adaptive Boolean Monotonicity Testing in
                 Total Influence Time, C. Seshadhri, Deeparnab
                 Chakrabarty, TR18-005. Pseudorandom Sets in Grassmann
                 Graph have Near-Perfect Expansion, Subhash Khot, Dor
                 Minzer, Muli Safra, TR18-006.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2018:OPCb,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "29--31",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232686",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There have been two polls asking theorists (and
                 others) what they thought of P vs NP (and other
                 questions) [4, 5]. Both were written by William Gasarch
                 and appeared in the Complexity Column of SIGACT News,
                 edited by Lane A. Hemaspaandra. They were in 2002 and
                 2012. Since William Gasarch is fond of Van der
                 Waerden's theorem, you would think the next poll would
                 be 2022; however, Lane asked if it could be a bit
                 earlier so as to be the 100th issue of his column. So
                 here we are. In the past the questions for the poll
                 appeared in Lane's column. This time they appear here
                 in the Open Problems Column, which makes sense since,
                 well, P vs NP is indeed an open problem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2018:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 98",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "32--32",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232688",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This Issue Warmest thanks to David and Josh for
                 starting all of our summers with their fascinating
                 column, Beyond number of bit erasures: New complexity
                 questions raised by recently discovered thermodynamic
                 costs of computation. Future Issues: Please stay tuned
                 for the coming issues' articles in the Complexity
                 Theory Column, namely, Lane A. Hemaspaandra and Holger
                 Spakowski (tentative topic: team diagonalization),
                 William Gasarch (not-at-all-tentative topic: the third
                 P versus NP poll), (again!) William Gasarch (tentative
                 topic: the muffin problem), and Emanuele Viola (topic:
                 TBD).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Grochow:2018:BNB,
  author =       "Joshua A. Grochow and David H. Wolpert",
  title =        "Beyond Number of Bit Erasures: New Complexity
                 Questions Raised by Recently Discovered Thermodynamic
                 Costs of Computation",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "33--56",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232689",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Recent advances in nonequilibrium statistical
                 mechanics have led to a deeper understanding of the
                 thermodynamic cost of computation than that put forth
                 by Landauer and then studied extensively in the
                 computational complexity community. In particular,
                 Landauer's work led to a focus on the number of bit
                 erasures in a computation, due to its relation to the
                 change in entropy between input and output. However new
                 advances in physics (which have been experimentally
                 confirmed) mean we can now calculate additional
                 thermodynamic costs beyond merely the change in entropy
                 between input and output. As a consequence, we now
                 understand that while logically reversible computing
                 can have some thermodynamic benefits, it is far from
                 the end of the story. The purpose of this paper is to
                 highlight new open questions in computational
                 complexity raised by consideration of these new
                 thermodynamic costs. Beyond leading to a revised
                 viewpoint on the benefits of logical reversibility,
                 these questions touch on randomized algorithms,
                 average-case complexity, the thermodynamic cost of
                 error correcting codes, and noisy/inexact/approximate
                 computation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2018:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 70: Formalizing and
                 Implementing Distributed Ledger Objects",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "57--57",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232690",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Blockchains and distributed ledgers, the technologies
                 underlying Bitcoin and other decentralized transaction
                 systems, have been garnering increasing interest in the
                 theoretical distributed computing community. The
                 current column, by Antonio Fern{\'a}ndez Anta, Chryssis
                 Georgiou, Kishori Konwar, and Nicolas Nicolaou, starts
                 with an informative overview of the world of
                 distributed ledgers and motivates the need for rigorous
                 approaches. The authors present an approach for
                 formally specifying a distributed ledger in the context
                 of several popular consistency conditions. The authors
                 then give algorithms that implement the different
                 variants in message-passing systems subject to crash
                 failures. The article closes with a discussion of
                 intriguing open questions. Many thanks to Antonio,
                 Chryssis, Kishori and Nicolas for their timely
                 contribution!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Anta:2018:FID,
  author =       "Antonio Fern{\'a}ndez Anta and Kishori Konwar and
                 Chryssis Georgiou and Nicolas Nicolaou",
  title =        "Formalizing and Implementing Distributed Ledger
                 Objects",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "58--76",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232691",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Despite the hype about blockchains and distributed
                 ledgers, formal abstractions of these objects are
                 scarce1. To face this issue, in this paper we provide a
                 proper formulation of a distributed ledger object. In
                 brief, we define a ledger object as a sequence of
                 records, and we provide the operations and the
                 properties that such an object should support.
                 Implementation of a ledger object on top of multiple
                 (possibly geographically dispersed) computing devices
                 gives rise to the distributed ledger object. In
                 contrast to the centralized object, distribution allows
                 operations to be applied concurrently on the ledger,
                 introducing challenges on the consistency of the ledger
                 in each participant. We provide the definitions of
                 three well known consistency guarantees in terms of the
                 operations supported by the ledger object: (1) atomic
                 consistency (linearizability), (2) sequential
                 consistency, and (3) eventual consistency. We then
                 provide implementations of distributed ledgers on
                 asynchronous message passing crash- prone systems using
                 an Atomic Broadcast service, and show that they provide
                 eventual, sequential or atomic consistency semantics
                 respectively. We conclude with a variation of the
                 ledger the validated ledger which requires that each
                 record in the ledger satisfies a particular validation
                 rule.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Banyassady:2018:CGC,
  author =       "Bahareh Banyassady and Matias Korman and Wolfgang
                 Mulzer",
  title =        "Computational Geometry Column 67",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "2",
  pages =        "77--94",
  month =        jun,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3232679.3232692",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Sun Jul 29 14:55:35 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In the limited workspace model, we consider algorithms
                 whose input resides in read-only memory and that use
                 only a constant or sublinear amount of writable memory
                 to accomplish their task. We survey recent results in
                 computational geometry that fall into this model and
                 that strive to achieve the lowest possible running
                 time. In addition to discussing the state of the art,
                 we give some illustrative examples and mention open
                 problems for further research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2018:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "6--8",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289139",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column we review these three books: 1. Compact
                 Data Structures --- A Practical Approach, by Gonzalo
                 Navarro. An unusual approach focussing on data
                 structures that use as little space as is theoretically
                 possible, while maintaining practicality. Review by
                 Laszlo Kozma. 2. Power Up: Unlocking the Hidden
                 Mathematics in Video Games, by Matthew Lane. A
                 revealing look at the mathematics, physics, and
                 computer science that underlies (good) video games,
                 with special attention to their potential valuable role
                 in education. Review by S. V. Nagaraj. 3. Probability
                 and Computing: Randomization and Probabilistic
                 Techniques in Algorithms and Data Analysis (Second
                 Edition), by Michael Mitzenmacher and Eli Upfal. The
                 second edition2 of a distinguished text on a rich area
                 that is central to computer and data science. Review by
                 Aravind Srinivasan. Many thanks to these and all
                 reviewers over the years who have graciously
                 volunteered this valuable service to the community!
                 Interested in reviewing? I hope so. Remember the perks:
                 Learning (more?) about a field that interests you, a
                 review on these pages, and a free book! The books
                 listed on the next two pages are available, but the
                 list is not exhaustive: I'm open to suggestions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kozma:2018:RCD,
  author =       "L{\'a}szl{\'o} Kozma",
  title =        "Review of {{\booktitle{Compact Data Structures --- a
                 practical approach}} by Gonzalo Navarro}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "9--13",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289140",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The book studies fundamental data structures and
                 representations of combinatorial objects, including
                 arrays, bitvectors, permutations, trees, graphs, etc.
                 There are, of course, a great number of existing
                 textbooks and lecture notes about data structures. The
                 perspective of this book is, however, different from
                 the usual presentations. In some sense, this book
                 starts exactly where others leave off saying ``we omit
                 the low-level details of representation'', and concerns
                 itself mostly with the low-level representation.
                 Specifically, it looks at how to organize and store
                 data structures using as little space as possible while
                 supporting efficient queries and operations. For the
                 considered structures, the book explores the trade-off
                 between reduced space and speed of operation. The
                 analyses of the presented solutions go beyond the usual
                 asymptotics, and also consider exact constant factors
                 (particularly for the leading term of the space
                 complexity); useful practical considerations are also
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2018:RPU,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Power Up:: Unlocking the hidden
                 mathematics in video games}}}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "14--19",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289141",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Video games provide entertainment to those who play
                 them. This book looks at the hidden mathematics behind
                 video games. It is meant for all those who love playing
                 video games, so that they may explore mathematical
                 ideas in the games. It is also aimed at mathematics
                 teachers for inspiring their students, and for all
                 those who love mathematics and games. Even those who
                 hate mathematics but love video games are also a part
                 of the target audience of this book. However, this
                 particular category of readers needs at least some
                 familiarity with high school mathematics to benefit
                 from the book. The author states that many people enjoy
                 playing computer / video games but few would be
                 indulging themselves in doing some math. He terms this
                 a consequence of poor marketing of mathematics since
                 time immemorial. The main purpose of the book is to
                 highlight that mathematics can be fun and that it can
                 be found even in the most unbelievable or unexpected
                 places such as in computer games.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Srinivasan:2018:PC,
  author =       "Aravind Srinivasan",
  title =        "Probability and Computing",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "20--22",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289142",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The power of randomization in the computational
                 context is one of the fundamental discoveries of
                 computer science; furthermore, statistical and
                 probabilistic reasoning is indispensable for modern-day
                 data analysis and data science. In this
                 significantly-expanded second edition, the authors
                 (continuing to assume exposure to just basic discrete
                 probability) present a unified treatment of
                 probabilistic concepts useful for modern computer
                 science and data science.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2018:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "23--33",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289143",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2018:OPCc,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "34--34",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289144",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's Open Problem Column is by Stephen Fenner,
                 Fred Green, and Steven Homer. It is titled:
                 Fixed-Parameter Extrapolation and Aperiodic Order: Open
                 Problems. It is not on xedparameter tractability. It is
                 on a generalization of the geometric notion of
                 convexity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fenner:2018:FPE,
  author =       "Stephen Fenner and Frederic Green and Steven Homer",
  title =        "Fixed-Parameter Extrapolation and Aperiodic Order:
                 Open Problems",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "35--47",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289145",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "For a number of years we have been investigating the
                 geometric and algebraic properties of a family of
                 discrete sets of points in Euclidean space generated by
                 a simple binary operation: pairwise affine combination
                 by a xed parameter, which we call xed-parameter
                 extrapolation. By varying the parameter and the set of
                 initial points, a large variety of point sets emerge.
                 To our surprise, many of these sets display aperiodic
                 order and share properties of so-called
                 \quasicrystals`` or \quasilattices.'' Such sets display
                 some ordered crystal-like properties (e.g., generation
                 by a regular set of local rules, such as a finite set
                 of tiles, and possessing a kind of repetitivity), but
                 are ``aperiodic'' in the sense that they have no
                 translational symmetry. The most famous of such systems
                 are Penrose's aperiodic tilings of the plane [16].
                 Mathematically, a widely accepted way of capturing the
                 idea of aperiodic order is via the notion of Meyer
                 sets, which we de ne later. Our goal is to classify the
                 sets generated by xed-parameter extrapolation in terms
                 of a number of these properties, including but not
                 limited to aperiodicity, uniform discreteness, and
                 relative density. We also seek to determine exactly
                 which parameter values lead to which types of sets.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2018:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 99",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "48--50",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289147",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "To call these papers influential would be a comic
                 understatement. In fact, what these papers did is to
                 help set the framework in which theoretical computer
                 science would grow. Reductions are perhaps the most
                 central way in which theoretical computer science
                 relates one problem's complexity to another, and these
                 two papers largely sculpted and powerfully explored the
                 landscape of both polynomial-time and logspace
                 reductions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2018:CTD,
  author =       "Lane A. Hemaspaandra and Holger Spakowski",
  title =        "Column: Team Diagonalization",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "51--61",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289148",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Ten years ago, Gla'er, Pavan, Selman, and Zhang
                 [GPSZ08] proved that if P 6= NP, then all NP-complete
                 sets can be simply split into two NP-complete sets.
                 That advance might naturally make one wonder about a
                 quite different potential consequence of
                 NP-completeness: Can the union of easy NP sets ever be
                 hard? In particular, can the union of two
                 non-NP-complete NP sets ever be NP-complete? Amazingly,
                 Ladner [Lad75] resolved this more than forty years ago:
                 If P 6= NP, then all NP-complete sets can be simply
                 split into two non-NP-complete NP sets. Indeed, this
                 holds even when one requires the two non-NP-complete NP
                 sets to be disjoint. We present this result as a
                 mini-tutorial. We give a relatively detailed proof of
                 this result, using the same technique and idea Ladner
                 [Lad75] invented and used in proving a rich collection
                 of results that include many that are more general than
                 this result: delayed diagonalization. In particular,
                 the proof presented is based on what one can call team
                 diagonalization (or if one is being playful, perhaps
                 even tag-team diagonalization): Multiple sets are
                 formed separately by delayed diagonalization, yet those
                 diagonalizations are mutually aware and delay some of
                 their actions until their partner(s) have also
                 succeeded in some coordinated action. We relatedly note
                 that, as a consequence of Ladner's result, if P 6= NP,
                 there exist OptP functions f and g whose composition is
                 NP-hard yet neither f nor g is NP-hard.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2018:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 71: Recent Algorithmic
                 Advances in Population Protocols",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "62--62",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289149",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Population protocols have been an active area of
                 distributed computing for over a decade, as they are an
                 abstract model of numerous real-world scenarios from
                 sensor networks to biological computing paradigms. For
                 this column, Dan Alistarh and Rati Gelashvili provide a
                 timely overview of recent results on population
                 protocols, focusing especially on the case when each
                 agent in the system can have more than a constant
                 amount of local memory. Several key building blocks are
                 presented, followed by applications of these
                 primitives, in an accessible way that conveys the
                 excitement of fast-moving developments in the area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2018:RAA,
  author =       "Dan Alistarh and Rati Gelashvili",
  title =        "Recent Algorithmic Advances in Population Protocols",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "63--73",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289150",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Population protocols are a popular model of
                 distributed computing, introduced by Angluin, Aspnes,
                 Diamadi, Fischer, and Peralta [6] a little over a
                 decade ago. In the meantime, the model has proved a
                 useful abstraction for modeling various settings, from
                 wireless sensor networks [35, 26], to gene regulatory
                 networks [17], and chemical reaction networks [21]. In
                 a nutshell, a population protocol consists of n agents
                 with limited local state that interact randomly in
                 pairs, according to an underlying communication graph,
                 and cooperate to collectively compute global
                 predicates. From a theoretical prospective, population
                 protocols, with the restricted communication and
                 computational power, are probably one of the simplest
                 distributed model one can imagine. Perhaps surprisingly
                 though, solutions to many classical distributed tasks
                 are still possible. Moreover, these solutions often
                 rely on interesting algorithmic ideas for design and
                 interesting probabilistic techniques for analysis,
                 while known lower bound results revolve around complex
                 combinatorial arguments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Czumaj:2018:HAH,
  author =       "Artur Czumaj and Robert Krauthgamer",
  title =        "3rd Highlights of Algorithms {(HALG 2018)}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "74--77",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289151",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 3rd edition of the Highlights of Algorithms (HALG)
                 conference took place in Amsterdam, June 46, 2018. In
                 this report, the chairs of the Steering Committee and
                 the Program Committee discuss the role, format and
                 impact of the conference until now, and describe their
                 goals and motivation for the future.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Teng:2018:KPA,
  author =       "Sheng-Hua Teng",
  title =        "{2018 Knuth Prize} is Awarded to {Johan H{\aa}stad}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "3",
  pages =        "78--79",
  month =        sep,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3289137.3289152",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/prng.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2018 Donald E. Knuth Prize will be awarded to
                 Johan H{\aa}stad of KTH Royal Institute of Technology
                 for his long and sustained record of milestone
                 breakthroughs at the foundations of computer science,
                 with huge impact on many areas including optimization,
                 cryptography, parallel computing, and complexity
                 theory. H{\aa}stad's multiple seminal works have not
                 only resolved longstanding deepest problems central to
                 circuit lower bounds, pseudorandom generation, and
                 approximability, but also introduced transformative
                 techniques that have fundamentally influenced much of
                 the subsequent work in these areas.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2018:BRCd,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "4--6",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300152",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column we look at four books, ranging from the
                 theoretical to the applied, in these three reviews:",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Louridas:2018:JRP,
  author =       "Panos Louridas",
  title =        "Joint Review of {{\booktitle{The Power of Networks:
                 Six Principles that Connect our Lives}}}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "7--10",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300153",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "These are two books that complement each other; they
                 target different audiences, adopt different pedagogy,
                 they even look very different, yet they treat largely
                 overlapping material. In short, they both present
                 material related to networks; not just computer
                 networks, but any kind of networks that may be subsumed
                 under the newly formed discipline of network science.
                 One of the two books intends to provide a broad sweep
                 and provide a high-level understanding of key concepts,
                 presenting the topics in way accessible to an educated
                 layperson. The other book goes into the nuts and bolts
                 of network science, taking us to the realm of rigorous
                 equations, proofs and algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aazami:2018:RGT,
  author =       "Amir Babak Aazami",
  title =        "Review of {{\booktitle{Game Theory, Alive}}}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "11--12",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300154",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Game Theory, Alive is a wonderful book and is to be
                 highly recommended, either for teaching or self-study.
                 By way of comparison, it covers fewer topics and is
                 less advanced than the well known book Game Theory, by
                 M. Maschler, E. Solan, and S. Zamir. For this reason,
                 it seems ideal for a first course on Game Theory at the
                 undergraduate level. Since Game Theory, Alive assumes
                 some basic knowledge of probability theory (in addition
                 to discrete math), students should have some
                 probability theory as a background, though much of the
                 book is still very accessible without it. This reviewer
                 would not be surprised if Game Theory, Alive becomes
                 the standard text for an introductory course on Game
                 Theory. It is very well written and fun to read. The
                 numerous figures, cartoons (see, e.g., Figure 6 on page
                 xxi), photos, anecdotes, and especially, the historical
                 summaries at the end of each chapter as well as the
                 backgrounds of the mathematicians, statisticians, and
                 economists whose results now go into Game Theory, is
                 one of the loveliest features of this book. Wikipedia
                 notwithstanding, we often don't learn enough about the
                 'players' themselves, their history and/or the
                 evolution of how a result came into being (at least in
                 this reviewer's primary field of study, which is not
                 game theory or even probability theory), and this book
                 very nicely bucks that trend. The most important caveat
                 I should state here is that I am not myself in game
                 theory or combinatorics, so my review of this book
                 cannot be as deep as that of a practitioner in either
                 of these fields. That is unfortunate, but the plus side
                 of this is that I can make the following comment: to
                 me, the most beautiful feature of this book is how
                 nicely-and yet how compactly-the authors convey
                 intuition and motivation, which is the most important
                 thing a textbook can do for someone approaching the
                 field for the first time. And to do so while at the
                 same time presenting everything
                 mathematically-definitions, theorems, proofs-is not
                 easy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miller:2018:RMD,
  author =       "Allan M. Miller",
  title =        "Review of {{\booktitle{Modern Data Science}}}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "13--16",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300155",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Modern Data Science with R (MDSR) is one of the first
                 textbooks to provide a comprehensive introduction to
                 data science for students at the undergraduate level
                 (it is also suitable for graduate students and
                 professionals in other fields). The authors follow the
                 approach taken by Garrett Grolemund and Hadley Wickham
                 in their book, R for Data Science7, and David Robinson
                 in Teach the Tidyverse to Beginners, which emphasizes
                 the teaching of data visualization and the tidyverse
                 (using dplyr and chained pipes) before covering base R,
                 along with using real-world data and modern data
                 science methods. The textbook includes end of chapter
                 exercises (an instructor's solution manual is
                 available), and a series of lab activities is also
                 under development. The result is an excellent textbook
                 that provides a solid foundation in data science for
                 students and professionals alike.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2018:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "17--27",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300156",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2018:OPCd,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "28--28",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300157",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's Open Problem Column is by Virginia
                 Vassilevska Williams. It is titled: Some Open Problems
                 in Fine-Grained Complexity.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Williams:2018:SOP,
  author =       "Virginia Vassilevska Williams",
  title =        "Some Open Problems in Fine-Grained Complexity",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "29--35",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300158",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Fine-grained complexity studies problems that are
                 ``hard'' in the following sense. Consider a
                 computational problem for which existing techniques
                 easily give an algorithm running in a(n) time for
                 inputs of size n, for some a. The algorithm is often
                 brute-force, and despite decades of research, no $
                 O(a(n) 1 - \epsilon) $ time algorithm for constant `` >
                 0 has been developed. There are many diverse examples
                 of such problems. Here are two: CNF-SAT on n variables
                 and m clauses can be solved via exhaustive search in
                 O(2nmn) time, and no $ 2 (1 - \epsilon){\rm npoly}(m;
                 n) $ time algorithm for constant '' > 0 is known. The
                 Longest Common Subsequence (LCS) problem on strings of
                 length n has a classical O(n2) time algorithm, and no
                 O(n- \in ) time algorithm for `` > 0 is known. Let's
                 call these running times the ''textbook running
                 times''. (Note that this is not well-defined but for
                 many fundamental problems such as SAT or LCS, it is
                 natural. The textbook runtime is the runtime of the
                 algorithm a bright student in an algorithms class would
                 come up with.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2018:SNOb,
  author =       "Rob van Stee",
  title =        "{SIGACT} News Online Algorithms Column 34: 2018 in
                 review",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "36--45",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300160",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column, I will discuss some papers in online
                 algorithms that appeared in 2018. It is very nice to
                 see many good papers on this topic appearing year after
                 year. I make no claim at complete coverage here, and
                 have instead made a selection. As always, if I have
                 unaccountably missed your favorite paper and you would
                 like to write about it or about any other topic in
                 online algorithms, please don't hesitate to contact
                 me!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2018:CGC,
  author =       "Adrian Dumitrescu",
  title =        "Computational Geometry Column 68",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "46--54",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300161",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column is devoted to geometric clustering and
                 covering problems in Rd. As exact solutions for these
                 problems are usually out of reach (unless d = 1), one
                 is forced to deal with approximations. Here we mostly
                 consider online algorithms, as the online setting
                 introduces additional difficulty due to uncertainty
                 about the future. One representative problem is the
                 following (so-called Unit Covering): given a set of n
                 points in Rd, cover the points by balls of unit
                 diameter, so as to minimize the number of balls used.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Arenas:2018:DTC,
  author =       "Marcelo Arenas",
  title =        "Database Theory Column Report on {PODS 2018}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "55--57",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300162",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 37th edition of the ACM SIGMOD-SIGACT-SIGAI
                 Symposium on Principles of Database Systems (PODS) took
                 place from June 11 to June 13, 2018, in Houston, Texas,
                 USA. As in previous years, the symposium was held
                 jointly with the ACM SIGMOD International Conference on
                 Management of Data (SIGMOD). PODS focuses on
                 theoretical aspects of data management systems and
                 techniques, and the co-location with SIGMOD stimulates
                 interaction between theory-oriented and system-oriented
                 research.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2018:DCCd,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 72: Annual Review 2018",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "58--59",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300163",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "As with prior December issues, this issue is devoted
                 to a review of notable events related to distributed
                 computing that occurred during the year. First,
                 congratulations to Bowen Alpern and Fred Schneider,
                 winners of the 2018 Edsger W. Dijkstra Prize in
                 Distributed Computing for their paper ``Defining
                 Liveness''! Their paper appeared in Information
                 Processing Letters in October 1985. The prize is
                 jointly sponsored by ACM and EATCS, and is given
                 alternately at PODC1 and DISC2; this year it was given
                 at PODC. This paper formally de ned liveness properties
                 of concurrent and distributed algorithms for the first
                 time and also proved that every trace property is the
                 conjunction of a safety property and a liveness
                 property. The full citation can be found at
                 http://www.podc.org/dijkstra/2018-dijkstra-prize/. I am
                 delighted to include in this column the text of the
                 remarks that Fred and Bowen gave at PODC when the award
                 was presented to them.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Schneider:2018:HCD,
  author =       "Fred Schneider",
  title =        "History and Context for Defining Liveness: Winner
                 {2018 Edsger W. Dijkstra Prize}",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "60--63",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300164",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It's great to be back at PODC. I attended this
                 conference religiously through 1992. It's interesting
                 to see what has changed but also what has not changed
                 in 25 years. And I can't think of a happier excuse to
                 be back. All of us know how gratifying it is to see
                 that our work is having impact, and that's what this
                 award signifies. To win an award that carries
                 Dijkstra's name is especially meaningful for me. As a
                 graduate student, I read and reread Dijkstra's work; it
                 changed the way I looked at systems research and the
                 research enterprise. (Bowen will o er some remarks that
                 expand on this theme.) I then had a chance to meet
                 Dijkstra when I served as teaching assistant for a
                 1-week short course he taught in Santa Cruz. That was
                 the summer following my first year as an assistant
                 professor at Cornell; my colleague David Gries had
                 gotten me the assistantship. I guess I did OK, because
                 Dijkstra and his wife Ria subsequently invited me to
                 visit their home in Nuenen (The Netherlands) for a
                 week. What a thrill. I subsequently saw Dijkstra at
                 technical meetings and socially at least once a year,
                 until he passed away. So, yes, I have many Dijkstra
                 stories to tell. Catch me after dessert for those. You
                 can read our paper ``Defining Liveness'' (it's only 5
                 pages!) if you are interested in the technical details.
                 I thought that instead I would talk about how we
                 developed those ideas and where things stand today. I'm
                 always fascinated by the history behind discoveries,
                 and I suspect that I'm not alone in enjoying this
                 ``academic gossip''.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alpern:2018:EWD,
  author =       "Bowen Alpern",
  title =        "{Edsger W. Dijkstra}: The Man Behind the Prize",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "64--65",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300165",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "It would be understatement to say that news of this
                 year's Dijkstra award came to me as a surprise. In
                 fact, it put me into a rather profound funk,
                 occasioning unsought reflection on my arguably misspent
                 adulthood. It has been some time since I have done
                 significant scientific research. So, I am quite humbled
                 to be here. I did not really know Dijkstra, but I
                 certainly knew of him. With Fred and David Gries on the
                 faculty, his influence on the Computer Science
                 Department at Cornell was substantial when I was a
                 graduate student. (I trust it still is.)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Miller:2018:SR,
  author =       "Avery Miller",
  title =        "{SIROCCO 2018} Review",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "66--82",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300166",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The International Colloquium on Structural Information
                 and Communication Complexity (SIROCCO) is devoted to
                 the study of decentralized systems consisting of
                 multiple communicating entities, with a special focus
                 on better understanding how knowledge and communication
                 affect the feasibility and efficiency of solving tasks
                 in such systems. The conference turned 25 this year,
                 and I am proud to say that I share its birthplace:
                 Ottawa, Canada (unfortunately, 11-year-old Avery did
                 not have a paper to submit to the first one). Another
                 milestone is that this was the first SIROCCO to be held
                 in Israel. The venue: a kibbutz called Ma'ale HaHamisha
                 perched high up in the Judean Hills near Jerusalem.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-David:2018:PR,
  author =       "Naama Ben-David",
  title =        "{PODC 2018} Review",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "83--88",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300167",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2018 ACM Symposium on the Principles of
                 Distributed Computing (PODC 2018) was held on July
                 23-27, at Royal Holloway, University of London, in
                 Egham, UK (see Figure 1). This venue achieved a nice
                 balance between two opposing desirable features of a
                 conference location: being remote enough to encourage
                 conference participants to attend most of the talks,
                 and being central enough to allow for enjoyable
                 tourism. Royal Holloway is only a 15 minute drive from
                 Windsor Castle (see Figure 2), and about an hour away
                 from central London. This allowed conference attendees
                 to enjoy London before and after the conference, but
                 also created a lively atmosphere in the lecture hall
                 and during breaks, as most conference attendees
                 remained in the area.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Biradavolu:2018:DR,
  author =       "Aditya Biradavolu and Saptaparni Kumar",
  title =        "{DISC 2018} Review",
  journal =      j-SIGACT,
  volume =       "49",
  number =       "4",
  pages =        "89--95",
  month =        dec,
  year =         "2018",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3300150.3300168",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:54 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 32nd International Symposium on Distributed
                 Computing, DISC 2018 was held in New Orleans, USA, from
                 October 15-19, 2018. The conference took place at the
                 Hampton Inn \& Suites New Orleans-Convention Center and
                 was organized by Costas Busch of Louisiana State
                 University. The conference included two workshops and
                 three days of main conference this year.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319629",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column we review two books, both mathematical,
                 the second containing more of an emphasis on
                 applications:",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:RNT,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Number Theory: an Introduction
                 via the Density of Primes}}, second edition}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "9--13",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319630",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There are probably at least as many different
                 approaches to number theory as there are books written
                 about it. Some broad distinctions include those taking
                 an historical versus (say) a purely modern approach,
                 with many gradations in between, or those that are
                 algebraically oriented (e.g., with an emphasis on
                 reciprocity laws, or questions that relate to algebraic
                 geometry), or still others that are more analytic. The
                 book under review is definitely in the latter category.
                 The ``message'' of the book is in the title, as primes
                 and their density are the principle concern. In
                 accordance with that theme, a highlight of the book is
                 a complete proof of the prime number theorem. However,
                 the theme and its variations are taken as springboards
                 to other important fields, including aspects of
                 algebraic number theory, as well as applications, such
                 as primality testing and cryptography.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2019:RCC,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Codes, Cryptology and Curves
                 with Computer Algebra}}}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "14--16",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319631",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Codes, cryptology and curves are widely used today for
                 secure as well as reliable communication. This book
                 aims to introduce these topics to students of computer
                 science, mathematics and physics at the masters
                 level. It also looks at the application of computer
                 algebra for solving related problems. It consists of
                 twelve chapters contributed by four authors and
                 published by Cambridge University Press. The book is
                 also available in hardback and e-book formats, the
                 price / ISBN being US\$160 / 978-0-521-81711-0, and US
                 \$52 / 978-1-108-54782-6, respectively.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2019:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "17--27",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319632",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:OPCa,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "28--34",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319633",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "There have been two polls asking theorists (and
                 others) what they thought of P vs NP and related
                 questions [5, 6]. Both were written by me (William
                 Gasarch) and appeared in the Complexity Column of
                 SIGACT News, edited by Lane A. Hemaspaandra. I have
                 conducted a third poll. The results of that poll will
                 appear in Lane's column in this issue (Volume 50,
                 Number 1, March 2019). In the article I did not give my
                 own answers [though I commented on other people's
                 answers in square brackets]. By contrast, this column
                 contains my answers about the status of P vs. NP. For
                 information on what is the status of P vs NP see Scott
                 Aaronson's article [1], Lance Fortnow's article [3], or
                 (for the layperson) Lance Fortnow's book [4].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2019:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 100",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "35--37",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319635",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This is column number 100, and Bill Gasarch has very
                 kindly made it an event! In particular, this issue's
                 column is the third of Bill Gasarch's series of polls
                 on the field's thoughts on P vs. NP (and other central
                 issues in complexity). The first two polls in the
                 series appeared as SIGACT News Complexity Theory
                 Columns 36 and 74. Warmest thanks to Bill Gasarch for
                 having undertaken the huge task of creating the poll,
                 gathering the responses, analyzing them, and writing
                 this article on what the poll reveals, and to Clyde
                 Kruskal who was Bill's magical elf on proofreading,
                 polishing, and even knocking on doors to ask people
                 what they think of P versus NP. (Psst: Bill and Clyde's
                 2019 book, ``problems with a Point: Exploring Math and
                 Computer Science'' (https://www.worldscienti
                 c.com/worldscibooks/10.1142/11261), sounds absolutely
                 fascinating!)",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:GCT,
  author =       "William I. Gasarch",
  title =        "Guest Column: The Third {P =? NP} Poll",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "38--59",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319636",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In 2001 I (innocently!) asked Lane if I could write an
                 article for his SIGACT News Complexity Theory Column
                 that would be a poll of what computer scientists (and
                 others) thought about P=?NP and related issues. It was
                 to be an objective record of subjective opinions. I
                 asked (by telegraph in those days) over 100 theorists.
                 Exactly 100 responded, which made taking percentages
                 very easy. That poll appeared in the SIGACT News
                 Complexity Theory Column in 2002 (I call it the 2002
                 poll even though people answered it in 2001). The
                 Wikipedia page on P=?NP links to it. That poll's
                 readership and popularity have exceeded my wildest
                 dreams.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2019:DCCa,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 73 {SPAA 2018} Review",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "60--60",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319637",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's column contains a review of the 2018 ACM
                 Symposium on Parallelism in Algorithms and
                 Architectures (SPAA) by Laxman Dhulipa. Laxman has
                 provided an insightful overview of the keynote lectures
                 and highlights of the contributed presentations, that I
                 hope will inspire you to track down and read the
                 papers, if you haven't done so already.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dhulipa:2019:SR,
  author =       "Laxman Dhulipa",
  title =        "{SPAA 2018} Review",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "61--64",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319638",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The 2018 ACM Symposium on Parallelism in Algorithms
                 and Architectures was held on July 1618 in Vienna,
                 Austria. The conference took place on the TU Wien
                 campus in the Engineering building, an ideal location
                 that was walking distance to central Vienna as well as
                 historic buildings like Karlskirche and St. Stephen's
                 Cathedral. Thanks to the organizers, presenters and
                 attendees for their hard work that made this conference
                 possible!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Farr:2019:UGT,
  author =       "Graham Farr",
  title =        "Using {Go} in teaching the theory of computation",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "65--78",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319639",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "With increased public interest in the ancient game of
                 Go since 2016, it is an especially good time to use it
                 in teaching. The game is an excellent source of
                 exercises in the theory of computation. We give some
                 exercises developed during our research on Go which
                 were then used when teaching this subject at Monash
                 University. These are based on One-Dimensional Go
                 (1D-Go) which uses a path graph as its board. They are
                 about determining whether or not a position is legal
                 and counting the number of legal positions. Curriculum
                 elements that may be illustrated and practised using
                 1D-Go include: regular expressions, linear recurrences,
                 proof by induction, finite automata, regular grammars,
                 context-free grammars and languages, pushdown automata,
                 and Turing machines.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Du:2019:MKK,
  author =       "Ding-Zhu Du and Jie Wang",
  title =        "In Memoriam: {Ker-I Ko} (1950--2018)",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "1",
  pages =        "79--79",
  month =        mar,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3319627.3319641",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We write to celebrate the life of a colleague and
                 friend, Ker-I Ko, who passed away peacefully from lung
                 failure on December 13, 2018 in New York, with his wife
                 and all three children by his side. His passing is a
                 great loss to the theoretical computer science
                 community.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "4--5",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351454",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column we review three accessible books about
                 difficult subjects. The second and third are in the AMS
                 Student Mathematical Library, a series I have so far
                 found to be uniformly excellent.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:RQQ,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Q is for Quantum}} by Terry
                 Rudolph}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "6--8",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351455",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This book really is written for people who know
                 NOTHING about quantum mechanics and don't know much
                 math, hence I was able to give it a fair review. Since
                 I have sometimes heard people talk about quantum
                 mechanics I could also recognize some of the
                 discussions in the book as well known controversies in
                 quantum mechanics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:RIR,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{An Introduction to Ramsey
                 Theory: Fast Functions, Infinity, and Metamathematics}}
                 by Matthew Katz and Jan Reimann}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "9--11",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351456",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This is a very important theorem since it shows that
                 Peano Arithmetic cannot do everything in Number Theory.
                 However, the statement S is not natural. Paris and
                 Harrington came up with a natural statement in Ramsey
                 Theory that is not provable in Peano Arithmetic. I have
                 always wanted a clean self-contained treatment of the
                 Paris-Harrington result and why it is not provable in
                 Peano Arithmetic. Is this book that treatment? Yes!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:RMC,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Modern Cryptography and
                 Elliptic Curves, A Beginner's Guide}} by Thomas R.
                 Shemanske}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "12--14",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351457",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The equation $ y^2 = x^3 + a x^2 + b x + c $ might
                 seem a little innocuous at first. However, studying the
                 sets of rational points $ (x; y) $ obeying this
                 equation has proven to be one of the most far-reaching
                 and fruitful areas of mathematics. For example, it led,
                 aided and abetted by much of the most powerful
                 mathematics of the past century, to Wiles' proof of
                 Fermat's Last Theorem. And furthermore, these so-called
                 ``elliptic curves'' (the terminology having little to
                 do with ellipses) are actually useful. You can factor
                 numbers with them! And send secret messages!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2019:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "15--27",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351458",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:OPCb,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "28--28",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351459",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "I invite any reader who has knowledge of some area to
                 contact me and arrange to write a column about open
                 problems in that area. That area can be (1) broad or
                 narrow or anywhere in between, and (2) really important
                 or really unimportant or anywhere in between.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2019:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 101",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "29--30",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351461",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's column brings to a close the half-year of
                 Bill in the Complexity Theorem Column. In particular,
                 the previous issue's Complexity Theory Column was Bill
                 Gasarch's third P versus NP poll, and this issue's
                 column is Bill, Erik, Jacob, and Scott's article on the
                 muffin problem. Warmest thanks to Bill, Erik, Jacob,
                 and Scott for their splendid baking! Quite naturally
                 given that their article is rich in conjectures, this
                 article is brought to you not just by the Complexity
                 Theory Column, but in fact is a joint production with
                 the Open Problems Column, the letter M, and the number
                 157 286 .",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:GCM,
  author =       "William Gasarch and Scott Huddleston and Erik Metz and
                 Jacob Prinz",
  title =        "Guest Column: The Muffin Problem",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "31--60",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351462",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "You have m muffins and s students. You want to divide
                 the muffins into pieces and give the shares to students
                 such that every student has m s muffins and the minimum
                 piece is maximized. Let f(m; s) be the minimum piece in
                 the optimal protocol. We present, by examples, several
                 methods to obtain upper and lower bounds on f(m; s).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2019:DCCb,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 74 Survey of
                 Reconfigurable Data Center Networks",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "61--61",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351463",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column consists of an overview of reconfigurable
                 data center networks and is contributed by Klaus-Tycho
                 Foerster and Stefan Schmid. After giving some
                 accessible background on how such networks came about
                 from the technological and empirical perspective, the
                 authors provide an overview of the algorithmic results
                 obtained so far for problems in this area. The
                 take-away is that the surface has only been scratched
                 and there is potential for much interesting work on
                 algorithmic foundations for reconfigurable data center
                 networks.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Foerster:2019:SRD,
  author =       "Klaus-Tycho Foerster and Stefan Schmid",
  title =        "Survey of Reconfigurable Data Center Networks:
                 Enablers, Algorithms, Complexity",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "2",
  pages =        "62--79",
  month =        jun,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3351452.3351464",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Emerging optical technologies introduce opportunities
                 to reconfigure network topologies at runtime. The
                 resulting topological flexibilities can be exploited to
                 design novel demand-aware and self-adjusting networks.
                 This paper provides an overview of the algorithmic
                 problems introduced by this technology, and surveys
                 first solutions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "4--5",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364628",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "In this column I review the following book: Handbook
                 of Graph Theory, Combinatorial Optimization, and
                 Algorithms, edited by KT Thulasiraman
                 (Editor-in-Chief), Subramanian Arumugam, Andreas
                 Brandst{\"a}dt, and Takao Nishizeki. An extensive guide
                 to an extremely important subject. Review by Frederic
                 Green.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:RHG,
  author =       "Frederic Green",
  title =        "Review of Handbook of Graph Theory, Combinatorial
                 Optimization, and Algorithms",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "6--11",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364629",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Some (admittedly controversial) models of physical
                 reality propose that it is, at the fundamental level,
                 based on a certain type of graph, called a spin-network
                 (and this among other models of physical reality based
                 on graphs). Recently, astronomers have verified that
                 the otherwise empty reaches of intergalactic space are
                 laced with wispy tendrils of hot gas that connect
                 galaxies. On a more quotidian level, the machine on
                 which I'm typing this document is constructed out of
                 components that are essentially graphs, those
                 components being connected by electrical edges forming
                 an even larger graph, and this one device in turn being
                 connected via various links to millions of other nodes
                 in a huge global graph called the internet. The notion
                 of a graph encompasses all levels of reality, from the
                 subatomic through everyday life and reaching out to the
                 cosmological scale.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2019:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "12--23",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364630",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Sign rank vs Discrepancy, Hamed Hatami, Kaave
                 Hosseini, Shachar Lovett, TR19-067. LARGE CLIQUE IS
                 HARD ON AVERAGE FOR RESOLUTION, Shuo Pang, TR19-068.
                 Bounded-depth Frege complexity of Tseitin formulas for
                 all graphs, Nicola Galesi, Dmitry Itsykson, Artur
                 Riazanov, Anastasia Sofronova, TR19-069.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:OPCc,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "24--24",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364631",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This issue's Open Problems Column is by Dana
                 Moshkovitz. It is titled: Sliding Scale Conjectures in
                 PCP. The PCP theorem has been around since 1992, but
                 some of the most fundamental questions about it are
                 still open. This column explains the questions, their
                 importance, and why we're stuck. We quote Dana's
                 column: The ``Sliding Scale Conjecture'' and related
                 conjectures capture our beliefs about the PCP theorems
                 we should aspire to, and they are the focus of this
                 column.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Moshkovitz:2019:SSC,
  author =       "Dana Moshkovitz",
  title =        "Sliding Scale Conjectures in {PCP}",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "25--33",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364632",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The PCP (i.e., Probabilistically Checkable Proofs)
                 Theorem [8, 7, 22, 5, 4] states that any mathematical
                 proof can be converted to a format that can be checked
                 by a verifier making only a constant number of queries
                 to the proof. The verifier picks the queries in a
                 randomized way and might err with low probability.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Welch:2019:DCCc,
  author =       "Jennifer L. Welch",
  title =        "Distributed Computing Column 75 The Splendors and
                 Miseries of Rounds",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "34--34",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364634",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "This column consists of a position paper by Adam Shimi
                 about the usefulness of the concept of rounds in
                 distributed algorithms. It first gives a survey of
                 different ways of modeling rounds and then provides an
                 extensive list of fascinating open questions, with
                 particular emphasis on using and extending the Heard-Of
                 model of Charron-Bost and Schiper. Many thanks to Adam
                 for his contribution!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shimi:2019:SMR,
  author =       "Adam Shimi",
  title =        "The Splendors and Miseries of Rounds",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "35--50",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364635",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Take a stroll with me through the distributed
                 computing literature: we could scour the proceedings of
                 PODC, DISC, SIROCCO, OPODIS, and more; we could explore
                 the issues of Distributed Computing; or we could skim
                 through the multitude of preprints on arXiv. Yet, I can
                 already predict that with good probability, the paper
                 we choose to read will contain the word ``round'' or
                 ``layer''. Is it a lower-bound paper? Then round
                 complexity is probably one measure of performance
                 considered. Is it a combinatorial topology paper?
                 Almost all techniques developed from application of
                 combinatorial topology assume layers of communication,
                 such that an execution can be reduced as successive
                 complexes; here again rounds are essential. Is it a
                 paper on fault-tolerance? Then some broadcasting
                 strategy to ensure decent replication probably uses
                 rounds.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2019:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 102",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "51--51",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364636",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Warmest thanks to Emanuele Viola for his fascinating
                 article, \Non-abelian Combinatorics and Communication
                 Complexity.`` And since this issue will be coming out
                 right around the start of the academic year|a natural
                 time for people to be wondering, \What might I think
                 about and look into this year?''|it is particularly
                 great that Manu has generously included in his article
                 many open problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Viola:2019:GCN,
  author =       "Emanuele Viola",
  title =        "Guest Column: Non-abelian Combinatorics and
                 Communication Complexity",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "52--74",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364637",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Finite groups provide an amazing wealth of problems of
                 interest to complexity theory. And complexity theory
                 also provides a useful viewpoint of group-theoretic
                 notions, such as what it means for a group to be ``far
                 from abelian.'' The general problem that we consider in
                 this survey is that of computing a group product g = x1
                 . x2 \ldots{} xt over a finite group G. Several variants of
                 this problem are considered in this survey and in the
                 literature, including in [KMR, Mi, BC, IL, BGKL, PRS,
                 Am, AL, Raz1, MV, Mi, GV1].",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Dumitrescu:2019:CGC,
  author =       "Adrian Dumitrescu and Minghui Jiang",
  title =        "Computational Geometry Column 69",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "75--90",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364638",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "We revisit the following problem called Maximum Empty
                 Box: Given a set S of n points inside an axis-parallel
                 box U in Rd, nd a maximum-volume axis-parallel box that
                 is contained in U but contains no points of S in its
                 interior.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mahoney:2019:DAI,
  author =       "Michael W. Mahoney",
  title =        "The Difficulties of Addressing Interdisciplinary
                 Challenges at the Foundations of Data Science",
  journal =      j-SIGACT,
  volume =       "50",
  number =       "3",
  pages =        "91--95",
  month =        sep,
  year =         "2019",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3364626.3364640",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Tue Oct 22 09:39:55 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "The Transdisciplinary Research in Principles of Data
                 Science (TRIPODS) program is an effort funded by the
                 National Science Foundation (NSF) to establish the
                 foundations of data science. It aims to unite the
                 statistics, mathematics, and theoretical computer
                 science research communities (three areas central to
                 the foundations of data, hence the ``TRI'' in the name)
                 to build the theoretical foundations that will enable
                 continued data-driven discovery and breakthroughs in
                 the natural and social sciences, engineering, and
                 beyond.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2019:BRC,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "4--6",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374859",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374859",
  abstract =     "In this column we review the following books: 1.
                 Factor Man, by Matt Ginsberg. A fictional account of
                 what might happen if it turns out that P=NP. Review by
                 William Gasarch. 2. Kolmogorov Complexity and
                 Algorithmic Randomness, by A. Shen, V. A. Uspensky,.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:RFM,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Factor Man}} by Matt
                 Ginsberg}",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "7--8",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374860",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374860",
  abstract =     "What would you do if you proved P=NP? If you publish
                 it you might be rich and famous: : : in a world
                 destroyed by cyber terrorists. If you don't publish it
                 someone might beat you to it. Can you make money off of
                 it? Matt Ginsberg's fictional book, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Shafei:2019:RKC,
  author =       "Hadi Shafei",
  title =        "Review of {{\booktitle{Kolmogorov Complexity and
                 Algorithmic Randomness}} by A. Shen, V. A. Uspensky,
                 and N. Vereshchagin}",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "9--13",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374861",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374861",
  abstract =     "This is a book about Kolmogorov complexity and
                 algorithmic randomness. The main idea in Kolmogorov
                 complexity, introduced by A. N. Kolmogorov and others
                 in the 1960's, is to use an algorithmic approach to
                 measure the amount of information in finite \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2019:TRC,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "14--25",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374862",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374862",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2019:OPC,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "26--30",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374863",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374863",
  abstract =     "This Issue's Column! This issue's Open Problem Column
                 is by William Gasarch and is A Problem on Linked
                 Sequences Inspired by an Oliver Roeder Column Request
                 for Columns! I invite any reader who has knowledge of
                 some area to contact me and arrange to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2019:DCC,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 76: Annual Review 2019",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "31--32",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374865",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374865",
  abstract =     "As this is the first column I am editing, I would like
                 to sincerely thank Jennifer Welch for inviting me as
                 editor, and for being extremely helpful with the
                 transition. I will do my best to maintain the very high
                 standard set for the column by her, and \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Ben-David:2019:PR,
  author =       "Naama Ben-David and Yi-Jun Chang and Michal Dory and
                 Dean Leitersdorf",
  title =        "{PODC 2019} Review",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "33--45",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374866",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374866",
  abstract =     "The 38th ACM SIGACT-SIGOPS Symposium on Principles of
                 Distributed Computing (PODC 2019) was held on July
                 29-August 2, 2019 at the Double Tree Hilton hotel in
                 Toronto, Canada. With three keynotes, over 40 accepted
                 papers, over 20 accepted brief \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Brandt:2019:SR,
  author =       "Sebastian Brandt and Manuela Fischer and Jara Uitto",
  title =        "{SIROCCO 2019} Review",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "46--47",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374867",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374867",
  abstract =     "The conference was held from July 1st to July 4th at
                 Gran Sasso Science Institute (GSSI) in the heart of
                 L'Aquila, Abruzzo, a historic city in Italy to the east
                 of Rome. First Day On the rst day, a tutorial on
                 Permissioned Blockchains took place. There, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kuznetsov:2019:RSS,
  author =       "Petr Kuznetsov",
  title =        "Review of the {Second Sankt Petersburg Summer School
                 on Practice and Theory of Distributed Computing (SPTDC
                 2019)}",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "48--55",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374868",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374868",
  abstract =     "The second Summer School on Practice and Theory of
                 Distributed Computing (SPTDC 2019) took place on July
                 8-12, 2019, in Saint-Petersburg, Russia. In addition to
                 graduate and undergraduate students from all around the
                 world, the audience featured a \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2019:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 103",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "56--56",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374869",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374869",
  abstract =     "SETH vs Approximation Warmest thanks to Aviad
                 Rubinstein and Virginia Vassilevska Williams for their
                 guest column. As you can see, it not only is excitingly
                 covering a lot of exciting work, but also is presenting
                 quite a few open issues; clearly, they \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rubinstein:2019:SVA,
  author =       "Aviad Rubinstein and Virginia Vassilevska Williams",
  title =        "{SETH} vs Approximation",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "57--76",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374870",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374870",
  abstract =     "Our story is about hardness of problems in P, but its
                 roots begin with two algorithmic approaches that have
                 been developed to cope with NP-hard problems:
                 approximation algorithms and faster-than-brute-force
                 algorithms. Approximation algorithms were \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hohne:2019:SNO,
  author =       "Felix H{\"o}hne and S{\"o}ren Schmitt and Rob van
                 Stee",
  title =        "{SIGACT} News Online Algorithms Column 35: 2019 in
                 review",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "77--92",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374871",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374871",
  abstract =     "In this column, we will discuss some papers in online
                 algorithms that appeared in 2019. As usual, we make no
                 claim at complete coverage here, and have instead made
                 a selection. If we have unaccountably missed your
                 favorite paper and you would like to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Koch:2019:DTC,
  author =       "Christoph Koch",
  title =        "Database Theory Column Report on {PODS 2019}",
  journal =      "SIGACT",
  volume =       "50",
  number =       "4",
  pages =        "93--94",
  month =        dec,
  year =         "2019",
  DOI =          "https://doi.org/10.1145/3374857.3374872",
  bibdate =      "Thu Mar 19 17:44:36 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/3374857.3374872",
  abstract =     "The 38th ACM SIGMOD-SIGACT-SIGAI Symposium on
                 Principles of Database Systems (PODS 2019) took place
                 in Amsterdam, The Netherlands, from July 1 to July 3,
                 2019, in conjunction with the 2019 ACM SIGMOD
                 International Conference on Management of Data. PODS
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2020:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388394",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388394",
  abstract =     "In this column, the reviewers review each others'
                 books!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:RWC,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{What Can Be Computed: a
                 Practical Guide to the Theory of Computation}} by John
                 MacCormick}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388395",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388395",
  abstract =     "What can be Computed is a textbook for a course that
                 covers Decidable Languages, Computable Functions,
                 Recursively Enumerable Languages, Turing Machines,
                 Reductions, Regular Languages, P, NP, and
                 NP-completeness. Since there are already many books
                 with \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{MacCormick:2020:RPP,
  author =       "John MacCormick",
  title =        "Review of Problems with a Point: Exploring Math and
                 Computer Science",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "12--14",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388396",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388396",
  abstract =     "Many readers will be familiar with the Computational
                 Complexity blog, started in 2003 by Lance Fortnow and,
                 since 2007, co-blogged by Bill Gasarch. Professor
                 Gasarch is also the first author of Problems with a
                 Point, which is based on 24 of Gasarch's \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2020:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "15--26",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388397",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388397",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:OPCa,
  author =       "William Gasarch and Aarav Bajaj",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "27--36",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388398",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388398",
  abstract =     "I invite any reader who has knowledge of an area of
                 theoretical computer science to contact me and arrange
                 to write a column about open problems in that area.
                 That area can be (1) broad or narrow or anywhere
                 in between, and (2) really important or really
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2020:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 104",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "37--37",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388400",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388400",
  abstract =     "My deepest thanks to Sabine Broda, Antonio Machiavelo,
                 Nelma Moreira, and Rogerio Reis for welcoming the year
                 2020 with their exciting tutorial,\Analytic
                 Combinatorics and Descriptional Complexity of Regular
                 Languages on Average.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Broda:2020:GCA,
  author =       "Sabine Broda and Antonio Machiavelo and Nelma Moreira
                 and Rogerio Reis",
  title =        "Guest Column: Analytic Combinatorics and Descriptional
                 Complexity of Regular Languages on Average",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "38--56",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388401",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388401",
  abstract =     "Average-case complexity results provide important
                 information about computational models and methods, as
                 worst-case scenarios usually occur for a negligible
                 amount of cases. The framework of analytic
                 combinatorics provides an elegant tool for that
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2020:DCCa,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 77 Consensus Dynamics: an
                 Overview",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "57--57",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388402",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388402",
  abstract =     "Overview. In this edition of the column, we have an
                 exciting contribution from Luca Becchetti, Andrea
                 Clementi, and Emanuele Natale, who provide an in-depth
                 algorithmic perspective on emergent complexity.
                 Roughly, this area aims to characterize non-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Becchetti:2020:CDO,
  author =       "Luca Becchetti and Andrea Clementi and Emanuele
                 Natale",
  title =        "Consensus Dynamics: an Overview",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "58--104",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388403",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388403",
  abstract =     "The term distributed system typically refers to a set
                 of entities, called nodes, connected by point-to-point
                 communication links. The set of nodes together with the
                 set of links form a network, which is usually
                 represented by a graph. The term {ldots}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Zhu:2020:CGC,
  author =       "Binhai Zhu",
  title =        "Computational Geometry Column 70: Processing
                 Persistence Diagrams as Purely Geometric Objects",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "105--117",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388404",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388404",
  abstract =     "In this column, we review the most recent results on
                 processing persistence diagrams as purely geometric
                 objects. (Yes, this is not a typo!) While persistence
                 diagrams originally come from computational topology,
                 this column will mainly focus on the \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2020:HWG,
  author =       "Li Chen",
  title =        "How to Write a Good Project Report",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "1",
  pages =        "118--119",
  month =        mar,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3388392.3388405",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3388392.3388405",
  abstract =     "This is not a template for how to format a project
                 report. This document only contains pointers and
                 suggestions for how to structure a report. We focus on
                 what materials should be included.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2020:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "4--5",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406680",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406680",
  abstract =     "In this column, we review these three books:",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:RED,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Essential Discrete Mathematics
                 for Computer Science}} by Harry Lewis and Rachel Zax}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "6--8",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406681",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406681",
  abstract =     "In this column we state a class of open problems that
                 are well known in Ramsey Theory but probably not to my
                 non-Ramsey readers. Nothing I present is original.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Yan:2020:RAN,
  author =       "Song Y. Yan",
  title =        "Review of {{\booktitle{Applied Number Theory}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "9--10",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406682",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406682",
  abstract =     "Number theory (or the theory of numbers [1]) starts
                 from elementary (not necessarily simple and easy, and
                 in fact, it is often very hard) number theory and grows
                 up with analytic number theory (including additive and
                 multiplicative number theory), \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2020:RMD,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Market Design: a Linear
                 Programming Approach to Auctions and Matching}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "11--14",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406683",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406683",
  abstract =     "Nowadays, supply has to be matched with demand for
                 various types of goods and services. For designing
                 real-world markets, the study of market design becomes
                 essential, which is the focus of this book. The book
                 comprises four parts and consists of twelve \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2020:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "15--26",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406684",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406684",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:OPCb,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "27--35",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406685",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406685",
  abstract =     "In this column we state a class of open problems that
                 are well known in Ramsey Theory but probably not to my
                 non-Ramsey readers. Nothing I present is original.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2020:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 105",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "36--37",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406687",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406687",
  abstract =     "This is being written during the COVID-19 pandemic,
                 and no one knows what things will be like even when
                 Eshan's article reaches you (psst: please skip this
                 introduction and go right to Eshan's great article
                 now!), much less this coming fall semester, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chattopadhyay:2020:GCR,
  author =       "Eshan Chattopadhyay",
  title =        "Guest Column: a Recipe for Constructing Two-Source
                 Extractors",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "38--57",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406688",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406688",
  abstract =     "Randomness is a valuable resource in computation.
                 Randomness is used to run various Monte Carlo
                 simulations of complex systems such as the stock market
                 or weather prediction systems. Various randomized
                 algorithms have been discovered that often vastly
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2020:DCCb,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 78: 60 Years of Mastering
                 Concurrent Computing through Sequential Thinking",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "58--58",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406689",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406689",
  abstract =     "Overview. In this edition of the column, we have a
                 fascinating contribution by Sergio Rajsbaum and Michel
                 Raynal, who provide an in-depth survey of how our
                 understanding of concurrency has evolved over the past
                 sixty years.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Rajsbaum:2020:YMC,
  author =       "Sergio Rajsbaum and Michel Raynal",
  title =        "60 Years of Mastering Concurrent Computing through
                 Sequential Thinking",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "2",
  pages =        "59--88",
  month =        jun,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3406678.3406690",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3406678.3406690",
  abstract =     "Modern computing systems are highly concurrent.
                 Threads run concurrently in shared-memory multi-core
                 systems, and programs run in different servers
                 communicating by sending messages to each other.
                 Concurrent programming is hard because it requires to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2020:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "5--6",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427363",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427363",
  abstract =     "In this column, we review these three books: 1. The
                 Problem With Software: Why Smart Engineers Write Bad
                 Code, by Adam Barr. Answers to a question many of us
                 have probably asked; and what we can do about it.
                 Review by Shoshana Marcus. 2. Elements of \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Marcus:2020:RPS,
  author =       "Shoshana Marcus",
  title =        "Review of {{\booktitle{The Problem With Software: Why
                 Smart Engineers Write Bad Code}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "7--9",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427364",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427364",
  abstract =     "As we become progressively more dependent on computers
                 and the software they run, the threat of bugs in
                 computer systems is more and more concerning. This book
                 begins by describing attacks of different viruses in
                 1988 and 2014 that exploited similar \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Amoretti:2020:REP,
  author =       "Michele Amoretti",
  title =        "Review of {{\booktitle{Elements of Parallel
                 Computing}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "10--13",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427365",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427365",
  abstract =     "As the title clearly states, this book is about
                 parallel computing. Modern computers are no longer
                 characterized by a single, fully sequential CPU.
                 Instead, they have one or more multicore/manycore
                 processors. The purpose of such parallel architectures
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:RTC,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Theorems of the 21st Century:
                 Volume I}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "14--19",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427366",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427366",
  abstract =     "In the movie Oh God! Book II, God (played by George
                 Burns) says: Mathematics, that was a mistake. I should
                 have made the whole thing a little easier. While I am
                 not one to argue with God, George Burns, or George
                 Burns playing God, I do not think \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2020:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "20--30",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427367",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427367",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:OPCc,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "31--31",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427368",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427368",
  abstract =     "This issue's Open Problem Column is by Scott Aaronson
                 and is on The Busy Beaver Frontier.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aaronson:2020:BBF,
  author =       "Scott Aaronson",
  title =        "The Busy Beaver Frontier",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "32--54",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427369",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427369",
  abstract =     "The Busy Beaver function, with its incomprehensibly
                 rapid growth, has captivated generations of computer
                 scientists, mathematicians, and hobbyists. In this
                 survey, I o er a personal view of the BB function 58
                 years after its introduction, emphasizing \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2020:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 106: Teaching
                 Models, Computability, and Complexity in Time of
                 {COVID-19}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "55--58",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427371",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427371",
  abstract =     "As I write this in July 2020, I have no idea what the
                 COVID-19 situation will be like when this September
                 2020 issue reaches your mailbox or your previewer. My
                 typical advice is to prove exciting theorems. But in
                 these times, all I can share are my \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Tao:2020:DTC,
  author =       "Yufei Tao",
  title =        "Database Theory Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "59--61",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427372",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427372",
  abstract =     "The 39th edition of the ACM SIGMOD-SIGACT-SIGAI
                 Symposium on Principles of Database Systems (PODS) was
                 planned to take place from June 14 to June 19, 2020, in
                 Portland, OR, USA. Due to the coronavirus pandemic, it
                 was organized instead as a virtual \ldots{}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2020:DCCc,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 79: Using Round
                 Elimination to Understand Locality",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "62--62",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427373",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427373",
  abstract =     "In this edition of the column, we have an exciting
                 contribution by Jukka Suomela, who provides an overview
                 of his recent work revisiting a key concept in the
                 theory of distributed computing: locality.
                 Specifically, the column covers Jukka's recent work
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Suomela:2020:URE,
  author =       "Jukka Suomela",
  title =        "Using Round Elimination to Understand Locality",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "3",
  pages =        "63--81",
  month =        sep,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3427361.3427374",
  bibdate =      "Thu Mar 11 06:59:29 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3427361.3427374",
  abstract =     "A key concept in the theory of distributed computing
                 is locality: if I am a node in the middle of a large
                 graph, how far do I need to see in order to pick my own
                 part of the solution? A modern, effective technique for
                 studying such questions is called \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2020:BRCd,
  author =       "Frederic Green",
  title =        "The Book Review Column1",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "4--5",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444817",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444817",
  abstract =     "The three books reviewed in this column are about
                 central ideas in algorithms, complexity, and geometry.
                 The third one brings together topics from the first two
                 by applying techniques of both property testing (the
                 subject of the first book) and \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Upadhyay:2020:RIP,
  author =       "Sarvagya Upadhyay",
  title =        "Review of {{\booktitle{Introduction To Property
                 Testing}} by Oded Goldreich}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "6--10",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444818",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444818",
  abstract =     "The area of property testing is concerned with
                 designing methods to decide whether an input object
                 possesses a certain property or not. Usually the
                 problem is described as a promise problem: either the
                 input object has the property or the input object
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Jackman:2020:RKT,
  author =       "Tim Jackman and Steve Homer",
  title =        "Review of {{\booktitle{Kernelization: Theory of
                 Parameterized Preprocessing}} by Fedor V. Fomin, Daniel
                 Lokshtanov, Saket Saurabh, and Meirav Zehavi}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "11--14",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444819",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444819",
  abstract =     "On the surface, the concept of preprocessing may not
                 seem particularly novel nor insightful. Indeed, the
                 simple idea that putting in computational effort
                 upfront may pay off in dividends of time saved later is
                 not only advice that we have received \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2020:RFC,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Forbidden Configurations in
                 Discrete Geometry}} by David Eppstein}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "15--17",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444820",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444820",
  abstract =     "In 1930, the mathematician Esther Klein observed that
                 any five points in the plane in general position (i.e.,
                 no three points forming a line) contain four points
                 forming a convex quadrilateral. This innocent-sounding
                 discovery led to major lines of \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2020:TRCd,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "18--29",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444821",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444821",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2020:OPCd,
  author =       "William Gasarch",
  title =        "Open Problems Column Edited by {William Gasarch}.
                 {This} Issue's Column!",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "30--46",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444822",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444822",
  abstract =     "In this column we state a class of open problems in
                 Ramsey Theory. The general theme is to take Ramsey-type
                 statements that are false and weaken them by allowing
                 the homogeneous set to use more than one color. This
                 concept is not new, and the theorems we \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2020:SNCd,
  author =       "Lane A. Hemaspaandra",
  title =        "{SIGACT} News Complexity Theory Column 107",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "47--47",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444824",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444824",
  abstract =     "Warmest thanks to Mark Bun and Justin Thaler for their
                 terrific article, \booktitle{Approximate Degree in
                 Classical and Quantum Computing}. And, amazingly, they
                 made the time to craft it during a time of worldwide
                 pandemic| wow!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bun:2020:GCA,
  author =       "Mark Bun and Justin Thaler",
  title =        "Guest Column: Approximate Degree in Classical and
                 Quantum Computing",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "48--72",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444825",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444825",
  abstract =     "The approximate degree of a Boolean function f
                 captures how well f can be approximated pointwise by
                 low-degree polynomials. This article surveys what we
                 know about approximate degree and illustrates some of
                 its applications in theoretical computer \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2020:DCCd,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 80: Annual Review 2020",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "73--74",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444826",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444826",
  abstract =     "This has been a very difficult year from several
                 points of view, so it is great to see that our
                 community has stayed resilient in spite of these
                 challenges. In particular, the committees and
                 organizers of our community's meetings have braved the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Baig:2020:PR,
  author =       "Ahad Mirza Baig and Alkida Balliu and Peter Davies and
                 Michal Dory",
  title =        "{PODC 2020} Review",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "75--81",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444827",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444827",
  abstract =     "Rachid Guerraoui was the rst keynote speaker, and he
                 got things o to a great start by discussing the broad
                 relevance of the research done in our community
                 relative to both industry and academia. He rst argued
                 that, in some sense, the fact that \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aksenov:2020:RTS,
  author =       "Vitaly Aksenov and Petr Kuznetsov",
  title =        "Review of the {{\booktitle{Third Summer School on the
                 Practice and Theory of Distributed Computing SPTDC
                 2020}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "82--84",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444828",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444828",
  abstract =     "The third edition of the Summer School on Practice and
                 Theory of Distributed Computing (SPTDC 2020) took place
                 on July 6-9, 2020. Because of the ongoing pandemic, the
                 school was held in a virtual format. Following the
                 strategy of the rst and the second \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Aksenov:2020:RHC,
  author =       "Vitaly Aksenov and Alexey Fyodorov",
  title =        "Review of the {{\booktitle{Hydra Conference on
                 Concurrent and Distributed Computing Hydra 2020}}}",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "85--88",
  month =        dec,
  year =         "2020",
  DOI =          "https://doi.org/10.1145/3444815.3444829",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444829",
  abstract =     "Hydra is a premier Russian conference on Concurrent
                 and Distributed Computing (https:// hydraconf.com). It
                 is a one-of-a-kind conference, whose goal is to bring
                 together people from academia and industry. At the same
                 time, it is a forum for academics to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hohne:2020:SNO,
  author =       "Felix H{\"o}hne and S{\"o}ren Schmitt and Rob van
                 Stee",
  title =        "{SIGACT} News Online Algorithms Column 36: 2020 in
                 review",
  journal =      j-SIGACT,
  volume =       "51",
  number =       "4",
  pages =        "89--107",
  month =        dec,
  year =         "2020",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3444815.3444830",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu Mar 11 06:59:30 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3444815.3444830",
  abstract =     "In this column, we will discuss some papers in online
                 algorithms that appeared in 2020. As usual, we make no
                 claim at complete coverage here, and have instead made
                 a selection. If we have unaccountably missed your
                 favorite paper and you would like to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:BRCa,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "7--8",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457590",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457590",
  abstract =     "In this column, we review these three books: 1.
                 Algorithmic Aspects of Machine Learning, by Ankur
                 Moitra. A succinct book about theoretical aspects of
                 ML. Review by Sarvagya Upadhyay. 2. Network Flow
                 Algorithms, by David Williamson. An examination of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Upadhyay:2021:RAA,
  author =       "Sarvagya Upadhyay",
  title =        "Review of {{\booktitle{Algorithmic Aspects of Machine
                 Learning}} By Ankur Moitra}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "9--11",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457591",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457591",
  abstract =     "Over the past two decades, machine learning has seen
                 tremendous development in practice. Technological
                 advancement and increased computational resources have
                 enabled several learning algorithms to become quite
                 useful in practice. Although many families \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2021:RNF,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{Network Flow Algorithms}},
                 David P. Williamson}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "12--15",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457592",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457592",
  abstract =     "This book is on algorithms for network flows. Network
                 flow problems are optimization problems where given a
                 flow network, the aim is to construct a flow that
                 respects the capacity constraints of the edges of the
                 network, so that incoming flow equals the \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fenner:2021:RTQ,
  author =       "Stephen A. Fenner",
  title =        "Review of {{\booktitle{The Theory of Quantum
                 Information}}, John Watrous}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "16--24",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457593",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457593",
  abstract =     "This is an extremely clear, carefully written book
                 that covers the most important results in the sprawling
                 field of quantum information. It is perfect for a
                 reference, self-study, or a graduate course in quantum
                 information. It makes no attempt to be \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2021:TRCa,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "25--35",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457594",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457594",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2021:OPCa,
  author =       "William Gasarch and Erik Metz",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "36--40",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457595",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457595",
  abstract =     "I invite any reader who has knowledge of some area to
                 contact me and arrange to write a column about open
                 problems in that area. That area can be (1) broad or
                 narrow or anywhere inbetween, and (2) really important
                 or really unimportant or anywhere \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2021:SNCa,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 108",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "41--46",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457597",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457597",
  abstract =     "Warmest thanks to Rafael Pass and Muthu
                 Venkitasubramaniam for this issue's guest column,
                 ``Average-Case Complexity Through the Lens of
                 Interactive Puzzles.'' When I mentioned to them that my
                 introduction would have a section on Alan Selman's
                 passing, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pass:2021:GCA,
  author =       "R. Pass and M. Venkitasubramaniam",
  title =        "Guest Column: Average-case Complexity Through the Lens
                 of Interactive Puzzles",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "47--69",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457598",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457598",
  abstract =     "We review a study of average-case complexity through
                 the lens of interactive puzzles- interactive games
                 between a computationally bounded Challenger and
                 computationally-bounded Solver/Attacker. Most notably,
                 we use this treatment to review a recent \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2021:DCCa,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 81: {Byzantine} Agreement
                 with Less Communication: Recent Advances",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "70--70",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457599",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457599",
  abstract =     "Overview. In this edition of the column, we have an
                 exciting contribution from Shir Cohen, Idit Keidar, and
                 Oded Naor (Technion), who provide an in-depth
                 perspective on communication-efficient Byzantine
                 Agreement. With the huge popularity of blockchains,.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cohen:2021:BAL,
  author =       "Shir Cohen and Idit Keidar and Oded Naor",
  title =        "{Byzantine} Agreement with Less Communication: Recent
                 Advances",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "71--80",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457600",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457600",
  abstract =     "The development of reliable distributed systems often
                 relies on Byzantine Agreement (BA) [26]. In this
                 problem, a set of correct processes aim to reach a
                 common decision, despite the presence of malicious
                 ones. BA has been around for four decades, yet
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Chen:2021:IVR,
  author =       "Li Chen",
  title =        "Iteration vs. Recursion: Two Basic Algorithm Design
                 Methodologies",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "81--86",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457601",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457601",
  abstract =     "Iteration and recursion are two essential approaches
                 in Algorithm Design and Computer Programming. Both
                 iteration and recursion are needed for repetitive
                 processes in computing. An iterative structure is a
                 loop in which a collection of instructions and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fenner:2021:RA,
  author =       "Stephen Fenner",
  title =        "Remembrances of {Alan}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "1",
  pages =        "87--93",
  month =        mar,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3457588.3457603",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3457588.3457603",
  abstract =     "Alan L. Selman, who profoundly shaped the eld of
                 computational complexity and who supported and
                 encouraged students and colleagues in so many ways,
                 died on January 22, 2021 at the age of 79. On the pages
                 that follow are six remembrances of him and his
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:BRCb,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "4--6",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471471",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471471",
  abstract =     "From the ethereal heights of the theory of
                 computability, to the developing eras of computer
                 science, to the sometimes vexing complexities of the
                 present day.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Galinkin:2021:RFC,
  author =       "Erick Galinkin",
  title =        "Review of {{\booktitle{The Foundations of
                 Computability Theory}} (Second Edition) by Borut
                 Robic}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "7--9",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471472",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471472",
  abstract =     "Computability theory forms the foundation for much of
                 theoretical computer science. Many of our great
                 unsolved questions stem from the need to understand
                 what problems can even be solved. The greatest question
                 of computer science, P vs. NP, even \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2021:RIC,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Ideas that Created the Future:
                 Classic Papers of Computer Science}}, Edited by Harry
                 Lewis}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "10--17",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471473",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471473",
  abstract =     "What are the most important papers in computer
                 science? What are the most important 46 papers in
                 computer science? Yikes! Far more than 46 seem to
                 qualify. Picking out the top 46 papers in computer
                 science is the task that befallen Harry Lewis
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2021:RBB,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Blown to Bits: Your Life,
                 Liberty, and Happiness after the Digital Explosion}} by
                 Hal Abelson, Ken Ledeen, Harry Lewis, and Wendy
                 Seltzer}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "18--23",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471474",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471474",
  abstract =     "I reviewed the first edition of this book in 2009.
                 Here is a link to the entire column which includes
                 reviews of other books as well:
                 https://www.cs.umd.edu/users/gasarch/bookrev/40-1.pdf
                 If you are reading this as an online pdf you can
                 probably click \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2021:TRCb,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "24--35",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471475",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471475",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2021:HTP,
  author =       "William Gasarch",
  title =        "{Hilbert's Tenth Problem}: Refinements and Variants",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "36--44",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471476",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471476",
  abstract =     "This column is a short version of a long version of an
                 article based on a blog. What? I give the complete
                 history.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2021:SNCb,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 109",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "45--45",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471478",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471478",
  abstract =     "Warmest thanks to Alexander Knop, Shachar Lovett, Sam
                 McGuire, and Weiqiang Yuan for this issue's guest
                 column, Models of computation between decision trees
                 and communication. Their article came in early, and I
                 wrote back thanking them for being \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Knop:2021:GCM,
  author =       "A. Knop and S. Lovett and S. McGuire and W. Yuan",
  title =        "Guest Column: Models of computation between decision
                 trees and communication",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "46--70",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471479",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471479",
  abstract =     "Communication complexity studies the amount of
                 communication necessary to compute a function whose
                 value depends on information distributed among several
                 entities. Yao [Yao79] initiated the study of
                 communication complexity more than 40 years ago, and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{vanStee:2021:SNO,
  author =       "Rob van Stee",
  title =        "{{\booktitle{SIGACT News}}} Online Algorithms Column
                 37",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "71--71",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471480",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471480",
  abstract =     "For this issue, Pavel Vesely has contributed a
                 wonderful overview of the ideas that were used in his
                 SODA paper on packet scheduling with Marek Chrobak,
                 Lukasz Jez and Jiri Sgall. This is a problem for which
                 a 2-competitive algorithm as well as a lower \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Vesely:2021:PSP,
  author =       "Pavel Vesel{\'y}",
  title =        "Packet Scheduling: Plans, Monotonicity, and the Golden
                 Ratio",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "72--84",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471481",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471481",
  abstract =     "Online packet scheduling with deadlines is one of the
                 fundamental models in buffer management. Recently, the
                 author together with Chrobak, Jez, and Sgall (SODA
                 2019) designed an optimal $ \varphi $-competitive
                 algorithm for this problem, where $ \varphi \approx
                 1.618$ is the \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Richards:2021:TN,
  author =       "Dana Richards",
  title =        "Teaching Nondeterminism",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "85--90",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471482",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471482",
  abstract =     "Nondeterminism is an important topic that is difficult
                 to teach. We give a plan that starts with a new
                 abstraction of nondeterminism. We present language
                 models rst and foremost. The use of pseudo-code
                 augmented by a new construct makes it easier to
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2021:DCCb,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 82 Distributed
                 Computability: a Few Results Masters Students Should
                 Know",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "91--91",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471483",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471483",
  abstract =     "Overview. In this edition of the column, we have a
                 very useful and interesting piece from Michel Raynal
                 (IRISA Rennes \& Hong Kong Polytechnic), whose goal is
                 to provide a systematic view of the computability
                 results in distributed computing which should
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Raynal:2021:DCF,
  author =       "Michel Raynal",
  title =        "Distributed Computability: a Few Results Masters
                 Students Should Know",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "2",
  pages =        "92--110",
  month =        jun,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3471469.3471484",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:52 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3471469.3471484",
  abstract =     "As today Computer Science is more and more (driven)
                 consumed by its applications, it becomes more and more
                 important to know what is and what is not computable.
                 For a long time now, this has been relatively well
                 understood in sequential computing. But \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:BRCc,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "3--5",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494658",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494658",
  abstract =     "This column, the spotlight is on complexity,
                 computational and communicational: 1. Mathematics and
                 Computation, by Avi Wigderson. A sweeping look at
                 computational complexity and adjacent fields,
                 especially how they interact with mathematics. Review
                 by \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:RMC,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Mathematics and Computation}}
                 by Avi Wigderson}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "6--10",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494659",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494659",
  abstract =     "Mathematics and computation are inextricably
                 entangled3. We couldn't do one without the other. The
                 need to calculate can be traced to early human history,
                 and mathematics developed in large part to enable
                 computation. And computation is necessary to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Cadilhac:2021:RCC,
  author =       "Michael Cadilhac",
  title =        "Review of {{\booktitle{Communication Complexity and
                 Applications}} by Anup Rao and Amir Yehudayoff}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "11--13",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494660",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494660",
  abstract =     "At its core, communication complexity is the study of
                 the amount of information two parties need to exchange
                 in order to compute a function. For instance, Alice
                 receives a string of characters, Bob receives another,
                 and they should decide whether these \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2021:TRCc,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "14--24",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494661",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494661",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2021:OPCb,
  author =       "William Gasarch",
  title =        "Open Problems Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "25--25",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494662",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494662",
  abstract =     "This issue's Open Problem Column is by Lance Fortnow
                 and its titled Worlds to Die For: Open Oracle Questions
                 for the 21st Century.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Fortnow:2021:WHO,
  author =       "Lance Fortnow",
  title =        "Worlds to Die Harder For Open Oracle Questions for the
                 21st Century",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "26--36",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494663",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494663",
  abstract =     "Most of the interesting open problems about
                 relationships between complexity classes have either
                 been resolved or have relativizable worlds in both
                 directions. We discuss some remaining open questions,
                 updating questions from a similar 1995 survey of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2021:SNCc,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 110",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "37--37",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494665",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494665",
  abstract =     "My deepest thanks to Beatrice and Carlo for their
                 fascinating article, Quantum Finite Automata: From
                 Theory to Practice. Regarding the extent to which their
                 article brings to life both parts of its
                 subtitle\ldots{} wow! And I think Section 4 is an
                 absolute \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Mereghetti:2021:GCQ,
  author =       "Carlo Mereghetti and Beatrice Palano",
  title =        "Guest Column: Quantum Finite Automata: From Theory to
                 Practice",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "38--59",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494666",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494666",
  abstract =     "Quantum computing is a prolific research area, halfway
                 between physics and computer science [27, 29, 52]. Most
                 likely, its origins may be dated back to 70's, when
                 some works on quantum information began to appear (see,
                 e.g., [34, 37]). In early 80's, \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2021:DCCc,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 83 Five Ways Not To Fool
                 Yourself: Designing Experiments for Understanding
                 Performance",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "60--60",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494667",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494667",
  abstract =     "Overview. In this edition of the column, we have a
                 very interesting and instructive contribution from Tim
                 Harris (Microsoft, Cambridge, UK), whose goal is to
                 provide a systematic overview of practical,
                 ``hands-on'' techniques for the correct performance
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Harris:2021:FWF,
  author =       "Tim Harris",
  title =        "Five Ways Not To Fool Yourself: Designing Experiments
                 for Understanding Performance",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "61--68",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494668",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494668",
  abstract =     "Performance experiments are often used to show that a
                 new system is better than an old system, and to
                 quantify how much faster it is, or how much more
                 efficient it is in the use of some resource.
                 Frequently, these experiments come toward the end of a
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Pichler:2021:DTC,
  author =       "Reinhard Pichler",
  title =        "Database Theory Column Report on {PODS 2021}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "3",
  pages =        "69--72",
  month =        sep,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3494656.3494669",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Wed Mar 2 08:34:53 MST 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3494656.3494669",
  abstract =     "The 40th edition of the ACM SIGMOD-SIGACT-SIGAI
                 Symposium on Principles of Database Systems (PODS) was
                 held from June 20 to June 25, 2021, in Xi'an, Shaanxi,
                 China. Due to the COVID-19 pandemic, it was organized
                 in hybrid mode, with a local event \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:BRC,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "3--5",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510384",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510384",
  abstract =     "The first two reviews in this column draw from the
                 ``SpringerBriefs'' series, dedicated to compact
                 summaries of cutting-edge research in a variety of
                 fields. The first is from SpringerBriefs in Physics,
                 the second from SpringerBriefs in Applied Sciences
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2021:RTL,
  author =       "Frederic Green",
  title =        "Review of {{\booktitle{Three Lectures on Complexity
                 and Black Holes}} by Leonard Susskind}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "6--10",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510385",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510385",
  abstract =     "The future prospects for anyone falling into a black
                 hole are bleak. For one thing, there is no chance
                 (according to our present state of knowledge) of ever
                 getting out again. Worse, one is facing certain
                 destruction when one meets the ``singularity'' (or
                 \ldots{})",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gassama:2021:RSC,
  author =       "Abdulai Gassama and Frederic Green",
  title =        "Review of {{\booktitle{A Short Course in Computational
                 Geometry and Topology}} by Herbert Edelsbrunner}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "11--14",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510386",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510386",
  abstract =     "Computational geometry and topology are huge branches
                 of mathematics. Focussing on concepts that lead to
                 computation is one strategy to provide a concrete
                 conceptual basis for ideas that hold in a more general
                 context. Indeed, this short book gives an \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Nagaraj:2021:RAA,
  author =       "S. V. Nagaraj",
  title =        "Review of {{\booktitle{The Age of Algorithms}} by
                 Serge Abiteboul and Gilles Dowek}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "15--17",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510387",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510387",
  abstract =     "This book is about algorithms and their enormous
                 influence on people in the current age. Algorithms are
                 precise sets of rules to solve problems. They are
                 ubiquitous and have a great effect on the lives of
                 contemporary people, primarily due to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2021:TRC,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "18--30",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510388",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510388",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Romashchenko:2021:OPK,
  author =       "Andrei Romashchenko and Alexander Shen and Marius
                 Zimand",
  title =        "27 Open Problems in {Kolmogorov} Complexity",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "31--54",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510389",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510389",
  abstract =     "This formula can be informally read as follows: the
                 $i$th message $m_i$ brings us log(1=pi) ``bits of
                 information'' (whatever this means), and appears with
                 frequency pi, so H is the expected amount of
                 information provided by one random message (one sample
                 of \ldots{})",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2021:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 111",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "55--55",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510391",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510391",
  abstract =     "This issue's complexity theory column is by Ben Lee
                 Volk on algebraic natural proofs. My warmest thanks to
                 Ben Lee for his terrific article.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Volk:2021:GCA,
  author =       "Ben Lee Volk",
  title =        "Guest Column: Algebraic Natural Proofs {Ben Lee
                 Volk}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "56--73",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510392",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510392",
  abstract =     "Algebraic Natural Proofs is a recent framework which
                 formalizes the type of reasoning used for proving most
                 lower bounds on algebraic computational models. This
                 concept is similar to and inspired by the famous
                 natural proofs notion of Razborov and \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Alistarh:2021:DCC,
  author =       "Dan Alistarh",
  title =        "Distributed Computing Column 84: Perspectives on the
                 Paper {``CCS Expressions, Finite State Processes, and
                 Three Problems of Equivalence''}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "74--75",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510393",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Bartocci:2021:PCE}.",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510393",
  abstract =     "Overview. In this column, we combine traditional
                 content for the December edition, namely a perspective
                 on the paper which received the 2021 Dijkstra Award,
                 but we also depart of from tradition, by not having our
                 traditional articles covering the PODC \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Bartocci:2021:PCE,
  author =       "Ezio Bartocci and Michael A. Bender",
  title =        "A Perspective on {``CCS Expressions, Finite State
                 Processes, and Three Problems of Equivalence''}",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "76--77",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510394",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Alistarh:2021:DCC}.",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510394",
  abstract =     "With the publication of the Kannellakis-Smolka 1983
                 PODC paper, Kanellakis and Smolka pioneered the
                 development of efficient algorithms for deciding
                 behavioral equivalence of concurrent and distributed
                 processes, especially bisimulation equivalence.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Smolka:2021:KSC,
  author =       "Scott A. Smolka",
  title =        "{Kanellakis--Smolka 1983}: a Convolution of
                 Circumstances",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "78--79",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510395",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510395",
  abstract =     "Dan Alistarh, Editor of the ``Distributed Computing''
                 SIGACT column, asked me if I might be interested in
                 publishing a written version of the perspective I gave
                 at DISC 2021 upon receiving the 2021 Dijkstra Prize for
                 the PODC 1983 paper I wrote with Paris \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hohne:2021:SNO,
  author =       "Felix Hohne and Soren Schmitt and Rob van Stee",
  title =        "{{\booktitle{SIGACT News}}} Online Algorithms Column
                 38: 2021 in review",
  journal =      j-SIGACT,
  volume =       "52",
  number =       "4",
  pages =        "80--96",
  month =        dec,
  year =         "2021",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3510382.3510396",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:47 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3510382.3510396",
  abstract =     "In this column, we will discuss some papers in online
                 algorithms that appeared in 2021. As usual, we make no
                 claim at complete coverage here, and have instead made
                 a selection. If we have unaccountably missed your
                 favorite paper and you would like to \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Green:2022:BRC,
  author =       "Frederic Green",
  title =        "The Book Review Column",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "6--8",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532739",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532739",
  abstract =     "This column consists of two reviews that only Bill
                 Gasarch could write. Well. . . I suppose it wouldn't be
                 impossible for someone else to review the first, and
                 not even less wrong to write the second, but it's a
                 treat to have an all-Gasarch program!",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2022:RTI,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{Tales of Impossibility: The
                 2000-Year Quest to Solve the Mathematical Problems of
                 Antiquity}} Author: David Richeson}",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "9--12",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532740",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532740",
  abstract =     "This book is about the 4 Greek problems of Antiquity.
                 I will state them in a way that is absolutely
                 whiggish.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Gasarch:2022:RMR,
  author =       "William Gasarch",
  title =        "Review of {{\booktitle{A Map that Reflects the
                 Territory: Essays by the LessWrong Community}} Author:
                 LessWrong}",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "13--24",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532741",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532741",
  abstract =     "LessWrong is a forum founded by Artificial
                 Intelligence Theorist Eliezer Yudkowsky and Economist
                 Robin Hanson in 2009. The stated philosophy is: We are
                 a community dedicated to improving our reasoning and
                 decision-making. We seek to hold true beliefs
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Kelley:2022:TRC,
  author =       "Dean Kelley",
  title =        "Technical Report Column",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "25--35",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532742",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532742",
  abstract =     "Welcome to the Technical Reports Column. If your
                 institution publishes technical reports that you'd like
                 to have included here, please contact me at the email
                 address above.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Grechuk:2022:SOD,
  author =       "Bogdsan Grechuk",
  title =        "On the smallest open {Diophantine} equations",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "36--57",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532743",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532743",
  abstract =     "This paper reports on the current status of the
                 project in which we order all polynomial Diophantine
                 equations by an appropriate version of ``size'', and
                 then solve the equations in that order. We list the
                 ``smallest'' equations that are currently open,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{Hemaspaandra:2022:SNC,
  author =       "Lane A. Hemaspaandra",
  title =        "{{\booktitle{SIGACT News}}} Complexity Theory Column
                 112",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "58--58",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532745",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532745",
  abstract =     "As I write this (in January), it is -7F (and -17F with
                 the wind chill factor) here in Western New York, and
                 looking at the pictures of this guest article's
                 authors, I'm thinking that (from the outdoor pictures)
                 Sweden and Switzerland are looking like \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

@Article{deRezende:2022:GCP,
  author =       "S. F. de Rezende and M. G{\"o}{\"o}s and R. Robere",
  title =        "Guest Column: Proofs, Circuits, and Communication",
  journal =      j-SIGACT,
  volume =       "53",
  number =       "1",
  pages =        "59--82",
  month =        mar,
  year =         "2022",
  CODEN =        "SIGNDM",
  DOI =          "https://doi.org/10.1145/3532737.3532746",
  ISSN =         "0163-5700 (print), 1943-5827 (electronic)",
  ISSN-L =       "0163-5700",
  bibdate =      "Thu May 26 07:15:48 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3532737.3532746",
  abstract =     "We survey lower-bound results in complexity theory
                 that have been obtained via newfound interconnections
                 between propositional proof complexity, boolean circuit
                 complexity, and query/communication complexity. We
                 advocate for the theory of total search \ldots{}",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGACT News",
  journal-URL =  "https://dl.acm.org/loi/sigact",
}

%%% ====================================================================
%%% Cross-referenced entries, sorted by citation label, so that multiple
%%% editions are kept together:
@Book{Abadi:1996:TO,
  author =       "Mart{\'\i}n Abadi and Luca Cardelli",
  title =        "A Theory of Objects",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 396",
  year =         "1996",
  ISBN =         "0-387-94775-2 (hardcover)",
  ISBN-13 =      "978-0-387-94775-4 (hardcover)",
  LCCN =         "QA76.64 .A22 1996",
  bibdate =      "Thu Mar 22 13:07:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/96017038-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Object-oriented programming (Computer science)",
}

@Book{Abelson:2008:BBY,
  author =       "Harold Abelson and Ken Ledeen and Harry R. Lewis",
  title =        "Blown to Bits: Your Life, Liberty, and Happiness After
                 the Digital Explosion",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 366",
  year =         "2008",
  ISBN =         "0-13-713559-9 (hardcover)",
  ISBN-13 =      "978-0-13-713559-2 (hardcover)",
  LCCN =         "QA76.9.C66 A245 2008",
  bibdate =      "Fri Mar 23 10:27:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computers and civilization; Information technology;
                 Technological innovations; Digital media",
}

@Book{Aceto:1992:ARP,
  author =       "Luca Aceto",
  title =        "Action Refinement in Process Algebras",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 273",
  year =         "1992",
  ISBN =         "0-521-43111-5",
  ISBN-13 =      "978-0-521-43111-8",
  LCCN =         "QA76.58 .A23 1992",
  bibdate =      "Thu Mar 22 10:58:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Thesis (Ph.D.), University of Sussex, 1990.",
  series =       "Distinguished dissertations in computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/92249890.html;
                 http://www.loc.gov/catdir/toc/cam029/92249890.html",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers);
                 Programming languages (Electronic computers);
                 Semantics",
  tableofcontents = "Preface \\
                 1. Introduction \\
                 2. A semantic theory based on atomic actions \\
                 3. Action refinement for a simple language \\
                 4. Action refinement for communicating processes \\
                 5. Full abstraction for series-parallel pomsets \\
                 6. On relating concurrency and nondeterminism \\
                 7. Conclusions \\
                 Bibliography \\
                 Index",
}

@Book{Adams:1974:LTC,
  author =       "William J. Adams",
  title =        "The Life and Times of the {Central Limit Theorem}",
  publisher =    "Kaedmon Pub. Co.",
  address =      "New York, NY, USA",
  pages =        "119 + 9",
  year =         "1974",
  ISBN =         "0-913002-00-3",
  ISBN-13 =      "978-0-913002-00-1",
  LCCN =         "QA273.67 .A3",
  bibdate =      "Thu Mar 22 12:32:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Central Limit Theorem; History",
}

@Book{Adams:2009:LTC,
  author =       "William J. Adams",
  title =        "The Life and Times of the {Central Limit Theorem}",
  volume =       "35",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  edition =      "Second",
  pages =        "xii + 195",
  year =         "2009",
  ISBN =         "0-8218-4899-2",
  ISBN-13 =      "978-0-8218-4899-9",
  LCCN =         "QA273.67 .A3 2009",
  bibdate =      "Thu Mar 22 12:32:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "History of mathematics",
  acknowledgement = ack-nhfb,
  remark =       "Originally published: New York: Kaedmon Pub. Co.,
                 1974.",
  subject =      "Central limit theorem; History",
}

@Book{Adams:2009:RCE,
  author =       "Colin Conrad Adams",
  title =        "Riot at the Calc Exam and Other Mathematically Bent
                 Stories",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xvi + 271",
  year =         "2009",
  ISBN =         "0-8218-4817-8",
  ISBN-13 =      "978-0-8218-4817-3",
  LCCN =         "QA99 .A235 2009",
  bibdate =      "Thu Mar 22 12:56:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy1001/2009009835.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Humor",
}

@Book{Adjeroh:2008:BWT,
  author =       "Donald Adjeroh and Tim Bell and Amar Mukherjee",
  title =        "The {Burrows--Wheeler} Transform: Data Compression,
                 Suffix Arrays, and Pattern Matching",
  publisher =    "Springer Science+Business Media, LLC",
  address =      "Boston, MA",
  pages =        "xxii + 351",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-0-387-78909-5",
  ISBN =         "0-387-78908-1, 0-387-78909-X",
  ISBN-13 =      "978-0-387-78908-8, 978-0-387-78909-5",
  LCCN =         "QA76.9.D33 A35 2008",
  bibdate =      "Fri Mar 23 18:07:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "Data Structures; Computer Science; Database
                 management; Information Storage and Retrieval; Data
                 structures (Computer science); Information storage and
                 retrieval systems; Data Structures, Cryptology and
                 Information Theory; datakomprimering",
}

@Book{Agarwal:1991:IDA,
  author =       "Pankaj K. Agarwal",
  title =        "Intersection and Decomposition Algorithms for Planar
                 Arrangements",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvii + 277",
  year =         "1991",
  ISBN =         "0-521-40446-0",
  ISBN-13 =      "978-0-521-40446-4",
  LCCN =         "QA167 .A33 1991",
  bibdate =      "Thu Mar 22 10:29:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam025/91155565.html;
                 http://www.loc.gov/catdir/toc/cam028/91155565.html",
  acknowledgement = ack-nhfb,
  subject =      "combinatorial geometry; geometry; data processing;
                 algorithms",
  tableofcontents = "Introduction \\
                 1. Davenport--Schinzel sequences \\
                 2. Red-blue intersection detection algorithms \\
                 3. Partitioning arrangements of lines \\
                 4. Applications of the partitioning algorithm \\
                 5. Spanning trees with low stabbing number \\
                 Bibliography \\
                 Index of symbols \\
                 Index of keywords",
}

@Book{Aigner:1998:PB,
  author =       "Martin Aigner and G{\"u}nter M. Ziegler",
  title =        "Proofs from {The Book}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 199",
  year =         "1998",
  ISBN =         "3-540-63698-6 (hardcover)",
  ISBN-13 =      "978-3-540-63698-4 (hardcover)",
  LCCN =         "QA36 .A36 1998",
  bibdate =      "Thu Mar 22 12:52:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Aigner:1999:PB,
  author =       "Martin Aigner and G{\"u}nter M. Ziegler",
  title =        "Proofs from {The Book}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second corrected printing",
  pages =        "viii + 199",
  year =         "1999",
  ISBN =         "3-540-63698-6",
  ISBN-13 =      "978-3-540-63698-4",
  LCCN =         "QA36 .A36 1999",
  bibdate =      "Thu Mar 22 12:52:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Aigner:2001:PB,
  author =       "Martin Aigner and G{\"u}nter M. Ziegler",
  title =        "Proofs from {The Book}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "viii + 215",
  year =         "2001",
  ISBN =         "3-540-67865-4",
  ISBN-13 =      "978-3-540-67865-6",
  LCCN =         "QA36 .A36 2001",
  bibdate =      "Thu Mar 22 12:52:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Aigner:2004:PB,
  author =       "Martin Aigner and G{\"u}nter M. Ziegler",
  title =        "Proofs from {The Book}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "viii + 239",
  year =         "2004",
  ISBN =         "3-540-40460-0",
  ISBN-13 =      "978-3-540-40460-6",
  LCCN =         "QA36 .A36 2004",
  bibdate =      "Thu Mar 22 12:52:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003060832-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Aigner:2007:CE,
  author =       "Martin Aigner",
  title =        "A Course in Enumeration",
  volume =       "238",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 561",
  year =         "2007",
  ISBN =         "3-540-39032-4 (hardcover)",
  ISBN-13 =      "978-3-540-39032-9 (hardcover)",
  LCCN =         "QA164.8 .A36 2007",
  bibdate =      "Thu Mar 22 12:00:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics, 0072-5285",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0825/2007928344-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial enumeration problems",
}

@Book{Aigner:2010:PB,
  author =       "Martin Aigner and G{\"u}nter M. Ziegler",
  title =        "Proofs from {The Book}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "viii + 274",
  year =         "2010",
  ISBN =         "3-642-00855-0",
  ISBN-13 =      "978-3-642-00855-9",
  LCCN =         "QA36 .A36 2010",
  bibdate =      "Thu Mar 22 12:52:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Albert:2003:TSU,
  author =       "Jim Albert",
  title =        "Teaching Statistics Using Baseball",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xi + 288",
  year =         "2003",
  ISBN =         "0-88385-727-8",
  ISBN-13 =      "978-0-88385-727-4",
  LCCN =         "QA276.18 .A44 2003",
  bibdate =      "Thu Mar 22 13:03:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Classroom resource materials",
  acknowledgement = ack-nhfb,
  subject =      "Statistics; Study and teaching; Baseball",
}

@Book{Alevras:2001:LOE,
  author =       "Dimitris Alevras and Manfred W. Padberg",
  title =        "Linear Optimization and Extensions: Problems and
                 Solutions",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 449",
  year =         "2001",
  ISBN =         "3-540-41744-3 (paperback)",
  ISBN-13 =      "978-3-540-41744-6 (paperback)",
  LCCN =         "T57.74 .A44 2001",
  bibdate =      "Fri Mar 23 11:52:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Universitext",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/2001020974-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0816/2001020974-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Linear programming; Problems, exercises, etc;
                 Mathematical optimization",
}

@Book{Allouche:2003:AST,
  author =       "Jean-Paul Allouche and Jeffrey Outlaw Shallit",
  title =        "Automatic sequences: theory, applications,
                 generalizations",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 571",
  year =         "2003",
  ISBN =         "0-521-82332-3",
  ISBN-13 =      "978-0-521-82332-6",
  LCCN =         "QA267.5.S4 A55 2003",
  bibdate =      "Fri Mar 23 10:24:14 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://www.myilibrary.com?id=43653",
  acknowledgement = ack-nhfb,
  subject =      "Sequential machine theory; Sequences (Mathematics)",
  tableofcontents = "Preface \\
                 1. Stringology \\
                 2. Number theory and algebra \\
                 3. Numeration systems \\
                 4. Finite automata and other models of computation \\
                 5. Automatic sequences \\
                 6. Uniform morphisms and automatic sequences \\
                 7. Morphic sequences \\
                 8. Frequency of letters \\
                 9. Characteristic words \\
                 10. Subwords \\
                 11. Cobham's theorem \\
                 12. Formal power series \\
                 13. Automatic real numbers \\
                 14. Multidimensional automatic sequences \\
                 15. Automaticity \\
                 16. k-regular sequences \\
                 17. Physics \\
                 A. Hints \ldots{} for selected exercises",
}

@Book{Amos:2005:TED,
  author =       "Martyn Amos",
  title =        "Theoretical and Experimental {DNA} Computation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 172",
  year =         "2005",
  ISBN =         "3-540-65773-8",
  ISBN-13 =      "978-3-540-65773-6",
  LCCN =         "QP625.N89 A56 2005",
  bibdate =      "Thu Mar 22 13:04:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn;
                 z3950.loc.gov:7090/Voyager",
  series =       "Natural computing series",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10143901;
                 http://www.loc.gov/catdir/enhancements/fy0662/2004116588-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2004116588-t.html;
                 http://www.myilibrary.com?id=30647;
                 http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-3-540-65773-6",
  acknowledgement = ack-nhfb,
  subject =      "Nucleotide sequence; Data processing; Gene mapping;
                 Automation",
  tableofcontents = "Introduction \\
                 1. DNA: The Molecule of Life \\
                 2. Theoretical Computer Science: A Primer \\
                 3. Models of Molecular Computation \\
                 4. Complexity Issues \\
                 5. Physical Implementations \\
                 6. Cellular Computing \\
                 References \\
                 Index",
}

@Book{Anderson:2006:ATM,
  author =       "James A. (James Andrew) Anderson and Thomas J. Head",
  title =        "Automata Theory with Modern Applications",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 255",
  year =         "2006",
  ISBN =         "0-521-84887-3, 0-521-61324-8 (paperback)",
  ISBN-13 =      "978-0-521-84887-9, 978-0-521-61324-8 (paperback)",
  LCCN =         "QA267 .A53 2006",
  bibdate =      "Thu Mar 22 11:39:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0618/2006281694-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0618/2006281694-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0733/2006281694-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Formal languages",
}

@Book{Antoniou:2007:POA,
  author =       "Andreas Antoniou and Wusheng Lu",
  title =        "Practical Optimization: Algorithms and Engineering
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 669",
  year =         "2007",
  ISBN =         "0-387-71106-6, 1-4419-4383-8",
  ISBN-13 =      "978-0-387-71106-5, 978-1-4419-4383-5",
  LCCN =         "QA402.5 .A68 2007",
  bibdate =      "Fri Mar 23 10:28:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10230218;
                 http://www.myilibrary.com?id=133757;
                 http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-0-387-71106-5",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical optimization",
  tableofcontents = "The Optimization Problem \\
                 Basic Principles \\
                 General Properties of Algorithms \\
                 One-Dimensional Optimization \\
                 Basic Multidimensional Gradient Methods \\
                 Conjugate-Direction Methods \\
                 Quasi-Newton Methods \\
                 Minimax Methods \\
                 Applications of Unconstrained Optimization \\
                 Fundamentals of Constrained Optimization \\
                 Linear Programming Part I: The Simplex Method \\
                 Linear Programming Part II: Interior-Point Methods \\
                 Quadratic and Convex Programming \\
                 Semidefinite and Second-Order Cone Programming \\
                 General Nonlinear Optimization Problems \\
                 Applications of Constrained Optimization",
}

@Book{Applegate:2006:TSP,
  author =       "David L. Applegate and Robert E. Bixby and Vasek
                 Chv{\'a}tal and William J. Cook",
  title =        "The Traveling Salesman Problem: a Computational
                 Study",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "ix + 593",
  year =         "2006",
  ISBN =         "1-4008-4110-0 (e-book), 0-691-12993-2 (hardcover)",
  ISBN-13 =      "978-1-4008-4110-3 (e-book), 978-0-691-12993-8
                 (hardcover)",
  LCCN =         "QA164 .A67 2006",
  bibdate =      "Fri Mar 23 17:58:41 MDT 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "Princeton series in applied mathematics",
  abstract =     "This book presents the latest findings on one of the
                 most intensely investigated subjects in computational
                 mathematics--the traveling salesman problem. It sounds
                 simple enough: given a set of cities and the cost of
                 travel between each pair of them, the problem
                 challenges you to find the cheapest route by which to
                 visit all the cities and return home to where you
                 began. Though seemingly modest, this exercise has
                 inspired studies by mathematicians, chemists, and
                 physicists. Teachers use it in the classroom. It has
                 practical applications in genetics, telecommunications,
                 and neuroscience.",
}

@Book{Apt:1991:VSC,
  author =       "Krzysztof R. Apt and E.-R. Olderog",
  title =        "Verification of Sequential and Concurrent Programs",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 441",
  year =         "1991",
  ISBN =         "0-387-97532-2 (Springer-Verlag New York Berlin
                 Heidelberg), 3-540-97532-2 (Springer-Verlag Berlin
                 Heidelberg New York)",
  ISBN-13 =      "978-0-387-97532-0 (Springer-Verlag New York Berlin
                 Heidelberg), 978-3-540-97532-8 (Springer-Verlag Berlin
                 Heidelberg New York)",
  LCCN =         "QA76.76.V47 A67 1991",
  bibdate =      "Thu Mar 22 13:11:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts and monographs in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computer software; Verification",
}

@Book{Apt:1997:VSC,
  author =       "Krzysztof R. Apt and E.-R. Olderog",
  title =        "Verification of Sequential and Concurrent Programs",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvii + 364",
  year =         "1997",
  ISBN =         "0-387-94896-1 (hardcover)",
  ISBN-13 =      "978-0-387-94896-6 (hardcover)",
  LCCN =         "QA76.76.V47 A67 1997",
  bibdate =      "Thu Mar 22 13:11:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/96029771-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/96029771-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer software; Verification",
}

@Book{Apt:2009:VSC,
  author =       "Krzysztof R. Apt and Frank S. de Boer and E.-R.
                 Olderog",
  title =        "Verification of Sequential and Concurrent Programs",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xxiii + 502",
  year =         "2009",
  ISBN =         "1-84882-744-X (hardcover)",
  ISBN-13 =      "978-1-84882-744-8 (hardcover)",
  LCCN =         "QA76.76.V47 A67 2009",
  bibdate =      "Thu Mar 22 13:11:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in computer science",
  abstract =     "This third edition provides a systematic exploration
                 of one of the most common approaches to program
                 verification, known as the assertional approach. This
                 approach is applied to deterministic and
                 nondeterministic sequential programs of varying
                 complexity, together with both parallel and distributed
                 concurrent programs.",
  acknowledgement = ack-nhfb,
  subject =      "Computer software; Verification",
}

@Book{Arora:2009:CCM,
  author =       "Sanjeev Arora and Boaz Barak",
  title =        "Computational Complexity: a Modern Approach",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxiv + 579",
  year =         "2009",
  ISBN =         "0-521-42426-7",
  ISBN-13 =      "978-0-521-42426-4",
  LCCN =         "QA267.7 .A76 2009",
  bibdate =      "Fri Mar 23 10:30:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Mathematics",
}

@Book{Attiya:1998:DCF,
  author =       "Hagit Attiya and Jennifer Welch",
  title =        "Distributed Computing: Fundamentals, Simulations and
                 Advanced Topics",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xii + 451",
  year =         "1998",
  ISBN =         "0-07-709352-6 (paperback)",
  ISBN-13 =      "978-0-07-709352-5 (paperback)",
  LCCN =         "QA76.9.D5 A77 1998",
  bibdate =      "Fri Mar 23 10:58:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing;
                 Mathematics; Distributed operating systems
                 (Computers)",
}

@Book{Attiya:2004:DCF,
  author =       "Hagit Attiya and Jennifer Welch",
  title =        "Distributed Computing: Fundamentals, Simulations, and
                 Advanced Topics",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xv + 414",
  year =         "2004",
  ISBN =         "0-471-45324-2 (hardcover)",
  ISBN-13 =      "978-0-471-45324-6 (hardcover)",
  LCCN =         "QA76.9.D5 A75 2004",
  bibdate =      "Fri Mar 23 10:56:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Wiley series on parallel and distributed computing",
  URL =          "http://www.loc.gov/catdir/bios/wiley046/2004040728.html;
                 http://www.loc.gov/catdir/description/wiley041/2004040728.html;
                 http://www.loc.gov/catdir/toc/wiley041/2004040728.html",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing",
}

@Book{Aycock:2006:CVM,
  author =       "John Daniel Aycock",
  title =        "Computer Viruses and Malware",
  volume =       "22",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 227",
  year =         "2006",
  ISBN =         "0-387-30236-0, 0-387-34188-9 (e-book)",
  ISBN-13 =      "978-0-387-30236-2, 978-0-387-34188-0 (e-book)",
  LCCN =         "QA76.76.C68 A96 2006",
  bibdate =      "Thu Mar 22 11:57:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Advances in information security",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0824/2006925091-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0824/2006925091-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer viruses; Computer networks; Security
                 measures",
}

@Book{Aycock:2011:SA,
  author =       "John Daniel Aycock",
  title =        "Spyware and Adware",
  volume =       "50",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 145",
  year =         "2011",
  ISBN =         "0-387-77740-7 , 0-387-77741-5 (e-book)",
  ISBN-13 =      "978-0-387-77740-5, 978-0-387-77741-2 (e-book)",
  LCCN =         "QA76.76.S69 A93 2011",
  bibdate =      "Tue May 7 10:53:52 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Advances in information security, 1568-2633",
  acknowledgement = ack-nhfb,
  subject =      "Spyware (Computer software); Computer security",
  tableofcontents = "Introduction \\
                 Getting there \\
                 Staying there \\
                 Keylogging \\
                 Phoning home \\
                 Advertising \\
                 Advertisement implementation \\
                 Tracking users \\
                 Conclusion",
}

@Book{Baader:1998:TRA,
  author =       "Franz Baader and Tobias Nipkow",
  title =        "Term Rewriting and All That",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 301",
  year =         "1998",
  ISBN =         "0-521-45520-0 (hardcover)",
  ISBN-13 =      "978-0-521-45520-6 (hardcover)",
  LCCN =         "QA267 .B314 1998",
  bibdate =      "Thu Mar 22 13:03:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam028/97028286.html;
                 http://www.loc.gov/catdir/toc/cam027/97028286.html",
  acknowledgement = ack-nhfb,
  subject =      "Rewriting systems (Computer science)",
}

@Book{Baase:1978:CAI,
  author =       "Sara Baase",
  title =        "Computer Algorithms: Introduction to Design and
                 Analysis",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xvii + 286",
  year =         "1978",
  ISBN =         "0-201-00327-9",
  ISBN-13 =      "978-0-201-00327-7",
  LCCN =         "QA76.6 .B25",
  bibdate =      "Fri Mar 23 07:49:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Addison-Wesley series in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Algorithms",
}

@Book{Baase:1988:CAI,
  author =       "Sara Baase",
  title =        "Computer Algorithms: Introduction to Design and
                 Analysis",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xv + 415",
  year =         "1988",
  ISBN =         "0-201-06035-3",
  ISBN-13 =      "978-0-201-06035-5",
  LCCN =         "QA76.6 .B25 1988",
  bibdate =      "Fri Mar 23 07:49:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  price =        "US\$36.95",
  series =       "Addison-Wesley series in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Algorithms",
}

@Book{Baase:2000:CAI,
  author =       "Sara Baase and Allen {Van Gelder}",
  title =        "Computer Algorithms: Introduction to Design and
                 Analysis",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Third",
  pages =        "xix + 688",
  year =         "2000",
  ISBN =         "0-201-61244-5",
  ISBN-13 =      "978-0-201-61244-8",
  LCCN =         "QA76.9.A43 B33 2000",
  bibdate =      "Fri Mar 23 07:49:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms",
  tableofcontents = "1. Analyzing Algorithms and Problems: Principles
                 and Examples. Introduction. Java as an Algorithm
                 Language. A Usable Subset of Java. Organizer Classes.
                 Java-Based Pseudocode Conventions. Mathematical
                 Background. Sets, Tuples, and Relations. Algebra and
                 Calculus Tools. Elements of Logic. Analyzing Algorithms
                 and Problems. Correctness. Amount of Work Done. Average
                 and Worst-Case Analysis. Space Usage. Simplicity.
                 Optimality. Lower Bounds and the Complexity of
                 Problems. Implementation and Programming. Classifying
                 Functions by their Asymptotic Growth Rates. Definitions
                 and Notation. How Important Is Asymptotic Order?
                 Properties of O, Theta, and Omega. The Asymptotic Order
                 of Commonly Occurring Sums. Searching an Ordered Array.
                 Some Solutions. Worst-Case Analysis of Binary Search.
                 Average-Behavior Analysis. Optimality. \\
                 2. Data Abstraction and Basic Data Structures.
                 Introduction. ADT Specifications and Design Techniques.
                 ADT Specifications. ADT Design Techniques. Elementary
                 ADTs - Lists and Trees. Recursive ADTs. The List ADT.
                 Binary Tree ADT. The Tree ADT. In-Tree ADT. Stacks and
                 Queues. Stack ADT. Queue ADT. ADTs for Dynamic Sets.
                 Priority Queue ADT. Union-Find ADT for Disjoint Sets.
                 Dictionary ADT. \\
                 3. Recursion and Induction. Introduction. Recursive
                 Procedures. Activation Frames and Recursive Procedure
                 Calls. Hints for Recursion - Method 99. Wrappers for
                 Recursive Procedures. What is a Proof? Induction
                 Proofs. Induction Proof Schema. Induction Proof on a
                 Recursive Procedure. Proving Correctness of Procedures.
                 Definitions and Terminology. Elementary Control
                 Structures. The Single-Assignment Paradigm. Procedures
                 with Loops. Correctness Proofs as a Debugging Tool.
                 Termination of Recursive Procedures. Correctness of
                 Binary Search. Recurrence Equations. Recursion Trees.
                 Divide-and-Conquer, General Case. Chip and Conquer, or
                 be Conquered. Why Recursion Trees Work (*). \\
                 4. Sorting. Introduction. Insertion Sort. The Strategy.
                 The Algorithm and Analysis. Lower Bounds on the
                 Behavior of Certain Sorting Algorithms. Divide and
                 Conquer. Quicksort. The Quicksort Strategy. The
                 Partition Subroutine. Analysis of Quicksort.
                 Improvements on the Basic Quicksort Algorithm. Merging
                 Sorted Sequences. Worst Case. Optimality of Merge.
                 Space Usage. Mergesort. Lower Bounds for Sorting by
                 Comparison of Keys. Decision Trees for Sorting
                 Algorithms. Lower Bound for Worst Case. Lower Bound for
                 Average Behavior. Heapsort. Heaps. The Heapsort
                 Strategy. FixHeap. Heap Construction. Implementation of
                 a Heap and the Heapsort Algorithm. Accelerated
                 Heapsort. Comparison of Four Sorting Methods.
                 Shellsort. The Algorithm. Analysis and Remarks. Radix
                 Sorting. Using Properties of the Keys. Radix Sort. \\
                 5. Selection and Adversary Arguments. Introduction. The
                 Selection Problem. Lower Bounds. Adversary Arguments.
                 Tournaments. Finding max and min. Finding the
                 Second-Largest Key. Introduction. The Tournament
                 Method. An Adversary Lower-Bound Argument.
                 Implementation of the Tournament Method for Finding max
                 and secondLargest. The Selection Problem. A
                 Divide-and-Conquer Approach. A Linear-Time Selection
                 Algorithm (*). Analysis of the Selection Algorithm (*).
                 A Lower Bound for Finding the Median. Designing Against
                 an Adversary. \\
                 6. Dynamic Sets and Searching. Introduction. Array
                 Doubling. Amortized Time Analysis. Red-Black Trees.
                 Binary Search Trees. Binary Tree Rotations. Red-Black
                 Tree Definitions. Size and Depth of Red-Black Trees.
                 Insertion into a Red-Black Tree. Deletion from a
                 Red-Black Tree. Hashing. Closed Address Hashing. Open
                 Address Hashing. Hash Functions. Dynamic Equivalence
                 Relations and Union-Find Programs. Dynamic Equivalence
                 Relations. Some Obvious Implementations. Union-Find
                 Programs. Weighted Union. Path Compression. Analysis of
                 wUnion and cFind (*). Applications. Priority Queues
                 with a Decrease Key Operation. The Decrease Key
                 Operation. Pairing Forests. \\
                 7. Graphs and Graph Traversals. Definitions and
                 Representations. Some Examples. Elementary Graph
                 Definitions. Graph Representations and Data Structures.
                 Traversing Graphs. Overview of Depth-First Search.
                 Overview of Breadth-First Search. Comparison of
                 Depth-First and Breadth-First Searches. Depth-First
                 Search and Recursion. Finding Connected Components with
                 Depth-First Search. Depth-First Search Trees. A
                 Generalized Depth-First Search Skeleton. Structure of
                 Depth-First Search. Directed Acyclic Graphs and
                 Topological Sort. Strongly Connected Components of a
                 Directed Graph. Definitions. A Strong Component
                 Algorithm. Analysis. Biconnected Components of an
                 Undirected Graph. Articulation Points and Biconnected
                 Components. The Bicomponent Algorithm. Analysis.
                 Generalizations. \\
                 8. Graph Optimization Problems and Greedy Algorithms.
                 Introduction. Prim's Minimum Spanning Tree Algorithm.
                 Definition and Examples of Minimum Spanning Trees. An
                 Overview of the Algorithm. Properties of Minimum
                 Spanning Trees. Correctness of Prim's MST Algorithm.
                 Managing the Fringe Efficiently with a Priority Queue.
                 Implementation. Analysis (Time and Space). Lower Bound.
                 Single-Source Shortest Paths. Background. Properties of
                 Shortest Paths. Dijkstra's Shortest-Path Algorithm.
                 Implementation. Kruskal's Minimum Spanning Tree
                 Algorithm. Analysis. \\
                 9. Transitive Closure, All-Pairs Shortest Paths. The
                 Transitive Closure of a Binary Relation. Definitions
                 and Background. Finding the Reachability Matrix by
                 Depth-First Search. Transitive Closure by Short Cuts.
                 Warshall-s Algorithm for Transitive Closure. The Basic
                 Algorithm. Warshall-s Algorithm for Bit Matrices.
                 Distances in Graphs. Computing Transitive Closure by
                 Matrix Operations. Multiplying Bit Matrices - Kronrod's
                 Algorithm. Introduction. Kronrod-s Algorithm. Lower
                 Bound (*). \\
                 10. Dynamic Programming. Introduction. Multiplying a
                 Sequence of Matrices. Constructing Optimal Binary
                 Search Trees. Separating Words into Lines. Some
                 Comments on Developing a Dynamic Programming Algorithm.
                 \\
                 11. String Matching. A Straightforward Solution. The
                 Knuth-Morris-Pratt Algorithm. Pattern Matching with
                 Finite Automata. The Knuth-Morris-Pratt Flowchart.
                 Construction of the KMP Flowchart. Analysis of the
                 Flowchart Construction. The Knuth-Morris-Pratt Scan
                 Algorithm. The Boyer-Moore Algorithm. The New Idea. And
                 the ``Old'' Idea. The Boyer-Moore Scan Algorithm.
                 Remarks. Approximate String Matching. Exercises. \\
                 12. Polynomials and Matrices. Introductory Comments.
                 Evaluating Polynomial Functions. Algorithms. Lower
                 Bounds for Polynomial Evaluation. Preprocessing of
                 Coefficients. Vector and Matrix Multiplication. Review
                 of Standard Algorithms. Winograd's Matrix
                 Multiplication. Lower Bounds for Matrix Multiplication.
                 Strassen's Matrix Multiplication. The Fast Fourier
                 Transform and Convolution (*). Introduction. The Fast
                 Fourier Transform. Convolution. Appendix: Complex
                 Numbers and Roots of Unity. \\
                 13. NP-Complete Problems. P and NP. Decision Problems.
                 Some Sample Problems. The Class P. The Class NP. The
                 Size of the Input. NP-Complete Problems. Polynomial
                 Reductions. Some Known NP-Complete Problems. What Makes
                 a Problem Hard? Optimization Problems and Decision
                 Problems. Approximation Algorithms. Bin Packing. The
                 First Fit Decreasing Strategy. Other Heuristics. The
                 Knapsack and Subset-Sum Problems. Graph Coloring. Some
                 Basic Techniques. Approximate Graph Coloring Is Hard.
                 Wigderson's Graph Coloring Algorithm. The Traveling
                 Salesperson Problem. Greedy Strategies. The Nearest
                 Neighbor Strategy. The Shortest Link Strategy. How Good
                 Are the TSP Approximation Algorithms? Computing with
                 DNA. The Problem and an Overview of the Algorithm. DNA
                 Background. Adleman's Directed Graph and the DNA
                 Algorithm. Analysis and Evaluation. \\
                 14. Parallel Algorithms. Parallelism, the PRAM, and
                 Other Models. Introduction. The PRAM. Other Models.
                 Some PRAM Algorithms. The Binary Fan-In Technique. Some
                 Easily Parallelizable Algorithms. Handling Write
                 Conflicts. Boolean or on n Bits. An Algorithm for
                 Finding Maximum in Constant Time. Merging and Sorting.
                 Introduction. Merging. Sorting. Finding Connected
                 Components. Strategy and Techniques. The Algorithm.
                 PRAM Implementation of the Algorithm. Analysis. A Lower
                 Bound for Computing a Function on n Bits. A: Java
                 Examples and Techniques. A Java ``Main Program.''
                 Library IntListLib Examples. Generic Order and the
                 ``Comparable'' Interface. Copy via the ``Clone''
                 Interface. Subclasses Extend the Capability of Their
                 Superclass.",
}

@Book{Ballard:1997:INC,
  author =       "Dana H. Ballard",
  title =        "An Introduction to Natural Computation",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxii + 307",
  year =         "1997",
  ISBN =         "0-262-02420-9 (hardcover), 0-262-52258-6 (paperback),
                 0-585-08766-0 (e-book)",
  ISBN-13 =      "978-0-262-02420-4 (hardcover), 978-0-262-52258-8
                 (paperback), 978-0-585-08766-5 (e-book)",
  LCCN =         "QP356 .B345 1997",
  bibdate =      "Thu Mar 22 11:49:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Complex Adaptive Systems",
  acknowledgement = ack-nhfb,
  subject =      "Computational Intelligence",
  tableofcontents = "Contents \\
                 Figures \\
                 Tables \\
                 Preface \\
                 Natural Computation \\
                 I. Core Concepts \\
                 Fitness \\
                 Programs \\
                 Data \\
                 Dynamics \\
                 Optimization \\
                 II. Memories \\
                 Content-Addressable Memory \\
                 Supervised Learning \\
                 Unsupervised Learning \\
                 III. Programs \\
                 Markov Models \\
                 Reinforcement Learning \\
                 IV. Systems \\
                 Genetic Algorithms \\
                 Genetic Programming \\
                 Summary \\
                 Index",
}

@Book{Bard:2009:AC,
  author =       "Gregory V. Bard",
  title =        "Algebraic Cryptanalysis",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxxiii + 356",
  year =         "2009",
  ISBN =         "0-387-88756-3, 0-387-88757-1 (e-book)",
  ISBN-13 =      "978-0-387-88756-2, 978-0-387-88757-9 (e-book)",
  LCCN =         "Z104 .B314 2009",
  bibdate =      "Thu Mar 22 11:31:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1202/2009929845-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Cryptography; Data encryption (Computer science);
                 Kryptoanalyse",
}

@Book{Barwise:1996:VCM,
  author =       "Jon Barwise and Lawrence Stuart Moss",
  title =        "Vicious Circles: On the Mathematics of Non-Wellfounded
                 Phenomena",
  volume =       "60",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "x + 390",
  year =         "1996",
  ISBN =         "1-57586-009-0 , 1-57586-008-2 (paperback)",
  ISBN-13 =      "978-1-57586-009-1, 978-1-57586-008-4 (paperback)",
  LCCN =         "QA248 .B376 1996",
  bibdate =      "Thu Mar 22 13:11:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "CSLI lecture notes",
  URL =          "http://www.loc.gov/catdir/description/cam027/96000809.html;
                 http://www.loc.gov/catdir/toc/cam023/96000809.html",
  acknowledgement = ack-nhfb,
  subject =      "Hypersets; Cycles",
}

@Book{Basin:2011:AIS,
  author =       "David Basin and Patrick Schaller and Michael
                 Schl{\"a}pfer",
  title =        "Applied information security: a hands-on approach",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 202",
  year =         "2011",
  ISBN =         "3-642-24473-4 (hardcover)",
  ISBN-13 =      "978-3-642-24473-5 (hardcover)",
  LCCN =         "QA76.9.A25 B37 2011",
  bibdate =      "Tue May 7 09:12:31 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@Book{Bauer:2010:OFC,
  editor =       "Friedrich Ludwig Bauer",
  title =        "Origins and foundations of computing: in cooperation
                 with {Heinz Nixdorf MuseumsForum}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 142",
  year =         "2010",
  ISBN =         "3-642-02991-4 (hardcover), 3-642-02992-2 (e-book)",
  ISBN-13 =      "978-3-642-02991-2 (hardcover), 978-3-642-02992-9
                 (e-book)",
  LCCN =         "QA76.17 .B38 2010",
  bibdate =      "Tue May 7 10:22:39 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; History",
}

@Book{Beck:2008:CGT,
  author =       "J{\'o}zsef Beck",
  title =        "Combinatorial games: tic-tac-toe theory",
  volume =       "114",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 732",
  year =         "2008",
  ISBN =         "0-521-46100-6 (hardcover)",
  ISBN-13 =      "978-0-521-46100-9 (hardcover)",
  LCCN =         "QA269 .B335 2008",
  bibdate =      "Tue May 7 09:19:16 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Encyclopedia of mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/toc/fy0805/2008275067.html",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Combinatorial analysis",
  tableofcontents = "Part A. Weak win and strong draw \\
                 Chapter I. Win vs. weak win \\
                 Illustration: every finite point set in the plane is a
                 weak winner \\
                 Analyzing the proof of theorem 1.1 \\
                 Examples: tic-tac-toe games \\
                 More examples: tic-tac-toe like games \\
                 Games on hypergraphs, and the combinatorial chaos \\
                 Chapter II. The main result: exact solutions for
                 infinite classes of games \\
                 Ramsey theory and clique games \\
                 Arithmetic progressions \\
                 Two-dimensional arithmetic progressions \\
                 Explaining the exact solutions: a meta-conjecture \\
                 Potentials and the Erd{\H{o}}s--Selfridge theorem \\
                 Local vs. global \\
                 Ramsey theory and hypercube tic-tac-toe \\
                 Part B. Basic potential technique: game-theoretic first
                 and second moments \\
                 Chapter III. Simple applications \\
                 Easy building via theorem 1.2 \\
                 Games beyond Ramsey theory \\
                 A generalization of Kaplansky's game \\
                 Chapter IV. Games and randomness \\
                 Discrepancy games and the variance \\
                 Biased discrepancy games: when the extension from fair
                 to biased works! \\
                 A simple illustration of ``randomness'' (I) \\
                 A simple illustration of ``randomness'' (II) \\
                 Another illustration of ``randomness'' in games \\
                 Part C. Advanced weak win: game-theoretic higher moment
                 \\
                 Chapter V. Self-improving potentials \\
                 Motivating the probabilistic approach \\
                 Game-theoretic second moment: application to the
                 picker-choose game \\
                 Weak win in the lattice games \\
                 Game-theoretic higher moments \\
                 Exact solution of the clique game (I) \\
                 More applications \\
                 Who-scores-more games \\
                 Chapter VI. What is the biased meta-conjecture, and why
                 is it so difficult? \\
                 Discrepancy games (I) \\
                 Discrepancy games (II) \\
                 Biased games (I): biased meta-conjecture \\
                 Biased games (II): sacrificing the probabilistic
                 intuition to force negativity \\
                 Biased games (III): sporadic results \\
                 Biased games (IV): more sporadic results \\
                 Part D. Advanced strong draw: game-theoretic
                 independence \\
                 Chapter VII. BigGame--SmallGame decomposition \\
                 The Hales--Jewett conjecture \\
                 Reinforcing the Erd{\H{o}}s--Selfridge technique (I)
                 \\
                 Reinforcing the Erd{\H{o}}s--Selfridge technique (II)
                 \\
                 Almost disjoint hypergraphs \\
                 Exact solution of the clique game (II)Chapter VIII.
                 Advanced decomposition \\
                 Proof of the second ugly theorem \\
                 Breaking the ``square-root barrier'' (I) \\
                 Breaking the ``square-root barrier'' (II) \\
                 Van der Waerden game and the RELARIN technique \\
                 Chapter IX. Game-theoretic lattice-numbers \\
                 Winning planes: exact solution \\
                 Winning lattices: exact solution \\
                 I-can-you-can't games \\
                 second player's moral victory \\
                 Chapter X. Conclusion \\
                 More exact solutions and more partial results \\
                 Miscellany (I) \\
                 Miscellany (II) \\
                 Concluding remarks \\
                 Appendix A: Ramsey numbers \\
                 Appendix B: Hales--Jewett theorem: Shelah's proof \\
                 Appendix C: A formal treatment of positional games \\
                 Appendix D: An informal introduction to game theory",
}

@Book{Behrends:2008:FMM,
  author =       "Ehrhard Behrends",
  title =        "Five-Minute Mathematics",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xxvii + 380",
  year =         "2008",
  ISBN =         "0-8218-4348-6",
  ISBN-13 =      "978-0-8218-4348-2",
  LCCN =         "QA93 .B4413 2008",
  bibdate =      "Thu Mar 22 12:13:04 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Popular works; Mathematical recreations",
}

@Book{Beissinger:2006:CUM,
  author =       "Janet Beissinger and Vera Pless",
  title =        "The Cryptoclub: Using Mathematics to Make and Break
                 Secret Codes",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xvi + 199",
  year =         "2006",
  ISBN =         "1-56881-223-X",
  ISBN-13 =      "978-1-56881-223-6",
  LCCN =         "QA40.5 .B45 2006",
  bibdate =      "Fri Mar 23 19:22:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip067/2006002743.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Juvenile literature; Cryptography",
}

@Book{Bella:2007:FCS,
  author =       "Giampaolo Bella",
  title =        "Formal Correctness of Security Protocols",
  volume =       "4752",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 367",
  year =         "2007",
  ISBN =         "3-540-68136-1, 3-540-68134-5",
  ISBN-13 =      "978-3-540-68136-6, 978-3-540-68134-2",
  LCCN =         "TK5105.59 .B45 2007eb",
  bibdate =      "Thu Mar 22 12:38:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Information security and cryptography",
  acknowledgement = ack-nhfb,
  subject =      "Computer networks; Security measures",
}

@Book{Benjamin:2003:PRC,
  author =       "Arthur T. Benjamin and Jennifer J. Quinn",
  title =        "Proofs That Really Count: the Art of Combinatorial
                 Proof",
  volume =       "27",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xiv + 194",
  year =         "2003",
  ISBN =         "0-88385-333-7",
  ISBN-13 =      "978-0-88385-333-7",
  LCCN =         "QA164.8 B45 2003",
  bibdate =      "Fri Mar 23 10:24:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Dolciani mathematical expositions",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial enumeration problems",
  tableofcontents = "1. Fibonacci identities \\
                 2. Lucas identities \\
                 3. Gibonacci identities \\
                 4. Linear recurrences \\
                 5. Continued fractions \\
                 6. Binomial identities \\
                 7. Alternating sign binomial identities \\
                 8. Harmonic numbers and Stirling numbers \\
                 9. Number theory \\
                 10. Advanced Fibonacci and Lucas identities",
}

@Book{Berlekamp:2000:DBG,
  author =       "Elwyn R. Berlekamp",
  title =        "The Dots-and-Boxes Game: Sophisticated Child's Play",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 131",
  year =         "2000",
  ISBN =         "1-56881-129-2 (paperback)",
  ISBN-13 =      "978-1-56881-129-1 (paperback)",
  LCCN =         "QA269 .B39 2000",
  bibdate =      "Tue May 7 11:18:45 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Dots-and-boxes (Game)",
  tableofcontents = "1: Dots-and-Boxes \\
                 An Introduction \\
                 2: Strings-and-Coins \\
                 3: Elementary Chain Counting Problems \\
                 4: Advanced Chain Counting \\
                 5: Advanced Chain Counting Problems \\
                 6: Nimber Values for Nimstring Graphs \\
                 7: Elementary Problems with Nimbers \\
                 8: More about Nimstring, Arrays, Mutations, Vines, etc
                 \\
                 9: Advanced Nimstring Problems \\
                 10: Playing Dots-and-Boxes with Very Close Scores \\
                 11: Dots-and-Boxes Problems with Close Scores \\
                 12: Unsolved Problems",
}

@Book{Berman:2005:ASP,
  author =       "Kenneth A. Berman and Jerome L. Paul",
  title =        "Algorithms: sequential, parallel, and distributed",
  publisher =    "Thomson",
  address =      "Boston, MA, USA",
  pages =        "xxix + 962",
  year =         "2005",
  ISBN =         "0-534-42057-5",
  ISBN-13 =      "978-0-534-42057-4",
  LCCN =         "QA76.9.A43 B47 2005",
  bibdate =      "Fri Mar 23 12:42:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.tufts.edu:210/INNOPAC;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer programming",
}

@Book{Best:2001:PNA,
  author =       "Eike Best and Raymond Devillers and Maciej Koutny",
  title =        "{Petri} Net Algebra",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 378",
  year =         "2001",
  ISBN =         "3-540-67398-9",
  ISBN-13 =      "978-3-540-67398-9",
  LCCN =         "QA76.58 .B48 2001",
  bibdate =      "Fri Mar 23 11:05:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/2001017045-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers); Computer
                 science; Mathematics; Petri nets",
}

@Book{Bierbrauer:2005:ICT,
  author =       "Juergen Bierbrauer",
  title =        "Introduction to Coding Theory",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xxiii + 390",
  year =         "2005",
  ISBN =         "1-58488-421-5",
  ISBN-13 =      "978-1-58488-421-7",
  LCCN =         "QA268 .B48 2004",
  bibdate =      "Thu Mar 22 11:55:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/2004049447-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory",
  tableofcontents = "1. The concept of coding \\
                 2. Binary linear codes \\
                 3. General linear codes \\
                 4. Singleton bound and Reed-Solomon codes \\
                 5. Recursive constructions I \\
                 6. Universal hashing \\
                 7. Designs and the binary Golay code \\
                 8. Shannon entropy \\
                 9. Asymptotic results \\
                 10. 3-dimensional codes, projective planes \\
                 11. Summary and outlook \\
                 12. Subfield codes and trace codes \\
                 13. Cyclic codes \\
                 14. Recursive constructions, covering radius \\
                 15. OA in statistics and computer science \\
                 16. The geometric description of codes \\
                 17. Additive codes \\
                 18. The last chapter",
}

@Book{Biggs:2008:CII,
  author =       "Norman Biggs",
  title =        "Codes: An introduction to Information Communication
                 and Cryptography",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 273",
  year =         "2008",
  ISBN =         "1-84800-273-4 (e-book), 1-84800-272-6 (paperback)",
  ISBN-13 =      "978-1-84800-273-9 (e-book), 978-1-84800-272-2
                 (paperback)",
  LCCN =         "QA268 .B496 2008eb",
  bibdate =      "Fri Mar 23 10:32:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Springer undergraduate mathematics series",
  abstract =     "This book is an integrated introduction to the
                 mathematics of coding, that is, replacing information
                 expressed in symbols, such as a natural language or a
                 sequence of bits, by another message using (possibly)
                 different symbols. There are three main reasons for
                 doing this: economy, reliability, and security, and
                 each is covered in detail. Only a modest mathematical
                 background is assumed, the mathematical theory being
                 introduced at a level that enables the basic problems
                 to be stated carefully, but without unnecessary
                 abstraction.",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography; Computer Science; IT;
                 COMPUTERS; Information Theory; Kryptologie",
  tableofcontents = "Coding and its uses \\
                 Prefix-free codes \\
                 Economical coding \\
                 Data compression \\
                 Noisy channels \\
                 The problem of reliable communication \\
                 The noisy coding theorems \\
                 Linear codes \\
                 Algebraic coding theory \\
                 Coding natural languages \\
                 The development of cryptography \\
                 Cryptography in theory and practice \\
                 The RSA cryptosystem \\
                 Cryptography and calculation \\
                 Elliptic curve cryptography",
}

@Book{Blackburn:2001:ML,
  author =       "Patrick Blackburn and Maarten de Rijke and Yde
                 Venema",
  title =        "Modal Logic",
  volume =       "53",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxii + 554",
  year =         "2001",
  ISBN =         "0-521-80200-8 (hardcover)",
  ISBN-13 =      "978-0-521-80200-0 (hardcover)",
  LCCN =         "QA9.46 .B58 2001",
  bibdate =      "Thu Mar 22 12:39:37 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam021/00054667.html;
                 http://www.loc.gov/catdir/toc/fy02/00054667.html",
  acknowledgement = ack-nhfb,
  subject =      "Modality (Logic)",
  tableofcontents = "Machine generated contents note: 1 Basic Concepts
                 \\
                 1.1 Relational Structures \\
                 1.2 Modal Languages \\
                 1.3 Models and Frames \\
                 1.4 General Frames \\
                 1.5 Modal Consequence Relations \\
                 1.6 Normal Modal Logics \\
                 1.7 Historical Overview \\
                 1.8 Summary of Chapter 1 \\
                 2 Models \\
                 2.1 Invariance Results \\
                 2.2 Bisimulations \\
                 2.3 Finite Models \\
                 2.4 The Standard Translation \\
                 2.5 Modal Saturation via Ultrafilter Extensions \\
                 2.6 Characterization and Definability \\
                 2.7 Simulation and Safety \\
                 2.8 Summary of Chapter 2 \\
                 Notes \\
                 3 Frames \\
                 3.1 Frame Definability \\
                 3.2 Frame Definability and Second-Order Logic \\
                 3.3 Definable and Undefinable Properties \\
                 3.4 Finite Frames \\
                 3.5 Automatic First-Order Correspondence \\
                 6 Sahlqvist Formulas \\
                 .7 More about Sahlqvist Formulas \\
                 2: r ii \\
                 3.8 Advanced Frame Theory \\
                 3.9 Summary of Chapter 3 \\
                 Notes \\
                 4 Completeness \\
                 4.1 Preliminaries \\
                 4.2 Canonical Models \\
                 4.3 Applications \\
                 4.4 Limitative Results \\
                 4.5 Transforming the Canonical Model \\
                 4.6 Step by Step \\
                 4.7 Rules for the Undefinable \\
                 4.8 Finitary Methods I \\
                 4.9 Finitary Methods II \\
                 4.10 Summary of Chapter 4 \\
                 Notes \\
                 5 Algebras and General Frames \\
                 5.1 Logic as Algebra \\
                 5.2 Algebraizing Modal Logic \\
                 5.3 The J{\"o}nsson--Tarski Theorem \\
                 5.4 Duality Theory \\
                 5.5 General Frames \\
                 5.6 Persistence \\
                 5.7 Summary of Chapter 5 \\
                 Notes \\
                 6 Computability and Complexity \\
                 6.1 Computing Satisfiability \\
                 6.2 Decidability via Finite Models \\
                 6.3 Decidability via Interpretations \\
                 6.4 Decidability via Quasi-models and Mosaics \\
                 6.5 Undecidability via Tiling \\
                 6.6 NP \\
                 6.7 PSPACE \\
                 6.8 EXPTIME \\
                 6.9 Summary of Chapter 6 \\
                 Notes \\
                 7 Extended Modal Logic \\
                 7.1 Logical Modalities \\
                 7.2 Since and Until \\
                 7.3 Hybrid Logic \\
                 7.4 The Guarded Fragment \\
                 - -: *: ii:: ~~~~Ii::-:1 \\
                 7.5 Multi-Dimensional Modal Logic \\
                 7.6 A Lindstr{\"o}m Theorem for Modal Logic \\
                 7.7 Summary of Chapter 7 \\
                 Notes \\
                 Appendix A: A Logical Toolkit \\
                 Appendix B: An Algebraic Toolkit \\
                 Appendix C: A Computational Toolkit \\
                 Appendix D: A Guide to the Literature \\
                 Bibliography \\
                 List of Notation \\
                 Index",
}

@Book{Blanchet-Sadri:2008:ACP,
  author =       "Francine Blanchet-Sadri",
  title =        "Algorithmic Combinatorics on Partial Words",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "385",
  year =         "2008",
  ISBN =         "1-4200-6092-9 (hardcover)",
  ISBN-13 =      "978-1-4200-6092-8 (hardcover)",
  LCCN =         "QA76.9.A43 B53 2008",
  bibdate =      "Thu Mar 22 11:33:18 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0808/2007031486-d.html;
                 http://www.loc.gov/catdir/toc/ecip0724/2007031486.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer science; Mathematics;
                 Combinatorial analysis",
}

@Book{Blanchette:2012:BPC,
  author =       "Jean-Fran{\c{c}}ois Blanchette",
  title =        "Burdens of Proof: Cryptographic Culture and Evidence
                 Law in the Age of Electronic Documents",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "276",
  year =         "2012",
  ISBN =         "0-262-01751-2 (hardcover)",
  ISBN-13 =      "978-0-262-01751-0 (hardcover)",
  LCCN =         "K2269.5 .B58 2012",
  bibdate =      "Tue May 7 10:56:16 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Electronic evidence; Data encryption (Computer
                 science); Law and legislation",
  tableofcontents = "Introduction \\
                 Communication in the presence of adversaries \\
                 On the brink of a revolution \\
                 The equivalent of a written signature \\
                 Written proof \\
                 Paper and state \\
                 The Cryptographic imagination \\
                 Epilogue",
}

@Book{Blatner:1997:JP,
  author =       "David Blatner",
  title =        "The Joy of $ \pi $",
  publisher =    pub-WALKER,
  address =      pub-WALKER:adr,
  pages =        "xiii + 129",
  year =         "1997",
  ISBN =         "0-8027-1332-7 (hardcover), 0-8027-7562-4 (paperback)",
  ISBN-13 =      "978-0-8027-1332-2 (hardcover), 978-0-8027-7562-7
                 (paperback)",
  LCCN =         "QA484 .B55 1997",
  bibdate =      "Fri Jun 17 06:26:55 MDT 2005",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.walkerbooks.com/books/catalog.php?key=4",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Pi (mathematical constant)",
}

@Book{Blum:1998:CRC,
  author =       "Lenore Blum and Felipe Cucker and Michael Shub and
                 Steve Smale",
  title =        "Complexity and Real Computation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 453",
  year =         "1998",
  ISBN =         "0-387-98281-7 (hardcover)",
  ISBN-13 =      "978-0-387-98281-6 (hardcover)",
  LCCN =         "QA76 .C5474 1998",
  bibdate =      "Thu Mar 22 11:52:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Foreword by Richard M. Karp.",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/97022859-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/97022859-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Computational complexity; Real-time
                 data processing; Computer algorithms",
}

@Book{Blum:2006:MPE,
  author =       "E. K. (Edward K.) Blum and Sergey V. Lototsky",
  title =        "Mathematics of Physics and Engineering",
  publisher =    pub-WORLD-SCI,
  address =      pub-WORLD-SCI:adr,
  pages =        "xiv + 482",
  year =         "2006",
  ISBN =         "981-256-621-X",
  ISBN-13 =      "978-981-256-621-8",
  LCCN =         "QA401 .B58 2006",
  bibdate =      "Thu Mar 22 12:37:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy0707/2006284392.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical physics; Engineering mathematics",
}

@Book{Bollobas:1985:RG,
  author =       "B{\'e}la Bollob{\'a}s",
  title =        "Random Graphs",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xvi + 447",
  year =         "1985",
  ISBN =         "0-12-111755-3 , 0-12-111756-1 (paperback)",
  ISBN-13 =      "978-0-12-111755-9, 978-0-12-111756-6 (paperback)",
  LCCN =         "QA166.17 .B66 1985",
  bibdate =      "Thu Mar 22 12:54:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Random graphs",
}

@Book{Bollobas:1998:MGT,
  author =       "B{\'e}la Bollob{\'a}s",
  title =        "Modern Graph Theory",
  volume =       "184",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 394",
  year =         "1998",
  ISBN =         "0-387-98491-7 , 0-387-98488-7 (paperback)",
  ISBN-13 =      "978-0-387-98491-9, 978-0-387-98488-9 (paperback)",
  LCCN =         "QA166 .B663 1998",
  bibdate =      "Thu Mar 22 12:40:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/98011960-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0816/98011960-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Graph theory",
}

@Book{Bollobas:2001:RG,
  author =       "B{\'e}la Bollob{\'a}s",
  title =        "Random Graphs",
  volume =       "73",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xviii + 498",
  year =         "2001",
  ISBN =         "0-521-80920-7, 0-521-79722-5 (paperback)",
  ISBN-13 =      "978-0-521-80920-7, 978-0-521-79722-1 (paperback)",
  LCCN =         "QA166.17 .B66 2001",
  bibdate =      "Thu Mar 22 12:54:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge studies in advanced mathematics",
  URL =          "http://www.loc.gov/catdir/description/cam021/00068952.html;
                 http://www.loc.gov/catdir/enhancements/fy0731/00068952-b.html;
                 http://www.loc.gov/catdir/toc/cam027/00068952.html",
  acknowledgement = ack-nhfb,
  subject =      "Random graphs",
}

@Book{Bonato:2008:CWG,
  author =       "Anthony Bonato",
  title =        "A Course on the {Web} Graph",
  volume =       "89",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xi + 184",
  year =         "2008",
  ISBN =         "0-8218-4467-9",
  ISBN-13 =      "978-0-8218-4467-0",
  LCCN =         "TK5105.888 .B667 2008",
  bibdate =      "Thu Mar 22 12:00:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate studies in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Internet; Mathematical models; Telecommunication;
                 Traffic; Representations of graphs; Information
                 visualization",
}

@Book{Borger:1997:CDP,
  author =       "Egon B{\"o}rger and Erich Gr{\"a}del and Yuri
                 Gurevich",
  title =        "The Classical Decision Problem",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 492",
  year =         "1997",
  ISBN =         "3-540-57073-X (hardcover)",
  ISBN-13 =      "978-3-540-57073-8 (hardcover)",
  LCCN =         "QA9.65 .B64 1997",
  bibdate =      "Thu Mar 22 11:46:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Perspectives in mathematical logic",
  acknowledgement = ack-nhfb,
  subject =      "Decidability (Mathematical logic)",
}

@Book{Borodin:2005:OCC,
  author =       "Allan Borodin and Ran El-Yaniv",
  title =        "Online Computation and Competitive Analysis",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 414",
  year =         "2005",
  ISBN =         "0-521-61946-7 (paperback)",
  ISBN-13 =      "978-0-521-61946-2 (paperback)",
  LCCN =         "QA76.9.A43 B67 2005",
  bibdate =      "Thu Mar 22 12:44:03 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0632/2005280521-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0632/2005280521-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computational complexity;
                 Mathematical optimization",
}

@Book{Brabazon:2006:BIA,
  author =       "Anthony Brabazon and Michael O'Neill",
  title =        "Biologically Inspired Algorithms for Financial
                 Modelling",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 275",
  year =         "2006",
  ISBN =         "3-540-26252-0 (hardcover)",
  ISBN-13 =      "978-3-540-26252-7 (hardcover)",
  LCCN =         "HG106 .B73 2006",
  bibdate =      "Thu Mar 22 11:42:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Natural computing series",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2005936099-d.html;
                 http://www.loc.gov/catdir/toc/fy0608/2005936099.html",
  acknowledgement = ack-nhfb,
  subject =      "Finance; Mathematical models",
}

@Book{Bradfield:1992:VTP,
  author =       "Julian Charles Bradfield",
  title =        "Verifying Temporal Properties of Systems",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "vi + 113",
  year =         "1992",
  ISBN =         "0-8176-3625-0 (hard), 3-7643-3625-0",
  ISBN-13 =      "978-0-8176-3625-8 (hard), 978-3-7643-3625-7",
  LCCN =         "QA76.9.A96 B73 1992",
  bibdate =      "Thu Mar 22 10:43:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in theoretical computer science",
  acknowledgement = ack-nhfb,
  subject =      "Automatic theorem proving; Petri nets; Verification
                 (Logic)",
}

@Book{Bradley:2007:CCD,
  author =       "Aaron R. Bradley and Zohar Manna",
  title =        "The Calculus of Computation: Decision Procedures with
                 Applications to Verification",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 366",
  year =         "2007",
  ISBN =         "3-540-74113-5",
  ISBN-13 =      "978-3-540-74113-8",
  LCCN =         "QA76.9.L63 B73 2007",
  bibdate =      "Fri Mar 23 18:51:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "computer science; computer software; information
                 theory; theory of computation; computation by abstract
                 devices; mathematical logic and formal languages;
                 algorithm analysis and problem complexity",
}

@Book{Brady:1977:TCS,
  author =       "J. M. Brady",
  title =        "The Theory of Computer Science: a Programming
                 Approach",
  publisher =    pub-CHAPMAN-HALL,
  address =      pub-CHAPMAN-HALL:adr,
  pages =        "xiii + 287",
  year =         "1977",
  ISBN =         "0-470-99103-8",
  ISBN-13 =      "978-0-470-99103-9",
  LCCN =         "QA76 .B697",
  bibdate =      "Fri Mar 23 21:24:36 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Machine theory; Computable
                 functions",
}

@Book{Brass:2005:RPD,
  author =       "Peter Brass and W. O. J. Moser and J{\'a}nos Pach",
  title =        "Research Problems in Discrete Geometry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 499",
  year =         "2005",
  ISBN =         "0-387-29929-7",
  ISBN-13 =      "978-0-387-29929-7",
  LCCN =         "QA640.7 .B73 2005",
  bibdate =      "Thu Mar 22 12:56:13 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy0608/2005924022.html",
  acknowledgement = ack-nhfb,
  subject =      "Discrete geometry",
}

@Book{Brass:2008:ADS,
  author =       "Peter Brass",
  title =        "Advanced Data Structures",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 456",
  year =         "2008",
  ISBN =         "0-521-88037-8 (hardcover)",
  ISBN-13 =      "978-0-521-88037-4 (hardcover)",
  LCCN =         "QA76.9.A43 B73 2008",
  bibdate =      "Thu Mar 22 11:30:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0818/2008021408.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms",
}

@Book{Braverman:2009:CJS,
  author =       "Mark Braverman and Michael Yampolsky",
  title =        "Computability of {Julia} Sets",
  volume =       "23",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 151",
  year =         "2009",
  ISBN =         "3-540-68546-4 (hardcover), 3-540-68547-2 (e-book)",
  ISBN-13 =      "978-3-540-68546-3 (hardcover), 978-3-540-68547-0
                 (e-book)",
  LCCN =         "QA614.86 .B73 2009",
  bibdate =      "Thu Mar 22 11:54:06 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  acknowledgement = ack-nhfb,
  subject =      "Julia sets; Data processing",
  tableofcontents = "1. Introduction to computability \\
                 2. Dynamics of rational mappings \\
                 3. First examples \\
                 4. Positive results \\
                 5. Negative results \\
                 6. Computability vs topology",
}

@Book{Brent:2011:MCA,
  author =       "Richard P. Brent and Paul Zimmermann",
  title =        "Modern Computer Arithmetic",
  volume =       "18",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 221",
  year =         "2011",
  ISBN =         "0-521-19469-5 (hardcover)",
  ISBN-13 =      "978-0-521-19469-3 (hardcover)",
  LCCN =         "QA76.9.C62 BRE 2011",
  bibdate =      "Sat Jan 15 12:25:22 MST 2011",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.ox.ac.uk:210/ADVANCE",
  series =       "Cambridge monographs on applied and computational
                 mathematics",
  URL =          "http://www.loria.fr/~zimmerma/mca/pub226.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer arithmetic",
  tableofcontents = "Preface / ix \\
                 Acknowledgements / xi \\
                 Notation / xiii \\
                 Integer arithmetic / 1 \\
                 1.1 Representation and notations / 1 \\
                 1.2 Addition and subtraction / 2 \\
                 1.3 Multiplication / J \\
                 i.3.1 Naive multiplication / 4 \\
                 1.3.2 Karatsuba's algorithm / 5 \\
                 1.3.3 Toom--Cook multiplication / 6 \\
                 1.3.4 Use of the fast Fourier transform (FFT) / 8 \\
                 1.3.5 Unbalanced multiplication / 8 \\
                 1.3.6 Squaring / 11 \\
                 1.3.7 Multiplication by a constant / 13 \\
                 1.4 Division / 14 \\
                 1.4.1 Naive division / 14 \\
                 1.4.2 Divisor preconditioning / 16 \\
                 1.4.3 Divide and conquer division / 18 \\
                 1.4.4 Newton's method / 21 \\
                 1.4.5 Exact division / 21 \\
                 1.4.6 Only quotient or remainder wanted / 22 \\
                 1.4.7 Division by a single word / 23 \\
                 1.4.8 Hensel's division / 24 \\
                 1.5 Roots / 25 \\
                 1.5.1 Square root / 25 \\
                 1.5.2 $k$th root / 27 \\
                 1.5.3 Exact root / 28 \\
                 1.6 Greatest common divisor / 29 \\
                 1.6.1 Naive GCD / 29 \\
                 1.6.2 Extended GCD / 32 \\
                 1.6.3 Half binary GCD, divide and conquer GCD / 33 \\
                 1.7 Base conversion / 37 \\
                 1.7.1 Quadratic algorithms / 37 \\
                 1.7.2 Subquadratic algorithms / 38 \\
                 1.8 Exercises / 39 \\
                 1.9 Notes and references / 44 \\
                 Modular arithmetic and the FFT / 47 \\
                 2.1 Representation / 47 \\
                 2.1.1 Classical representation / 47 \\
                 2.1.2 Montgomery's form / 48 \\
                 2.1.3 Residue number systems / 48 \\
                 2.1.4 MSB vs LSB algorithms / 49 \\
                 2.1.5 Link with Polynomials / 49 \\
                 2.2 Modular addition and subtraction / 50 \\
                 2.3 The Fourier transform / 50 \\
                 2.3.1 Theoretical setting / 50 \\
                 2.3.2 The fast Fourier transform / 51 \\
                 2.3.3 The Sch{\"o}nhage--Strassen algorithm / 55 \\
                 2.4 Modular multiplication / 58 \\
                 2.4.1 Barrett's algorithm / 58 \\
                 2.4.2 Montgomery's multiplication / 60 \\
                 2.4.3 McLaughlin's algorithm / 63 \\
                 2.4.4 Special moduli / 65 \\
                 2.5 Modular division and inversion / 65 \\
                 2.5.1 Several inversions at once / 61 \\
                 2.6 Modular exponentiation / 68 \\
                 2.6.1 Binary exponentiation / 70 \\
                 2.6.2 Exponentiation with a larger base / 70 \\
                 2.6.3 Sliding window and redundant representation / 72
                 \\
                 2.7 Chinese remainder theorem / 75 \\
                 2.8 Exercises / 75 \\
                 2.9 Notes and references / 77 \\
                 Floating-point arithmetic / 79 \\
                 3.1 Representation / 79 \\
                 3.1.1 Radix choice / 80 \\
                 3.1.2 Exponent range / 81 \\
                 3.1.3 Special values / 82 \\
                 3.1.4 Subnormal numbers / 82 \\
                 3.1.5 Encoding / 83 \\
                 3.1.6 Precision: local, global, operation, operand / 84
                 \\
                 3.1.7 Link to integers / 86 \\
                 3.1.8 Ziv's algorithm and error analysis / 86 \\
                 3.1.9 Rounding / 87 \\
                 3.1.10 Strategies / 90 \\
                 3.2 Addition, subtraction, comparison / 91 \\
                 3.2.1 Floating-point addition / 92 \\
                 3.2.2 Floating-point subtraction / 93 \\
                 3.3 Multiplication / 95 \\
                 3.3.1 Integer multiplication via complex FFT / 98 \\
                 3.3.2 The middle product / 99 \\
                 3.4 Reciprocal and division / 101 \\
                 3.4.1 Reciprocal / 102 \\
                 3.4.2 Division / 106 \\
                 3.5 Square root / 111 \\
                 3.5.1 Reciprocal square root / 112 \\
                 3.6 Conversion / 114 \\
                 3.6.1 Floating-point output / 115 \\
                 3.6.2 Floating-point input / 117 \\
                 3.7 Exercises / 118 \\
                 3.8 Notes and references / 120 \\
                 Elementary and special function evaluation / 125 \\
                 4.1 Introduction / 125 \\
                 4.2 Newton's method / 126 \\
                 4.2.1 Newton's method for inverse roots / 127 \\
                 4.2.2 Newton's method for reciprocals / 128 \\
                 4.2.3 Newton's method for (reciprocal) square roots /
                 129 \\
                 4.2.4 Newton's method for formal power series / 129 \\
                 4.2.5 Newton's method for functional inverses / 130 \\
                 4.2.6 Higher-order Newton-like methods / 131 \\
                 4.3 Argument reduction / 132 \\
                 4.3.1 Repeated use of a doubling formula / 134 \\
                 4.3.2 Loss of precision / 134 \\
                 4.3.3 Guard digits / 135 \\
                 4.3.4 Doubling versus tripling / 136 \\
                 4.4 Power series / 136 \\
                 4.4.1 Direct power series evaluation / 140 \\
                 4.4.2 Power series with argument reduction / 140 \\
                 4.4.3 Rectangular series splitting / 141 \\
                 4.5 Asymptotic expansions / 144 \\
                 4.6 Continued fractions / 150 \\
                 4.7 Recurrence relations / 152 \\
                 4.7.1 Evaluation of Bessel functions / 153 \\
                 4.7.2 Evaluation of Bernoulli and tangent numbers / 154
                 \\
                 4.8 Arithmetic--geometric mean / 158 \\
                 4.8.1 Elliptic integrals / 158 \\
                 4.8.2 First AGM algorithm for the logarithm / 159 \\
                 4.8.3 Theta functions / 160 \\
                 4.8.4 Second AGM algorithm for the logarithm / 162 \\
                 4.8.5 The complex AGM / 163 \\
                 4.9 Binary splitting / 163 \\
                 4.9.1 A binary splitting algorithm for sin, cos / 166
                 \\
                 4.9.2 The bit-burst algorithm / 161 \\
                 4.10 Contour integration / 169 \\
                 4.11 Exercises / 171 \\
                 4.12 Notes and references / 179 \\
                 Implementations and pointers / 185 \\
                 5.1 Software tools / 185 \\
                 5.1.1 CLN / 185 \\
                 5.1.2 GNUMP (GMP) / 185 \\
                 5.1.3 MPFQ / 186 \\
                 5.1.4 GNU MPFR / 187 \\
                 5.1.5 Other multiple-precision packages / 187 \\
                 5.1.6 Computational algebra packages / 188 \\
                 5.2 Mailing lists / 189 \\
                 5.2.1 The GMP lists / 189 \\
                 5.2.2 The MPFR list / 190 \\
                 5.3 Online documents / 190 \\
                 References / 191 \\
                 Index / 207",
}

@Book{Brualdi:2009:CAM,
  author =       "Richard A. Brualdi and Drago{\v{s}} M. Cvetkovi{\'c}",
  title =        "A Combinatorial Approach to Matrix Theory and Its
                 Applications",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xiii + 267",
  year =         "2009",
  ISBN =         "1-4200-8223-X (hardcover)",
  ISBN-13 =      "978-1-4200-8223-4 (hardcover)",
  LCCN =         "QA188 .B778 2009",
  bibdate =      "Thu Mar 22 11:49:15 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/toc/ecip0815/2008014627.html",
  acknowledgement = ack-nhfb,
  subject =      "Matrices; Combinatorial analysis",
}

@Book{Buchmann:2001:IC,
  author =       "Johannes Buchmann",
  title =        "Introduction to Cryptography",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 281",
  year =         "2001",
  ISBN =         "0-387-95034-6 (hardcover)",
  ISBN-13 =      "978-0-387-95034-1 (hardcover)",
  LCCN =         "QA268 .B83 2001",
  bibdate =      "Thu Mar 22 12:26:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
}

@Book{Buchmann:2004:IC,
  author =       "Johannes Buchmann",
  title =        "Introduction to Cryptography",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 335",
  year =         "2004",
  ISBN =         "0-387-20756-2",
  ISBN-13 =      "978-0-387-20756-8",
  LCCN =         "QA268 .B83 2004",
  bibdate =      "Thu Mar 22 12:26:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/2004041657-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2004041657-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2004041657-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
}

@Book{Buchmann:2007:BQF,
  author =       "Johannes Buchmann and Ulrich Vollmer",
  title =        "Binary Quadratic Forms: an Algorithmic Approach",
  volume =       "20",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 318",
  year =         "2007",
  ISBN =         "3-540-46367-4 (hardcover)",
  ISBN-13 =      "978-3-540-46367-2 (hardcover)",
  LCCN =         "QA243 .B9 2007",
  bibdate =      "Fri Mar 23 10:30:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10187632;
                 http://www.myilibrary.com?id=94925;
                 http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-3-540-46367-2",
  acknowledgement = ack-nhfb,
  subject =      "Forms, Binary; Forms, Quadratic",
  tableofcontents = "Binary Quadratic Forms \\
                 2 Equivalence of Forms \\
                 3 Constructing Forms \\
                 4 Forms, Bases, Points, and Lattices \\
                 5 Reduction of Positive Definite Forms \\
                 6 Reduction of Indefinite Forms \\
                 7 Multiplicative Lattices \\
                 8 Quadratic Number Fields \\
                 9 Class Groups \\
                 10 Infrastructure \\
                 11 Subexponential Algorithms \\
                 12 Cryptographic Applications \\
                 Appendix \\
                 Bibliography \\
                 References \\
                 Subject Index \\
                 Index",
}

@Book{Bundy:2005:RML,
  author =       "Alan Bundy and David Basin Dieter Hutter and Andrew
                 Ireland",
  title =        "Rippling: meta-level guidance for mathematical
                 reasoning",
  volume =       "56",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 202",
  year =         "2005",
  ISBN =         "0-521-83449-X (hardcover)",
  ISBN-13 =      "978-0-521-83449-0 (hardcover)",
  LCCN =         "QA76.9.A96 B84 2005",
  bibdate =      "Fri Mar 23 09:49:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Cambridge tracts in theoretical computer science",
  acknowledgement = ack-nhfb,
  subject =      "Automatic theorem proving; Logic, Symbolic and
                 mathematical; Logica; Redeneren",
  tableofcontents = "An introduction to rippling \\
                 Varieties of rippling \\
                 Productive use of failure \\
                 A formal account of rippling \\
                 The scope and limitations of rippling \\
                 From rippling to a general methodology",
}

@Book{Burgisser:1997:ACT,
  author =       "Peter B{\"u}rgisser and Michael Clausen and Mohammad
                 Amin Shokrollahi",
  title =        "Algebraic Complexity Theory",
  volume =       "315",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiii + 618",
  year =         "1997",
  ISBN =         "3-540-60582-7 (Berlin: hardcover)",
  ISBN-13 =      "978-3-540-60582-9 (Berlin: hardcover)",
  LCCN =         "QA267.7 .B87 1997",
  bibdate =      "Thu Mar 22 11:31:39 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Grundlehren der mathematischen Wissenschaften,
                 0072-7830",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/96029754-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/96029754-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity",
}

@Book{Buttcher:2010:IRI,
  author =       "Stefan B{\"u}ttcher and Charles L. A. Clarke and
                 Gordon V. Cormack",
  title =        "Information Retrieval: Implementing and Evaluating
                 Search Engines",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxiv + 606",
  year =         "2010",
  ISBN =         "0-262-02651-1 (hardcover)",
  ISBN-13 =      "978-0-262-02651-2 (hardcover)",
  LCCN =         "TK5105.884 .B98 2010",
  bibdate =      "Tue May 7 11:06:35 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Search engines; Programming; Information retrieval",
  tableofcontents = "I. Foundations \\
                 1. Introduction \\
                 2. Basic techniques \\
                 3. Tokens and terms \\
                 II. Indexing \\
                 4. Static inverted indices \\
                 5. Query processing \\
                 6. Index compression \\
                 7. Dynamic inverted indices \\
                 III. Retrieval and ranking \\
                 8. Probabilistic retrieval \\
                 9. Language modeling and related methods \\
                 10. Categorization and filtering \\
                 11. Fusion and metalearning \\
                 IV. Evaluation \\
                 12. Measuring effectiveness \\
                 13. Measuring efficiency \\
                 V. Applications and extensions \\
                 14. Parallel information retrieval \\
                 15. Web search \\
                 16. XML retrieval",
}

@Book{Cantone:2001:STC,
  author =       "Domenico Cantone and Eugenio Omodeo and Alberto
                 Policriti",
  title =        "Set Theory for Computing: From Decision Procedures to
                 Declarative Programming with Sets",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 409",
  year =         "2001",
  ISBN =         "0-387-95197-0",
  ISBN-13 =      "978-0-387-95197-3",
  LCCN =         "QA248 .C1945 2001",
  bibdate =      "Fri Mar 23 10:23:36 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  note =         "Foreword by Jacob T. Schwartz.",
  series =       "Monographs in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Set theory; Computable functions",
  tableofcontents = "What is Computable Set Theory?- Logical Background
                 \\
                 Axiomatic Views of Aggregates \\
                 Semantic Views of Aggregates \\
                 Sets for Problem Solving \\
                 Decision Problems and Some Solutions \\
                 Inference Techniques and Methods \\
                 Set/Hyperset Unification Algorithms \\
                 A Syllogistic Solitaire \\
                 Stratified Syllogistics \\
                 Quantitative Set Reasoning \\
                 Set Theory for Non-Classical Logics \\
                 Logic Programming with Sets \\
                 Syllogistic Tableaux",
}

@Book{Carpenter:1998:TLS,
  author =       "Bob Carpenter",
  title =        "Type-logical semantics",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxi + 575",
  year =         "1998",
  ISBN =         "0-262-03248-1 (hardcover), 0-262-53149-6 (paperback)",
  ISBN-13 =      "978-0-262-03248-3 (hardcover), 978-0-262-53149-8
                 (paperback)",
  LCCN =         "P325 .C324 1997",
  bibdate =      "Fri Mar 23 10:23:18 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Language, speech, and communication",
  URL =          "http://cognet.mit.edu/library/books/view?isbn=0262531496",
  acknowledgement = ack-nhfb,
  subject =      "semantics; semantics (philosophy); language and logic;
                 grammar, comparative and general; computational
                 linguistics; logic",
  tableofcontents = "Simply typed lambda-calculus \\
                 higher-order logic \\
                 applicative categorial grammar \\
                 the Lambek calculus \\
                 coordination and unbounded dependencies \\
                 quantifiers and scope \\
                 plurals \\
                 pronouns and dependency \\
                 modal logic \\
                 intentionality tense and aspect \\
                 Appendix: mathematical preliminaries",
}

@Book{Chaitin:1998:LMC,
  author =       "Gregory J. Chaitin",
  title =        "The Limits of Mathematics: a Course on Information
                 Theory and Limits of Formal Reasoning",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 148",
  year =         "1998",
  ISBN =         "981-3083-59-X",
  ISBN-13 =      "978-981-3083-59-2",
  LCCN =         "QA76.9.M35 C48 1998",
  bibdate =      "Thu Mar 22 12:33:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Springer series in discrete mathematics and
                 theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/97036103-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0902/97036103-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Mathematics; Information theory;
                 Reasoning",
}

@Book{Chartrand:2009:CGT,
  author =       "Gary Chartrand and Ping Zhang",
  title =        "Chromatic Graph Theory",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xiii + 483",
  year =         "2009",
  ISBN =         "1-58488-800-8 (hardcover)",
  ISBN-13 =      "978-1-58488-800-0 (hardcover)",
  LCCN =         "QA166.247 .C43 2009",
  bibdate =      "Thu Mar 22 11:45:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/toc/fy0903/2008044200.html",
  acknowledgement = ack-nhfb,
  subject =      "Graph coloring; Graph theory",
}

@Book{Chung:1998:EGH,
  author =       "Fan R. K. Chung and Paul Erd{\H{o}}s and Ronald L.
                 Graham",
  title =        "{Erd{\H{o}}s} on Graphs: His Legacy of Unsolved
                 Problems",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xiii + 142",
  year =         "1998",
  ISBN =         "1-56881-079-2",
  ISBN-13 =      "978-1-56881-079-9",
  LCCN =         "QA166 .C485 1998",
  bibdate =      "Fri Mar 23 19:04:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Graph theory",
}

@Book{Clark:1976:PMC,
  author =       "K. L. (Keith L.) Clark and Don Cowell",
  title =        "Programs, Machines, and Computation: an Introduction
                 to the Theory of Computing",
  publisher =    pub-MCGRAW-HILL,
  address =      pub-MCGRAW-HILL:adr,
  pages =        "xi + 176",
  year =         "1976",
  ISBN =         "0-07-084067-9",
  ISBN-13 =      "978-0-07-084067-6",
  LCCN =         "QA267 .C54",
  bibdate =      "Fri Mar 23 10:32:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Formal languages",
}

@Book{Clote:2002:BFC,
  author =       "Peter Clote and Evangelos Kranakis",
  title =        "{Boolean} Functions and Computation Models",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 601",
  year =         "2002",
  ISBN =         "3-540-59436-1",
  ISBN-13 =      "978-3-540-59436-9",
  LCCN =         "QA267.7 .C58 2002",
  bibdate =      "Thu Mar 22 11:42:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2001031128-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2001031128-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Algebra, Boolean",
}

@Book{Cohen:1993:CCA,
  author =       "Henri Cohen",
  title =        "A Course in Computational Algebraic Number Theory",
  volume =       "138",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 534",
  year =         "1993",
  ISBN =         "3-540-55640-0 (Springer-Verlag Berlin Heidelberg New
                 York), 0-387-55640-0 (Springer-Verlag New York Berlin
                 Heidelberg)",
  ISBN-13 =      "978-3-540-55640-4 (Springer-Verlag Berlin Heidelberg
                 New York), 978-0-387-55640-6 (Springer-Verlag New York
                 Berlin Heidelberg)",
  LCCN =         "QA247 .C55 1993",
  bibdate =      "Thu Mar 22 11:59:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Algebraic number theory; Data processing",
}

@Book{Cohen:1995:CCA,
  author =       "Henri Cohen",
  title =        "A Course in Computational Algebraic Number Theory",
  volume =       "138",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second corrected printing",
  pages =        "xxii + 534",
  year =         "1995",
  ISBN =         "3-540-55640-0 (Berlin), 0-387-55640-0 (New York)",
  ISBN-13 =      "978-3-540-55640-4 (Berlin), 978-0-387-55640-6 (New
                 York)",
  LCCN =         "QA247 .C55 1995",
  bibdate =      "Thu Mar 22 11:59:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Algebraic number theory; Data processing",
}

@Book{Cohen:1996:CCA,
  author =       "Henri Cohen",
  title =        "A Course in Computational Algebraic Number Theory",
  volume =       "138",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xx + 545",
  year =         "1996",
  ISBN =         "3-540-55640-0 (Berlin), 0-387-55640-0 (New York)",
  ISBN-13 =      "978-3-540-55640-4 (Berlin), 978-0-387-55640-6 (New
                 York)",
  LCCN =         "QA247 .C55 1996",
  bibdate =      "Thu Mar 22 11:59:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics, 0072-5285",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/96044745-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Algebraic number theory; Data processing",
}

@Book{Constable:1978:PLI,
  author =       "R. L. (Robert L.) Constable and Michael J. O'Donnell
                 and Scott D. Johnson",
  title =        "A Programming Logic: with an Introduction to the
                 {PL/CV} Verifier",
  publisher =    pub-WINTHROP-PUB,
  address =      pub-WINTHROP-PUB:adr,
  pages =        "x + 389",
  year =         "1978",
  ISBN =         "0-87626-726-6",
  ISBN-13 =      "978-0-87626-726-4",
  LCCN =         "QA76.73.P252 C66",
  bibdate =      "Thu Mar 22 12:50:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "PL/CV (Computer program language); Computer programs;
                 Testing; Logic, Symbolic and mathematical",
}

@Book{Constanda:2009:DCY,
  author =       "C. Constanda",
  title =        "Dude, Can You Count?: Stories, Challenges, and
                 Adventures in Mathematics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xviii + 294",
  year =         "2009",
  ISBN =         "1-84882-538-2",
  ISBN-13 =      "978-1-84882-538-3",
  LCCN =         "QA109 2009",
  bibdate =      "Fri Mar 23 18:58:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@Book{Cook:2012:PTS,
  author =       "William Cook",
  title =        "In pursuit of the traveling salesman: mathematics at
                 the limits of computation",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiii + 228",
  year =         "2012",
  ISBN =         "0-691-15270-5",
  ISBN-13 =      "978-0-691-15270-7",
  LCCN =         "QA164 .C69 2012",
  bibdate =      "Tue May 7 09:50:35 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "What is the shortest possible route for a traveling
                 salesman seeking to visit each city on a list exactly
                 once and return to his city of origin? It sounds simple
                 enough, yet the traveling salesman problem is one of
                 the most intensely studied puzzles in applied
                 mathematics--and it has defied solution to this day. In
                 this book, William Cook takes readers on a mathematical
                 excursion, picking up the salesman's trail in the 1800s
                 when Irish mathematician W. R. Hamilton first defined
                 the problem, and venturing to the furthest limits of
                 today's state-of-the-art attempts to solve it. Cook
                 examines the origins and history of the salesman
                 problem and explores its many important applications,
                 from genome sequencing and designing computer
                 processors to arranging music and hunting for planets.
                 He looks at how computers stack up against the
                 traveling salesman problem on a grand scale, and
                 discusses how humans, unaided by computers, go about
                 trying to solve the puzzle. Cook traces the salesman
                 problem to the realms of neuroscience, psychology, and
                 art, and he also challenges readers to tackle the
                 problem themselves. The traveling salesman problem
                 is---literally---a \$1 million question. That's the
                 prize the Clay Mathematics Institute is offering to
                 anyone who can solve the problem or prove that it can't
                 be done. In Pursuit of the Traveling Salesman travels
                 to the very threshold of our understanding about the
                 nature of complexity, and challenges you yourself to
                 discover the solution to this captivating mathematical
                 problem.\par

                 In Pursuit of the Traveling Salesman covers the
                 history, applications, theory, and computation of the
                 traveling salesman problem right up to state-of-the-art
                 solution machinery.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Challenges \\
                 Tour of the United States \\
                 An impossible task? \\
                 One problem at a time \\
                 Road map of the book \\
                 Origins of the problem \\
                 Before the mathematicians \\
                 Euler and Hamilton \\
                 Vienna to Harvard to Princeton \\
                 And on to the RAND Corporation \\
                 A statistical view \\
                 The salesman in action \\
                 Road trips \\
                 Mapping genomes \\
                 Aiming telescopes, X-rays, and lasers \\
                 Guiding industrial machines \\
                 Organizing data \\
                 Tests for microprocessors \\
                 Scheduling jobs \\
                 And more \\
                 Searching for a tour \\
                 The 48-states problem \\
                 Growing trees and tours \\
                 Alterations while you wait \\
                 Borrowing from physics and biology \\
                 The DIMACS challenge \\
                 Tour champions \\
                 Linear programming \\
                 General-purpose model \\
                 The simplex algorithm \\
                 Two for the price of one: LP duality \\
                 The degree LP relaxation of the TSP \\
                 Eliminating subtours \\
                 A perfect relaxation \\
                 Integer programming \\
                 Operations research \\
                 Cutting planes \\
                 The cutting-plane method \\
                 A catalog of TSP inequalities \\
                 The separation problem \\
                 Edmonds's glimpse of heaven \\
                 Cutting planes for integer programming \\
                 Branching \\
                 Breaking up \\
                 The search party \\
                 Branch-and-bound for integer programming \\
                 Big computing \\
                 World records \\
                 The TSP on a grand scale \\
                 Complexity \\
                 A model of computation \\
                 The campaign of Jack Edmonds \\
                 Cook's theorem and Karp's list \\
                 State of the TSP \\
                 Do we need computers? \\
                 The human touch \\
                 Humans versus computers \\
                 Tour-finding strategies \\
                 The TSP in neuroscience \\
                 Animals solving the TSP \\
                 Aesthetics \\
                 Julian Lethbridge \\
                 Jordan curves \\
                 Continuous lines \\
                 Art and mathematics \\
                 Pushing the limits",
}

@Book{Cornuejols:2001:COP,
  author =       "G{\'e}rard Cornu{\'e}jols",
  title =        "Combinatorial Optimization: Packing and Covering",
  volume =       "74",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xi + 132",
  year =         "2001",
  ISBN =         "0-89871-481-8 (paperback)",
  ISBN-13 =      "978-0-89871-481-4 (paperback)",
  LCCN =         "QA166.7 .C67 2001",
  bibdate =      "Fri Mar 23 17:39:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "CBMS-NSF regional conference series in applied
                 mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0708/00066073-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0708/00066073-t.html",
  acknowledgement = ack-nhfb,
  subject =      "combinatorial packing and covering",
}

@Book{Crama:2010:BMM,
  editor =       "Yves Crama and P. L. Hammer",
  title =        "{Boolean} Models and Methods in Mathematics, Computer
                 Science, and Engineering",
  volume =       "134",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 759",
  year =         "2010",
  ISBN =         "0-521-84752-4",
  ISBN-13 =      "978-0-521-84752-0",
  LCCN =         "QA10.3 .B658 2010",
  bibdate =      "Tue May 7 10:59:49 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Encyclopedia of mathematics and its applications",
  URL =          "http://assets.cambridge.org/97805218/47520/cover/9780521847520.jpg;
                 http://www.loc.gov/catdir/enhancements/fy1009/2010017816-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1009/2010017816-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1009/2010017816-t.html",
  abstract =     "This collection of papers presents a series of
                 in-depth examinations of a variety of advanced topics
                 related to Boolean functions and expressions. The
                 chapters are written by some of the most prominent
                 experts in their respective fields and cover topics
                 ranging from algebra and propositional logic to
                 learning theory, cryptography, computational
                 complexity, electrical engineering, and reliability
                 theory. Beyond the diversity of the questions raised
                 and investigated in different chapters, a remarkable
                 feature of the collection is the common thread created
                 by the fundamental language, concepts, models, and
                 tools provided by Boolean theory. Many readers will be
                 surprised to discover the countless links between
                 seemingly remote topics discussed in various chapters
                 of the book. This text will help them draw on such
                 connections to further their understanding of their own
                 scientific discipline and to explore new avenues for
                 research.\par

                 This collection of papers presents a series of in-depth
                 examinations of a variety of advanced topics related to
                 Boolean functions and expressions. The chapters are
                 written by some of the most prominent experts in their
                 respective fields and cover topics ranging from algebra
                 and propositional logic to learning theory,
                 cryptography, computational complexity, electrical
                 engineering, and reliability theory. Beyond the
                 diversity of the questions raised and investigated in
                 different chapters, a remarkable feature of the
                 collection is the common thread created by the
                 fundamental language, concepts, models, and tools
                 provided by Boolean theory.",
  acknowledgement = ack-nhfb,
  remark =       "Series numbering from jacket.",
  subject =      "Algebra, Boolean; Probabilities",
  tableofcontents = "Algebraic structures. Compositions and clones of
                 Boolean functions / Reinhard P{\"o}schel and Ivo
                 Rosenberg \\
                 Decomposition of Boolean functions / Jan C. Bioch \\
                 Logic. Proof theory / Alasdair Urquhart \\
                 Probabilistic analysis of satisfiability algorithms /
                 John Franco \\
                 Optimization methods in logic / John Hooker \\
                 Learning theory and cryptography. Probabilistic
                 learning and Boolean functions / Martin Anthony \\
                 Learning Boolean functions with queries / Robert H.
                 Sloan, Bal{\'a}zs Sz{\"o}r\'enyi, and Gy{\"o}rgy
                 Tur{\'a}n \\
                 Boolean functions for cryptography and error-correcting
                 codes / Claude Carlet \\
                 Vectorial Boolean functions for cryptography / Claude
                 Carlet \\
                 Graph representations and efficient computation models.
                 Binary decision diagrams / Beate Bollig [et al.] \\
                 Circuit complexity / Matthias Krause and Ingo Wegener
                 \\
                 Fourier transforms and threshold circuit complexity /
                 Jehoshua Bruck \\
                 Neural networks and Boolean functions / Martin Anthony
                 \\
                 Decision lists and related classes of Boolean functions
                 / Martin Anthony \\
                 Applications in engineering. Hardware equivalence and
                 property verification / J.-H. Roland Jiang and Tiziano
                 Villa \\
                 Synthesis of multi-level Boolean networks / Tiziano
                 Villa [et al.] \\
                 Boolean aspects of network reliability / Charles J.
                 Colbourn",
}

@Book{Crampton:2003:PMCa,
  author =       "Jeremy W. Crampton",
  title =        "The Political Mapping of Cyberspace",
  publisher =    "Edinburgh University Press",
  address =      "Edinburgh, Scotland",
  pages =        "vii + 214",
  year =         "2003",
  ISBN =         "0-7486-1412-5, 0-7486-1413-3 (paperback)",
  ISBN-13 =      "978-0-7486-1412-7, 978-0-7486-1413-4 (paperback)",
  LCCN =         "HM851 .C73 2003b",
  bibdate =      "Thu Mar 22 12:47:03 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Cyberspace; Political aspects; Social aspects;
                 Internet; Information society; Cartography; Geographic
                 information systems",
}

@Book{Crampton:2003:PMCb,
  author =       "Jeremy W. Crampton",
  title =        "The Political Mapping of Cyberspace",
  publisher =    pub-U-CHICAGO,
  address =      pub-U-CHICAGO:adr,
  pages =        "vii + 214",
  year =         "2003",
  ISBN =         "0-226-11746-4 (hardcover.), 0-226-11746-4",
  ISBN-13 =      "978-0-226-11746-1 (hardcover.), 978-0-226-11746-1",
  LCCN =         "HM851 .C73 2003",
  bibdate =      "Thu Mar 22 12:47:03 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/uchi051/2003066280.html;
                 http://www.loc.gov/catdir/description/uchi051/2003066280.html;
                 http://www.loc.gov/catdir/toc/uchi051/2003066280.html",
  acknowledgement = ack-nhfb,
  subject =      "Cyberspace; Political aspects; Social aspects;
                 Internet; Information society; Cartography; Geographic
                 information systems",
}

@Book{Crochemore:2007:AS,
  author =       "Maxime Crochemore and Christophe Hancart and Thierry
                 Lecroq",
  title =        "Algorithms on Strings",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 383",
  year =         "2007",
  ISBN =         "0-521-84899-7 (hardcover)",
  ISBN-13 =      "978-0-521-84899-2 (hardcover)",
  LCCN =         "QA76.9.A43 C757 2007",
  bibdate =      "Thu Mar 22 11:35:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0703/2006039263-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0703/2006039263-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0803/2006039263-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Matching theory; Computational
                 biology",
}

@Book{Dasgupta:2008:A,
  author =       "Sanjoy Dasgupta and Christos H. Papadimitriou and
                 Umesh Virkumar Vazirani",
  title =        "Algorithms",
  publisher =    "McGraw-Hill Higher Education",
  address =      "Boston, MA, USA",
  pages =        "x + 320",
  year =         "2008",
  ISBN =         "0-07-352340-2",
  ISBN-13 =      "978-0-07-352340-8",
  LCCN =         "QA9.58 .D37 2008",
  bibdate =      "Fri Mar 23 10:04:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0665/2006049014-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0701/2006049014-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Algorithms; Textbooks; Computer algorithms",
}

@Book{Davey:1990:ILO,
  author =       "B. A. Davey and H. A. (Hilary A.) Priestley",
  title =        "Introduction to Lattices and Order",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 248",
  year =         "1990",
  ISBN =         "0-521-36584-8, 0-521-36766-2 (paperback)",
  ISBN-13 =      "978-0-521-36584-0, 978-0-521-36766-0 (paperback)",
  LCCN =         "QA171.5 .D38 1990",
  bibdate =      "Thu Mar 22 12:28:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam023/89009753.html;
                 http://www.loc.gov/catdir/toc/cam029/89009753.html",
  acknowledgement = ack-nhfb,
  subject =      "Lattice theory",
}

@Book{Davey:2002:ILO,
  author =       "B. A. Davey and H. A. (Hilary A.) Priestley",
  title =        "Introduction to Lattices and Order",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xii + 298",
  year =         "2002",
  ISBN =         "0-521-78451-4 (paperback)",
  ISBN-13 =      "978-0-521-78451-1 (paperback)",
  LCCN =         "QA171.5 .D38 2002",
  bibdate =      "Thu Mar 22 12:28:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam022/2001043910.html;
                 http://www.loc.gov/catdir/toc/cam026/2001043910.html",
  acknowledgement = ack-nhfb,
  subject =      "Lattice theory",
}

@Book{Davis:1982:RMG,
  author =       "Natalie Zemon Davis and Jean-Claude Carri{\`e}re and
                 Daniel Vigne",
  title =        "Le retour de {Martin Guerre}",
  publisher =    "R. Laffont",
  address =      "Paris, France",
  pages =        "269",
  year =         "1982",
  ISBN =         "2-221-00744-1",
  ISBN-13 =      "978-2-221-00744-0",
  LCCN =         "KJV130.D8 D38 1982",
  bibdate =      "Sat Mar 24 06:48:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Arnault Du Tilh; trials, litigation, etc; trials
                 (impostors and imposture); France; early works to 1800;
                 impostors and imposture",
  subject-dates = "d. 1560",
}

@Book{deBerg:1997:CGA,
  author =       "Mark de Berg and others",
  title =        "Computational Geometry: Algorithms and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 365",
  year =         "1997",
  ISBN =         "3-540-61270-X",
  ISBN-13 =      "978-3-540-61270-4",
  LCCN =         "QA448.D38 C65 1997",
  bibdate =      "Fri Mar 23 08:20:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Geometry; Data processing",
}

@Book{deBerg:2000:CGA,
  author =       "Mark de Berg and others",
  title =        "Computational Geometry: Algorithms and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xii + 367",
  year =         "2000",
  ISBN =         "3-540-65620-0",
  ISBN-13 =      "978-3-540-65620-3",
  LCCN =         "QA448.D38 C65 2000",
  bibdate =      "Fri Mar 23 08:20:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Geometry; Data processing",
  tableofcontents = "Computational Geometry: Introduction \\
                 Line Segment Intersection: Thematic Map Overlay \\
                 Polygon Triangulation: Guarding an Art Gallery \\
                 Linear Programming: Manufacturing with Molds \\
                 Orthogonal Range Searching: Querying a Database \\
                 Point Location: Knowing Where You Are \\
                 Voronoi Diagrams: The Post Office Problem \\
                 Arrangements and Duality: Supersampling in Ray Tracing
                 \\
                 Delaunay Triangulations: Height Interpolation \\
                 More Geometric Data Structures: Windowing \\
                 Convex Hulls: Mixing Things \\
                 Binary Space Partitions: The Painter's Algorithm \\
                 Robot Motion Planning: Getting Where You Want to Be \\
                 Quadtrees: Non-Uniform Mesh Generation \\
                 Visibility Graphs: Finding the Shortest Route \\
                 Simplex Range Searching: Windowing Revisited \\
                 Bibliography \\
                 Index",
}

@Book{deBerg:2008:CGA,
  author =       "Mark de Berg and others",
  title =        "Computational Geometry: Algorithms and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xii + 386",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-3-540-77974-2",
  ISBN =         "3-540-77973-6 (hardcover), 3-540-77974-4 (ebook)",
  ISBN-13 =      "978-3-540-77973-5 (hardcover), 978-3-540-77974-2
                 (ebook)",
  LCCN =         "QA448.D38 C65 2008",
  bibdate =      "Fri Mar 23 08:20:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10231750",
  acknowledgement = ack-nhfb,
  subject =      "Geometry; Data processing; Textbooks",
  tableofcontents = "Computational Geometry: Introduction \\
                 Line Segment Intersection: Thematic Map Overlay \\
                 Polygon Triangulation: Guarding an Art Gallery \\
                 Linear Programming: Manufacturing with Molds \\
                 Orthogonal Range Searching: Querying a Database \\
                 Point Location: Knowing Where You Are \\
                 Voronoi Diagrams: The Post Office Problem \\
                 Arrangements and Duality: Supersampling in Ray Tracing
                 \\
                 Delaunay Triangulations: Height Interpolation \\
                 More Geometric Data Structures: Windowing \\
                 Convex Hulls: Mixing Things \\
                 Binary Space Partitions: The Painter's Algorithm \\
                 Robot Motion Planning: Getting Where You Want to Be \\
                 Quadtrees: Non-Uniform Mesh Generation \\
                 Visibility Graphs: Finding the Shortest Route \\
                 Simplex Range Searching: Windowing Revisited \\
                 Bibliography \\
                 Index",
}

@Book{deKoninck:2009:FN,
  author =       "J. M. de Koninck",
  title =        "Those Fascinating Numbers",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xviii + 426",
  year =         "2009",
  ISBN =         "0-8218-4807-0",
  ISBN-13 =      "978-0-8218-4807-4",
  LCCN =         "QA241 .K685913 2009",
  bibdate =      "Thu Mar 22 13:07:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Number theory",
}

@Book{Delfs:2002:ICP,
  author =       "Hans Delfs and Helmut Knebl",
  title =        "Introduction to Cryptography: Principles and
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 310",
  year =         "2002",
  ISBN =         "3-540-42278-1 (hardcover)",
  ISBN-13 =      "978-3-540-42278-5 (hardcover)",
  LCCN =         "QA76.9.A25 D447 2002",
  bibdate =      "Thu Mar 22 12:26:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Information security and cryptography.",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography; Computer networks;
                 Security measures",
}

@Book{Delfs:2007:ICP,
  author =       "Hans Delfs and Helmut Knebl",
  title =        "Introduction to Cryptography: Principles and
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 367",
  year =         "2007",
  ISBN =         "3-540-49243-7 (hardcover)",
  ISBN-13 =      "978-3-540-49243-6 (hardcover)",
  LCCN =         "QA76.9.A25 D447 2007",
  bibdate =      "Thu Mar 22 12:38:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "X-9218-2100-8",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Introduction \\
                 2. Symmetric-key encryption \\
                 3. Public-key cryptography \\
                 4. Cryptographic protocols \\
                 5. Probabilistic algorithms \\
                 6. One-way functions and the basic assumptions \\
                 7. Bit security of one-way functions \\
                 8. One-way functions and pseudorandomness \\
                 9. Provably secure encryption \\
                 10. Provably secure digital signatures \\
                 A. Algebra and number theory \\
                 B. Probabilities and information theory \\
                 References \\
                 Index",
}

@Book{Demaine:2007:GFA,
  author =       "Erik D. Demaine and Joseph O'Rourke",
  title =        "Geometric Folding Algorithms: Linkages, Origami,
                 Polyhedra",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 472",
  year =         "2007",
  ISBN =         "0-521-85757-0",
  ISBN-13 =      "978-0-521-85757-4",
  LCCN =         "QA491 .D46 2007",
  bibdate =      "Thu Mar 22 12:17:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0703/2006038156-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0703/2006038156-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0803/2006038156-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Polyhedra; Models; Data processing",
}

@Book{Dey:2007:CSR,
  author =       "Tamal K. (Tamal Krishna) Dey",
  title =        "Curve and Surface Reconstruction: Algorithms with
                 Mathematical Analysis",
  volume =       "23",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 214",
  year =         "2007",
  ISBN =         "0-521-86370-8 (hardcover)",
  ISBN-13 =      "978-0-521-86370-4 (hardcover)",
  LCCN =         "QA565 .D49 2007",
  bibdate =      "Fri Mar 23 18:10:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The Cambridge monographs on applied and computational
                 mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0659/2006017359-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0659/2006017359-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0733/2006017359-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Curves on surfaces; Mathematical models; Surfaces;
                 Surfaces, Models of",
}

@Book{DiCosmo:1995:ITL,
  author =       "Roberto {Di Cosmo}",
  title =        "Isomorphisms of Types: From $ \lambda $-Calculus to
                 Information Retrieval and Language Design",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "viii + 235",
  year =         "1995",
  ISBN =         "0-8176-3763-X , 3-7643-3763-X",
  ISBN-13 =      "978-0-8176-3763-7, 978-3-7643-3763-6",
  LCCN =         "QA76.7 .D5 1995",
  bibdate =      "Fri Mar 23 07:58:38 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Progress in theoretical computer science",
  acknowledgement = ack-nhfb,
  subject =      "programming languages (electronic computers); type
                 theory; human-computer interaction",
}

@Book{Dietzfelbinger:2004:PTP,
  author =       "Martin Dietzfelbinger",
  title =        "Primality Testing in Polynomial Time: From Randomized
                 Algorithms to ``Primes'' Is in {P}",
  volume =       "3000",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 147",
  year =         "2004",
  ISBN =         "3-540-40344-2",
  ISBN-13 =      "978-3-540-40344-9",
  LCCN =         "QA246 .D54 2004",
  bibdate =      "Thu Mar 22 12:48:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "LNCS, 0302-9743; Tutorial",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2004107785-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2004107785-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Polynomials; Numbers, Prime; Algorithms",
}

@Book{Diffie:1998:PLP,
  author =       "Whitfield Diffie and Susan Eva Landau",
  title =        "Privacy on the Line: the Politics of Wiretapping and
                 Encryption",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "ix + 342",
  year =         "1998",
  ISBN =         "0-262-04167-7 (hardcover)",
  ISBN-13 =      "978-0-262-04167-6 (hardcover)",
  LCCN =         "KF9670 .D54 1998",
  bibdate =      "Thu Mar 22 12:48:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Wiretapping; United States; Data encryption (Computer
                 science); Law and legislation; Privacy, Right of",
}

@Book{Diffie:2007:PLP,
  author =       "Whitfield Diffie and Susan Eva Landau",
  title =        "Privacy on the Line: the Politics of Wiretapping and
                 Encryption",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvii + 472",
  year =         "2007",
  ISBN =         "0-262-04240-1 (hardcover)",
  ISBN-13 =      "978-0-262-04240-6 (hardcover)",
  LCCN =         "UB256.U6 D54 2007",
  bibdate =      "Thu Mar 22 12:48:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip073/2006035514.html",
  acknowledgement = ack-nhfb,
  subject =      "Electronic intelligence; United States; Wiretapping;
                 Data encryption (Computer science); Law and
                 legislation; Electronic surveillance; Political
                 aspects; Telecommunication; Privacy, Right of",
  tableofcontents = "Cryptography \\
                 Cryptography and public policy \\
                 National security \\
                 Law enforcement \\
                 Privacy: protections and threats \\
                 Wiretapping \\
                 Communications in the 1990s \\
                 Cryptography in the 1990s \\
                 And then it all changed \\
                 Apr{\`e}s le d{\'e}luge",
}

@Book{Dorst:2007:GAC,
  author =       "Leo Dorst and Daniel Fontijne and Stephen Mann",
  title =        "Geometric Algebra for Computer Science: an
                 Object-Oriented Approach to Geometry",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xxxv + 626",
  year =         "2007",
  ISBN =         "0-12-369465-5, 0-12-374942-5 (hardcover)",
  ISBN-13 =      "978-0-12-369465-2, 978-0-12-374942-0 (hardcover)",
  LCCN =         "QA564 .D67 2007",
  bibdate =      "Thu Mar 22 12:17:04 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Morgan Kaufmann series in computer graphics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1011/2010481601-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Geometry, Algebraic; Computer science; Mathematics;
                 Object-oriented methods (Computer science);
                 G{\'e}om{\'e}trie alg{\'e}brique; Informatique;
                 Math{\'e}matiques; Approche orient{\'e}e objet
                 (Informatique); Geometrische algebra; Clifford-Algebra;
                 Computergraphik; Geometrische Algebra; Information;
                 Objektorientierte Programmierung",
  tableofcontents = "Why geometric algebra? \\
                 Spanning oriented subspaces \\
                 Metric products of subspaces \\
                 Linear transformations of subspaces \\
                 Intersection and union of subspaces \\
                 The fundamental product of geometric algebra \\
                 Orthogonal transformations as versors \\
                 Geometric differentiation \\
                 Modeling geometries \\
                 The vector space model: the algebra of directions \\
                 The homogeneous model \\
                 Applications of the homogeneous model \\
                 The conformal model: operational Euclidean geometry \\
                 New primitives for Euclidean geometry \\
                 Constructions in Euclidean geometry \\
                 Conformal operations \\
                 Operational models for geometries \\
                 Implementation issues \\
                 Basis blades and operations \\
                 The linear products and operations \\
                 Fundamental algorithms for nonlinear products \\
                 Specializing the structure for efficiency \\
                 Using the geometry in a ray-tracing application \\
                 Metrics and null vectors \\
                 Contractions and other inner products \\
                 Subspace products retrieved \\
                 Common equations",
}

@Book{Downey:1999:PC,
  author =       "R. G. (Rod G.) Downey and M. R. (Michael Ralph)
                 Fellows",
  title =        "Parameterized Complexity",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 533",
  year =         "1999",
  ISBN =         "0-387-94883-X (hardcover)",
  ISBN-13 =      "978-0-387-94883-6 (hardcover)",
  LCCN =         "QA267.7 .D68 1999",
  bibdate =      "Thu Mar 22 12:45:04 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/97022882-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/97022882-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity",
}

@Book{Downey:2010:ARC,
  author =       "R. G. (Rod G.) Downey and Denis Roman Hirschfeldt",
  title =        "Algorithmic Randomness and Complexity",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxviii + 855",
  year =         "2010",
  ISBN =         "0-387-95567-4, 0-387-68441-7 (e-book)",
  ISBN-13 =      "978-0-387-95567-4, 978-0-387-68441-3 (e-book)",
  LCCN =         "QA267.7 .D67 2010",
  bibdate =      "Tue May 7 11:02:45 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Theory and applications of computability, 2190-619X",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1202/2011377427-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1202/2011377427-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Computable functions",
  tableofcontents = "Part I. Background \\
                 Preliminaries \\
                 Computability theory \\
                 Kolmogorov complexity of finite strings \\
                 Relating complexities \\
                 Effective reals \\
                 Part II. Notions of randomness \\
                 Martin-L{\"o}f randomness \\
                 Other notions of algorithmic randomness \\
                 Algorithmic randomness and Turing reducibility \\
                 Part III. Relative randomness \\
                 Measures of relative randomness \\
                 Complexity and relative randomness for $1$-randoms sets
                 \\
                 Randomness-theoretic weakness \\
                 Lowness and triviality for other randomness notions \\
                 Algorithmic dimension \\
                 Part IV. Further topics \\
                 Strong jump traceability \\
                 $\Omega$ as an operator \\
                 Complexity of computably enumerable sets",
}

@Book{Doxiadis:2009:LES,
  author =       "Apostolos Doxiadis and Alecos Papadatos and Christos
                 H. Papadimitriou",
  title =        "{Logicomix}: an Epic Search for Truth",
  publisher =    "Bloomsbury",
  address =      "New York, NY, USA",
  pages =        "347",
  year =         "2009",
  ISBN =         "1-59691-452-1",
  ISBN-13 =      "978-1-59691-452-0",
  LCCN =         "PA5615.O87 L6413 2009",
  bibdate =      "Fri Mar 23 21:49:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  abstract =     "This innovative, dramatic graphic novel recounts the
                 spiritual odyssey of philosopher Bertrand Russell. In
                 his agonized search for absolute truth, Russell crosses
                 paths with legendary thinkers and finds a passionate
                 student in the great Ludwig Wittgenstein.",
  acknowledgement = ack-nhfb,
  subject =      "Russell, Bertrand",
}

@Book{Du:2000:TCC,
  author =       "Dingzhu Du and Ker-I. Ko",
  title =        "Theory of Computational Complexity",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xiii + 491",
  year =         "2000",
  ISBN =         "0-471-34506-7",
  ISBN-13 =      "978-0-471-34506-0",
  LCCN =         "QA267.7 .D8 2000",
  bibdate =      "Thu Mar 22 13:06:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/wiley042/99053576.html;
                 http://www.loc.gov/catdir/description/wiley034/99053576.html;
                 http://www.loc.gov/catdir/toc/onix05/99053576.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity",
}

@Book{Dubhashi:2009:CMA,
  author =       "Devdatt Dubhashi and Alessandro Panconesi",
  title =        "Concentration of Measure for the Analysis of
                 Randomized Algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 196",
  year =         "2009",
  ISBN =         "0-521-88427-6 (hardcover)",
  ISBN-13 =      "978-0-521-88427-3 (hardcover)",
  LCCN =         "QA273 .D765 2009",
  bibdate =      "Thu Mar 22 11:58:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Random variables; Distribution (Probability theory);
                 Limit theorems (Probability theory); Algorithms",
}

@Book{Dudley:2009:GEN,
  author =       "Underwood Dudley",
  title =        "A Guide to Elementary Number Theory",
  volume =       "41; \# 5",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "x + 141",
  year =         "2009",
  ISBN =         "0-88385-347-7",
  ISBN-13 =      "978-0-88385-347-4",
  LCCN =         "QA241 .D793 2009",
  bibdate =      "Thu Mar 22 12:19:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The Dolciani mathematical expositions; MAA guides",
  abstract =     "A Guide to Elementary Number Theory is a 140-page
                 exposition of the topics considered in a first course
                 in number theory. It is intended for those who may have
                 seen the material before but have half-forgotten it,
                 and also for those who may have misspent their youth by
                 not having a course in number theory and who want to
                 see what it is about without having to wade through
                 traditional texts, some of which approach 500 pages in
                 length. It will be especially useful to graduate
                 students preparing for qualifying exams. Though Plato
                 did not quite say, ''He is unworthy of the name of man
                 who does not know which integers are the sums of two
                 squares,'' he came close. This guide can make everyone
                 more worthy.",
  acknowledgement = ack-nhfb,
  subject =      "Number theory; Elementare Zahlentheorie",
  tableofcontents = "Greatest common divisors \\
                 Unique factorization \\
                 Linear Diophantine equations \\
                 Congruences \\
                 Linear congruences \\
                 The Chinese remainder theorem \\
                 Fermat's theorem \\
                 Wilson's theorem \\
                 The number of divisors of an integer \\
                 The sum of the divisors of an integer \\
                 Amicable numbers \\
                 Perfect numbers \\
                 Euler's theorem and function \\
                 Primitive roots and orders \\
                 Decimals \\
                 Quadratic congruences \\
                 Gauss's lemma \\
                 The quadratic reciprocity theorem \\
                 The Jacobi symbol \\
                 Pythagorean triangles \\
                 $x^4 + y^4 \neq z^4$ \\
                 Sums of two squares \\
                 Sums of three squares \\
                 Sums of four squares \\
                 Waring's problem \\
                 Pell's equation \\
                 Continued fractions \\
                 Multigrades \\
                 Carmichael numbers \\
                 Sophie Germain primes \\
                 The group of multiplicative functions \\
                 Bounds for [pi](x) \\
                 The sum of the reciprocals of the primes \\
                 The Riemann hypothesis \\
                 The prime number theorem \\
                 The abc conjecture \\
                 Factorization and testing for primes \\
                 Algebraic and transcendental numbers \\
                 Unsolved problems",
}

@Book{Durrett:2010:PTE,
  author =       "Richard Durrett",
  title =        "Probability: Theory and Examples",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Fourth",
  pages =        "x + 428",
  year =         "2010",
  ISBN =         "0-534-42441-4, 0-521-76539-0",
  ISBN-13 =      "978-0-534-42441-1, 978-0-521-76539-8",
  LCCN =         "QA273 .D865 2005",
  bibdate =      "Fri Mar 23 10:16:13 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "Measure theory \\
                 Laws of large numbers \\
                 Central limit theorems \\
                 Random walks \\
                 Martingales \\
                 Markov chains \\
                 Ergodic theorems \\
                 Brownian motion \\
                 Appendix A. Measure theory details",
}

@Book{Dwyer:2003:GPB,
  author =       "Rex A. Dwyer",
  title =        "Genomic {Perl}: From Bioinformatics Basics to Working
                 Code",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvii + 334",
  year =         "2003",
  ISBN =         "0-521-80177-X",
  ISBN-13 =      "978-0-521-80177-5",
  LCCN =         "QA76.73.P22 D88 2003",
  bibdate =      "Fri Mar 23 10:25:06 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://www.loc.gov/catdir/toc/cam031/2003268666.html",
  acknowledgement = ack-nhfb,
  subject =      "Perl (Computer program language); Molecular biology;
                 Data processing; Bioinformatics",
}

@Book{Edmonds:2008:HTA,
  author =       "Jeff Edmonds",
  title =        "How to Think about Algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 448",
  year =         "2008",
  ISBN =         "0-521-84931-4 (hardcover), 0-521-61410-4 (paperback)",
  ISBN-13 =      "978-0-521-84931-9 (hardcover), 978-0-521-61410-8
                 (paperback)",
  LCCN =         "QA9.58 .E36 2008",
  bibdate =      "Thu Mar 22 12:23:48 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0808/2008001238-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0808/2008001238-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Algorithms; Study and teaching; Loops (Group theory);
                 Invariants; Recursion theory",
}

@Book{Edwards:2005:ECM,
  author =       "Harold M. Edwards",
  title =        "Essays in Constructive Mathematics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 211",
  year =         "2005",
  ISBN =         "0-387-21978-1",
  ISBN-13 =      "978-0-387-21978-3",
  LCCN =         "QA9.56 .E39 2005",
  bibdate =      "Thu Mar 22 12:10:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0662/2004049156-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2004049156-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2004049156-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Constructive mathematics",
}

@Book{Edwards:2008:HAA,
  author =       "Harold M. Edwards",
  title =        "Higher Arithmetic: an Algorithmic Introduction to
                 Number Theory",
  volume =       "45",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xii + 210",
  year =         "2008",
  ISBN =         "0-8218-4439-3",
  ISBN-13 =      "978-0-8218-4439-7",
  ISSN =         "1520-9121",
  LCCN =         "QA241 .E39 2008",
  bibdate =      "Fri Mar 23 18:02:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Student mathematical library",
  acknowledgement = ack-nhfb,
}

@Book{Elaydi:1996:IDE,
  author =       "Saber Elaydi",
  title =        "An Introduction to Difference Equations",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 389",
  year =         "1996",
  ISBN =         "0-387-94582-2 (hardcover)",
  ISBN-13 =      "978-0-387-94582-8 (hardcover)",
  LCCN =         "QA431 .E43 1996",
  bibdate =      "Thu Mar 22 12:27:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Difference equations",
}

@Book{Elaydi:1999:IDE,
  author =       "Saber Elaydi",
  title =        "An Introduction to Difference Equations",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xviii + 427",
  year =         "1999",
  ISBN =         "0-387-98830-0 (hardcover)",
  ISBN-13 =      "978-0-387-98830-6 (hardcover)",
  LCCN =         "QA431 .E43 1999",
  bibdate =      "Thu Mar 22 12:27:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Difference equations",
}

@Book{Elaydi:2005:IDE,
  author =       "Saber Elaydi",
  title =        "An Introduction to Difference Equations",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xxii + 539",
  year =         "2005",
  ISBN =         "0-387-23059-9",
  ISBN-13 =      "978-0-387-23059-7",
  LCCN =         "QA431 .E43 2005",
  bibdate =      "Thu Mar 22 12:27:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0662/2004058916-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0813/2004058916-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Difference equations",
}

@Book{Elbirt:2009:UAC,
  author =       "Adam J. Elbirt",
  title =        "Understanding and Applying Cryptography and Data
                 Security",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xxvii + 637",
  year =         "2009",
  ISBN =         "1-4200-6160-7",
  ISBN-13 =      "978-1-4200-6160-4",
  LCCN =         "QA76.9.A25 E43 2009",
  bibdate =      "Thu Mar 22 13:10:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0821/2008028154.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography",
}

@Book{Erickson:2010:PDM,
  author =       "Martin J. Erickson",
  title =        "Pearls of Discrete Mathematics",
  publisher =    pub-TAYLOR-FRANCIS,
  address =      pub-TAYLOR-FRANCIS:adr,
  pages =        "x + 270",
  year =         "2010",
  ISBN =         "1-4398-1616-6 (paperback)",
  ISBN-13 =      "978-1-4398-1616-5 (paperback)",
  LCCN =         "QA164 .E745 2010",
  bibdate =      "Thu Mar 22 12:45:44 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Graph theory; Number theory",
}

@Book{Fagin:1995:RAK,
  author =       "Ronald Fagin and Joseph Y. Halpern and Yoram Moses and
                 Moshe Y. Vardi",
  title =        "Reasoning about Knowledge",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiii + 477",
  year =         "1995",
  ISBN =         "0-262-06162-7 (hardcover)",
  ISBN-13 =      "978-0-262-06162-9 (hardcover)",
  LCCN =         "BD181 .R38 1995",
  bibdate =      "Thu Mar 22 12:55:33 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Knowledge, Theory of; Agent (Philosophy); Reasoning",
}

@Book{Fagin:2003:RAK,
  author =       "Ronald Fagin and Joseph Y. Halpern and Yoram Moses and
                 Moshe Y. Vardi",
  title =        "Reasoning about Knowledge",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiii + 517",
  year =         "2003",
  ISBN =         "0-262-56200-6",
  ISBN-13 =      "978-0-262-56200-3",
  LCCN =         "BD181 .R38 2003",
  bibdate =      "Thu Mar 22 12:55:33 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Knowledge, Theory of; Agent (Philosophy); Reasoning",
}

@Book{Feferman:2004:ATL,
  author =       "Anita Burdman Feferman and Solomon Feferman",
  title =        "{Alfred Tarski}: Life and Logic",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "vi + 425",
  year =         "2004",
  ISBN =         "0-521-80240-7",
  ISBN-13 =      "978-0-521-80240-6",
  LCCN =         "QA29.T32 F44 2004",
  bibdate =      "Fri Mar 23 10:25:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://www.loc.gov/catdir/description/cam041/2004045748.html;
                 http://www.loc.gov/catdir/toc/cam041/2004045748.html",
  acknowledgement = ack-nhfb,
  subject =      "Tarski, Alfred; Logic, Symbolic and mathematical;
                 Logicians; United States; Biography",
  tableofcontents = "1. The two Tarskis \\
                 2. Independence and university \\
                 Interlude I. The Banach-Tarski paradox, set theory and
                 the axiom of choice \\
                 3. Polot! The Polish attribute \\
                 Interlude II. The completeness and decidability of
                 algebra and geometry \\
                 4. A wider sphere of influence \\
                 Interlude III. Truth and definability \\
                 5. How the 'Unity of Science' saved Tarski's life \\
                 6. Berkeley is so far from Princeton \\
                 7. Building a school \\
                 Interlude IV. The publication campaigns \\
                 8 'Papa Tarski' and his students \\
                 9. Three meetings and two departures \\
                 10. Logic and methodology, center stage \\
                 11. Heydays \\
                 Interlude V. Model theory and the 1963 symposium \\
                 12. Around the world \\
                 13. Los Angeles and Berkeley \\
                 Interlude VI. Algebras of logic \\
                 14. A decade of honors \\
                 15. The last times",
}

@Book{Fernandez:2009:MCI,
  author =       "Maribel Fern{\'a}ndez",
  title =        "Models of computation: an introduction to
                 computability theory",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 184",
  year =         "2009",
  ISBN =         "1-84882-433-5 (paperback)",
  ISBN-13 =      "978-1-84882-433-1 (paperback)",
  LCCN =         "QA267 .F47 2009",
  bibdate =      "Tue May 7 09:33:44 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate topics in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computable functions; Turing machines",
  tableofcontents = "Traditional models of computation \\
                 Automata and Turing machines \\
                 The Lambda calculus \\
                 Recursive functions \\
                 Logic-based models of computation \\
                 Modern models of computation \\
                 Computing with objects \\
                 Interaction-based models of computation \\
                 Concurrency \\
                 Emergent models of computation",
}

@Book{Fisher:2008:RPS,
  author =       "Len Fisher",
  title =        "Rock, Paper, Scissors: Game Theory in Everyday Life",
  publisher =    pub-BASIC,
  address =      pub-BASIC:adr,
  pages =        "x + 265",
  year =         "2008",
  ISBN =         "0-465-00938-7",
  ISBN-13 =      "978-0-465-00938-1",
  LCCN =         "QA269 .F49 2008",
  bibdate =      "Fri Mar 23 17:55:44 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1003/2008025592-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1003/2008025592-d.html;
                 http://www.loc.gov/catdir/toc/ecip0820/2008025592.html",
  abstract =     "The IgNobel Prize-winning author of How to Dunk a
                 Doughnut draws on the science of game theory to explain
                 how human beings cooperate in everyday life.",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Cooperation",
  tableofcontents = "Trapped in the matrix \\
                 I cut and you choose \\
                 The seven deadly dilemmas \\
                 Rock, paper, scissors \\
                 Let's get together \\
                 Trust \\
                 Tit for tat \\
                 Changing the game \\
                 Individuals can make a difference : the top ten tips",
}

@Book{Flajolet:2009:AC,
  author =       "Philippe Flajolet and Robert Sedgewick",
  title =        "Analytic Combinatorics",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 810",
  year =         "2009",
  ISBN =         "0-521-89806-4",
  ISBN-13 =      "978-0-521-89806-5",
  LCCN =         "QA164 .F57 2009",
  bibdate =      "Thu Mar 22 11:37:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0916/2009280635-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0916/2009280635-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0916/2009280635-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Combinatieleer.",
}

@Book{Flannery:2005:SRD,
  author =       "David Flannery",
  title =        "The square root of 2: a dialogue concerning a number
                 and a sequence",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 256",
  year =         "2005",
  ISBN =         "0-387-20220-X",
  ISBN-13 =      "978-0-387-20220-4",
  LCCN =         "QA247.5 .F536 2006",
  bibdate =      "Fri Mar 23 12:47:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "Asking the right questions \\
                 Irrationality and its consequences \\
                 The power of a little algebra \\
                 Witchcraft \\
                 Odds and ends",
}

@Book{Fruhwirth:2003:ECP,
  author =       "Thom Fr{\"u}hwirth and Slim Abdennadher",
  title =        "Essentials of Constraint Programming",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 144",
  year =         "2003",
  ISBN =         "3-540-67623-6",
  ISBN-13 =      "978-3-540-67623-2",
  LCCN =         "QA76.612 .F78 2003",
  bibdate =      "Fri Mar 23 11:44:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cognitive technologies",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2002044502-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2002044502-t.html",
  acknowledgement = ack-nhfb,
  subject =      "constraint programming (computer science)",
}

@Book{Gabizon:2010:DEW,
  author =       "Ariel Gabizon",
  title =        "Deterministic Extraction from Weak Random Sources",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "148",
  year =         "2010",
  ISBN =         "3-642-14902-2, 3-642-14903-0 (e-book)",
  ISBN-13 =      "978-3-642-14902-3, 978-3-642-14903-0 (e-book)",
  LCCN =         "QA564 .G33 2011",
  bibdate =      "Tue May 7 11:12:22 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/prng.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "Monographs in theoretical computer science",
  abstract =     "A deterministic extractor is a function that extracts
                 almost perfect random bits from a weak random source.
                 In this research monograph the author constructs
                 deterministic extractors for several types of sources.
                 A basic theme in this work is a methodology of
                 recycling randomness which enables increasing the
                 output length of deterministic extractors to near
                 optimal length. The author's main work examines
                 deterministic extractors for bit-fixing sources,
                 deterministic extractors for affine sources and
                 polynomial sources over large fields, and increasing
                 the output length of zero-error dispersers.",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
  tableofcontents = "Preface \\
                 Contents \\
                 1 Introduction \\
                 2 Deterministic Extractors for Bit-Fixing Sources by
                 Obtaining an Independent Seed \\
                 3 Deterministic Extractors for Affine Sources over
                 Large Fields \\
                 4 Extractors and Rank Extractors for Polynomial Sources
                 \\
                 5 Increasing the Output Length of Zero-Error Dispersers
                 \\
                 A Sampling and Partitioning \\
                 B Basic Notions from Algebraic Geometry \\
                 Bibliography",
}

@Book{Gardner:2006:ATV,
  author =       "Martin Gardner",
  title =        "{Aha}! {A} Two Volume Collection: {Aha}! Gotcha,
                 {Aha}! Insight",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xvii + 164 (vol. 1), ix + 181 (vol. 2)",
  year =         "2006",
  ISBN =         "0-88385-551-8",
  ISBN-13 =      "978-0-88385-551-5",
  LCCN =         "QA95 .G37 2006",
  bibdate =      "Thu Mar 22 11:30:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Spectrum series",
  acknowledgement = ack-nhfb,
  author-dates = "1914--2010",
}

@Book{Gardner:2008:OES,
  author =       "Martin Gardner",
  title =        "Origami, {Eleusis}, and the {Soma} cube: {Martin
                 Gardner}'s Mathematical Diversions",
  volume =       "2",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 234",
  year =         "2008",
  ISBN =         "0-521-75610-3 (hardcover), 0-521-73524-6 (paperback)",
  ISBN-13 =      "978-0-521-75610-5 (hardcover), 978-0-521-73524-7
                 (paperback)",
  LCCN =         "QA95 .G2975 2008",
  bibdate =      "Thu Mar 22 12:44:44 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The new Martin Gardner mathematical library",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0834/2008012534-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0834/2008012534-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0834/2008012534-t.html",
  acknowledgement = ack-nhfb,
  author-dates = "1914--2010",
  remark =       "The Mathematical Association of America. First edition
                 published as The 2nd Scientific American book of
                 mathematical puzzles and diversions, Simon and
                 Schuster, 1961.",
  subject =      "Mathematical recreations",
  tableofcontents = "The five platonic solids \\
                 Tetraflexagons \\
                 Henry Ernest Dudeney: England's greatest puzzlist \\
                 Digital roots \\
                 Nine problems \\
                 The Soma cube \\
                 Recreational topology \\
                 Phi: the golden ratio \\
                 The monkey and the coconuts \\
                 Mazes \\
                 Recreational logic \\
                 Magic squares \\
                 James Hugh Riley shows, Inc. \\
                 Nine more problems \\
                 Eleusis: the introduction game \\
                 Origami \\
                 Squaring the square \\
                 Mechanical puzzles \\
                 Probability and ambiguity \\
                 The mysterious Dr. Matrix",
}

@Book{Gasarch:1999:BQR,
  author =       "William I. Gasarch and Georgia A. Martin",
  title =        "Bounded Queries in Recursion Theory",
  volume =       "16",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xiii + 353",
  year =         "1999",
  ISBN =         "0-8176-3966-7 (hardcover)",
  ISBN-13 =      "978-0-8176-3966-2 (hardcover)",
  LCCN =         "QA267.7 .G38 1999",
  bibdate =      "Thu Mar 22 11:43:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Recursion theory",
}

@Book{Ghosh:2007:VAP,
  author =       "Subir Kumar Ghosh",
  title =        "Visibility Algorithms in the Plane",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 318",
  year =         "2007",
  ISBN =         "0-521-87574-9",
  ISBN-13 =      "978-0-521-87574-5",
  LCCN =         "TA1634 .G485 2007",
  bibdate =      "Thu Mar 22 13:12:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0803/2007297923-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0803/2007297923-d.html;
                 http://www.loc.gov/catdir/toc/fy0713/2007297923.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer vision",
}

@Book{Gillman:2009:MCC,
  author =       "Rick Gillman and David Housman",
  title =        "Models of Conflict and Cooperation",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xi + 417",
  year =         "2009",
  ISBN =         "0-8218-4872-0",
  ISBN-13 =      "978-0-8218-4872-2",
  LCCN =         "QA269 .G487 2009",
  bibdate =      "Tue May 7 11:09:44 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Decision making; Mathematical models",
  tableofcontents = "Deterministic games \\
                 Player preferences \\
                 Strategic games \\
                 Probabilistic strategies \\
                 Strategic game cooperation \\
                 Negotiation and arbitration \\
                 Coalition games \\
                 Fair division",
}

@Book{Ginsburg:1975:AAT,
  author =       "Seymour Ginsburg",
  title =        "Algebraic and Automata-Theoretic Properties of Formal
                 Languages",
  volume =       "2",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "xii + 313",
  year =         "1975",
  ISBN =         "0-444-10586-7 (American Elsevier)",
  ISBN-13 =      "978-0-444-10586-8 (American Elsevier)",
  LCCN =         "QA267.3 .G54",
  bibdate =      "Thu Mar 22 11:31:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Fundamental studies in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Formal languages",
}

@Book{Goldreich:1999:MCP,
  author =       "Oded Goldreich",
  title =        "Modern cryptography, probabilistic proofs, and
                 pseudorandomness",
  volume =       "17",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 182",
  year =         "1999",
  ISBN =         "3-540-64766-X",
  ISBN-13 =      "978-3-540-64766-9",
  LCCN =         "QA76.9.A25 G64 1999",
  bibdate =      "Fri Mar 23 11:33:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics, 0937-5511",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/98050548-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/98050548-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography",
}

@Book{Goldreich:2001:FCB,
  author =       "Oded Goldreich",
  title =        "Foundations of Cryptography: Basic Tools",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xix + 372",
  year =         "2001",
  ISBN =         "0-521-79172-3, 0-521-83084-2 (vol. 2)",
  ISBN-13 =      "978-0-521-79172-4, 978-0-521-83084-3 (vol. 2)",
  LCCN =         "QA268 .G5745 2001",
  bibdate =      "Fri Mar 23 10:23:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography; Mathematics",
  tableofcontents = "List of figures \\
                 Preface \\
                 Acknowledgements \\
                 5. Encryption schemes \\
                 6. Digital signatures and message authentication \\
                 7. General cryptographic protocols \\
                 Appendix C: corrections and additions to volume I \\
                 Bibliography \\
                 Index",
}

@Book{Goldreich:2008:CCCb,
  author =       "Oded Goldreich",
  title =        "Computational Complexity: a Conceptual Perspective",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxiv + 606",
  year =         "2008",
  ISBN =         "0-521-88473-X (hardcover), 0-511-64992-4 (e-book),
                 0-511-40077-2 (ebook)",
  ISBN-13 =      "978-0-521-88473-0 (hardcover), 978-0-511-64992-9
                 (e-book), 978-0-511-40077-3 (ebook)",
  LCCN =         "QA267.7 .G65 2008",
  bibdate =      "Fri Mar 23 10:30:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Turing machines",
}

@Book{Goldreich:2010:PNN,
  author =       "Oded Goldreich",
  title =        "{P}, {NP}, and {NP}-completeness: the basics of
                 computational complexity",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxix + 184",
  year =         "2010",
  ISBN =         "0-521-19248-X (hardcover), 0-521-12254-6 (paperback)",
  ISBN-13 =      "978-0-521-19248-4 (hardcover), 978-0-521-12254-2
                 (paperback)",
  LCCN =         "QA267.7 .G652 2010",
  bibdate =      "Tue May 7 10:44:21 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg",
  abstract =     "The focus of this book is the P-versus-NP Question and
                 the theory of NP-completeness. It also provides
                 adequate preliminaries regarding computational problems
                 and computational models. The P-versus-NP Question asks
                 whether or not finding solutions is harder than
                 checking the correctness of solutions. An alternative
                 formulation asks whether or not discovering proofs is
                 harder than verifying their correctness. It is widely
                 believed that the answer to these equivalent
                 formulations is positive, and this is captured by
                 saying that P is different from NP. Although the
                 P-versus-NP Question remains unresolved, the theory of
                 NP-completeness offers evidence for the intractability
                 of specific problems in NP by showing that they are
                 universal for the entire class. Amazingly enough,
                 NP-complete problems exist, and furthermore hundreds of
                 natural computational problems arising in many
                 different areas of mathematics and science are
                 NP-complete.",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Computer algorithms;
                 Approximation theory; Polynomials",
  tableofcontents = "1. Computational tasks and models \\
                 2. The P versus NP Question \\
                 3. Polynomial-time reductions \\
                 4. NP-completeness \\
                 5. Three relatively advanced topics \\
                 Epilogue: a brief overview of complexity theory",
}

@Book{Goodrich:1997:DSA,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Data Structures and Algorithms in {Java}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 738",
  year =         "1997",
  ISBN =         "0-471-19308-9 (paperback)",
  ISBN-13 =      "978-0-471-19308-1 (paperback)",
  LCCN =         "QA76.73.J38 G66 1997",
  bibdate =      "Thu Mar 22 12:04:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0706/97039794-d.html;
                 http://www.loc.gov/catdir/toc/onix01/97039794.html",
  acknowledgement = ack-nhfb,
  subject =      "Java (Computer program language); Data structures
                 (Computer science); Computer algorithms",
}

@Book{Goodrich:2001:DSA,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Data Structures and Algorithms in {Java}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Second",
  pages =        "xiii + 641",
  year =         "2001",
  ISBN =         "0-471-38367-8 (hardcover)",
  ISBN-13 =      "978-0-471-38367-3 (hardcover)",
  LCCN =         "QA76.73.J38 G66 2001",
  bibdate =      "Thu Mar 22 12:04:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/wiley043/00043294.html;
                 http://www.loc.gov/catdir/description/wiley035/00043294.html;
                 http://www.loc.gov/catdir/toc/onix07/00043294.html",
  acknowledgement = ack-nhfb,
  subject =      "Java (Computer program language); Data structures
                 (Computer science); Computer algorithms",
}

@Book{Goodrich:2002:ADF,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Algorithm Design: Foundations, Analysis, and
                 {Internet} Examples",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 708",
  year =         "2002",
  ISBN =         "0-471-38365-1",
  ISBN-13 =      "978-0-471-38365-9",
  LCCN =         "QA76.9.A43 G67 2002",
  bibdate =      "Fri Mar 23 11:40:13 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/wiley034/2002265982.html;
                 http://www.loc.gov/catdir/toc/wiley022/2002265982.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Data structures (Computer
                 science)",
}

@Book{Goodrich:2004:DSA,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Data Structures and Algorithms in {Java}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Third",
  pages =        "xvii + 681",
  year =         "2004",
  ISBN =         "0-471-46983-1 (hardcover)",
  ISBN-13 =      "978-0-471-46983-4 (hardcover)",
  LCCN =         "QA76.73.J38 G66 2004",
  bibdate =      "Thu Mar 22 12:04:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/bios/wiley046/2003071070.html;
                 http://www.loc.gov/catdir/description/wiley041/2003071070.html;
                 http://www.loc.gov/catdir/toc/wiley041/2003071070.html",
  acknowledgement = ack-nhfb,
  subject =      "Java (Computer program language); Data structures
                 (Computer science); Computer algorithms",
}

@Book{Goodrich:2006:DSA,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Data Structures and Algorithms in {Java}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Fourth",
  pages =        "xxii + 696",
  year =         "2006",
  ISBN =         "0-471-73884-0",
  ISBN-13 =      "978-0-471-73884-8",
  LCCN =         "QA76.73.J38 G66 2006",
  bibdate =      "Thu Mar 22 12:04:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0627/2005282681-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0627/2005282681-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0627/2005282681-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Java (Computer program language); Data structures
                 (Computer science); Computer algorithms",
}

@Book{Goodrich:2010:DSA,
  author =       "Michael T. Goodrich and Roberto Tamassia",
  title =        "Data Structures and Algorithms in {Java}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  edition =      "Fifth",
  pages =        "xxii + 714",
  year =         "2010",
  ISBN =         "0-470-38326-7 (hardcover), 0-470-39880-9 (paperback)",
  ISBN-13 =      "978-0-470-38326-1 (hardcover), 978-0-470-39880-7
                 (paperback)",
  LCCN =         "QA76.73.J38 G66 2010",
  bibdate =      "Thu Mar 22 12:04:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Java (Computer program language); Data structures
                 (Computer science); Computer algorithms",
}

@Book{Gradel:2002:ALI,
  author =       "Erich Gr{\"a}del and Wolfgang Thomas and Thomas
                 Wilke",
  title =        "Automata, Logics, and Infinite Games",
  volume =       "2500",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 385",
  year =         "2002",
  ISBN =         "3-540-00388-6",
  ISBN-13 =      "978-3-540-00388-5",
  LCCN =         "QA76.9.M35 A85 2002",
  bibdate =      "Thu Mar 22 11:39:45 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Lecture notes in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2002044587-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Mathematics; Machine theory; Logic,
                 Symbolic and mathematical; Game theory",
}

@Book{Graham:1989:CM,
  author =       "Ronald L. Graham and Donald E. Knuth and Oren
                 Patashnik",
  title =        "Concrete Mathematics",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiii + 625",
  year =         "1989",
  ISBN =         "0-201-14236-8",
  ISBN-13 =      "978-0-201-14236-5",
  LCCN =         "QA39.2 .G7331 1989",
  MRclass =      "00A05 (00-01 05-01 68-01 68Rxx)",
  MRnumber =     "91f:00001",
  MRreviewer =   "Volker Strehl",
  bibdate =      "Wed Dec 15 08:01:55 1993",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  acknowledgement = ack-nhfb,
  keywords =     "computer science -- mathematics; mathematics",
  remark-1 =     "Second printing, revised, January 1989. Third
                 printing, revised, May 1989. Fourth printing, revised,
                 January 1990. Fifth printing, revised, July 1990. Sixth
                 printing, revised, October 1990. Seventh printing,
                 revised, December 1991. Eighth printing, revised,
                 October 1992.",
  remark-2 =     "See translations
                 \cite{Knuth:1990:JTS,Knuth:1991:JTS,Knuth:1992:MD,Knuth:1992:xx,Knuth:1993:KS,Knuth:199x:xxc}.",
  shorttableofcontents = "1: Recurrent Problems / 1 \\
                 2: Sums / 21 \\
                 3: Integer Functions / 67 \\
                 4: Number Theory / 102 \\
                 5: Binomial Coefficients / 153 \\
                 6: Special Numbers / 243 \\
                 7: Generating Functions / 306 \\
                 8: Discrete Probability / 367 \\
                 9: Asymptotics / 425 \\
                 A: Answers to Exercises / 483 \\
                 B: Bibliography / 578 \\
                 C: Credits for Exercises / 601 \\
                 Index / 606 \\
                 List of Tables / 624",
  tableofcontents = "1: Recurrent Problems / 1 \\
                 1.1 The Tower of Hanoi / 1 \\
                 1.2 Lines in the Plane / 4 \\
                 1.3 The Josephus Problem / 8 \\
                 Exercises / 17 \\
                 2: Sums / 21 \\
                 2.1 Notation / 21 \\
                 2.2 Sums and Recurrences / 25 \\
                 2.3 Manipulation of Sums / 30 \\
                 2.4 Multiple Sums / 34 \\
                 2.5 General Methods / 41 \\
                 2.6 Finite and Infinite Calculus / 47 \\
                 2.7 Infinite Sums / 56 \\
                 Exercises / 62 \\
                 3: Integer Functions / 67 \\
                 3.1 Floors and Ceilings / 67 \\
                 3.2 Floor/Ceiling Applications / 70 \\
                 3.3 Floor/Ceiling Recurrences / 78 \\
                 3.4 `mod': The Binary Operation / 81 \\
                 3.5 Floor/Ceiling Sums / 86 \\
                 Exercises / 95 \\
                 4: Number Theory / 102 \\
                 4.1 Divisibility / 102 \\
                 4.2 Primes / 105 \\
                 4.3 Prime Examples / 107 \\
                 4.4 Factorial Factors / 111 \\
                 4.5 Relative Primality / 115 \\
                 4.6 `mod': The Congruence Relation / 123 \\
                 4.7 Independent Residues / 126 \\
                 4.8 Additional Applications / 129 \\
                 4.9 Phi and Mu / 133 \\
                 Exercises / 144 \\
                 5: Binomial Coefficients / 153 \\
                 5.1 Basic Identities / 153 \\
                 5.2 Basic Practice / 172 \\
                 5.3 Tricks of the Trade / 186 \\
                 5.4 Generating Functions / 196 \\
                 5.5 Hypergeometric Functions / 204 \\
                 5.6 Hypergeometric Transformations / 216 \\
                 5.7 Partial Hypergeometric Sums / 223 \\
                 Exercises / 230 \\
                 6: Special Numbers / 243 \\
                 6.1 Stirling Numbers / 243 \\
                 6.2 Eulerian Numbers / 253 \\
                 6.3 Harmonic Numbers / 258 \\
                 6.4 Harmonic Summation / 265 \\
                 6.5 Bernoulli Numbers / 269 \\
                 6.6 Fibonacci Numbers / 276 \\
                 6.7 Continuants / 287 \\
                 Exercises / 295 \\
                 7: Generating Functions / 306 \\
                 7.1 Domino Theory and Change / 306 \\
                 7.2 Basic Maneuvers / 317 \\
                 7.3 Solving Recurrences / 323 \\
                 7.4 Special Generating Functions / 336 \\
                 7.5 Convolutions / 339 \\
                 7.6 Exponential Generating Functions / 350 \\
                 7.7 Dirichlet Generating Functions / 356 \\
                 Exercises / 357 \\
                 8: Discrete Probability / 367 \\
                 8.1 Definitions / 367 \\
                 8.2 Mean and Variance / 373 \\
                 8.3 Probability Generating Functions / 380 \\
                 8.4 Flipping Coins / 387 \\
                 8.5 Hashing / 397 \\
                 Exercises / 413 \\
                 9: Asymptotics / 425 \\
                 9.1 A Hierarchy / 426 \\
                 9.2 0 Notation / 429 \\
                 9.3 0 Manipulation / 436 \\
                 9.4 Two Asymptotic Tricks / 449 \\
                 9.5 Euler's Summation Formula / 455 \\
                 9.6 Final Summations / 462 \\
                 Exercises / 475 \\
                 A: Answers to Exercises / 483 \\
                 B: Bibliography / 578 \\
                 C: Credits for Exercises / 601 \\
                 Index / 606 \\
                 List of Tables / 624",
}

@Book{Gratzer:1978:GLTa,
  author =       "George A. Gr{\"a}tzer",
  title =        "General Lattice Theory",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xiii + 381",
  year =         "1978",
  ISBN =         "3-7643-0813-3",
  ISBN-13 =      "978-3-7643-0813-1",
  LCCN =         "QA171.5 .G7",
  bibdate =      "Thu Mar 22 12:16:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "78.00F",
  series =       "Lehrb{\"u}cher und Monographien aus dem Gebiete der
                 exakten Wissenschaften: Mathematische Reihe; Bd. 52",
  acknowledgement = ack-nhfb,
  subject =      "Lattice theory",
}

@Book{Gratzer:1978:GLTb,
  author =       "George A. Gr{\"a}tzer",
  title =        "General Lattice Theory",
  volume =       "75",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xiii + 381",
  year =         "1978",
  ISBN =         "0-12-295750-4",
  ISBN-13 =      "978-0-12-295750-5",
  LCCN =         "QA3 .P8 vol. 75",
  bibdate =      "Thu Mar 22 12:16:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Pure and applied mathematics: a series of monographs
                 and textbooks",
  acknowledgement = ack-nhfb,
  subject =      "Lattice theory",
}

@Book{Gratzer:1998:GLT,
  author =       "George A. Gr{\"a}tzer",
  title =        "General Lattice Theory",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "xix + 663",
  year =         "1998",
  ISBN =         "3-7643-5239-6 (Basel: hardcover), 0-8176-5239-6
                 (Boston: hardcover)",
  ISBN-13 =      "978-3-7643-5239-4 (Basel: hardcover),
                 978-0-8176-5239-5 (Boston: hardcover)",
  LCCN =         "QA171.5 .G7 1998",
  bibdate =      "Thu Mar 22 12:16:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "With new appendices with B. A. Davey and others.",
  acknowledgement = ack-nhfb,
  subject =      "Lattice theory",
}

@Book{Green:2009:PWA,
  author =       "Judy Green and Jeanne LaDuke",
  title =        "Pioneering Women in {American} Mathematics: the
                 pre-1940 {PhD}'s",
  volume =       "34",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xviii + 349",
  year =         "2009",
  ISBN =         "0-8218-4376-1 (hardcover)",
  ISBN-13 =      "978-0-8218-4376-5 (hardcover)",
  LCCN =         "QA28 .G74 2009",
  bibdate =      "Fri Mar 23 10:31:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "History of mathematics",
  acknowledgement = ack-nhfb,
  subject =      "women mathematicians; United States; history; women in
                 higher education; women pioneers",
  tableofcontents = "Introduction \\
                 Family background and precollege education \\
                 Undergraduate education \\
                 Graduate education \\
                 Employment issues \\
                 Career patterns \\
                 Scholarly and professional contributions \\
                 Epilogue",
}

@Book{Greene:1981:MAA,
  author =       "Daniel H. Greene and Donald Ervin Knuth",
  title =        "Mathematics for the Analysis of Algorithms",
  volume =       "1",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "107",
  year =         "1981",
  ISBN =         "3-7643-3046-5",
  ISBN-13 =      "978-3-7643-3046-0",
  LCCN =         "QA76.6 .G7423",
  bibdate =      "Thu Mar 22 12:37:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Computer algorithms",
}

@Book{Greene:1982:MAA,
  author =       "Daniel H. Greene and Donald E. Knuth",
  title =        "Mathematics for the Analysis of Algorithms",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "123",
  year =         "1982",
  ISBN =         "3-7643-3102-X",
  ISBN-13 =      "978-3-7643-3102-3",
  LCCN =         "QA76.6 .G7423 1982",
  bibdate =      "Tue Dec 14 22:54:24 1993",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/hash.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  acknowledgement = ack-nhfb,
  descriptor =   "Algorithmus, Asymptotische Analyse, Erzeugende
                 Funktion, Identitaet, Komplexitaetsanalyse, Mathematik,
                 Operationsmethode, Rekursionsformel",
  keywords =     "computer algorithms; electronic digital computers --
                 programming",
  remark =       "{Mathematische Methoden zur Aufwandsabschaetzung von
                 Algorithmen. Allgemein Dargestellt, Aber Haeufig durch
                 Beispiele Motiviert (z.b. Zeitaufwand von
                 Hash-verfahren). Zum Teil Vertiefende Darstellung der
                 "optionalen" Kapitel aus "the Art of Computer
                 Programming, Band 3". Themengebiete: Rechnen MIT
                 Binomialkoeffizienten, Geschlossene Darstellungen fuer
                 Rekurrente Relationen, Operatormethoden, Herleitung
                 Asymptotischer Abschaetzungen}.",
  shorttableofcontents = "1: Binomial Identities / 5 \\
                 2: Recurrence Relations / 15 \\
                 3: Operator Methods / 35 \\
                 4: Asymptotic Analysis / 46 \\
                 5: Bibliography / 81 \\
                 6: Appendices / 85 \\
                 A: Lectures / 85 \\
                 B: Homework Assignments / 87 \\
                 C: Midterm Exam I and Solutions / 88 \\
                 D: Final Exam I and Solutions / 99 \\
                 E: Midterm Exam II and Solutions / 105 \\
                 F: Final Exam II and Solutions / 111 \\
                 G: A Qualifying Exam Problem and Solution / 115 \\
                 7: Index / 120",
  tableofcontents = "1: Binomial Identities / 5 \\
                 1.1 Summary of Useful Identities / 5 \\
                 1.2 Deriving the Identities / 7 \\
                 1.3 Inverse Relations / 9 \\
                 1.4 Operator Calculus / 12 \\
                 1.5 Hypergeometric Series / 13 \\
                 1.6 Identities with the Harmonic Numbers / 14 \\
                 2: Recurrence Relations / 15 \\
                 2.1 Linear Recurrence Relations / 15 \\
                 2.1.1 Finite History / 16 \\
                 2.1.1.1 Constant Coefficients / 16 \\
                 2.1.1.2 Variable Coefficients / 18 \\
                 2.1.2 Full History / 21 \\
                 2.1.2.1 Differencing / 21 \\
                 2.1.2.2 By Repertoire / 21 \\
                 2.2 Nonlinear Recurrence Relations / 25 \\
                 2.2.1 Relations with Maximum or Minimum Functions / 25
                 \\
                 2.2.2 Continued Fractions / 29 \\
                 2.2.3 Doubly Exponential Sequences / 31 \\
                 3: Operator Methods / 35 \\
                 3.1 The Cookie Monster / 35 \\
                 3.2 Coalesced Hashing / 38 \\
                 3.3 Open Addressing: Uniform Hashing / 42 \\
                 3.4 Open Addressing: Secondary Clustering / 43 \\
                 4: Asymptotic Analysis / 46 \\
                 4.1 Basic Concepts / 46 \\
                 4.1.1 Notation / 47 \\
                 4.1.2 Bootstrapping / 47 \\
                 4.1.3 Dissecting / 48 \\
                 4.1.4 Limits of Limits / 49 \\
                 4.1.5 Summary of Useful Asymptotic Expansions / 51 \\
                 4.1.6 An Example / 52 \\
                 4.2 Stieltjes Integration / 59 \\
                 4.2.1 $O$-notation and Integrals / 61 \\
                 4.2.2 Euler's Summation Formula / 62 \\
                 4.2.3 A Number Theory Example / 63 \\
                 4.3 Asymptotics from Generating Functions / 69 \\
                 4.3.1 Darboux's Method / 69 \\
                 4.3.2 Residue Calculus / 72 \\
                 4.3.3 The Saddle Point Method / 74 \\
                 5: Bibliography / 81 \\
                 6: Appendices / 85 \\
                 A: Lectures / 85 \\
                 B: Homework Assignments / 87 \\
                 C: Midterm Exam I and Solutions / 88 \\
                 D: Final Exam I and Solutions / 99 \\
                 E: Midterm Exam II and Solutions / 105 \\
                 F: Final Exam II and Solutions / 111 \\
                 G: A Qualifying Exam Problem and Solution / 115 \\
                 7: Index / 120",
}

@Book{Greene:1990:MAA,
  author =       "Daniel H. Greene and Donald Ervin Knuth",
  title =        "Mathematics for the Analysis of Algorithms",
  volume =       "1",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Third",
  pages =        "viii + 132",
  year =         "1990",
  ISBN =         "0-8176-3515-7 (U.S.), 3-7643-3515-7 (Germany)",
  ISBN-13 =      "978-0-8176-3515-2 (U.S.), 978-3-7643-3515-1
                 (Germany)",
  LCCN =         "QA76.6 .G7423 1990",
  bibdate =      "Thu Mar 22 12:37:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Computer algorithms",
}

@Book{Greene:2007:MAA,
  author =       "Daniel H. Greene and Donald Ervin Knuth",
  title =        "Mathematics for the Analysis of Algorithms",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Third",
  pages =        "viii + 132",
  year =         "2007",
  ISBN =         "0-8176-4728-7, 0-8176-4729-5",
  ISBN-13 =      "978-0-8176-4728-5, 978-0-8176-4729-2",
  LCCN =         "QA76.6 .G7423 2008",
  bibdate =      "Thu Mar 22 12:37:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Modern Birkh{\"a}user Classics",
  acknowledgement = ack-nhfb,
}

@Book{Grosse-Rhode:2004:SIH,
  author =       "Martin Gro{\ss}e-Rhode",
  title =        "Semantic Integration of Heterogeneous Software
                 Specifications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 327",
  year =         "2004",
  ISBN =         "3-540-40257-8",
  ISBN-13 =      "978-3-540-40257-2",
  LCCN =         "QA76.76.D47 G79 2004",
  bibdate =      "Thu Mar 22 12:59:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003069097-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003069097-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003069097-t.html",
  acknowledgement = ack-nhfb,
  subject =      "computer software; development; specifications;
                 computer science",
}

@Book{Gunter:1992:SPL,
  author =       "Carl A. Gunter",
  title =        "Semantics of Programming Languages: Structures and
                 Techniques",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 419",
  year =         "1992",
  ISBN =         "0-262-07143-6",
  ISBN-13 =      "978-0-262-07143-7",
  LCCN =         "QA76.7 .G86 1992",
  bibdate =      "Thu Mar 22 10:48:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  series =       "Foundations of computing",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers);
                 Semantics",
}

@Book{Gusfield:1997:AST,
  author =       "Dan Gusfield",
  title =        "Algorithms on Strings, Trees, and Sequences: Computer
                 Science and Computational Biology",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xviii + 534",
  year =         "1997",
  ISBN =         "0-521-58519-8 (hardcover)",
  ISBN-13 =      "978-0-521-58519-4 (hardcover)",
  LCCN =         "QA76.9.A43 G87 1997",
  bibdate =      "Thu Mar 22 11:35:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam028/96046612.html;
                 http://www.loc.gov/catdir/toc/cam023/96046612.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computational biology; Molecular
                 biology; Data processing",
}

@Book{Halpern:2003:RAU,
  author =       "Joseph Y. Halpern",
  title =        "Reasoning About Uncertainty",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 483",
  year =         "2003",
  ISBN =         "0-262-08320-5 (hardcover)",
  ISBN-13 =      "978-0-262-08320-1 (hardcover)",
  LCCN =         "Q375 .H35 2003",
  bibdate =      "Thu Mar 22 12:55:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Uncertainty (Information theory); Reasoning; Logic,
                 Symbolic and mathematical",
}

@Book{Hankerson:2000:CTC,
  author =       "Darrel R. Hankerson and D. G. Hoffman and D. A.
                 Leonard",
  title =        "Coding Theory and Cryptography: the Essentials",
  volume =       "234",
  publisher =    pub-DEKKER,
  address =      pub-DEKKER:adr,
  edition =      "Second",
  pages =        "x + 350",
  year =         "2000",
  ISBN =         "0-8247-0465-7",
  ISBN-13 =      "978-0-8247-0465-0",
  LCCN =         "QA268 .C675 2000",
  bibdate =      "Fri Mar 23 10:23:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Monographs and textbooks in pure and applied
                 mathematics; Pure and applied mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
  tableofcontents = "Coding theory: introduction to coding theory \\
                 Linear codes \\
                 Perfect and related codes \\
                 Cyclic linear codes \\
                 BCH codes \\
                 Reed-Solomon codes \\
                 Burst error-correcting codes \\
                 Convolutional codes \\
                 Reed-Muller and Preparata codes. Cryptography:
                 classical cryptography \\
                 Topics in algebra and number theory \\
                 Public-key cryptography. Appendices: the Euclidean
                 algorithm \\
                 Factorization of $1 + x^n$ \\
                 Example of compact disc encoding \\
                 Solutions to selected exercises",
}

@Book{Hankin:1994:LCG,
  author =       "Chris Hankin",
  title =        "Lambda calculi: a guide for computer scientists",
  volume =       "3",
  publisher =    pub-CLARENDON,
  address =      pub-CLARENDON:adr,
  pages =        "xiii + 162",
  year =         "1994",
  ISBN =         "0-19-853841-3, 0-19-853840-5",
  ISBN-13 =      "978-0-19-853841-7, 978-0-19-853840-0",
  LCCN =         "QA9.5 .H36 1994",
  bibdate =      "Fri Mar 23 12:10:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Graduate texts in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Lambda calculus",
}

@Book{Hardy:2001:CQC,
  author =       "Yorick Hardy and W.-H. Steeb",
  title =        "Classical and Quantum Computing: with {C++} and {Java}
                 Simulations",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xxiii + 589",
  year =         "2001",
  ISBN =         "3-7643-6610-9",
  ISBN-13 =      "978-3-7643-6610-0",
  LCCN =         "QA76.73.C153 H367 2001",
  bibdate =      "Fri Mar 23 11:59:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2001052712-d.html",
  acknowledgement = ack-nhfb,
  subject =      "C++ (Computer program language); Java (Computer
                 program language)",
}

@Book{Hardy:2009:AAC,
  author =       "Darel W. Hardy and Carol L. Walker and Fred Richman",
  title =        "Applied algebra: codes, ciphers, and discrete
                 algorithms",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  edition =      "Second",
  pages =        "410",
  year =         "2009",
  ISBN =         "1-4200-7142-4 (hardcover)",
  ISBN-13 =      "978-1-4200-7142-9 (hardcover)",
  LCCN =         "QA268 .H365 2009",
  bibdate =      "Sat Jun 13 08:24:16 MDT 2009",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  acknowledgement = ack-nhfb,
  remark =       "A Chapman and Hall book.",
  subject =      "Coding theory; Computer security; Mathematics",
}

@Book{Harel:1979:FOD,
  author =       "David Harel",
  title =        "First-Order Dynamic Logic",
  volume =       "68",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "133",
  year =         "1979",
  ISBN =         "0-387-09237-4",
  ISBN-13 =      "978-0-387-09237-9",
  LCCN =         "QA76.6 .H34 1979",
  bibdate =      "Thu Mar 22 12:12:44 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Lecture notes in computer science",
  acknowledgement = ack-nhfb,
  remark =       "Revised version of the author's thesis, MIT, 1978.",
  subject =      "Computer programming; Logic, Symbolic and
                 mathematical; Recursion theory",
}

@Book{Harel:2000:DL,
  author =       "David Harel and Dexter Kozen and Jerzy Tiuryn",
  title =        "Dynamic Logic",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xv + 459",
  year =         "2000",
  ISBN =         "0-262-08289-6 (hardcover)",
  ISBN-13 =      "978-0-262-08289-1 (hardcover)",
  LCCN =         "QA76.9.L63 H37 2000",
  bibdate =      "Fri Mar 23 11:01:37 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Foundations of computing",
  acknowledgement = ack-nhfb,
  subject =      "Computer logic; Formal methods (Computer science)",
}

@Book{Harris:2000:CGT,
  author =       "John M. (John Michael) Harris and Jeffry L. Hirst and
                 Michael J. Mossinghoff",
  title =        "Combinatorics and Graph Theory",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 225",
  year =         "2000",
  ISBN =         "0-387-98736-3",
  ISBN-13 =      "978-0-387-98736-1",
  LCCN =         "QA165 .H37 2000",
  bibdate =      "Thu Mar 22 11:50:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/99049806-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0816/99049806-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Graph theory",
}

@Book{Harris:2008:CGT,
  author =       "John M. (John Michael) Harris and Jeffry L. Hirst and
                 Michael J. Mossinghoff",
  title =        "Combinatorics and Graph Theory",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xv + 381",
  year =         "2008",
  ISBN =         "0-387-79710-6",
  ISBN-13 =      "978-0-387-79710-6",
  LCCN =         "QA165 .H37 2008",
  bibdate =      "Thu Mar 22 11:50:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics, 0172-6056",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0907/2008934034-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0907/2008934034-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Graph theory",
}

@Book{Hayes:2008:GTB,
  author =       "Brian Hayes",
  title =        "Group Theory in the Bedroom and Other Mathematical
                 Diversions",
  publisher =    "Hill and Wang",
  address =      "New York, NY, USA",
  pages =        "xi + 269",
  year =         "2008",
  ISBN =         "0-8090-5219-9 (hardcover)",
  ISBN-13 =      "978-0-8090-5219-6 (hardcover)",
  LCCN =         "T185 .H39 2008",
  bibdate =      "Thu Mar 22 12:19:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0740/2007023337-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0740/2007023337-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Technology; Science",
}

@Book{Hazay:2010:EST,
  author =       "Carmit Hazay and Yehuda Lindell",
  title =        "Efficient Secure Two-Party Protocols: Techniques and
                 Constructions",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 263",
  year =         "2010",
  ISBN =         "3-642-14302-4 (hardcover), 3-642-14303-2 (e-book)",
  ISBN-13 =      "978-3-642-14302-1 (hardcover), 978-3-642-14303-8
                 (e-book)",
  ISSN =         "1619-7100",
  LCCN =         "Z103 .H39 2010eb",
  bibdate =      "Fri Mar 23 10:32:15 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Information security and cryptography: texts and
                 monographs",
  acknowledgement = ack-nhfb,
  subject =      "Cryptography",
  tableofcontents = "Part 1. Introduction and definitions \\
                 Part 2. General constructions \\
                 Part 3. Specific constructions",
}

@Book{Hearn:2009:GPC,
  author =       "Robert A. Hearn and Erik D. Demaine",
  title =        "Games, Puzzles, and Computation",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "ix + 237",
  year =         "2009",
  ISBN =         "1-56881-322-8 (hardcover)",
  ISBN-13 =      "978-1-56881-322-6 (hardcover)",
  LCCN =         "QA63 .H35 2009",
  bibdate =      "Fri Mar 23 10:31:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "problem solving; mathematical models; games; logic,
                 symbolic and mathematical",
}

@Book{Hemaspaandra:2003:TSF,
  author =       "Lane A. Hemaspaandra and Leen Torenvliet",
  title =        "Theory of Semi-Feasible Algorithms",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 148",
  year =         "2003",
  ISBN =         "3-540-42200-5",
  ISBN-13 =      "978-3-540-42200-6",
  LCCN =         "QA76.9.A43 H46 2003",
  bibdate =      "Thu Mar 22 13:07:37 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/2002029158-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computational complexity",
}

@Book{Herbrich:2002:LKC,
  author =       "Ralf Herbrich",
  title =        "Learning Kernel Classifiers: Theory and Algorithms",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xx + 364",
  year =         "2002",
  ISBN =         "0-262-08306-X (hardcover)",
  ISBN-13 =      "978-0-262-08306-5 (hardcover)",
  LCCN =         "Q325.5 .H48 2002",
  bibdate =      "Thu Mar 22 11:36:19 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Adaptive computation and machine learning",
  acknowledgement = ack-nhfb,
  subject =      "Machine learning; Algorithms",
}

@Book{Hesselink:1992:PRU,
  author =       "Wim H. Hesselink",
  title =        "Programs, Recursion, and Unbounded Choice:
                 Predicate-Transformation Semantics and Transformation
                 Rules",
  volume =       "27",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 223",
  year =         "1992",
  ISBN =         "0-521-40436-3",
  ISBN-13 =      "978-0-521-40436-5",
  LCCN =         "QA76.6 .H483 1992",
  bibdate =      "Thu Mar 22 11:07:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/92232354.html;
                 http://www.loc.gov/catdir/toc/cam029/92232354.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming",
  tableofcontents = "List of symbols \\
                 Introduction \\
                 1. Weakest preconditions \\
                 2. Annotation, recursion and repetition \\
                 3. Healthiness laws \\
                 4. Semantics of recursion \\
                 5. Ramifications \\
                 6. Relational semantics \\
                 7. Determinacy and disjunctivity \\
                 8. Syntactic criteria \\
                 9. Operational semantics of recursion \\
                 10. Procedure substitutions \\
                 11. Induction and semantic equality \\
                 12. Induction and refinement \\
                 13. The strong preorder \\
                 14. Temporal operators \\
                 15. Predicative fairness \\
                 16. Solutions of exercises \\
                 References \\
                 Index of concepts and identifiers",
}

@Book{Hindley:1997:BST,
  author =       "J. Roger Hindley",
  title =        "Basic Simple Type Theory",
  volume =       "42",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 186",
  year =         "1997",
  ISBN =         "0-521-46518-4",
  ISBN-13 =      "978-0-521-46518-2",
  LCCN =         "QA76.7 .H55 1997",
  bibdate =      "Thu Mar 22 11:41:06 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam027/95009058.html;
                 http://www.loc.gov/catdir/samples/cam034/95009058.html;
                 http://www.loc.gov/catdir/toc/cam027/95009058.html",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers); Type
                 theory",
}

@Book{Hinek:2010:CRV,
  author =       "M. Jason Hinek",
  title =        "Cryptanalysis of {RSA} and Its Variants",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xviii + 268",
  year =         "2010",
  ISBN =         "1-4200-7518-7 (hardcover)",
  ISBN-13 =      "978-1-4200-7518-2 (hardcover)",
  LCCN =         "TK5102.94 .H56 2010",
  bibdate =      "Thu Mar 22 12:01:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC cryptography and network
                 security",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication; Security measures; Mathematics;
                 Public key cryptography; Computer security",
}

@Book{Hirvensalo:2001:QC,
  author =       "Mika Hirvensalo",
  title =        "Quantum Computing",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 190",
  year =         "2001",
  ISBN =         "3-540-66783-0",
  ISBN-13 =      "978-3-540-66783-4",
  LCCN =         "QA76.889 .H57 2001",
  bibdate =      "Thu Mar 22 12:14:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Natural computing series",
  acknowledgement = ack-nhfb,
  subject =      "Quantum computers",
  tableofcontents = "1. Introduction \\
                 1.1. A Brief History of Quantum Computation \\
                 1.2. Classical Physics \\
                 1.3. Probabilistic Systems \\
                 1.4. Quantum Mechanics \\
                 2. Devices for Computation \\
                 2.1. Classical Computational Models \\
                 2.2. Quantum Information \\
                 2.3. Circuits \\
                 3. Fast Factorization \\
                 3.1. Quantum Fourier Transform \\
                 3.2. Shor's Algorithm for Factoring Numbers \\
                 3.3. The Correctness Probability \\
                 3.4. Exercises \\
                 4. Finding the Hidden Subgroup \\
                 4.1. Generalized Simon's Algorithm \\
                 4.2. Examples \\
                 4.3. Exercises \\
                 5. Grover's Search Algorithm \\
                 5.1. Search Problems \\
                 5.2. Grover's Amplification Method \\
                 5.3. Utilizing Grover's Search Method \\
                 6. Complexity Lower Bounds for Quantum Circuits \\
                 6.1. General Idea \\
                 6.2. Polynomial Representations \\
                 6.3. Quantum Circuit Lower Bound \\
                 7. Appendix A: Quantum Physics \\
                 7.1. A Brief History of Quantum Theory \\
                 7.2. Mathematical Framework for Quantum Theory \\
                 7.3. Quantum States as Hilbert Space Vectors \\
                 7.4. Quantum States as Operators \\
                 7.5. Exercises \\
                 8. Appendix B: Mathematical Background \\
                 8.1. Group Theory \\
                 8.2. Fourier Transforms \\
                 8.3. Linear Algebra \\
                 8.4. Number Theory \\
                 8.5. Shannon Entropy and Information \\
                 8.6. Exercises",
}

@Book{Hodge:2005:MVE,
  author =       "Jonathan K. Hodge and Richard E. Klima",
  title =        "The Mathematics of Voting and Elections: a Hands-On
                 Approach",
  volume =       "22",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiv + 226",
  year =         "2005",
  ISBN =         "0-8218-3798-2",
  ISBN-13 =      "978-0-8218-3798-6",
  LCCN =         "JF1001 .H63 2005",
  bibdate =      "Fri Mar 23 10:29:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Mathematical world, 1055-9426",
  acknowledgement = ack-nhfb,
  subject =      "Voting; Mathematical models; Elections; Social choice;
                 Game theory; Social sciences",
  tableofcontents = "What's so good about majority rule? \\
                 Perot, Nader, and other inconveniences \\
                 Back into the ring\\
                 Trouble in democracy \\
                 Explaining the impossible \\
                 One person, one vote? \\
                 Calculating corruption \\
                 The ultimate college experience \\
                 Trouble in direct democracy\\
                 Proportional (mis)representation \\
                 Bibliography \\
                 Index",
}

@Book{Hoffstein:2008:IMC,
  author =       "Jeffrey Hoffstein and Jill Catherine Pipher and Joseph
                 H. Silverman",
  title =        "An Introduction to Mathematical Cryptography",
  volume =       "666",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 523",
  year =         "2008",
  ISBN =         "0-387-77993-0 (hardcover)",
  ISBN-13 =      "978-0-387-77993-5 (hardcover)",
  LCCN =         "QA268 .H64 2008",
  bibdate =      "Thu Mar 22 12:29:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate texts in mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography; Mathematics",
  tableofcontents = "An introduction to cryptography \\
                 Discrete logarithms and Diffie-Hellman \\
                 Integer factorization and RSA \\
                 Combinatorics, probability, and information theory \\
                 Elliptic curves and cryptography \\
                 Lattices and cryptography \\
                 Digital signatures \\
                 Additional topics in cryptography",
}

@Book{Hopcroft:1979:IAT,
  author =       "John E. Hopcroft and Jeffrey D. Ullman",
  title =        "Introduction to Automata Theory, Languages, and
                 Computation",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "x + 418",
  year =         "1979",
  ISBN =         "0-201-02988-X",
  ISBN-13 =      "978-0-201-02988-8",
  LCCN =         "QA267 .H56",
  bibdate =      "Thu Mar 22 12:25:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$20.00",
  series =       "Addison-Wesley series in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Formal languages; Computational
                 complexity",
}

@Book{Hopcroft:2001:IATb,
  author =       "John E. Hopcroft and Rajeev Motwani and Jeffrey D.
                 Ullman",
  title =        "Introduction to Automata Theory, Languages, and
                 Computation",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  edition =      "Second",
  pages =        "xiv + 521",
  year =         "2001",
  ISBN =         "0-201-44124-1",
  ISBN-13 =      "978-0-201-44124-6",
  LCCN =         "QA267 .H56 2001",
  bibdate =      "Thu Mar 22 12:25:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Formal languages; Computational
                 complexity",
}

@Book{Hopcroft:2007:IAT,
  author =       "John E. Hopcroft and Rajeev Motwani and Jeffrey D.
                 Ullman",
  title =        "Introduction to Automata Theory, Languages, and
                 Computation",
  publisher =    "Pearson/Addison Wesley",
  address =      "Boston, MA, USA",
  edition =      "Third",
  pages =        "xvii + 535",
  year =         "2007",
  ISBN =         "0-321-45536-3, 0-321-46225-4, 0-321-45537-1 (student
                 access kit)",
  ISBN-13 =      "978-0-321-45536-9, 978-0-321-46225-1,
                 978-0-321-45537-6 (student access kit)",
  LCCN =         "QA267 .H56 2007",
  bibdate =      "Thu Mar 22 12:25:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0613/2006014263.html",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Formal languages; Computational
                 complexity",
}

@Book{Hromkovic:2003:AHP,
  author =       "Juraj Hromkovi{\v{c}}",
  title =        "Algorithmics for Hard Problems: Introduction to
                 Combinatorial Optimization, Randomization,
                 Approximation, and Heuristics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiii + 544",
  year =         "2003",
  ISBN =         "3-540-44134-4",
  ISBN-13 =      "978-3-540-44134-2",
  LCCN =         "QA76.58 .H76 2003",
  bibdate =      "Fri Mar 23 11:17:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2002032405-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2002032405-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers);
                 Computational complexity",
  tableofcontents = "1: Introduction \\
                 2: Elementary Fundamentals \\
                 3: Deterministic Approaches \\
                 4: Approximation Algorithms \\
                 5: Randomized Algorithms \\
                 6: Heuristics \\
                 7: A Guide to Solving Hard Problems",
}

@Book{Hromkovic:2009:AAH,
  author =       "Juraj Hromkovic",
  title =        "Algorithmic adventures: from knowledge to magic",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 363",
  year =         "2009",
  ISBN =         "3-540-85986-1",
  ISBN-13 =      "978-3-540-85986-4",
  LCCN =         "QA76.9.A43 H76 2009",
  bibdate =      "Tue May 7 09:24:29 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://site.ebrary.com/lib/upcatalunya/docDetail.action?docID=10313472",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface \\
                 Contents \\
                 A Short Story About the Development of Computer Science
                 or Why Computer Science Is Not a Computer Driving
                 Licence \\
                 Algorithmics, or What Have Programming and Baking in
                 Common? \\
                 Infinity Is Not Equal to Infinity, or Why Infinity Is
                 Infinitely Important in Computer Science \\
                 Limits of Computability or Why Do There Exist Tasks
                 That Cannot Be Solved Automatically by Computers \\
                 Complexity Theory or What to Do When the Energy of the
                 Universe Doesn't Suffice for Performing a Computation?
                 \\
                 Randomness in Nature and as a Source of Efficiency in
                 Algorithmics \\
                 Cryptography, or How to Transform Drawbacks into
                 Advantages \\
                 Computing with DNA Molecules, or Biological Computer
                 Technology on the Horizon \\
                 Quantum Computers, or Computing in the Wonderland of
                 Particles \\
                 How to Make Good Decisions for an Unknown Future or How
                 to Foil an Adversary \\
                 References \\
                 Index",
}

@Book{Hsu:2009:GTI,
  author =       "Lih-Hsing Hsu and Cheng-Kuan Lin",
  title =        "Graph theory and interconnection networks",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xiii + 706",
  year =         "2009",
  ISBN =         "1-4200-4481-8 (hardcover)",
  ISBN-13 =      "978-1-4200-4481-2 (hardcover)",
  LCCN =         "QA166 .H78 2009",
  bibdate =      "Tue May 7 10:17:33 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0817/2008019917.html",
  acknowledgement = ack-nhfb,
  subject =      "Graph theory",
  tableofcontents = "Front cover \\
                 Contents \\
                 Preface \\
                 Authors \\
                 Chapter 1. Fundamental Concepts \\
                 Chapter 2. Applications on Graph Isomorphisms \\
                 Chapter 3. Distance and Diameter \\
                 Chapter 4. Trees \\
                 Chapter 5. Eulerian Graphs and Digraphs \\
                 Chapter 6. Matchings and Factors \\
                 Chapter 7. Connectivity \\
                 Chapter 8. Graph Coloring \\
                 Chapter 9. Hamiltonian Cycles \\
                 Chapter 10. Planar Graphs \\
                 Chapter 11. Optimal $k$-Fault-Tolerant Hamiltonian
                 Graphs \\
                 Chapter 12. Optimal $1$-Fault-Tolerant Hamiltonian
                 Graphs \\
                 Chapter 13. Optimal $k$-Fault-Tolerant
                 Hamiltonian-Laceable Graphs \\
                 Chapter 14. Spanning Connectivity",
}

@Book{Huth:2001:SCS,
  author =       "Michael Huth",
  title =        "Secure communicating systems: design, analysis, and
                 implementation",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 283",
  year =         "2001",
  ISBN =         "0-521-80731-X",
  ISBN-13 =      "978-0-521-80731-9",
  LCCN =         "TK5102.85 .H88 2001",
  bibdate =      "Fri Mar 23 10:25:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10006816;
                 http://www.myilibrary.com?id=41927",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication; Security measures",
  tableofcontents = "1. Secure communication in modern information
                 societies \\
                 2. Public-key cryptography \\
                 3. Symmetric-key cryptography \\
                 4. Security protocol design and analysis \\
                 5. Optimal public-key encryption with RSA \\
                 6. Secure information-flow analysis",
}

@Book{Huttel:2010:TTI,
  author =       "Hans H{\"u}ttel",
  title =        "Transitions and Trees: an Introduction to Structural
                 Operational Semantics",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvii + 272",
  year =         "2010",
  ISBN =         "0-521-19746-5 (hardcover), 0-521-14709-3 (paperback)",
  ISBN-13 =      "978-0-521-19746-5 (hardcover), 978-0-521-14709-5
                 (paperback)",
  LCCN =         "QA76.7 .H88 2010",
  bibdate =      "Tue May 7 10:20:37 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1116/2010282941-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1116/2010282941-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1116/2010282941-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers);
                 Semantics",
  tableofcontents = "1. A question of semantics \\
                 2. Mathematical preliminaries \\
                 3. The basic principles \\
                 4. Basic imperative statements \\
                 5. Control structures \\
                 6. Blocks and procedures (1) \\
                 7. Parameters \\
                 8. Concurrent communicating processes \\
                 9. Structured declarations \\
                 10. Blocks and procedures (2) \\
                 11. Concurrent object-oriented languages \\
                 12. Functional programming languages \\
                 13. Typed programming languages \\
                 14. An introduction to denotational semantics \\
                 15. Recursive definitions",
}

@Book{Iosevich:2007:VTA,
  author =       "Alex Iosevich",
  title =        "A View From the Top: Analysis, Combinatorics and
                 Number Theory",
  volume =       "39",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 136",
  year =         "2007",
  ISBN =         "0-8218-4397-4 (paperback)",
  ISBN-13 =      "978-0-8218-4397-0 (paperback)",
  LCCN =         "QA295 .I57 2007",
  bibdate =      "Fri Mar 23 18:53:19 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Student mathematical library",
  acknowledgement = ack-nhfb,
  subject =      "inequalities (mathematics); combinatorial analysis;
                 number theory",
}

@Book{Jackson:2006:SAL,
  author =       "Daniel Jackson",
  title =        "Software Abstractions: Logic, Language, and Analysis",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvi + 350",
  year =         "2006",
  ISBN =         "0-262-10114-9",
  ISBN-13 =      "978-0-262-10114-1",
  LCCN =         "QA76.76.D47 J29 2006",
  bibdate =      "Fri Mar 23 10:30:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://library.stanford.edu/bks24\_id=12936",
  acknowledgement = ack-nhfb,
  subject =      "Computer software; Development",
}

@Book{Jain:1999:SLI,
  author =       "Sanjay Jain and Daniel Osherson and James S. Royer and
                 Arun Sharma",
  title =        "Systems That Learn: an Introduction to Learning
                 Theory",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  edition =      "Second",
  pages =        "xii + 317",
  year =         "1999",
  ISBN =         "0-262-10077-0 (hardcover)",
  ISBN-13 =      "978-0-262-10077-9 (hardcover)",
  LCCN =         "BF318 .O83 1999",
  bibdate =      "Thu Mar 22 13:03:11 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Learning, development, and conceptual change",
  acknowledgement = ack-nhfb,
  subject =      "Learning; Mathematical models; Learning, Psychology
                 of; Human information processing",
}

@Book{Jensen:1992:CPN,
  author =       "K. (Kurt) Jensen",
  title =        "Coloured {Petri} Nets: Basic Concepts, Analysis
                 Methods, and Practical Use",
  volume =       "26",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "????",
  year =         "1992--1997",
  ISBN =         "3-540-55597-8 (v. 1), 0-387-55597-8 (New York : v. 1),
                 3-540-58276-2 (v. 2 : acid-free), 0-387-58276-2 (New
                 York : v. 2 : acid-free), 3-540-62867-3 (v. 3)",
  ISBN-13 =      "978-3-540-55597-1 (v. 1), 978-0-387-55597-3 (New York
                 : v. 1), 978-3-540-58276-2 (v. 2 : acid-free),
                 978-0-387-58276-4 (New York : v. 2 : acid-free),
                 978-3-540-62867-5 (v. 3)",
  LCCN =         "QA267 .J46 1992",
  bibdate =      "Thu Mar 22 11:02:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "v. 1: EATCS monographs on theoretical computer
                 science; v. 2--3: Monographs in theoretical computer
                 science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/92227749-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/92227749-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Petri nets",
  tableofcontents = "v. 1. Basic concepts, analysis methods, and
                 practical use",
}

@Book{Johnsonbaugh:2003:A,
  author =       "Richard Johnsonbaugh and Marcus Schaefer",
  title =        "Algorithms",
  publisher =    "Pearson Education",
  address =      "Upper Saddle River, NJ, USA",
  pages =        "xiii + 752",
  year =         "2003",
  ISBN =         "0-02-360692-4, 0-13-122853-6, 81-317-0868-3",
  ISBN-13 =      "978-81-317-0868-2",
  LCCN =         "Q A76.9.A43 J67 2003",
  bibdate =      "Fri Mar 23 10:01:42 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
}

@Book{Joux:2009:AC,
  author =       "Antoine Joux",
  title =        "Algorithmic Cryptanalysis",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "501",
  year =         "2009",
  ISBN =         "1-4200-7002-9 (hardcover)",
  ISBN-13 =      "978-1-4200-7002-6 (hardcover)",
  LCCN =         "QA76.9.A43; QA76.9.A43 J693 2009",
  bibdate =      "Sat May 15 09:31:38 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.mit.edu:9909/mit01",
  series =       "Chapman and Hall/CRC cryptography and network
                 security",
  acknowledgement = ack-nhfb,
  remark =       "I. Background \\
                 1. A bird's-eye view of modern cryptography \\
                 2. Elementary number theory and algebra background \\
                 II. Algorithms \\
                 3. Linear algebra \\
                 4. Sieve algorithms \\
                 5. Brute force cryptanalysis \\
                 6. The birthday paradox: Sorting or not? \\
                 7. Birthday-based algorithms for functions \\
                 8. Birthday attacks through quadrisection \\
                 9. Fourier and Hadamard-Walsh transforms \\
                 10. Lattice reduction \\
                 11. Polynomial systems and Grabner base computations
                 \\
                 III. Applications \\
                 12. Attacks on stream ciphers \\
                 13. Lattice-based cryptanalysis \\
                 14. Elliptic curves and pairings \\
                 15. Index calculus algorithms..",
  subject =      "Computer algorithms; Cryptography",
}

@Book{Jungnickel:1999:GNA,
  author =       "D. (Dieter) Jungnickel",
  title =        "Graphs, Networks, and Algorithms",
  volume =       "5",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 589",
  year =         "1999",
  ISBN =         "3-540-63760-5",
  ISBN-13 =      "978-3-540-63760-8",
  LCCN =         "QA402.5 .J8913 1999",
  bibdate =      "Thu Mar 22 12:18:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the German by Tilla Schade. The
                 English edition is based on the third German edition
                 published by Bibliographisches Institut
                 Wissenschaftsverlag in 1994.",
  subject =      "Combinatorial optimization; Graph theory",
}

@Book{Jungnickel:2005:GNA,
  author =       "D. (Dieter) Jungnickel",
  title =        "Graphs, Networks, and Algorithms",
  volume =       "5",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 611",
  year =         "2005",
  ISBN =         "3-540-21905-6",
  ISBN-13 =      "978-3-540-21905-7",
  LCCN =         "QA402.5 .J8913 2005",
  bibdate =      "Thu Mar 22 12:18:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0826/2004112299-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0826/2004112299-t.html",
  acknowledgement = ack-nhfb,
  remark =       "Second, completely revised edition (based on the
                 translation of the third German edition by Tilla Schade
                 in collaboration with the author)",
  subject =      "Combinatorial optimization; Graph theory",
}

@Book{Jungnickel:2008:GNA,
  author =       "D. (Dieter) Jungnickel",
  title =        "Graphs, Networks, and Algorithms",
  volume =       "5",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xix + 650",
  year =         "2008",
  ISBN =         "3-540-72779-5",
  ISBN-13 =      "978-3-540-72779-8",
  LCCN =         "QA402.5 .J8913 2008",
  bibdate =      "Thu Mar 22 12:18:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  URL =          "http://www.loc.gov/catdir/toc/fy0804/2007929271.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial optimization; Graph theory",
}

@Book{Kahn:1967:CSSa,
  author =       "David Kahn",
  title =        "The Codebreakers: the Story of Secret Writing",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  pages =        "xvi + 1164",
  year =         "1967",
  LCCN =         "Z103 .K28",
  bibdate =      "Tue Dec 01 08:31:37 1998",
  bibsource =    "http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography;
                 http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/index-table-c.html#cryptography;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography/1000.html",
  acknowledgement = ack-nhfb,
  keywords =     "information hiding; steganography",
}

@Book{Kahn:1967:CSSb,
  author =       "David Kahn",
  title =        "The Codebreakers: the Story of Secret Writing",
  publisher =    pub-WEIDENFELD-NICOLSON,
  address =      pub-WEIDENFELD-NICOLSON:adr,
  pages =        "xvi + 1164",
  year =         "1967",
  LCCN =         "Z103 .K28 1967",
  bibdate =      "Tue Dec 01 08:35:10 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kahn:1974:C,
  author =       "David Kahn",
  title =        "The Codebreakers",
  publisher =    pub-WEIDENFELD-NICOLSON,
  address =      pub-WEIDENFELD-NICOLSON:adr,
  edition =      "Abridged",
  pages =        "xvi + 576",
  year =         "1974",
  ISBN =         "0-297-76785-2",
  ISBN-13 =      "978-0-297-76785-5",
  LCCN =         "Z103 .K28 1974",
  bibdate =      "Thu Jul 23 17:02:35 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
}

@Book{Kahn:1996:CSS,
  author =       "David Kahn",
  title =        "The Codebreakers: the Story of Secret Writing",
  publisher =    "Scribner",
  address =      "New York, NY, USA",
  edition =      "Revised",
  pages =        "xviii + 1181",
  year =         "1996",
  ISBN =         "0-684-83130-9",
  ISBN-13 =      "978-0-684-83130-5",
  LCCN =         "Z103 .K28 1996",
  bibdate =      "Thu Apr 29 18:02:15 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Tuchman:1966:ZT}.",
  acknowledgement = ack-nhfb,
}

@Book{Kaplan:1999:NNH,
  author =       "Robert Kaplan",
  title =        "The Nothing That Is: a Natural History of Zero",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "xii + 225",
  year =         "1999",
  ISBN =         "0-19-512842-7, 0-19-514237-3",
  ISBN-13 =      "978-0-19-512842-0, 978-0-19-514237-2",
  LCCN =         "QA141 .K36 1999",
  bibdate =      "Mon Dec 06 16:15:22 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  price =        "US\$22.00",
  acknowledgement = ack-nhfb,
}

@Book{Kasman:2005:RCS,
  author =       "Alex Kasman",
  title =        "Reality conditions: short mathematical fiction",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "ix + 247",
  year =         "2005",
  ISBN =         "0-88385-552-6",
  ISBN-13 =      "978-0-88385-552-2",
  LCCN =         "PS3611.A7854 R43 2005",
  bibdate =      "Fri Mar 23 12:44:15 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Spectrum series",
  URL =          "http://www.loc.gov/catdir/toc/fy0614/2005924781.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Fiction",
}

@Book{Katz:2008:IMC,
  author =       "Jonathan Katz and Yehuda Lindell",
  title =        "Introduction to Modern Cryptography",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xviii + 534",
  year =         "2008",
  ISBN =         "1-58488-551-3",
  ISBN-13 =      "978-1-58488-551-1",
  LCCN =         "QA76.9.A25 K36 2008",
  bibdate =      "Thu Mar 22 12:29:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC cryptography and network
                 security",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0807/2007017861-d.html;
                 http://www.loc.gov/catdir/toc/ecip0716/2007017861.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography",
}

@Book{Kenschaft:2005:CPS,
  author =       "Patricia C. Kenschaft",
  title =        "Change is Possible: Stories of Women and Minorities in
                 Mathematics",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "ix + 212",
  year =         "2005",
  ISBN =         "0-8218-3748-6",
  ISBN-13 =      "978-0-8218-3748-1",
  LCCN =         "QA10.5 .K46 2005",
  bibdate =      "Fri Mar 23 10:29:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Kenschaft, Patricia C; Mathematics; Vocational
                 guidance; United States; History; 20th century; Women
                 in mathematics; Minorities in mathematics;
                 Mathematicians; Biography",
  tableofcontents = "Introduction \\
                 With the help of good white men \\
                 Women and mathematics in the nineteenth century \\
                 The Twentieth century: Mathematics and marriage \\
                 African American mathematicians from the eighteenth
                 through the twentieth century \\
                 Latino mathematicians \\
                 Reawakening: The Association for Women in Mathematics
                 Skits tell what's happening around 1990 \\
                 Women in mathematics now (2004) \\
                 Minorities in mathematics now (2004) \\
                 Conclusions\\
                 Appendix to Chapter 5: The careers of 75 African
                 American mathematicians of New Jersey in mid-1985",
}

@Book{Khoussainov:2001:ATA,
  author =       "Bakhadyr Khoussainov and Anil Nerode",
  title =        "Automata Theory and Its Applications",
  volume =       "21",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xiv + 430",
  year =         "2001",
  ISBN =         "0-8176-4207-2 , 3-7643-4207-2",
  ISBN-13 =      "978-0-8176-4207-5, 978-3-7643-4207-4",
  LCCN =         "QA267 .K56 2001",
  bibdate =      "Thu Mar 22 11:38:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science and applied logic",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2001025819-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2001025819-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory",
}

@Book{Kinber:2001:TCG,
  author =       "Efim Kinber and Carl H. Smith",
  title =        "Theory of Computing: a Gentle Introduction",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 207",
  year =         "2001",
  ISBN =         "0-13-027961-7",
  ISBN-13 =      "978-0-13-027961-3",
  LCCN =         "QA76 .K475 2001",
  bibdate =      "Fri Mar 23 08:17:45 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing",
  tableofcontents = "1. Introduction \\
                 2. Finite Automata \\
                 3. Context-Free Languages \\
                 4. Turing Machines \\
                 5. Undecidability \\
                 6. Computational Complexity",
}

@Book{Kitaev:2002:CQC,
  author =       "A. Yu. (Alexei Yu.) Kitaev and A. (Alexander) Shen and
                 M. N. (Mikhail N.) Vyalyi",
  title =        "Classical and Quantum Computation",
  volume =       "47",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 257",
  year =         "2002",
  ISBN =         "0-8218-2161-X",
  ISBN-13 =      "978-0-8218-2161-9",
  ISSN =         "1065-7339",
  LCCN =         "QA267 .K5713 2002",
  bibdate =      "Thu Mar 22 12:19:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate studies in mathematics",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the Russian by Lester J. Senechal.",
  subject =      "Machine theory; Computational complexity; Quantum
                 computers",
  tableofcontents = "Part 1. Classical Computation \\
                 1. Turing machines \\
                 2. Boolean circuits \\
                 3. The class NP: Reducibility and completeness \\
                 4. Probabilistic algorithms and the class BPP \\
                 5. The hierarchy of complexity classes \\
                 Part 2. Quantum Computation \\
                 6. Definitions and notation \\
                 7. Correspondence between classical and quantum
                 computation \\
                 8. Bases for quantum circuits \\
                 9. Definition of Quantum Computation. Examples \\
                 10. Quantum probability \\
                 11. Physically realizable transformations of density
                 matrices \\
                 12. Measuring operators \\
                 13. Quantum algorithms for Abelian groups \\
                 14. The quantum analogue of NP: the class BQNP \\
                 15. Classical and quantum codes \\
                 Part 3. Solutions \\
                 App. A. Elementary Number Theory",
}

@Book{Knuth:1976:MSR,
  author =       "Donald E. Knuth",
  title =        "Mariages stables et leurs relations avec d'autres
                 probl{\`e}mes combinatoires",
  publisher =    "Les Presses de l'Uni\-ver\-sit{\'e} de Montr{\'e}al",
  address =      "Montr{\'e}al, Qu{\'e}bec, Canada",
  pages =        "106",
  year =         "1976",
  ISBN =         "0-8405-0342-3, 2-7606-0529-9",
  ISBN-13 =      "978-0-8405-0342-8, 978-2-7606-0529-9",
  LCCN =         "QA164 .K59 1976",
  MRclass =      "68A10 (05-XX)",
  MRnumber =     "58 #8470",
  MRreviewer =   "Fabrizio Luccio",
  bibdate =      "Fri Aug 12 00:38:53 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Edition revue et corrig{\'e}e, 1981. Currently
                 available from Les Publications CRM / Centre de
                 Recherches Math{\'e}matiques, Universit{\'e} de
                 Montr{\'e}al, Montr{\'e}al, Qu{\'e}bec.",
  series =       "Collection de la Chaire Aisenstadt",
  acknowledgement = ack-nhfb,
  keywords =     "combinatorial analysis -- data processing; marriage
                 theorem -- data processing",
  xxnote =       "Tell Don/Phyllis about missing accent on Quebec in his
                 vita.",
}

@Article{Knuth:1984:CCS,
  author =       "Donald E. Knuth",
  title =        "Corrigendum: {``The complexity of songs''}",
  journal =      j-CACM,
  volume =       "27",
  number =       "6",
  pages =        "593--593",
  month =        jun,
  year =         "1984",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68Q25 (03D15)",
  MRnumber =     "87c:68032b",
  bibdate =      "Thu Dec 7 11:43:20 1995",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 MathSciNet database",
  note =         "See \cite{Knuth:1984:CS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Knuth:1984:CS,
  author =       "Donald E. Knuth",
  title =        "The complexity of songs",
  journal =      j-CACM,
  volume =       "27",
  number =       "4",
  pages =        "344--346",
  month =        apr,
  year =         "1984",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/358027.358042",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68Q25 (03D15)",
  MRnumber =     "87c:68032a",
  bibdate =      "Sat Mar 23 15:02:15 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 MathSciNet database",
  note =         "See erratum in \cite{Knuth:1984:CCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  remark =       "See \cite{Knuth:1977:CS}.",
  subject =      "J.5 Computer Applications, ARTS AND HUMANITIES,
                 Music",
}

@Book{Knuth:1996:SPC,
  author =       "Donald Ervin Knuth",
  title =        "Selected Papers on Computer Science",
  volume =       "59",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 274",
  year =         "1996",
  ISBN =         "1-881526-91-7 (paperback), 1-881526-92-5 (hardcover)",
  ISBN-13 =      "978-1-881526-91-9 (paperback), 978-1-881526-92-6
                 (hardcover)",
  LCCN =         "QA76.K537 1996",
  bibdate =      "Thu Aug 07 13:46:40 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "CSLI lecture notes",
  acknowledgement = ack-nhfb,
  keywords =     "Computer science.",
}

@Book{Knuth:1997:SMR,
  author =       "Donald E. Knuth",
  title =        "Stable Marriage and Its Relation to Other
                 Combinatorial Problems. {An} Introduction to the
                 Mathematical Analysis of Algorithms",
  volume =       "10",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiv + 74",
  year =         "1997",
  ISBN =         "0-8218-0603-3",
  ISBN-13 =      "978-0-8218-0603-6",
  LCCN =         "QA164 .K5913 1997",
  MRclass =      "68Q25 (68-02 68R05)",
  MRnumber =     "MR1415126 (97h:68048)",
  bibdate =      "Sat Dec 13 15:23:21 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 MathSciNet database",
  note =         "Translated from the French by Martin Goldstein and
                 revised by the author.",
  series =       "CRM Proceedings \& Lecture Notes",
  acknowledgement = ack-nhfb,
  keywords =     "combinatorial analysis -- data processing; marriage
                 theorem -- data processing",
}

@Book{Knuth:2000:SPA,
  author =       "Donald Ervin Knuth",
  title =        "Selected Papers on Analysis of Algorithms",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 621",
  year =         "2000",
  ISBN =         "1-57586-211-5, 1-57586-212-3 (paperback)",
  ISBN-13 =      "978-1-57586-211-8, 978-1-57586-212-5 (paperback)",
  LCCN =         "QA9.58 .K65 2000",
  bibdate =      "Thu Mar 22 12:59:36 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam021/00023847.html;
                 http://www.loc.gov/catdir/toc/cam023/00023847.html",
  acknowledgement = ack-nhfb,
  subject =      "Algorithms",
}

@Book{Knuth:2003:SPD,
  author =       "Donald E. Knuth",
  title =        "Selected Papers on Discrete Mathematics",
  volume =       "106",
  publisher =    pub-CSLI,
  address =      pub-CSLI:adr,
  pages =        "xvi + 812",
  year =         "2003",
  ISBN =         "1-57586-248-4",
  ISBN-13 =      "978-1-57586-248-4",
  LCCN =         "QA39.3 .K59 2001",
  MRclass =      "01A75 (05-06 68-06)",
  MRnumber =     "MR2030307 (2005c:01030)",
  MRreviewer =   "Alexander Zvonkin",
  bibdate =      "Fri Mar 4 15:20:28 2011",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$40.00",
  series =       "CSLI Lecture Notes",
  acknowledgement = ack-nhfb,
  classmath =    "01A75 (Collected or selected works); 00B60
                 (Collections of reprinted articles)",
  keywords =     "discrete mathematics; graph theory; groupoid;
                 identities; matrix theory; matroid; partitions;
                 permutations; recurrences",
  remark =       "This book is number six in a series of eight of Donald
                 E. Knuth's collected papers that Stanford's Center for
                 the Study of Language and Information plans to publish.
                 The previous already published volumes were: 1.
                 Literate Programming (1992); 2. Selected Papers on
                 Computer Science (1996; Zbl 0866.68002); 3. Digital
                 Typography (1999; Zbl 0927.68109); 4. Selected Papers
                 on Analysis of Algorithms (2000; Zbl 0966.68082). 5.
                 Selected Papers on Computer Languages (2003; Zbl
                 1046.68003). This sixth volume is devoted to
                 mathematical topics and contains 41 papers written
                 during the last four decades.\par

                 Donald E. Knuth is widely known as a pioneer of the
                 computer science and most of his papers are devoted to
                 this field. However he has solid mathematical
                 background and has published a lot of mathematical
                 papers covering the entire range of discrete
                 mathematics. Let us mention some topics exposed in this
                 collection of papers: combinatorial analysis related to
                 computers (sequences, backtrack, Latin squares,
                 projective planes), notes on mathematical notation,
                 notes on some 17th century mathematical publications,
                 doubly stochastic matrices, Pfaffians (arrays of
                 numbers), relations between matrices, graphs and trees,
                 large numbers (power series raised to the power), floor
                 function, random sequences, finite fields, central
                 groupoids, algebraic approach of Huffman's algorithm,
                 directed graphs, random matroids, permutations,
                 efficient balanced codes, various aspects of partitions
                 (enumeration, identities, etc.), recurrences (linear,
                 minimization, related to trees), cycles in an evolving
                 graph.\par

                 The collection ends with two lengthy papers: ``First
                 Cycles in an Evolving Graph'' (56 pages) (see Zbl
                 0696.05045) and ``The Birth of the Giant Component''
                 (150 pages) devoted to random graph problems (see Zbl
                 0795.05127), initiated by [{\it P. Erd{\H{o}}s} and
                 {\it A. R{\'e}nyi}, ``On random graphs I''. Publ. Math.
                 (Debrecen) 6, 290--297 (1959; Zbl 0092.15705)]. The
                 papers are self-contained so that a reader with a
                 general mathematical background would be able to
                 understand the content.\par

                 Almost every paper in this book is supplemented with an
                 addendum where the author presents short information
                 about what has happened after the paper was published:
                 further investigations and new results related to the
                 topic of the paper, comments, corrections.",
}

@Book{Knuth:2011:ACP,
  author =       "Donald E. Knuth",
  title =        "The Art of Computer Programming: Volume 4,
                 {Combinatorial} algorithms. {Part 1}",
  volume =       "4A",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 883",
  year =         "2011",
  ISBN =         "0-201-03804-8",
  ISBN-13 =      "978-0-201-03804-0",
  LCCN =         "QA76.6 2005",
  bibdate =      "Fri Mar 4 17:53:38 MST 2011",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.gbv.de:20011/gvk",
  series =       "The art of computer programming",
  acknowledgement = ack-nhfb,
  remark =       "Also issued from 2005 to 2010 in four fascicles prior
                 to this complete edition.",
  tableofcontents = "7: Combinatorial Searching \\
                 7.1. Zeros and Ones \\
                 7.1.1. Boolean Baiscs \\
                 7.1.2. Boolean Evaluation \\
                 7.1.3. Bitwise Tricks and Techniques \\
                 7.1.4. Binary Decision Diagrams \\
                 7.2. Generating All Possibilities \\
                 7.2.1. Generating Basic Cambinatorial Patterns \\
                 7.2.1.1. Generating all n-Tuples \\
                 7.2.1.2. Generating all Permutations \\
                 7.2.1.3. Generating all Combinations \\
                 7.2.1.4. Generating all Partitions \\
                 7.2.1.5. Generating all Set Partitions \\
                 7.2.1.6. Generating all Trees \\
                 7.2.1.7. History and Further References \\
                 Answers to Exercises \\
                 Appendix A. Tables of Numerical Quantities \\
                 1. Fundamental Constants (decimal) \\
                 2. Fundamental Constants (hexadecimal) \\
                 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci
                 Numbers \\
                 Appendix B. Index to Notations \\
                 Appendix C. Index to Algorithms and Theorems \\
                 Appendix D. Index to Combinatorial Problems \\
                 Index and Glossary",
}

@Book{Koblitz:2008:RCJ,
  author =       "Neal Koblitz",
  title =        "Random Curves: Journeys of a Mathematician",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "392",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-3-540-74078-0",
  ISBN =         "3-540-74077-5 (hardcover), 3-540-74078-3 (e-book)",
  ISBN-13 =      "978-3-540-74077-3 (hardcover), 978-3-540-74078-0
                 (e-book)",
  LCCN =         "QA29.K57 A3 2008",
  bibdate =      "Fri Mar 23 10:29:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Koblitz, Neal; Travel; Mathematicians; United States;
                 Biography; World politics; 20th century",
  subject-dates = "1948--",
  tableofcontents = "Early Years \\
                 Harvard \\
                 SDS \\
                 The Army \\
                 Spring of 1972 \\
                 Academics \\
                 The Soviet Union \\
                 Racism and Apartheid \\
                 Vietnam. Part I \\
                 Vietnam. Part II \\
                 Nicaragua and Cuba \\
                 El Salvador \\
                 Two Cultures \\
                 Cryptography \\
                 Education \\
                 Arizona \\
                 Index",
}

@Book{Koren:1993:CAA,
  author =       "Israel Koren",
  title =        "Computer Arithmetic Algorithms",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiii + 210",
  year =         "1993",
  ISBN =         "0-13-151952-2",
  ISBN-13 =      "978-0-13-151952-7",
  LCCN =         "QA76.9.C62 K67 1993",
  bibdate =      "Thu Mar 22 11:57:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer arithmetic; Computer algorithms",
}

@Book{Koren:2002:CAA,
  author =       "Israel Koren",
  title =        "Computer Arithmetic Algorithms",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Second",
  pages =        "xv + 281",
  year =         "2002",
  ISBN =         "1-56881-160-8",
  ISBN-13 =      "978-1-56881-160-4",
  LCCN =         "QA76.9.C62 K67 2002",
  bibdate =      "Thu Mar 22 11:57:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer arithmetic; Computer algorithms",
}

@Book{Korte:2000:COT,
  author =       "Bernhard H. (Bernhard H.) Korte and Jens Vygen",
  title =        "Combinatorial optimization: theory and algorithms",
  volume =       "21",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 530",
  year =         "2000",
  ISBN =         "3-540-67226-5",
  ISBN-13 =      "978-3-540-67226-5",
  ISSN =         "0937-5511",
  LCCN =         "QA402.5 .K6665 2000",
  bibdate =      "Fri Mar 23 12:19:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial optimization",
}

@Book{Korte:2002:COT,
  author =       "Bernhard H. (Bernhard H.) Korte and Jens Vygen",
  title =        "Combinatorial optimization: theory and algorithms",
  volume =       "21",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiii + 530",
  year =         "2002",
  ISBN =         "3-540-43154-3",
  ISBN-13 =      "978-3-540-43154-1",
  ISSN =         "0937-5511",
  LCCN =         "QA402.5 .K6665 2002",
  bibdate =      "Fri Mar 23 12:19:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial optimization",
}

@Book{Korte:2006:COT,
  author =       "Bernhard Korte",
  title =        "Combinatorial optimization: theory and algorithms",
  volume =       "21",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xv + 597",
  year =         "2006",
  ISBN =         "3-540-25684-9",
  ISBN-13 =      "978-3-540-25684-7",
  ISSN =         "0937-5511",
  LCCN =         "QA402.5 .K6665 2006",
  bibdate =      "Fri Mar 23 12:18:13 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0662/2005931374-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0826/2005931374-t.html",
  acknowledgement = ack-nhfb,
}

@Book{Korte:2008:COT,
  author =       "Bernhard Korte and Jens Vygen",
  title =        "Combinatorial Optimization: Theory and Algorithms",
  volume =       "21",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fourth",
  pages =        "xvii + 627",
  year =         "2008",
  ISBN =         "3-540-71843-5 (print), 3-540-71844-3 (e-book)",
  ISBN-13 =      "978-3-540-71843-7 (print), 978-3-540-71844-4
                 (e-book)",
  ISSN =         "0937-5511",
  LCCN =         "QA402.5 .K6665 2008",
  bibdate =      "Fri Mar 23 12:19:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics",
  acknowledgement = ack-nhfb,
  tableofcontents = "Graphs \\
                 Linear programming \\
                 Linear programming algorithms \\
                 Integer programming \\
                 Spanning trees and arborescences \\
                 Shortest paths \\
                 Network flows \\
                 Minimum cost flows \\
                 Maximum matchings \\
                 Weighted matching \\
                 B-matchings and T-joins \\
                 Matroids \\
                 Generalizations of matroids \\
                 NP-completeness \\
                 Approximation algorithms \\
                 The knapsack problem \\
                 Bin-packing \\
                 Multicommodity flows and edge-disjoint paths \\
                 Network design problems \\
                 The traveling salesman problem \\
                 Facility location",
}

@Book{Korte:2012:COH,
  author =       "Bernhard Korte and Jens Vygen",
  title =        "Combinatorial Optimization: Theory and Algorithms",
  volume =       "21",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Fifth",
  pages =        "xix + 659",
  year =         "2012",
  ISBN =         "3-642-24487-4, 3-642-24488-2",
  ISBN-13 =      "978-3-642-24487-2, 978-3-642-24488-9",
  ISSN =         "0937-5511",
  LCCN =         "QA402.5 .K6665 2012",
  bibdate =      "Fri Mar 23 12:18:57 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and combinatorics",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Combinatorics; Computer science;
                 Mathematical optimization",
}

@Book{Kozen:2006:TC,
  author =       "Dexter Kozen",
  title =        "Theory of Computation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 418",
  year =         "2006",
  ISBN =         "1-84628-297-7",
  ISBN-13 =      "978-1-84628-297-3",
  LCCN =         "QA267.7 .K69 2006",
  bibdate =      "Fri Mar 23 10:10:17 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2005937504-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2005937504-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Computer science;
                 Mathematics; Recursion theory",
}

@Book{Kung:2009:CRW,
  author =       "Joseph P. S. Kung and Gian-Carlo Rota and Catherine H.
                 Yan",
  title =        "Combinatorics: the {Rota} Way",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 396",
  year =         "2009",
  ISBN =         "0-521-73794-X (paperback), 0-521-88389-X (hardcover)",
  ISBN-13 =      "978-0-521-73794-4 (paperback), 978-0-521-88389-4
                 (hardcover)",
  LCCN =         "QA164 .K86 2009",
  bibdate =      "Fri Mar 23 10:29:11 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Cambridge mathematical library",
  acknowledgement = ack-nhfb,
  subject =      "Rota, Gian-Carlo; Combinatorial analysis",
  subject-dates = "1932--1999",
}

@Book{Landau:2010:SSR,
  author =       "Susan Eva Landau",
  title =        "Surveillance or security?: {The} risks posed by new
                 wiretapping technologies",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xvi + 383",
  year =         "2010",
  ISBN =         "0-262-01530-7 (hardcover),0-262-29558-X (e-book)",
  ISBN-13 =      "978-0-262-01530-1 (hardcover), 978-0-262-29558-1
                 (e-book)",
  LCCN =         "TK5102.85 .L36 2010",
  bibdate =      "Tue May 7 10:51:07 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication; Security measures; United States;
                 Wiretapping; Data encryption (Computer science);
                 Government policy; Electronic surveillance; Political
                 aspects; Computer crimes; Risk assessment",
  tableofcontents = "Introduction \\
                 Communication networks and their architectures \\
                 Securing the Internet is difficult \\
                 Wiretaps and the law \\
                 The effectiveness of wiretapping \\
                 Evolving communications technologies \\
                 Who are the intruders? what are they targeting? \\
                 Security risks arising from wiretapping technology \\
                 Policy risks arising from wiretapping \\
                 Communication during crisis \\
                 Getting communications security right \\
                 Epilogue",
}

@Book{Leighton:1992:IPA,
  author =       "Frank Thomson Leighton",
  title =        "Introduction to Parallel Algorithms and Architectures:
                 Arrays, Trees, Hypercubes",
  publisher =    pub-MORGAN-KAUFMANN,
  address =      pub-MORGAN-KAUFMANN:adr,
  pages =        "xvii + 831",
  year =         "1992",
  ISBN =         "1-55860-117-1",
  ISBN-13 =      "978-1-55860-117-8",
  LCCN =         "QA76.58 .L45 1992",
  bibdate =      "Fri Mar 23 07:54:14 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers); Computer
                 algorithms",
  tableofcontents = "Preface \\
                 Acknowledgments \\
                 Notation \\
                 1 Arrays and Trees \\
                 1.1 Elementary Sorting and Counting \\
                 1.1.1 Sorting on a Linear Array Assessing the
                 Performance of the Algorithm Sorting N Numbers with
                 Fewer Than N Processors \\
                 1.1.2 Sorting in the Bit Model \\
                 1.1.3 Lower Bounds \\
                 1.1.4 A Counterexample-Counting \\
                 1.1.5 Properties of the Fixed-Connection Network Model
                 \\
                 1.2 Integer Arithmetic \\
                 1.2.1 Carry-Lookahead Addition \\
                 1.2.2 Prefix Computations-Segmented Prefix Computations
                 1.2.3 Carry-Save Addition \\
                 1.2.4 Multiplication and Convolution \\
                 1.2.5 Division and Newton Iteration \\
                 1.3 Matrix Algorithms \\
                 1.3.1 Elementary Matrix Products \\
                 1.3.2 Algorithms for Triangular Matrices \\
                 1.3.3 Algorithms for Tridiagonal Matrices -Odd-Even
                 Reduction -Parallel Prefix Algorithms \\
                 1.3.4 Gaussian Elimination \\
                 1.3.5 Iterative Methods -Jacobi Relaxation
                 -Gauss-Seidel Relaxation Finite Difference Methods
                 -Multigrid Methods \\
                 1.4 Retiming and Systolic Conversion \\
                 1.4.1 A Motivating Example-Palindrome Recognition \\
                 1.4.2 The Systolic and Semisystolic Model of
                 Computation \\
                 1.4.3 Retiming Semisystolic Networks \\
                 1.4.4 Conversion of a Semisystolic Network into a
                 Systolic Network \\
                 1.4.5 The Special Case of Broadcasting \\
                 1.4.6 Retiming the Host \\
                 1.4.7 Design by Systolic Conversion-A Summary \\
                 1.5 Graph Algorithms \\
                 1.5.1 Transitive Closure \\
                 1.5.2 Connected Components \\
                 1.5.3 Shortest Paths \\
                 1.5.4 Breadth-First Spanning Trees \\
                 1.5.5 Minimum Weight Spanning Trees \\
                 1.6 Sorting Revisited \\
                 1.6.1 Odd-Even Transposition Sort on a Linear Array \\
                 1.6.2 A Simple Root-N(log N + 1)-Step Sorting Algorithm
                 \\
                 1.6.3 A (3 Root- N + o(Root-N))-Step Sorting Algorithm
                 \\
                 1.6.4 A Matching Lower Bound \\
                 1.7 Packet Routing \\
                 1.7.1 Greedy Algorithms \\
                 1.7.2 Average-Case Analysis of Greedy Algorithms
                 -Routing N Packets to Random Destinations -Analysis of
                 Dynamic Routing Problems \\
                 1.7.3 Randomized Routing Algorithms \\
                 1.7.4 Deterministic Algorithms with Small Queues \\
                 1.7.5 An Off-line Algorithm \\
                 1.7.6 Other Routing Models and Algorithms \\
                 1.8 Image Analysis and Computational Geometry \\
                 1.8.1 Component-Labelling Algorithms -Levialdi's
                 Algorithm -An O (Root-N)-Step Recursive Algorithm \\
                 1.8.2 Computing Hough Transforms \\
                 1.8.3 Nearest-Neighbor Algorithms \\
                 1.8.4 Finding Convex Hulls \\
                 1.9 Higher-Dimensional Arrays \\
                 1.9.1 Definitions and Properties \\
                 1.9.2 Matrix Multiplication \\
                 1.9.3 Sorting \\
                 1.9.4 Packet Routing \\
                 1.9.5 Simulating High-Dimensional Arrays on
                 Low-Dimensional Arrays \\
                 1.10 problems \\
                 1.11 Bibliographic Notes \\
                 2 Meshes of Trees \\
                 2.1 The Two-Dimensional Mesh of Trees \\
                 2.1.1 Definition and Properties \\
                 2.1.2 Recursive Decomposition \\
                 2.1.3 Derivation from KN, N \\
                 2.1.4 Variations \\
                 2.1.5 Comparison With the Pyramid and Multigrid \\
                 2.2 Elementary O(log N)-Step Algorithms \\
                 2.2.1 Routing \\
                 2.2.2 Sorting \\
                 2.2.3 Matrix-Vector Multiplication \\
                 2.2.4 Jacobi Relaxation \\
                 2.2.5 Pivoting \\
                 2.2.6 Convolution \\
                 2.2.7 Convex Hull \\
                 2.3 Integer Arithmetic \\
                 2.3.1 Multiplication \\
                 2.3.2 Division and Chinese Remaindering \\
                 2.3.3 Related Problems -Iterated Products -Rooting
                 Finding \\
                 2.4 Matrix Algorithms \\
                 2.4.1 The Three-Dimensional Mesh of Trees \\
                 2.4.2 Matrix Multiplication \\
                 2.4.3 Inverting Lower Triangular Matrices \\
                 2.4.4 Inverting Arbitrary Matrices -Csanky's Algorithm
                 -Inversion by Newton Iteration \\
                 2.4.5 Related Problems \\
                 2.5 Graph Algorithms \\
                 2.5.1 Minimum-Weight Spanning Trees \\
                 2.5.2 Connected Components \\
                 2.5.3 Transitive Closure \\
                 2.5.4 Shortest Paths \\
                 2.5.5 Matching Problems \\
                 2.6 Fast Evaluation of Straight-Line Code \\
                 2.6.1 Addition and Multiplication Over a Semiring \\
                 2.6.2 Extension to Codes with Subtraction and Division
                 \\
                 2.6.3 Applications \\
                 2.7 Higher-Dimensional meshes of Trees \\
                 2.7.1 Definitions and Properties \\
                 2.7.2 The Shuffle-Tree Graph \\
                 2.8 Problems \\
                 2.9 Bibliographic Notes \\
                 3 Hypercubes and Related Networks \\
                 3.1 The Hypercube \\
                 3.1.1 Definitions and Properties \\
                 3.1.2 Containment of Arrays -Higher-Dimensional Arrays
                 \\
                 -Non-Power-of-2 Arrays \\
                 3.1.3 Containment of Complete Binary Trees \\
                 3.1.4 Embeddings of Arbitrary Binary Trees -Embeddings
                 with Dilation 1 and Load O(M over N + log N)
                 -Embeddings with Dilation O(1) and Load O (M over N +
                 1) -A Review of One-Error-Correcting Codes -Embedding
                 Plog N into Hlog N \\
                 3.1.5 Containment of Meshes of Trees \\
                 3.1.6 Other Containment Results \\
                 3.2 The Butterfly, Cube-Connected-Cycles , and Benes
                 Network \\
                 3.2.1 Definitions and Properties \\
                 3.2.2 Simulation of Arbitrary Networks \\
                 3.2.3 Simulation of Normal Hypercube Algorithms \\
                 3.2.4 Some Containment and Simulation Results \\
                 3.3 The Shuffle-Exchange and de Bruijn Graphs \\
                 3.3.1 Definitions and Properties \\
                 3.3.2 The Diaconis Card Tricks \\
                 3.3.3 Simulation of Normal Hypercube Algorithms \\
                 3.3.4 Similarities with the Butterfly \\
                 3.3.5 Some Containment and Simulation Results \\
                 3.4 Packet-Routing Algorithms \\
                 3.4.1 Definitions and Routing Models \\
                 3.4.2 Greedy Routing Algorithms and Worst-Case Problems
                 \\
                 3.4.3 Packing, Spreading, and Monotone Routing Problems
                 -Reducing a Many-to-Many Routing Problem to a
                 Many-to-One Routing Problem -Reducing a Routing Problem
                 to a Sorting Problem \\
                 3.4.4 The Average-Case Behavior of the Greedy Algorithm
                 -Bounds on Congestion -Bounds on Running Time
                 -Analyzing Non-Predictive Contention-Resolution
                 Protocols \\
                 3.4.5 Converting Worst-Case Routing Problems into
                 Average-Case Routing Problems -Hashing -Randomized
                 Routing \\
                 3.4.6 Bounding Queue Sizes -Routing on Arbitrary
                 Levelled Networks \\
                 3.4.7 Routing with Combining \\
                 3.4.8 The Information Dispersal Approach to Routing
                 -Using Information Dispersal to Attain Fault-Tolerance
                 -Finite Fields and Coding Theory \\
                 3.4.9 Circuit-Switching Algorithms \\
                 3.5 Sorting \\
                 3.5.1 Odd-Even Merge Sort -Constructing a Sorting
                 Circuit with Depth log N(log N \\
                 +1)/2 3.5.2 Sorting Small Sets \\
                 3.5.3 A Deterministic O(log N log log N)-Step Sorting
                 Algorithm \\
                 3.5.4 Randomized O(log N)-Step Sorting Algorithms -A
                 Circuit with Depth \\
                 7.45 log N that Usually Sorts \\
                 3.6 Simulating a Parallel Random Access Machine \\
                 3.6.1 PRAM Models and Shared Memories \\
                 3.6.2 Randomized Simulations Based on Hashing \\
                 3.6.3 Deterministic Simulations using Replicated Data
                 \\
                 3.6.4 Using Information Dispersal to Improve
                 Performance \\
                 3.7 The Fast Fourier Transform \\
                 3.7.1 The Algorithm \\
                 3.7.2 Implementation on the Butterfly and
                 Shuffle-Exchange Graph \\
                 3.7.3 Application to Convolution and Polynomial
                 Arithmetic \\
                 3.7.4 Application to Integer Multiplication \\
                 3.8 Other Hypercubic Networks \\
                 3.8.1 Butterflylike Networks -The Omega Network -The
                 Flip Network -The Baseline and Reverse Baseline
                 Networks -Banyan and Delta Networks -k-ary Butterflies
                 \\
                 3.8.2 De Bruijn-Type Networks -The k-ary de Bruijn
                 Graph -The Generalized Shuffle-Exchange Graph \\
                 3.9 Problems \\
                 3.10 Bibliographic Notes Bibliography Index Lemmas,
                 Theorems, and Corollaries \\
                 Author Index \\
                 Subject Index",
}

@Book{Leiss:2007:PCA,
  author =       "Ernst L. Leiss",
  title =        "A Programmer's Companion to Algorithm Analysis",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "255",
  year =         "2007",
  ISBN =         "1-58488-673-0",
  ISBN-13 =      "978-1-58488-673-0",
  LCCN =         "QA402.5 .L398 2007",
  bibdate =      "Thu Mar 22 12:50:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0654/2006044552-d.html;
                 http://www.loc.gov/catdir/toc/fy0705/2006044552.html",
  acknowledgement = ack-nhfb,
  subject =      "Programming (Mathematics); Algorithms; Data
                 processing",
}

@Book{Levitin:2007:IDA,
  author =       "Anany Levitin",
  title =        "Introduction to the Design and Analysis of
                 Algorithms",
  publisher =    "Pearson Addison-Wesley",
  address =      "Boston, MA, USA",
  edition =      "Second",
  pages =        "xxiii + 562",
  year =         "2007",
  ISBN =         "0-321-35828-7",
  ISBN-13 =      "978-0-321-35828-8",
  LCCN =         "QA76.9.A43 L48 2007",
  bibdate =      "Thu Mar 22 12:30:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip063/2005033620.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms",
}

@Book{Levitin:2012:IDA,
  author =       "Anany Levitin",
  title =        "Introduction to the Design and Analysis of
                 Algorithms",
  publisher =    "Pearson",
  address =      "Boston, MA, USA",
  edition =      "Third",
  pages =        "xxiv + 565",
  year =         "2012",
  ISBN =         "0-13-231681-1",
  ISBN-13 =      "978-0-13-231681-1",
  LCCN =         "QA76.9.A43 L48 2012",
  bibdate =      "Thu Mar 22 12:30:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms",
}

@Book{Lewand:2000:CM,
  author =       "Robert Lewand",
  title =        "Cryptological Mathematics",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xiv + 199",
  year =         "2000",
  ISBN =         "0-88385-719-7",
  ISBN-13 =      "978-0-88385-719-9",
  LCCN =         "QA268 .L48 2000",
  bibdate =      "Thu Mar 22 12:03:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Classroom resource materials",
  URL =          "http://www.loc.gov/catdir/description/cam041/00105256.html;
                 http://www.loc.gov/catdir/toc/cam041/00105256.html",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography; Mathematics",
}

@Book{Lewis:1979:UCQ,
  author =       "Harry R. Lewis",
  title =        "Unsolvable Classes of Quantificational Formulas",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xv + 198",
  year =         "1979",
  ISBN =         "0-201-04069-7",
  ISBN-13 =      "978-0-201-04069-2",
  LCCN =         "QA9.63 .L48",
  bibdate =      "Thu Mar 22 13:10:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Unsolvability (Mathematical logic); Combinatorial
                 analysis; Computable functions",
}

@Book{Lewis:2006:ESH,
  author =       "Harry R. Lewis",
  title =        "Excellence without a soul: how a great university
                 forgot education",
  publisher =    "PublicAffairs",
  address =      "New York, NY, USA",
  pages =        "xiv + 305",
  year =         "2006",
  ISBN =         "1-58648-393-5",
  ISBN-13 =      "978-1-58648-393-7",
  LCCN =         "LA227.4 .L49 2006",
  bibdate =      "Fri Mar 23 12:53:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0828/2006002732-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0828/2006002732-d.html;
                 http://www.loc.gov/catdir/toc/ecip068/2006002732.html",
  acknowledgement = ack-nhfb,
  keywords =     "Harvard University",
  subject =      "Education, Higher; Aims and objectives; United States;
                 Universities and colleges; Academic achievement",
  tableofcontents = "Hollow excellence \\
                 Choice and direction \\
                 Meritocracy and citizenship \\
                 Contact, competition, cooperation \\
                 The eternal enigma: advising \\
                 Why grades go up \\
                 Evaluation is educational \\
                 Independence, responsibility, rape \\
                 Students and money \\
                 College athletes and money",
}

@Book{Li:1993:IKC,
  author =       "Ming Li and P. M. B. Vit{\'a}nyi",
  title =        "An Introduction to {Kolmogorov} complexity and Its
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 546",
  year =         "1993",
  ISBN =         "0-387-94053-7 (New York), 3-540-94053-7 (Berlin)",
  ISBN-13 =      "978-0-387-94053-3 (New York), 978-3-540-94053-1
                 (Berlin)",
  LCCN =         "QA267.7 .L5 1993",
  bibdate =      "Thu Mar 22 12:27:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts and monographs in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Kolmogorov complexity",
}

@Book{Li:1997:IKC,
  author =       "Ming Li and P. M. B. Vit{\'a}nyi",
  title =        "An Introduction to {Kolmogorov} Complexity and Its
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 637",
  year =         "1997",
  ISBN =         "0-387-94868-6 (hardcover)",
  ISBN-13 =      "978-0-387-94868-3 (hardcover)",
  LCCN =         "QA267.7 .L5 1997",
  bibdate =      "Thu Mar 22 12:27:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/96042357-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/96042357-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Kolmogorov complexity",
}

@Book{Li:2006:NIP,
  author =       "Duan Li and Xiaoling Sun",
  title =        "Nonlinear Integer Programming",
  volume =       "84",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 435",
  year =         "2006",
  ISBN =         "0-387-29503-8, 0-387-32995-1 (e-book)",
  ISBN-13 =      "978-0-387-29503-9, 978-0-387-32995-6 (e-book)",
  LCCN =         "T57.7 .L5 2006; MLCM 2006/41439 (T)",
  bibdate =      "Thu Mar 22 12:42:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "International series in operations research and
                 management science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2006922525-d.html;
                 http://www.loc.gov/catdir/toc/fy0712/2006922525.html",
  acknowledgement = ack-nhfb,
  subject =      "Integer programming; Nonlinear programming",
}

@Book{Li:2008:DFL,
  author =       "Fanzhang Li",
  title =        "Dynamic Fuzzy Logic and Its Applications",
  publisher =    "Nova Science Publishers",
  address =      "New York, NY, USA",
  pages =        "x + 296",
  year =         "2008",
  ISBN =         "1-60021-428-2",
  ISBN-13 =      "978-1-60021-428-8",
  LCCN =         "QA9.64 .L5 2008",
  bibdate =      "Thu Mar 22 12:08:59 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0619/2006028308.html",
  acknowledgement = ack-nhfb,
  subject =      "Fuzzy logic",
}

@Book{Li:2008:IKC,
  author =       "Ming Li and P. M. B. Vit{\'a}nyi",
  title =        "An Introduction to {Kolmogorov} Complexity and Its
                 Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Third",
  pages =        "xxiii + 790",
  year =         "2008",
  ISBN =         "0-387-33998-1 (hardcover), 0-387-49820-6 (e-book)",
  ISBN-13 =      "978-0-387-33998-6 (hardcover), 978-0-387-49820-1
                 (e-book)",
  LCCN =         "QA267.7 .L5 2008",
  bibdate =      "Thu Mar 22 12:27:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Kolmogorov complexity",
}

@Book{Lindner:1997:DT,
  author =       "Charles C. Lindner and C. A. (Christopher Andrew)
                 Rodger",
  title =        "Design Theory",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "198",
  year =         "1997",
  ISBN =         "0-8493-3986-3",
  ISBN-13 =      "978-0-8493-3986-8",
  LCCN =         "QA166.25 .L56 1997",
  bibdate =      "Fri Mar 23 10:12:04 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The CRC Press series on discrete mathematics and its
                 applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0729/97007965-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial designs and configurations",
}

@Book{Loehr:2011:BC,
  author =       "Nicholas A. Loehr",
  title =        "Bijective combinatorics",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xxii + 590",
  year =         "2011",
  ISBN =         "1-4398-4884-X (hardcover)",
  ISBN-13 =      "978-1-4398-4884-5 (hardcover)",
  LCCN =         "QA164 .L64 2011",
  bibdate =      "Tue May 7 10:46:26 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  tableofcontents = "1. Basic Counting \\
                 1.1. Review of Set Theory \\
                 1.2. Sum Rule \\
                 1.3. Product Rule \\
                 1.4. Words, Permutations, and Subsets \\
                 1.5. Functions \\
                 1.6. Bijections, Cardinality, and Counting \\
                 1.7. Subsets, Binary Words, and Compositions \\
                 1.8. Subsets of a Fixed Size \\
                 1.9. Anagrams \\
                 1.10. Lattice Paths \\
                 1.11. Multisets \\
                 1.12. Probability \\
                 1.13. Games of Chance \\
                 1.14. Conditional Probability and Independence \\
                 Summary \\
                 Exercises \\
                 2. Combinatorial Identities and Recursions \\
                 2.1. Generalized Distributive Law \\
                 2.2. Multinomial and Binomial Theorems \\
                 2.3. Combinatorial Proofs \\
                 2.4. Recursions \\
                 2.5. Recursions for Multisets and Anagrams \\
                 2.6. Recursions for Lattice Paths \\
                 2.7. Catalan Recursions \\
                 2.8. Integer Partitions \\
                 2.9. Set Partitions \\
                 2.10. Surjections \\
                 2.11. Stirling Numbers and Rook Theory \\
                 2.12. Linear Algebra Review \\
                 2.13. Stirling Numbers and Polynomials \\
                 2.14. Combinatorial Proofs of Polynomial Identities \\
                 Summary \\
                 Exercises \\
                 3. Counting Problems in Graph Theory \\
                 3.1. Graphs and Digraphs \\
                 3.2. Walks and Matrices \\
                 3.3. DAGs and Nilpotent Matrices \\
                 3.4. Vertex Degrees \\
                 3.5. Functional Digraphs \\
                 3.6. Cycle Structure of Permutations \\
                 3.7. Counting Rooted Trees \\
                 3.8. Connectedness and Components \\
                 3.9. Forests \\
                 3.10. Trees \\
                 3.11. Counting Trees \\
                 3.12. Pruning Maps \\
                 3.13. Ordered Trees and Terms \\
                 3.14. Ordered Forests and Lists of Terms \\
                 3.15. Graph Coloring \\
                 3.16. Spanning Trees \\
                 3.17. Matrix-Tree Theorem \\
                 3.18. Eulerian Tours \\
                 Summary \\
                 Exercises \\
                 4. Inclusion-Exclusion and Related Techniques \\
                 4.1. Involutions \\
                 4.2. The Inclusion-Exclusion Formula \\
                 4.3. More Proofs of Inclusion-Exclusion \\
                 4.4. Applications of the Inclusion-Exclusion Formula
                 \\
                 4.5. Derangements \\
                 4.6. Coefficients of Chromatic Polynomials \\
                 4.7. Classical M{\"o}bius Inversion \\
                 4.8. Partially Ordered Sets \\
                 4.9. M{\"o}bius Inversion for Posets \\
                 4.10. Product Posets \\
                 Summary \\
                 Exercises \\
                 5. Ranking and Unranking",
}

@Book{Lothaire:2005:ACW,
  author =       "M. Lothaire",
  title =        "Applied Combinatorics on Words",
  volume =       "104",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xv + 610",
  year =         "2005",
  ISBN =         "0-521-84802-4",
  ISBN-13 =      "978-0-521-84802-2",
  LCCN =         "QA164 .L66 2005",
  bibdate =      "Thu Mar 22 11:37:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Encyclopedia of mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/description/cam051/2004057012.html;
                 http://www.loc.gov/catdir/toc/cam051/2004057012.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Word problems (Mathematics)",
}

@Book{Lovasz:1986:MT,
  author =       "L{\'a}szl{\'o} Lov{\'a}sz and M. D. Plummer",
  title =        "Matching theory",
  volume =       "121 / 29",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "xxxiii + 544",
  year =         "1986",
  ISBN =         "0-444-87916-1 (paperback)",
  ISBN-13 =      "978-0-444-87916-5 (paperback)",
  LCCN =         "QA164 .L7 1986",
  bibdate =      "Tue May 7 09:02:19 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "North-Holland mathematics studies; Annals of discrete
                 mathematics",
  acknowledgement = ack-nhfb,
  keywords =     "graph matching; linear programming; Markov Chain Monte
                 Carlo method; matroid matching",
  remark =       "Republished as \cite{Lovasz:2009:MT}.",
  subject =      "Matching theory",
}

@Book{Lovasz:2009:MT,
  author =       "L{\'a}szl{\'o} Lov{\'a}sz and M. D. Plummer",
  title =        "Matching theory",
  publisher =    "AMS Chelsea Publishing",
  address =      "Providence, RI, USA",
  pages =        "xxxiii + 547",
  year =         "2009",
  ISBN =         "0-8218-4759-7",
  ISBN-13 =      "978-0-8218-4759-6",
  LCCN =         "QA164 .L7 2009",
  bibdate =      "Tue May 7 09:00:20 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  keywords =     "graph matching; linear programming; Markov Chain Monte
                 Carlo method; matroid matching",
  remark =       "Originally published as \cite{Lovasz:1986:MT}.",
  subject =      "Matching theory",
}

@Book{Loveland:1978:ATP,
  author =       "Donald W. Loveland",
  title =        "Automated Theorem Proving: a Logical Basis",
  volume =       "6",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "xii + 405",
  year =         "1978",
  ISBN =         "0-7204-0499-1",
  ISBN-13 =      "978-0-7204-0499-9",
  LCCN =         "QA76.9.A96 L68",
  bibdate =      "Fri Mar 23 10:21:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Fundamental studies in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Automatic theorem proving",
}

@Book{Mahmoud:2008:PUM,
  author =       "Hosam M. (Hosam Mahmoud) Mahmoud",
  title =        "{P{\'o}lya} Urn Models",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "290",
  year =         "2008",
  ISBN =         "1-4200-5983-1",
  ISBN-13 =      "978-1-4200-5983-0",
  LCCN =         "QA273 .M317 2008",
  bibdate =      "Thu Mar 22 12:47:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC texts in statistical science
                 series",
  URL =          "http://www.loc.gov/catdir/toc/fy0805/2008013347.html",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Distribution (Probability theory)",
}

@Book{Manes:1992:PTS,
  author =       "Ernest G. Manes",
  title =        "Predicate Transformer Semantics",
  volume =       "33",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "223",
  year =         "1992",
  ISBN =         "0-521-42036-9",
  ISBN-13 =      "978-0-521-42036-5",
  LCCN =         "QA76.7 .M342 1992",
  bibdate =      "Thu Mar 22 11:17:11 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/92249094.html;
                 http://www.loc.gov/catdir/toc/cam029/92249094.html",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers);
                 Semantics; Computer science; Mathematics",
  tableofcontents = "1. Finite coproducts \\
                 2. Structure of a Boolean category \\
                 3. Metatheory \\
                 4. Distributive categories \\
                 Bibliography \\
                 Index",
}

@Book{Manna:1992:TLR,
  author =       "Zohar Manna and Amir Pnueli",
  title =        "The Temporal Logic of Reactive and Concurrent
                 Systems",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 427 (vol. 1)",
  year =         "1992",
  ISBN =         "0-387-97664-7 (New York : v. 1), 3-540-97664-7 (Berlin
                 : v. 1)",
  ISBN-13 =      "978-0-387-97664-8 (New York : v. 1), 978-3-540-97664-6
                 (Berlin : v. 1)",
  LCCN =         "QA76.6 .M3564 1991",
  bibdate =      "Thu Mar 22 11:12:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/91028181-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Logic, Symbolic and
                 mathematical",
  tableofcontents = "[1] Specification",
}

@Book{Manna:1993:DFC,
  author =       "Zohar Manna and Richard Waldinger",
  title =        "The Deductive Foundations of Computer Programming: a
                 One-Volume Version of the Logical Basis for Computer
                 Programming",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 717",
  year =         "1993",
  ISBN =         "0-201-54886-0",
  ISBN-13 =      "978-0-201-54886-0",
  LCCN =         "QA76.6 .M35595 1993",
  bibdate =      "Thu Mar 22 11:26:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Condensed and simplified version of the original
                 work.",
  subject =      "Computer programming; Logic, Symbolic and
                 mathematical",
}

@Book{Maor:1994:SN,
  author =       "Eli Maor",
  title =        "$e$: The Story of a Number",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xiv + 223",
  year =         "1994",
  DOI =          "https://doi.org/10.1515/9781400832347",
  ISBN =         "0-691-03390-0",
  ISBN-13 =      "978-0-691-03390-7",
  LCCN =         "QA247.5.M33 1994",
  bibdate =      "Thu Sep 08 11:13:04 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  note =         "This book chronicles the story of the ultimate version
                 number of {\MF}.",
  URL =          "http://www-gap.dcs.st-and.ac.uk/~history/HistTopics/e.html",
  abstract =     "The story of $ \pi $ has been told many times, both in
                 scholarly works and in popular books. But its close
                 relative, the number $e$, has fared less well: despite
                 the central role it plays in mathematics, its history
                 has never before been written for a general audience.
                 The present work fills this gap. Geared to the reader
                 with only a modest background in mathematics, the book
                 describes the story of $e$ from a human as well as a
                 mathematical perspective. In a sense, it is the story
                 of an entire period in the history of mathematics, from
                 the early seventeenth to the late nineteenth century,
                 with the invention of calculus at its center. Many of
                 the players who took part in this story are here
                 brought to life. Among them are John Napier, the
                 eccentric religious activist who invented logarithms
                 and --- unknowingly --- came within a hair's breadth of
                 discovering $e$; William Oughtred, the inventor of the
                 slide rule, who lived a frugal and unhealthful life and
                 died at the age of 86, reportedly of joy when hearing
                 of the restoration of King Charles II to the throne of
                 England; Newton and his bitter priority dispute with
                 Leibniz over the invention of the calculus, a conflict
                 that impeded British mathematics for more than a
                 century; and Jacob Bernoulli, who asked that a
                 logarithmic spiral be engraved on his tombstone but a
                 linear spiral was engraved instead! The unifying theme
                 throughout the book is the idea that a single number
                 can tie together so many different aspects of
                 mathematics --- from the law of compound interest to
                 the shape of a hanging chain, from the area under a
                 hyperbola to Euler's famous formula $ e^{i \pi } = -
                 1$, from the inner structure of a nautilus shell to
                 Bach's equal-tempered scale and to the art of M.C.
                 Escher. The book ends with an account of the discovery
                 of transcendental numbers, an event that paved the way
                 for Cantor's revolutionary ideas about infinity. No
                 knowledge of calculus is assumed, and the few places
                 where calculus is used are fully explained.",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  tableofcontents = "Preface / xi \\
                 1. John Napier, 1614 / 3 \\
                 2. Recognition / 11 \\
                 Computing with Logarithms / 18 3. Financial Matters /
                 23 \\
                 4. To the Limit, If It Exists / 28 \\
                 Some Curious Numbers Related to $e$ / 37 \\
                 5. Forefathers of the Calculus / 40 \\
                 6. Prelude to Breakthrough / 49 \\
                 Indivisibles at Work / 56 \\
                 7. Squaring the Hyperbola / 58 \\
                 8. The Birth of a New Science / 70 \\
                 9. The Great Controversy / 83 \\
                 The Evolution of a Notation / 95 \\
                 10. $e^x$: The Function That Equals its Own Derivative
                 / 98 \\
                 The Parachutist / 109 \\
                 Can Perceptions be Quantified? / 111 \\
                 11. $e^\theta$: Spira Mirabilis / 114 \\
                 A Historic Meeting between J. S. Bach and Johann
                 Bernoulli / 129 \\
                 The Logarithmic Spiral in Art and Nature / 134 \\
                 12. $(e^x + e^{-x})/2$: The Hanging Chain / 140 \\
                 Remarkable Analogies / 147 \\
                 Some Interesting Formulas Involving $e$ / 151 \\
                 13. $e^{i x}$: ``The Most Famous of All Formulas'' /
                 153 \\
                 A Curious Episode in the History of $e$ / 162 \\
                 14. $e^{x + i y}$: The Imaginary Becomes Real / 164 \\
                 15. But What Kind of Number Is It? / 183 \\
                 Appendix 1. Some Additional Remarks on Napier's
                 Logarithms / 195 \\
                 Appendix 2. The Existence of $\lim (1 + 1/n)^n$ as $n
                 \to \infty$ / 197 \\
                 Appendix 3. A Heuristic Derivation of the Fundamental
                 Theorem of Calculus / 200 \\
                 Appendix 4. The Inverse Relation between $\lim (b^h -
                 1) / h = 1$ and $\lim (1 + h)^{1 / h} = b$ as $h \to 0$
                 / 202 \\
                 Appendix 5. An Alternative Definition of the
                 Logarithmic Function / 203 \\
                 Appendix 6. Two Properties of the Logarithmic Spiral /
                 205 \\
                 Appendix 7. Interpretation of the Parameter $\phi$ in
                 the Hyperbolic Functions / 208 \\
                 Appendix 8. $e$ to One Hundred Decimal Places / 211 \\
                 Bibliography / 213 \\
                 Index / 217",
}

@Book{Marcus:1998:CPO,
  author =       "Daniel A. Marcus",
  title =        "Combinatorics: a Problem Oriented Approach",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "x + 136",
  year =         "1998",
  ISBN =         "0-88385-710-3",
  ISBN-13 =      "978-0-88385-710-6",
  LCCN =         "QA164 .M345 1998",
  bibdate =      "Fri Mar 23 19:06:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Classroom resource materials",
  URL =          "http://www.loc.gov/catdir/description/cam029/98085594.html;
                 http://www.loc.gov/catdir/toc/cam027/98085594.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis",
}

@Book{Marcus:2008:GTP,
  author =       "Daniel A. Marcus",
  title =        "Graph Theory: a Problem Oriented Approach",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xvi + 205",
  year =         "2008",
  ISBN =         "0-88385-753-7",
  ISBN-13 =      "978-0-88385-753-3",
  LCCN =         "QA166 .M37 2008",
  bibdate =      "Fri Mar 23 19:13:10 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "MAA textbooks",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0902/2008922013-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0902/2008922013-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0902/2008922013-t.html",
  abstract =     "Graph Theory presents a natural, reader-friendly way
                 to learn some of the essential ideas of graph theory
                 starting from first principles. The format is similar
                 to the companion text, Combinatorics: A Problem
                 Oriented Approach also by Daniel A. Marcus, in that it
                 combines the features of a textbook with those of a
                 problem workbook. The material is presented through a
                 series of approximately 360 strategically placed
                 problems with connecting text. This is supplemented by
                 280 additional problems that are intended to be used as
                 homework assignments. Concepts of graph theory are
                 introduced, developed, and reinforced by working
                 through leading questions posed in the problems. This
                 problem-oriented format is intended to promote active
                 involvement by the reader while always providing clear
                 direction. This approach figures prominently on the
                 presentation of proofs, which become more frequent and
                 elaborate as the book progresses. Arguments are
                 arranged in digestible chunks and always appear along
                 with concrete examples to keep the readers firmly
                 grounded in their motivation. Spanning tree algorithms,
                 Euler paths, Hamilton paths and cycles, planar graphs,
                 independence and covering, connections and
                 obstructions, and vertex and edge colorings make up the
                 core of the book. Hall's Theorem, the Konig-Egervary
                 Theorem, Dilworth's Theorem and the Hungarian algorithm
                 to the optional assignment problem, matrices, and Latin
                 squares are also explored.",
  acknowledgement = ack-nhfb,
  subject =      "graph theory; problems, exercises, etc",
}

@Book{Marek:2009:IMS,
  author =       "Wiktor Marek",
  title =        "Introduction to mathematics of satisfiability",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xiii + 350",
  year =         "2009",
  ISBN =         "1-4398-0167-3 (hardcover)",
  ISBN-13 =      "978-1-4398-0167-3 (hardcover)",
  LCCN =         "QA9.3 .M37 2009",
  bibdate =      "Tue May 7 09:39:28 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC studies in informatics series",
  acknowledgement = ack-nhfb,
  subject =      "Propositional calculus; Logic, Symbolic and
                 mathematical",
  tableofcontents = "Chapter 1: Sets, lattices, and Boolean algebras \\
                 Chapter 2: Introduction to propositional logic \\
                 Chapter 3: Normal forms of formulas \\
                 Chapter 4: The Craig lemma \\
                 Chapter 5: Complete sets of functors \\
                 Chapter 6: Compactness theorem \\
                 Chapter 7: Clausal logic and resolution \\
                 Chapter 8: Testing satisfiability, finding satisfying
                 assignment \\
                 Chapter 9: Polynomial cases of SAT \\
                 Chapter 10: Embedding SAT into integer programming and
                 into matrix algebra \\
                 Chapter 11: Coding runs of Turing machines,
                 NP-completeness and related topics \\
                 Chapter 12: Computational knowledge representation with
                 SAT getting started \\
                 Chapter 13: Computational knowledge representation with
                 SAT handling constraint satisfaction \\
                 Chapter 14: Answer set programming, an extension of
                 Horn logic \\
                 Chapter 15: Conclusions \\
                 References \\
                 Index",
}

@Book{Maros:2003:CTS,
  author =       "Istv{\'a}n Maros",
  title =        "Computational Techniques of the Simplex Method",
  volume =       "61",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "xx + 325",
  year =         "2003",
  ISBN =         "1-4020-7332-1",
  ISBN-13 =      "978-1-4020-7332-8",
  LCCN =         "T57.76 .M37 2003",
  bibdate =      "Thu Mar 22 11:56:48 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "International series in operations research and
                 management science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0820/2002040603-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0820/2002040603-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Linear programming; Computer algorithms",
}

@Book{Matiyasevich:1993:HTP,
  author =       "Yuri V. Matiyasevich",
  title =        "{Hilbert}'s Tenth Problem",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxii + 264",
  year =         "1993",
  ISBN =         "0-262-13295-8",
  ISBN-13 =      "978-0-262-13295-4",
  LCCN =         "QA242 .M399 1993",
  bibdate =      "Fri Mar 23 08:09:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  note =         "With a foreword by Martin Davis.",
  series =       "Foundations of computing",
  acknowledgement = ack-nhfb,
  subject =      "Hilbert's tenth problem; Computable functions",
}

@Book{Mazur:2010:CGT,
  author =       "David R. Mazur",
  title =        "Combinatorics: a Guided Tour",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xviii + 391",
  year =         "2010",
  ISBN =         "0-88385-762-6 (hardcover)",
  ISBN-13 =      "978-0-88385-762-5 (hardcover)",
  LCCN =         "QA164 .M398 2010",
  bibdate =      "Fri Mar 23 10:31:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "MAA textbooks",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis",
}

@Book{Mazzola:2006:CMC,
  author =       "G. (Guerino) Mazzola and G{\'e}rard Milmeister and
                 Jody Weissmann",
  title =        "Comprehensive Mathematics for Computer Scientists 1:
                 Sets and Numbers, Graphs and Algebra, Logic and
                 Machines, Linear Geometry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiv + 383",
  year =         "2006",
  ISBN =         "3-540-36873-6, 3-540-36874-4",
  ISBN-13 =      "978-3-540-36873-1, 978-3-540-36874-8",
  LCCN =         "QA267.7 .M39 2006",
  bibdate =      "Fri Mar 23 10:30:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Computer science;
                 Mathematics",
}

@Book{McConnell:2001:AAA,
  author =       "Jeffrey J. McConnell",
  title =        "Analysis of Algorithms: an Active Learning Approach",
  publisher =    "Jones and Bartlett Publishers",
  address =      "Sudbury, MA, USA",
  year =         "2001",
  ISBN =         "0-7637-1634-0",
  ISBN-13 =      "978-0-7637-1634-9",
  LCCN =         "QA76.9.A43 M38 2001b",
  bibdate =      "Fri Mar 23 08:31:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms",
}

@Book{Mehlhorn:2008:ADS,
  author =       "Kurt Mehlhorn and Peter Sanders",
  title =        "Algorithms and Data Structures: the Basic Toolbox",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 300",
  year =         "2008",
  ISBN =         "3-540-77978-7, 3-540-77977-9",
  ISBN-13 =      "978-3-540-77978-0, 978-3-540-77977-3",
  LCCN =         "QA76.9.D35 M47 2008eb",
  bibdate =      "Fri Mar 23 10:32:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Data structures (Computer science); Computer
                 algorithms",
}

@Book{Mehlmann:2000:GAG,
  author =       "Alexander Mehlmann",
  title =        "The Game's Afoot!: Game Theory in Myth and Paradox",
  volume =       "5",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xx + 159",
  year =         "2000",
  ISBN =         "0-8218-2121-0",
  ISBN-13 =      "978-0-8218-2121-3",
  ISSN =         "1520-9121",
  LCCN =         "QA269 .M44513 2000",
  bibdate =      "Fri Mar 23 17:29:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Translated by David Kramer.",
  series =       "Student mathematical library",
  acknowledgement = ack-nhfb,
  subject =      "Game theory",
}

@Book{Mendelson:2004:IGT,
  author =       "Elliott Mendelson",
  title =        "Introducing Game Theory and Its Applications",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "259",
  year =         "2004",
  ISBN =         "1-58488-300-6",
  ISBN-13 =      "978-1-58488-300-5",
  LCCN =         "QA269 .M455 2004",
  bibdate =      "Thu Mar 22 12:25:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/2004042807-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Game theory",
}

@Book{Mermin:2007:QCS,
  author =       "N. David Mermin",
  title =        "Quantum Computer Science: an Introduction",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 220",
  year =         "2007",
  ISBN =         "0-521-87658-3 (hardcover)",
  ISBN-13 =      "978-0-521-87658-2 (hardcover)",
  LCCN =         "QA76.889 .M47 2007",
  bibdate =      "Fri Mar 23 10:30:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://site.ebrary.com/lib/stanford/Doc?id=10202764",
  acknowledgement = ack-nhfb,
  subject =      "Quantum computers; Quantum theory",
  tableofcontents = "Preface \\
                 1. Cbits and Qbits \\
                 2. General features and some simple examples \\
                 3. Breaking RSA encryption with a quantum computer \\
                 4. Searching with a quantum computer \\
                 5. Quantum error correction \\
                 6. Protocols that use just a few Qbits \\
                 Appendices \\
                 Index",
}

@Book{Michalewicz:2002:HSI,
  author =       "Zbigniew Michalewicz and David B. Fogel",
  title =        "How to Solve It: Modern Heuristics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 467",
  year =         "2002",
  ISBN =         "3-540-66061-5",
  ISBN-13 =      "978-3-540-66061-3",
  LCCN =         "QA63 .M53 2000",
  bibdate =      "Fri Mar 23 08:26:45 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Problem solving; Heuristic",
  tableofcontents = "What are the ages of my three sons? \\
                 1. Why are some problems difficult to solve? \\
                 How important is a model? \\
                 2. Basic concepts \\
                 What are the prices in 7--11?\\
                 3. traditional methods \\
                 Part 1 What are the numbers? \\
                 Traditional methods \\
                 Part 2 What's the colour of the bear? \\
                 Escaping local optima \\
                 How good is your intuition? \\
                 An evolutionary approach \\
                 One of these things is not like the others \\
                 Designing evolutionary algorithms \\
                 What is the shortest way? \\
                 The travelling salesman problem \\
                 Who owns the zebra? \\
                 Constraint-handling techniques \\
                 Can you tune to the problem? \\
                 Tuning the algorithm to the problem \\
                 Can you mate in two moves? \\
                 Time-varying environments and noise \\
                 Day of the week of January 1st \\
                 Neural networks \\
                 What was the length of the rope? \\
                 Fuzzy systems \\
                 Do you like simple solutions? \\
                 Hybrid systems \\
                 Summary",
}

@Book{Michiels:2007:TAL,
  author =       "Wil Michiels and E. H. L. (Emile H. L.) Aarts and Jan
                 Korst",
  title =        "Theoretical Aspects of Local Search",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 235",
  year =         "2007",
  ISBN =         "3-540-35853-6",
  ISBN-13 =      "978-3-540-35853-4",
  LCCN =         "QA402.5 .M526 2007",
  bibdate =      "Thu Mar 22 13:05:13 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in theoretical computer science,
                 1431-2654",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0824/2006936842-d.html;
                 http://www.loc.gov/catdir/toc/fy0707/2006936842.html",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial optimization; Heuristic programming",
}

@Book{Miller:2005:ASP,
  author =       "Russ Miller and Laurence Boxer",
  title =        "Algorithms sequential and parallel: a unified
                 approach",
  publisher =    "Charles River Media",
  address =      "Hingham, MA, USA",
  edition =      "Second",
  pages =        "xix + 372",
  year =         "2005",
  ISBN =         "1-58450-412-9, 1-58450-652-0",
  ISBN-13 =      "978-1-58450-412-2, 978-1-58450-652-2",
  LCCN =         "QA76.9.A43 M55 2005",
  bibdate =      "Fri Mar 23 10:23:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer programming",
}

@Book{Milner:1999:CMS,
  author =       "R. (Robin) Milner",
  title =        "Communicating and Mobile Systems: the $ \pi
                 $-Calculus",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 161",
  year =         "1999",
  ISBN =         "0-521-05216-4 (hardcover), 0-521-05216-5 (paperback)",
  ISBN-13 =      "978-0-521-05216-0 (hardcover), 978-0-521-05216-0
                 (paperback)",
  LCCN =         "QA76.59 .M55 1999",
  bibdate =      "Wed Mar 21 19:05:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1934--2010",
  subject =      "Mobile computing; Telecommunication systems;
                 Pi-calculus",
}

@Book{Milner:2009:SMC,
  author =       "R. (Robin) Milner",
  title =        "The Space and Motion of Communicating Agents",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 191",
  year =         "2009",
  ISBN =         "0-521-49030-8 (hardcover), 0-521-73833-4 (paperback)",
  ISBN-13 =      "978-0-521-49030-6 (hardcover), 978-0-521-73833-0
                 (paperback)",
  LCCN =         "TK5102.5 .M524 2009",
  bibdate =      "Thu Mar 22 12:28:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0729/2007014231-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0729/2007014231-d.html;
                 http://www.loc.gov/catdir/toc/ecip0715/2007014231.html",
  acknowledgement = ack-nhfb,
  author-dates = "1934--2010",
  subject =      "Communication; Network analysis; Mathematical models;
                 Telecommunication systems; Machine theory; Nets
                 (Mathematics)",
  tableofcontents = "1. The idea of bigraphs \\
                 2. Defining bigraphs \\
                 3. Algebra for bigraphs \\
                 4. Relative and minimal bounds \\
                 5. Bigraphical structure \\
                 6. Sorting \\
                 7. Reactions and transitions \\
                 8. Bigraphical reactive systems \\
                 9. Behaviour in link graphs \\
                 10. Behavioural theory for CCS \\
                 11. Further topics \\
                 12. Background, development and related work \\
                 App. A. Technical detail \\
                 App. B. Solutions to exercises",
}

@Book{Mitzenmacher:2005:PCR,
  author =       "Michael Mitzenmacher and Eli Upfal",
  title =        "Probability and Computing: Randomized Algorithms and
                 Probabilistic Analysis",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  year =         "2005",
  ISBN =         "0-521-83540-2",
  ISBN-13 =      "978-0-521-83540-4",
  LCCN =         "QA274 .M574 2005",
  bibdate =      "Fri Mar 23 10:26:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Algorithms; Probabilities; Stochastic analysis",
}

@Book{Mollin:2003:RPK,
  author =       "Richard A. Mollin",
  title =        "{RSA} and Public-Key Cryptography",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xii + 291",
  year =         "2003",
  ISBN =         "1-58488-338-3",
  ISBN-13 =      "978-1-58488-338-8",
  LCCN =         "QA268 .M655 2003",
  bibdate =      "Thu Mar 22 12:58:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/2002031096-d.html;
                 http://www.loc.gov/catdir/toc/fy036/2002031096.html",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Public key cryptography",
}

@Book{Mollin:2005:CGS,
  author =       "Richard A. Mollin",
  title =        "Codes: The Guide to Secrecy from Ancient to Modern
                 Times",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xx + 678",
  year =         "2005",
  ISBN =         "1-4200-3508-8 (e-book), 1-58488-470-3 (hardcover)",
  ISBN-13 =      "978-1-4200-3508-7 (e-book), 978-1-58488-470-5
                 (hardcover)",
  LCCN =         "QA76.9.A25 M67 2005",
  bibdate =      "Fri Mar 23 10:25:12 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  URL =          "http://marc.crcnetbase.com/isbn/9781420035087",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Data encryption (Computer
                 science)",
  tableofcontents = "Preface \\
                 FROM THE RIDDLES OF ANCIENT EGYPT TO CRYPTOGRAPHY IN
                 THE RENAISSANCE-3,500 YEARS IN THE MAKING \\
                 Antiquity-From Phaistos Cryptography in Classical
                 Literature The Middle Ages Cryptology and the Arabs
                 Rise of the West \\
                 FROM SIXTEENTH-CENTURY CRYPTOGRAPHY TO THE NEW
                 MILLENNIUM-THE LAST 500 YEARS \\
                 Three Post-Renaissance Centuries The American Colonies
                 Nineteenth-Century Cryptography Two World Wars The Post
                 War Era and the Future \\
                 SYMMETRIC-KEY CRYPTOGRAPHY \\
                 Block Ciphers and DES S-DES and DES Modes of Operation
                 Blowfish The Advanced Encryption Standard Stream
                 Ciphers \\
                 RC4 PUBLIC-KEY CRYPTOGRAPHY \\
                 The Ideas Behind PKC RSA Digital Signatures ElGamal \\
                 CRYPTOGRAPHIC PROTOCOLS \\
                 Introduction Keys Identification Commitment Secret
                 Sharing Electronic Voting Protocol Layers and SSL
                 Digital Cash Schemes \\
                 KEY MANAGEMENT \\
                 Authentication, Exchange, and Distribution Public-Key
                 Infrastructure (PKI) Secure Electronic Transaction
                 (SET) \\
                 MESSAGE AUTHENTICATION \\
                 Authentication Functions Message Authentication Codes
                 Encryption Functions Authentication Applications \\
                 ELECTRONIC MAIL AND INTERNET SECURITY \\
                 Pretty Good Privacy (PGP) S/MIME and PGP IPSec
                 Internetworking and Security-Firewalls Client-Server
                 Model and Cookies History of the Internet and the WWW
                 \\
                 APPLICATIONS AND THE FUTURE \\
                 Login and Network Security Wireless Security Smart
                 Cards Biometrics Quantum Cryptography Nuclear Test Ban
                 Treaty Compliance \\
                 NON-CRYPTOGRAPHIC SECURITY ISSUES \\
                 Cybercrime Hackers Viruses and Other Infections Legal
                 Matters and Controversy \\
                 INFORMATION THEORY AND CODING \\
                 Shannon Entropy Huffman Codes Information Theory of
                 Cryptosystems Error-Correcting Codes \\
                 APPENDIX A: MATHEMATICAL FACTS \\
                 Sets, Relations, and Functions Basic Arithmetic Modular
                 Arithmetic Groups, Fields, Modules, and Rings Vector
                 Spaces Basic Matrix Theory Continued Fractions Elliptic
                 Curves Complexity \\
                 APPENDIX B: PSEUDO-RANDOM NUMBER GENERATION \\
                 ANSI X9.17 The Blum-Blum-Shub-(BBS) PRNG \\
                 APPENDIX C: FACTORING LARGE INTEGERS \\
                 Classical Factorization Methods The Continued Fraction
                 Algorithm Pollard's p-1 Algorithm Pollard's Rho-Method
                 The Quadratic Sieve (QS) Multipolynomial Quadratic
                 Sieve (MPQS) The Elliptic Curve Method (ECM) The
                 General Number Field Sieve \\
                 APPENDIX D: TECHNICAL AND ADVANCED DETAILS AES \\
                 Silver-Pohlig-Hellman Baby-Step Giant-Step Algorithm
                 Index-Calculus Algorithm Brands' Digital Cash Scheme
                 Radix-64 Encoding \\
                 APPENDIX E: PROBABILITY THEORY \\
                 Basic Probability Randomness, Expectation, and Variance
                 Binomial Distribution The Law of Large Numbers
                 Probability and Error Detection \\
                 APPENDIX F: RECOGNIZING PRIMES \\
                 Primality and Compositeness Tests
                 Miller-Selfridge-Rabin Primes is in P Generation of
                 Random Primes Decision Problem or Primality Test? \\
                 APPENDIX G: EXERCISES \\
                 BIBLIOGRAPHY \\
                 LIST OF SYMBOLS \\
                 INDEX",
}

@Book{Mora:2003:SPE,
  author =       "Teo Mora",
  title =        "Solving Polynomial Equation Systems. {I}. {The}
                 {Kronecker--Duval} Philosophy",
  volume =       "88",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 423",
  year =         "2003",
  ISBN =         "0-521-81154-6",
  ISBN-13 =      "978-0-521-81154-5",
  LCCN =         "QA218 .M64 2003",
  bibdate =      "Fri Mar 23 17:48:15 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Encyclopedia of mathematics and its applications",
  acknowledgement = ack-nhfb,
  subject =      "polynomials; iterative methods (mathematics);
                 equations; numerical solutions",
}

@Book{Mora:2005:SPE,
  author =       "Teo Mora",
  title =        "Solving Polynomial Equation Systems: {II}:
                 {Macaulay}'s Paradigm and {Gr{\"o}bner} Technology",
  volume =       "99",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxii + 759",
  year =         "2005",
  ISBN =         "0-521-81156-2",
  ISBN-13 =      "978-0-521-81156-9",
  LCCN =         "QA218 .M64 2005",
  bibdate =      "Fri Mar 23 17:48:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "Encyclopedia of mathematics and its applications",
  acknowledgement = ack-nhfb,
}

@Book{Mosses:1992:AS,
  author =       "Peter D. Mosses",
  title =        "Action Semantics",
  volume =       "26",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xx + 372",
  year =         "1992",
  ISBN =         "0-521-40347-2",
  ISBN-13 =      "978-0-521-40347-4",
  LCCN =         "QA76.7 .M68 1992",
  bibdate =      "Thu Mar 22 10:53:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/92249086.html;
                 http://www.loc.gov/catdir/toc/cam029/92249086.html",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers);
                 Semantics",
  tableofcontents = "Part I. Language Descriptions: \\
                 1. Motivation \\
                 2. Concepts \\
                 3. Formalities \\
                 Part II. Action Notation: \\
                 4. Basic \\
                 5. Data \\
                 6. Functional \\
                 7. Declarative \\
                 8. Imperative \\
                 9. Reflective \\
                 10. Communicative \\
                 Part III. Action Semantic Descriptions: \\
                 11. Statements \\
                 12. Literals \\
                 13. Expressions \\
                 14. Declarations \\
                 15. Variables \\
                 16. Subprogramming \\
                 17. Tasks \\
                 Part IV. Conclusion: \\
                 18. Other frameworks \\
                 19. Development \\
                 Appendices \\
                 Bibliography \\
                 Symbol Index \\
                 Concept Index",
}

@Book{Moulin:2003:FDC,
  author =       "Herv{\'e} Moulin",
  title =        "Fair Division and Collective Welfare",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "vi + 289",
  year =         "2003",
  ISBN =         "0-262-13423-3",
  ISBN-13 =      "978-0-262-13423-1",
  LCCN =         "HB846 .M68 2003",
  bibdate =      "Thu Mar 22 12:11:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Welfare economics; Equality; Economic aspects; Income
                 distribution; Wealth; Moral and ethical aspects;
                 Distributive justice",
}

@Book{Mullen:2007:FFA,
  author =       "Gary L. Mullen and Carl Mummert",
  title =        "Finite Fields and Applications",
  volume =       "41",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "ix + 175",
  year =         "2007",
  ISBN =         "0-8218-4418-0 (paperback)",
  ISBN-13 =      "978-0-8218-4418-2 (paperback)",
  LCCN =         "QA247.3 .M85 2007",
  bibdate =      "Thu Mar 22 12:12:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Student mathematical library",
  acknowledgement = ack-nhfb,
  subject =      "Finite fields (Algebra); Coding theory; Cryptography",
}

@Book{Nahin:1998:ITS,
  author =       "Paul J. Nahin",
  title =        "An Imaginary Tale: the Story of $ \sqrt {-1} $ [the
                 square root of minus one]",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xvi + 257",
  year =         "1998",
  ISBN =         "0-691-02795-1",
  ISBN-13 =      "978-0-691-02795-1",
  LCCN =         "QA255 .N34 1998",
  bibdate =      "Sat Jun 28 14:13:29 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  annote =       "This is a lovely book that complements the stories of
                 $0$ \cite{Kaplan:1999:NNH}, $e$ \cite{Maor:1994:SN}, $
                 \gamma $ \cite{Havil:2003:GEE}, $ \infty $
                 \cite{Clegg:2003:BHI}, $ \phi $
                 \cite{Herz-Fischler:1987:MHD,Herz-Fischler:1998:MHG,Livio:2002:GRS},
                 and $ \pi $ \cite{Beckmann:1993:HP}. Recall the famous
                 identity $ e^{i \pi } + 1 = 0 $ that connects the
                 fundamental numbers of mathematics and computers.",
  libnote =      "Not in my library.",
}

@Book{Nahin:2004:WLB,
  author =       "Paul J. Nahin",
  title =        "When Least Is Best: How Mathematicians Discovered Many
                 Clever Ways to Make Things as Small (or as Large) as
                 Possible",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xviii + 370",
  year =         "2004",
  ISBN =         "0-691-07078-4 (hardcover)",
  ISBN-13 =      "978-0-691-07078-0 (hardcover)",
  LCCN =         "QA306.N34 2004",
  bibdate =      "Fri Mar 23 21:42:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.mit.edu:9909/mit01",
  acknowledgement = ack-nhfb,
  subject =      "Maxima and minima; Mathematics; History",
  tableofcontents = "1. Minimums, Maximums, Derivatives, and Computers
                 \\
                 1.1. Introduction \\
                 1.2. When Derivatives Don't Work \\
                 1.3. Using Algebra to Find Minimums \\
                 1.4. A Civil Engineering Problem \\
                 1.5. The AM-GM Inequality \\
                 1.6. Derivatives from Physics \\
                 1.7. Minimizing with a Computer \\
                 2. The First Extremal Problems \\
                 2.1. The Ancient Confusion of Length and Area \\
                 2.2. Dido's Problem and the Isoperimetric Quotient \\
                 2.3. Steiner's ``Solution'' to Dido's Problem \\
                 2.4. How Steiner Stumbled \\
                 2.5. A ``Hard'' Problem with an Easy Solution \\
                 2.6. Fagnano's Problem \\
                 3. Medieval Maximization and Some Modern Twists \\
                 3.1. The Regiomontanus Problem \\
                 3.2. The Saturn Problem \\
                 3.3. The Envelope-Folding Problem \\
                 3.4. The Pipe-and-Corner Problem \\
                 3.5. Regiomontanus Redux \\
                 3.6. The Muddy Wheel Problem \\
                 4. The Forgotten War of Descartes and Fermat \\
                 4.1. Two Very Different Men \\
                 4.2. Snell's Law \\
                 4.3. Fermat, Tangent Lines, and Extrema \\
                 4.4. The Birth of the Derivative \\
                 4.5. Derivatives and Tangents \\
                 4.6. Snell's Law and the Principle of Least Time \\
                 4.7. A Popular Textbook Problem \\
                 4.8. Snell's Law and the Rainbow \\
                 5. Calculus Steps Forward, Center Stage \\
                 5.1. The Derivative: Controversy and Triumph \\
                 5.2. Paintings Again, and Kepler's Wine Barrel \\
                 5.3. The Mailable Package Paradox \\
                 5.4. Projectile Motion in a Gravitational Field \\
                 5.5. The Perfect Basketball Shot \\
                 5.6. Halley's Gunnery Problem \\
                 5.7. De L'Hospital and His Pulley Problem, and a New
                 Minimum Principle \\
                 5.8. Derivatives and the Rainbow \\
                 6. Beyond Calculus \\
                 6.1. Galileo's Problem \\
                 6.2. The Brachistochrone Problem \\
                 6.3. Comparing Galileo and Bernoulli \\
                 6.4. The Euler-Lagrange Equation \\
                 6.5. The Straight Line and the Brachistochrone \\
                 6.6. Galileo's Hanging Chain \\
                 6.7. The Catenary Again --6.8. The Isoperimetric
                 Problem, Solved (at last!) \\
                 6.9. Minimal Area Surfaces, Plateau's Problem, and Soap
                 Bubbles \\
                 6.10. The Human Side of Minimal Area Surfaces \\
                 7. The Modern Age Begins \\
                 7.1. The Fermat/Steiner Problem \\
                 7.2. Digging the Optimal Trench, Paving the Shortest
                 Mail Route, and Least-Cost Paths through Directed
                 Graphs \\
                 7.3. The Traveling Salesman Problem \\
                 7.4. Minimizing with Inequalities (Linear Programming)
                 \\
                 7.5. Minimizing by Working Backwards (Dynamic
                 Programming) \\
                 App. A. The AM-GM Inequality \\
                 App. B. The AM-QM Inequality, and Jensen's Inequality
                 \\
                 App. C. ``The Sagacity of the Bees'' \\
                 App. D. Every Convex Figure Has a Perimeter Bisector
                 \\
                 App. E. The Gravitational Free-Fall Descent Time along
                 a Circle \\
                 App. F. The Area Enclosed by a Closed Curve \\
                 App. G. Beltrami's Identity \\
                 App. H. The Last Word on the Lost Fisherman Problem",
}

@Book{Nerode:1993:LA,
  author =       "Anil Nerode and Richard A. Shore",
  title =        "Logic for Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 365",
  year =         "1993",
  ISBN =         "0-387-94129-0 (New York), 3-540-94129-0 (Berlin)",
  ISBN-13 =      "978-0-387-94129-5 (New York), 978-3-540-94129-3
                 (Berlin)",
  LCCN =         "QA76.63 .N45 1993",
  bibdate =      "Thu Mar 22 12:34:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts and monographs in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Logic programming; Logic, Symbolic and mathematical",
}

@Book{Nerode:1997:LA,
  author =       "Anil Nerode and Richard A. Shore",
  title =        "Logic for Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiii + 456",
  year =         "1997",
  ISBN =         "0-387-94893-7 (hardcover)",
  ISBN-13 =      "978-0-387-94893-5 (hardcover)",
  LCCN =         "QA76.9.M35 N47 1997",
  bibdate =      "Fri Mar 23 07:56:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/96043297-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0815/96043297-t.html",
  acknowledgement = ack-nhfb,
  subject =      "computer science; mathematics; logic, symbolic and
                 mathematical",
  tableofcontents = "Propositional logic \\
                 Predicate logic \\
                 PROLOG \\
                 Modal logic \\
                 Intuitionistic logic \\
                 Elements of set theory \\
                 Appendices",
}

@Book{Nievergelt:2002:FLM,
  author =       "Yves Nievergelt",
  title =        "Foundations of Logic and Mathematics: Applications to
                 Computer Science and Cryptography",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xvi + 415",
  year =         "2002",
  ISBN =         "0-8176-4249-8 , 3-7643-4249-8",
  ISBN-13 =      "978-0-8176-4249-5, 978-3-7643-4249-4",
  LCCN =         "QA9 .N53 2002",
  bibdate =      "Fri Mar 23 19:09:42 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2001052551-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2001052551-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Logic, Symbolic and mathematical; Set theory; Number
                 theory; Computer science; Mathematics",
}

@Book{Olderog:1991:NTF,
  author =       "Ernst-R{\"u}diger Olderog",
  title =        "Nets, Terms, and Formulas: Three Views of Concurrent
                 Processes and Their Relationship",
  volume =       "23",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 267",
  year =         "1991",
  ISBN =         "0-521-40044-9",
  ISBN-13 =      "978-0-521-40044-2",
  LCCN =         "QA76.58 .O43 1991",
  bibdate =      "Thu Mar 22 10:39:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/92160256.html;
                 http://www.loc.gov/catdir/toc/cam029/92160256.html",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers); System
                 design",
  tableofcontents = "1. Introduction \\
                 2. Petri nets \\
                 3. Process terms \\
                 4. Logical formulas \\
                 5. Process construction \\
                 6. Extensions \\
                 References",
}

@Book{ORourke:1994:CGCc,
  author =       "Joseph O'Rourke",
  title =        "Computational Geometry in {C}",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 346",
  year =         "1994",
  ISBN =         "0-521-44034-3, 0-521-44592-2 (paperback)",
  ISBN-13 =      "978-0-521-44034-9, 978-0-521-44592-4 (paperback)",
  LCCN =         "QA448.D38 O76 1994",
  bibdate =      "Thu Mar 22 11:55:07 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Geometry; Data processing; C (Computer program
                 language)",
}

@Book{Padberg:2010:LOE,
  author =       "Manfred W. Padberg",
  title =        "Linear Optimization and Extensions",
  volume =       "12",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xx + 501",
  year =         "2010",
  ISBN =         "3-642-08511-3 (paperback)",
  ISBN-13 =      "978-3-642-08511-6 (paperback)",
  LCCN =         "T57.74 .P3 2010",
  bibdate =      "Fri Mar 23 11:52:18 MDT 2012",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "Algorithms and combinatorics, 0937-5511",
  acknowledgement = ack-nhfb,
  subject =      "Linear programming; Mathematical optimization",
}

@Book{Parkes:2002:ILM,
  author =       "Alan Parkes",
  title =        "Introduction to Languages, Machines and Logic:
                 Computable Languages, Abstract Machines and Formal
                 Logic",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 351",
  year =         "2002",
  ISBN =         "1-85233-464-9 (paperback)",
  ISBN-13 =      "978-1-85233-464-2 (paperback)",
  LCCN =         "QA267.3 .P37 2002",
  bibdate =      "Fri Mar 23 11:37:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/2001054282-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0816/2001054282-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Formal languages; Machine theory",
}

@Book{Parkes:2008:CIL,
  author =       "Alan Parkes",
  title =        "A Concise Introduction to Languages and Machines",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x, vi--vii, 343",
  year =         "2008",
  ISBN =         "1-84800-120-7 (paperback)",
  ISBN-13 =      "978-1-84800-120-6 (paperback)",
  LCCN =         "QA267.3 .P36 2008",
  bibdate =      "Thu Mar 22 12:28:18 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Undergraduate topics in computer science",
  acknowledgement = ack-nhfb,
  subject =      "Formal languages; Machine theory",
}

@Book{Peterson:2002:MTS,
  author =       "Ivars Peterson",
  title =        "Mathematical Treks: From Surreal Numbers to Magic
                 Circles",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "x + 170",
  year =         "2002",
  ISBN =         "0-88385-537-2",
  ISBN-13 =      "978-0-88385-537-9",
  LCCN =         "QA99 .P47 2002",
  bibdate =      "Fri Mar 23 18:26:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Spectrum series; A science news book",
  URL =          "http://www.loc.gov/catdir/description/cam022/2001098094.html;
                 http://www.loc.gov/catdir/toc/cam027/2001098094.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Miscellanea",
}

@Book{Petkovic:2009:FPG,
  author =       "Miodrag Petkovi{\'c}",
  title =        "Famous Puzzles of Great Mathematicians",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xviii + 325",
  year =         "2009",
  ISBN =         "0-8218-4814-3",
  ISBN-13 =      "978-0-8218-4814-2",
  LCCN =         "QA95 .P4358 2009",
  bibdate =      "Thu Mar 22 12:12:03 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical recreations; Mathematics; Popular works",
}

@Book{Petkovsek:1996:AB,
  author =       "Marko Petkov{\v{s}}ek and Herbert S. Wilf and Doron
                 Zeilberger",
  title =        "{$ A = B $}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xii + 212",
  year =         "1996",
  ISBN =         "1-56881-063-6",
  ISBN-13 =      "978-1-56881-063-8",
  LCCN =         "QA164.9 .P48 1996",
  bibdate =      "Fri Mar 23 07:28:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial identities; Data processing",
  tableofcontents = "I. Background \\
                 1. Proof Machines \\
                 2. Tightening the Target \\
                 3. The Hypergeometric Database \\
                 II. The Five Basic Algorithms \\
                 4. Sister Celine's Method \\
                 5. Gosper's Algorithm \\
                 6. Zeilberger's Algorithm \\
                 7. The WZ Phenomenon \\
                 8. Algorithm Hyper \\
                 III. Epilogue \\
                 9. An Operator Algebra Viewpoint \\
                 A: The WWW sites and the software",
}

@Book{Petzold:2008:ATG,
  author =       "Charles Petzold",
  title =        "The Annotated {Turing}: a Guided Tour Through {Alan
                 Turing}'s Historic Paper on Computability and the
                 {Turing Machine}",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xii + 372",
  year =         "2008",
  ISBN =         "0-470-22905-5 (paperback)",
  ISBN-13 =      "978-0-470-22905-7 (paperback)",
  LCCN =         "QA267 .P48 2008",
  bibdate =      "Sat Nov 20 21:31:14 MST 2010",
  bibsource =    "catalog.princeton.edu:7090/voyager;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  abstract =     "Mathematician Alan Turing invented an imaginary
                 computer known as the Turing Machine; in an age before
                 computers, he explored the concept of what it meant to
                 be computable, creating the field of computability
                 theory in the process, a foundation of present-day
                 computer programming. The book expands Turing's
                 original 36-page paper with additional background
                 chapters and extensive annotations; the author
                 elaborates on and clarifies many of Turing's
                 statements, making the original difficult-to-read
                 document accessible to present day programmers,
                 computer science majors, math geeks, and others.
                 Interwoven into the narrative are the highlights of
                 Turing's own life: his years at Cambridge and
                 Princeton, his secret work in cryptanalysis during
                 World War II, his involvement in seminal computer
                 projects, his speculations about artificial
                 intelligence, his arrest and prosecution for the crime
                 of ``gross indecency,'' and his early death by apparent
                 suicide at the age of 41.''",
  acknowledgement = ack-nhfb,
  subject =      "Turing, Alan Mathison; Turing machines; Computational
                 complexity",
  subject-dates = "1912--1954",
  tableofcontents = "This tomb holds Diophantus \\
                 The irrational and the transcendental \\
                 Centuries of progress \\
                 The education of Alan Turing \\
                 Machines at work \\
                 Addition and multiplication \\
                 Also known as subroutines \\
                 Everything is a number \\
                 The universal machine \\
                 Computers and computability \\
                 Of machines and men \\
                 Logic and computability \\
                 Computable functions \\
                 The major proof \\
                 The lambda calculus \\
                 Conceiving the continuum \\
                 Is everything a turing machine? \\
                 The long sleep of Diophantus",
}

@Book{Pierce:2002:TPL,
  author =       "Benjamin C. Pierce",
  title =        "Types and Programming Languages",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xxi + 623",
  year =         "2002",
  ISBN =         "0-262-16209-1 (hardcover)",
  ISBN-13 =      "978-0-262-16209-8 (hardcover)",
  LCCN =         "QA76.7 .P54 2002",
  bibdate =      "Thu Mar 22 13:09:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Programming languages (Electronic computers)",
}

@Book{Pippenger:1997:TC,
  author =       "Nicholas Pippenger",
  title =        "Theories of Computability",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "ix + 251",
  year =         "1997",
  ISBN =         "0-521-55380-6 (hardcover)",
  ISBN-13 =      "978-0-521-55380-3 (hardcover)",
  LCCN =         "QA267 .P553 1997",
  bibdate =      "Thu Mar 22 13:05:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam028/96044633.html;
                 http://www.loc.gov/catdir/toc/cam023/96044633.html",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory",
}

@Book{Pittenger:2000:IQC,
  author =       "Arthur O. Pittenger",
  title =        "An Introduction to Quantum Computing Algorithms",
  volume =       "19",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xii + 138",
  year =         "2000",
  ISBN =         "0-8176-4127-0 , 3-7643-4127-0",
  ISBN-13 =      "978-0-8176-4127-6, 978-3-7643-4127-5",
  LCCN =         "QA76.889 .P58 2000",
  bibdate =      "Thu Mar 22 12:09:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  subject =      "Quantum computers; Computer algorithms",
}

@Book{Pollack:2009:ABD,
  author =       "Paul Pollack",
  title =        "Not Always Buried Deep: a Second Course in Elementary
                 Number Theory",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xv + 303",
  year =         "2009",
  ISBN =         "0-8218-4880-1 (hardcover)",
  ISBN-13 =      "978-0-8218-4880-7 (hardcover)",
  LCCN =         "QA241 .P657 2009",
  bibdate =      "Fri Mar 23 10:31:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Number theory",
}

@Book{Pottmann:2001:CLG,
  author =       "Helmut Pottmann and Johannes Wallner",
  title =        "Computational Line Geometry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 563",
  year =         "2001",
  ISBN =         "3-540-42058-4",
  ISBN-13 =      "978-3-540-42058-3",
  LCCN =         "QA608 .P68 2001",
  bibdate =      "Thu Mar 22 11:56:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematics and visualization",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0816/2001040054-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0816/2001040054-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Line geometry; Data processing",
}

@Book{Pottmann:2009:CLG,
  author =       "Helmut Pottmann and Johannes Wallner",
  title =        "Computational Line Geometry",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 563",
  year =         "2009",
  ISBN =         "3-642-04017-9 (softcover)",
  ISBN-13 =      "978-3-642-04017-7 (softcover)",
  LCCN =         "QA608 .P68 2010",
  bibdate =      "Thu Mar 22 11:56:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
}

@Book{Reed:2009:DSA,
  author =       "David M. Reed and John M. Zelle",
  title =        "Data Structures and Algorithms using {Python} and
                 {C++}",
  publisher =    "Franklin, Beedle and Associates",
  address =      "Wilsonville, OR, USA",
  pages =        "xiii + 568",
  year =         "2009",
  ISBN =         "1-59028-233-7",
  ISBN-13 =      "978-1-59028-233-5",
  LCCN =         "QA76.73.P98 R44 2009",
  bibdate =      "Thu Mar 22 12:04:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  abstract =     "Builds on knowledge from a first course in computer
                 programming using Python. Makes a transition from
                 programming in Python to a data structures course and
                 programming in C++.",
  acknowledgement = ack-nhfb,
  subject =      "Python (Computer program language); C++ (Computer
                 program language); Data structures (Computer science);
                 Computer algorithms",
}

@Book{Reid:2006:ZIW,
  author =       "Constance Reid",
  title =        "From Zero to Infinity: What Makes Numbers
                 Interesting",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  edition =      "Fifth",
  pages =        "xvii + 188",
  year =         "2006",
  ISBN =         "1-56881-273-6",
  ISBN-13 =      "978-1-56881-273-1",
  LCCN =         "QA93 .R42 2006",
  bibdate =      "Fri Dec 23 07:07:08 MST 2005",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not yet in my library.",
  subject =      "numerals; number theory",
}

@TechReport{Reingold:1988:MNO,
  author =       "Edward M. Reingold and Xiao-Jun Shen",
  title =        "More nearly optimal algorithms for unbounded
                 searching",
  type =         "Report",
  number =       "UIUCDCS-R-88-1471",
  institution =  "Department of Computer Science, University of Illinois
                 at Urbana-Champaign",
  address =      "Urbana, IL, USA",
  pages =        "56",
  year =         "1988",
  bibdate =      "Fri Mar 23 07:55:10 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  tableofcontents = "Ackermann's function. \\
                 Inverse Ackermann's function. \\
                 Kraft's inequality. \\
                 Ordinal numbers. \\
                 Prefix free codes. \\
                 Unbounded search.",
}

@Article{Reingold:1991:MNOa,
  author =       "Edward M. Reingold and Xiao Jun Shen",
  title =        "More Nearly Optimal Algorithms for Unbounded
                 Searching, {Part I}: The Finite Case",
  journal =      j-SIAM-J-COMPUT,
  volume =       "20",
  number =       "1",
  pages =        "156--183",
  month =        feb,
  year =         "1991",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q25 (68Q20)",
  MRnumber =     "91m:68091a",
  MRreviewer =   "D. M. Campbell",
  bibdate =      "Mon Nov 29 11:01:41 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/20/1;
                 http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Reingold:1991:MNOb,
  author =       "Edward M. Reingold and Xiao Jun Shen",
  title =        "More nearly optimal algorithms for unbounded
                 searching. {II}. The transfinite case",
  journal =      j-SIAM-J-COMPUT,
  volume =       "20",
  number =       "1",
  pages =        "184--208",
  month =        feb,
  year =         "1991",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68Q25 (04A10 68Q20)",
  MRnumber =     "91m:68091b",
  MRreviewer =   "D. M. Campbell",
  bibdate =      "Mon Nov 29 11:01:41 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/20/1;
                 http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Book{Roberts:1984:AC,
  author =       "Fred S. Roberts",
  title =        "Applied Combinatorics",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xviii + 606",
  year =         "1984",
  ISBN =         "0-13-039313-4",
  ISBN-13 =      "978-0-13-039313-5",
  LCCN =         "QA164 .R6 1984",
  bibdate =      "Thu Mar 22 11:37:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$37.95",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis",
}

@Book{Roberts:2005:AC,
  author =       "Fred S. Roberts and Barry Tesman",
  title =        "Applied Combinatorics",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xxii + 824",
  year =         "2005",
  ISBN =         "0-13-079603-4",
  ISBN-13 =      "978-0-13-079603-5",
  LCCN =         "QA164 .R6 2005",
  bibdate =      "Thu Mar 22 11:37:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis",
}

@Book{Robinson:2011:IBO,
  author =       "Peter N. (Peter Nicholas) Robinson and Sebastian
                 Bauer",
  title =        "Introduction to bio-ontologies",
  publisher =    pub-TAYLOR-FRANCIS,
  address =      pub-TAYLOR-FRANCIS:adr,
  pages =        "xxvii + 488",
  year =         "2011",
  ISBN =         "1-4398-3665-5 (hardcover)",
  ISBN-13 =      "978-1-4398-3665-1 (hardcover)",
  LCCN =         "QH324.2 .R618 2011",
  bibdate =      "Tue May 7 11:15:28 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC mathematical and computational
                 biology series",
  acknowledgement = ack-nhfb,
  subject =      "Bioinformatics; Ontologies (Information retrieval)",
  tableofcontents = "Ontologies and applications of ontologies in
                 biomedicine \\
                 Mathematical logic and inference \\
                 Probability theory and statistics for bio-ontologies
                 \\
                 Ontology language \\
                 The gene ontology \\
                 Upper-level ontologies \\
                 A selective survey of bio-ontologies \\
                 Overrepresentation analysis \\
                 Model-based approaches to GO analysis \\
                 Semantic similarity \\
                 Frequency-aware Bayesian network searches in attribute
                 ontologies \\
                 Inference in gene ontology \\
                 RDFS semantics and inference \\
                 Inference in OWL ontologies \\
                 Algorithmic foundations of computational inference \\
                 SPARQL \\
                 Appendixes \\
                 A. An overview of R \\
                 B. Information content and entropy \\
                 C. W3C standards : XML, URIs, and RDF \\
                 D. W3C standards : OWL",
}

@Book{Rosen:2006:CZK,
  author =       "Alon Rosen and Oded Goldreich",
  title =        "Concurrent Zero-Knowledge",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 184",
  year =         "2006",
  ISBN =         "3-540-32938-2 (hardcover)",
  ISBN-13 =      "978-3-540-32938-1 (hardcover)",
  LCCN =         "QA76.9.A25 R657 2006",
  bibdate =      "Thu Mar 22 11:59:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Information security and cryptography, 1619-7100",
  acknowledgement = ack-nhfb,
  subject =      "Data encryption (Computer science); Zero-knowledge
                 proofs; Cryptography",
}

@Book{Rothe:2005:CTC,
  author =       "J{\"o}rg Rothe",
  title =        "Complexity Theory and Cryptology: an Introduction to
                 Cryptocomplexity",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 478",
  year =         "2005",
  ISBN =         "3-540-22147-6, 3-540-28520-2 (e-book)",
  ISBN-13 =      "978-3-540-22147-0, 978-3-540-28520-5 (e-book)",
  LCCN =         "QA76.9.A25 R672 2005",
  bibdate =      "Fri Mar 23 10:26:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Texts in theoretical computer science: an EATCS
                 series",
  URL =          "http://www.myilibrary.com?id=133022;
                 http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-3-540-22147-0",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography; Computational
                 complexity",
  tableofcontents = "Introduction to cryptocomplexity \\
                 Foundations of computer science and mathematics \\
                 Foundations of complexity theory \\
                 Foundations of cryptology \\
                 Hierarchies based on NP \\
                 Randomized algorithms and complexity classes \\
                 RSA cryptosystem, primality, and factoring \\
                 Other public-key cryptosystems and protocols",
}

@Book{Saari:2001:DEE,
  author =       "D. (Donald) Saari",
  title =        "Decisions and Elections: Explaining the Unexpected",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiii + 240",
  year =         "2001",
  ISBN =         "0-521-80816-2, 0-521-00404-7 (paperback)",
  ISBN-13 =      "978-0-521-80816-3, 978-0-521-00404-6 (paperback)",
  LCCN =         "HB846.8 .S25 2001",
  bibdate =      "Thu Mar 22 12:24:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 prodorbis.library.yale.edu:7090/voyager",
  acknowledgement = ack-nhfb,
  subject =      "Social choice; Decision making; Elections; Arrow,
                 Kenneth Joseph; Sen, Amartya Kumar",
  subject-dates = "1921--",
  tableofcontents = "1. Do We Get What We Expect? \\
                 2. Arrow's Theorem \\
                 3. Explanations And Examples \\
                 4. What Else Can Go Wrong? \\
                 5. More Perversities \\
                 6. A Search For Resolutions \\
                 7. From Sen To Prisoners and Prostitution \\
                 8. Glossary, Notes, and Technical Talk",
}

@Book{Sakarovitch:2011:EAT,
  author =       "Jacques Sakarovitch",
  title =        "Elements of Automata Theory",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  year =         "2011",
  ISBN =         "0-521-84425-8",
  ISBN-13 =      "978-0-521-84425-3",
  LCCN =         "????",
  bibdate =      "Tue May 7 09:44:34 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Translation by Reuben Thomas from the French
                 original.",
  URL =          "http://purl.utwente.nl/publications/78134",
  acknowledgement = ack-nhfb,
  remark =       "Also published by Cambridge University Press.",
}

@Book{Sally:2007:RRV,
  author =       "Judith D. Sally and Paul Sally",
  title =        "Roots to Research: a Vertical Development of
                 Mathematical Problems",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 338",
  year =         "2007",
  ISBN =         "0-8218-4403-2",
  ISBN-13 =      "978-0-8218-4403-8",
  LCCN =         "QA11.2 .S25 2007",
  bibdate =      "Thu Mar 22 12:57:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy0804/2007060836.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Research",
}

@Book{Salomon:2003:DPS,
  author =       "David Salomon",
  title =        "Data Privacy and Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 465",
  year =         "2003",
  ISBN =         "0-387-00311-8",
  ISBN-13 =      "978-0-387-00311-5",
  LCCN =         "QA76.9.A25 S265 2003",
  bibdate =      "Mon Jun 16 18:35:35 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  price =        "US\$59.95",
  URL =          "http://www.booksbydavidsalomon.com/",
  abstract =     "This integrated volume focuses on keeping data secure
                 and private and covers classical cryptography, modern
                 cryptography, and steganography. Each topic is
                 presented and explained by describing various methods,
                 techniques, and algorithms. Moreover, there are
                 numerous helpful examples to reinforce the reader's
                 understanding and expertise with these techniques and
                 methodologies.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I: Data Encryption \\
                 1: Monoalphabetic Substitution Ciphers \\
                 2: Transposition Ciphers \\
                 3: Polyalphabetic Substitution Ciphers \\
                 4: Random Numbers \\
                 5: The Enigma \\
                 6: Stream Ciphers \\
                 7: Block Ciphers \\
                 8: Public-Key Cryptography \\
                 9: Quantum Cryptography \\
                 Part II: Data Hiding \\
                 10: Data Hiding in Text \\
                 11: Data Hiding in Images \\
                 12: Data Hiding: Other Methods \\
                 Part III: Essential Resources \\
                 Appendix A: Convolution \\
                 Appendix B: Hashing \\
                 Appendix C: Cyclic Redundancy Codes \\
                 Appendix D: Galois Fields",
}

@Book{Salomon:2005:CDC,
  author =       "David Salomon",
  title =        "Coding for Data and Computer Communications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 548",
  year =         "2005",
  ISBN =         "0-387-21245-0",
  ISBN-13 =      "978-0-387-21245-6",
  LCCN =         "TK5102.94 .S35 2005",
  bibdate =      "Mon Apr 25 16:21:05 2005",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.DavidSalomon.name/Codes/Codes.html;
                 http://www.ecs.csun.edu/~dsalomon/",
  acknowledgement = ack-nhfb,
  subject =      "Telecommunication systems; Coding theory;
                 Cryptography",
  tableofcontents = "Preface vii \\
                 \\
                 Part I: Channel Coding 1 \\
                 \\
                 1 Error-Control Codes 3 \\
                 2 Check Digits for Error Detection 35 \\
                 \\
                 Part II: Source Codes 59 \\
                 \\
                 3 Statistical Methods 67 \\
                 4 Dictionary Methods 111 \\
                 5 Image Compression 133 \\
                 \\
                 Part III: Secure Codes 197 \\
                 \\
                 6 Basic Concepts 199 \\
                 7 Monoalphabetic Substitution Ciphers 213 \\
                 8 Transposition Ciphers 227 \\
                 9 Polyalphabetic Substitution Ciphers 243 \\
                 10 Stream Ciphers 269 \\
                 11 Block Ciphers 289 \\
                 12 Public-Key Cryptography 311 \\
                 13 Data Hiding 341 \\
                 14 Data Hiding in Images 365 \\
                 15 Data Hiding: Other Methods 417 \\
                 \\
                 Part IV: Essential Resources 445 \\
                 \\
                 Appendixes \\
                 \\
                 A Symmetry Groups 447 \\
                 B Galois Fields 451 \\
                 B.1 Field Definitions and Operations 451 \\
                 B.2 Polynomial Arithmetic 459 \\
                 C Cyclic Redundancy Codes 461 \\
                 D Projects 465 \\
                 \\
                 Answers to Exercises 471 \\
                 \\
                 Glossary 503 \\
                 \\
                 Bibliography 523 \\
                 \\
                 Index 533",
}

@Book{Salomon:2005:FCS,
  author =       "David Salomon",
  title =        "Foundations of Computer Security",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxi + 368",
  year =         "2005",
  ISBN =         "1-84628-193-8, 1-84628-341-8",
  ISBN-13 =      "978-1-84628-193-8, 978-1-84628-341-3",
  LCCN =         "QA76.9.A25 S2656 2005",
  bibdate =      "Sat Jan 7 09:42:09 MST 2006",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.springer.com/sgw/cda/frontpage/0,11855,4-40007-22-65173048-0,00.html;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166687-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166688-p65173048,00.pdf;
                 http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166689-p65173048,00.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "authentication; computer security; cryptography;
                 encryption; firewalls; identity theft; malware;
                 physical security; spyware; trojan horses; viruses;
                 worms",
  publishersummary = "Anyone with a computer has heard of viruses, had
                 to deal with several, and has been struggling with
                 spam, spyware, and disk crashes. This book is intended
                 as a starting point for those familiar with basic
                 concepts of computers and computations and who would
                 like to extend their knowledge into the realm of
                 computer and network security. Its comprehensive
                 treatment of all the major areas of computer security
                 aims to give readers a complete foundation in the field
                 of Computer Security. Exercises are given throughout
                 the book and are intended to strengthening the reader?s
                 knowledge - answers are also provided.\par

                 Written in a clear, easy to understand style, aimed
                 towards advanced undergraduates and non-experts who
                 want to know about the security problems confronting
                 them everyday. The technical level of the book is low
                 and requires no mathematics, and only a basic concept
                 of computers and computations. Foundations of Computer
                 Security will be an invaluable tool for students and
                 professionals alike.",
}

@Book{Salomon:2007:VLC,
  author =       "David Salomon",
  title =        "Variable-length Codes for Data Compression",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 191",
  year =         "2007",
  ISBN =         "1-84628-958-0 (paperback), 1-84628-959-9 (ebook)",
  ISBN-13 =      "978-1-84628-958-3 (paperback), 978-1-84628-959-0
                 (ebook)",
  LCCN =         "QA76.9.D33 S25 2007",
  bibdate =      "Wed Oct 17 14:22:23 MDT 2007",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/datacompression.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 prodorbis.library.yale.edu:7090/voyager;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Computer Science; Coding and
                 Information Theory",
}

@Book{Sangiorgi:2001:PCT,
  author =       "Davide Sangiorgi and David Walker",
  title =        "The $ \pi $-Calculus: a Theory of Mobile Processes",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 580",
  year =         "2001",
  ISBN =         "0-521-78177-9",
  ISBN-13 =      "978-0-521-78177-0",
  LCCN =         "QA76.59 .S36 2001",
  bibdate =      "Fri Mar 23 10:23:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Mobile computing; Mobile communication systems;
                 Pi-calculus",
  tableofcontents = "Preface \\
                 Introduction \\
                 Part I. The p-Calculus: 1. Processes \\
                 2. Behavioural equivalence \\
                 Part II. Variations of the p-Calculus: 3. Polyadicity
                 and recursion \\
                 4. Behavioural equivalence, continued \\
                 5. Subcalculi \\
                 Part III. Typed p-Calculi: 6. Foundations \\
                 7. Subtyping \\
                 8. Advanced type systems \\
                 Part IV. Reasoning about Processes Using Types: 9.
                 Groundwork \\
                 10. Behavioural effects of i/o types \\
                 11. Techniques for advanced type systems \\
                 Part V. The Higher-Order Paradigm: 12. Higher-order
                 p-calculus \\
                 13. Comparing first-order and higher-order calculi \\
                 Part VI. Functions as Processes: 14. The l-calculus \\
                 15. Interpreting l-calculi \\
                 16. Interpreting typed l-calculi \\
                 17. Full abstraction \\
                 18. The local structure of the interpretations \\
                 Part VII. Objects and p-Calculus: 19. Semantic
                 definition \\
                 20. Applications \\
                 List of notations \\
                 Bibliography \\
                 Index",
}

@Article{Savage:1974:ACL,
  author =       "John E. Savage",
  title =        "An Algorithm for the Computation of Linear Forms",
  journal =      j-SIAM-J-COMPUT,
  volume =       "3",
  number =       "2",
  pages =        "150--158",
  month =        "????",
  year =         "1974",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  bibdate =      "Mon Nov 29 10:57:55 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/3/2;
                 http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Book{Schneider:2000:CRT,
  author =       "S. A. (Steve A.) Schneider",
  title =        "Concurrent and Real Time Systems: the {CSP} Approach",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xv + 510",
  year =         "2000",
  ISBN =         "0-471-62373-3",
  ISBN-13 =      "978-0-471-62373-1",
  LCCN =         "QA76.58 .S346 2000",
  bibdate =      "Fri Mar 23 11:42:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Worldwide series in computer science",
  URL =          "http://www.loc.gov/catdir/description/wiley032/99041795.html;
                 http://www.loc.gov/catdir/toc/onix03/99041795.html",
  acknowledgement = ack-nhfb,
  subject =      "Parallel processing (Electronic computers); Real-time
                 data processing",
}

@Book{Schneider:2004:VRS,
  author =       "Klaus Schneider",
  title =        "Verification of Reactive Systems: Formal Methods and
                 Algorithms",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 600",
  year =         "2004",
  ISBN =         "3-540-00296-0",
  ISBN-13 =      "978-3-540-00296-3",
  LCCN =         "QA76.76.V47 S34 2004",
  bibdate =      "Fri Mar 23 12:50:43 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2003066407-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003066407-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2003066407-t.html",
  acknowledgement = ack-nhfb,
  subject =      "computer systems; verification; formal methods
                 (computer science); computer algorithms",
}

@Book{Scholkopf:2002:LKS,
  author =       "Bernhard Sch{\"o}lkopf and Alexander J. Smola",
  title =        "Learning with Kernels: Support Vector Machines,
                 Regularization, Optimization, and Beyond",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xviii + 626",
  year =         "2002",
  ISBN =         "0-262-19475-9",
  ISBN-13 =      "978-0-262-19475-4",
  LCCN =         "Q325.5 .S32 2002",
  bibdate =      "Thu Mar 22 11:41:04 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Adaptive computation and machine learning",
  acknowledgement = ack-nhfb,
  subject =      "Support vector machines; Kernel functions",
}

@Book{Schoning:1989:LCS,
  author =       "Uwe Sch{\"o}ning",
  title =        "Logic for Computer Scientists",
  volume =       "8",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "166",
  year =         "1989",
  ISBN =         "0-8176-3453-3",
  ISBN-13 =      "978-0-8176-3453-7",
  LCCN =         "QA9 .S363 1989",
  bibdate =      "Thu Mar 22 12:34:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  remark =       "Translation of: Logik f{\"u}r Informatiker.",
  subject =      "Logic, Symbolic and mathematical; Logic programming",
}

@Book{Schoning:1998:GTC,
  author =       "Uwe Sch{\"o}ning and Randall J. Pruim",
  title =        "Gems of Theoretical Computer Science",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 320",
  year =         "1998",
  ISBN =         "3-540-64425-3 (hardcover)",
  ISBN-13 =      "978-3-540-64425-5 (hardcover)",
  LCCN =         "QA76.9.A96 S42713 1998",
  bibdate =      "Thu Mar 22 12:16:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Translated from the German by Randall Pruim.",
  subject =      "Automatic theorem proving",
}

@Book{Schoning:2008:LCS,
  author =       "Uwe Sch{\"o}ning",
  title =        "Logic for Computer Scientists",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "????",
  year =         "2008",
  ISBN =         "0-8176-4762-7, 0-8176-4763-5",
  ISBN-13 =      "978-0-8176-4762-9, 978-0-8176-4763-6",
  LCCN =         "QA9 .S363 2008",
  bibdate =      "Thu Mar 22 12:34:27 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Modern Birkh{\"a}user classics",
  acknowledgement = ack-nhfb,
}

@Book{Schroder:2003:OSI,
  author =       "Bernd S. W. (Bernd Siegfried Walter) Schr{\"o}der",
  title =        "Ordered Sets: an Introduction",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xvii + 391",
  year =         "2003",
  ISBN =         "0-8176-4128-9, 3-7643-4128-9",
  ISBN-13 =      "978-0-8176-4128-3, 978-3-7643-4128-2",
  LCCN =         "QA171.48 .S47 2003",
  bibdate =      "Fri Mar 23 17:43:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2002018231-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2002018231-t.html",
  acknowledgement = ack-nhfb,
  subject =      "ordered sets",
}

@Book{Sesiano:2009:IHA,
  author =       "Jacques Sesiano",
  title =        "An introduction to the history of algebra: solving
                 equations from {Mesopotamian} times to the
                 {Renaissance}",
  volume =       "27",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "viii + 174",
  year =         "2009",
  ISBN =         "0-8218-4473-3",
  ISBN-13 =      "978-0-8218-4473-1",
  LCCN =         "QA151 .S4513 2009",
  bibdate =      "Sat Mar 15 09:45:20 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Translated by Anna Pierrehumbert.",
  series =       "Mathematical world",
  acknowledgement = ack-nhfb,
  subject =      "Algebra; History",
  tableofcontents = "Algebra in Mesopotamia \\
                 Algebra in ancient Greece \\
                 Algebra in the Islamic world \\
                 Algebra in medieval Europe \\
                 Algebra in the Renaissance \\
                 Appendix A: Mesopotamian texts in translation \\
                 Appendix B: Greek and Latin texts \\
                 Appendix C: Arabic texts \\
                 Appendix D: Hebrew text \\
                 Appendix E: French, German, Italian, and
                 Proven{\c{c}}al texts",
}

@Book{Shackell:2004:SA,
  author =       "John R. Shackell",
  title =        "Symbolic Asymptotics",
  volume =       "12",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 243",
  year =         "2004",
  ISBN =         "3-540-21097-0 (hardcover)",
  ISBN-13 =      "978-3-540-21097-9 (hardcover)",
  LCCN =         "QA297 .S435 2004",
  bibdate =      "Thu Mar 22 13:02:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Algorithms and computation in mathematics, 1431-1550",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0829/2004045315-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0829/2004045315-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Asymptotic expansions; Algorithms",
}

@Book{Shallit:2009:SCF,
  author =       "Jeffrey Outlaw Shallit",
  title =        "A Second Course in Formal Languages and Automata
                 Theory",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 240",
  year =         "2009",
  ISBN =         "0-521-86572-7 (hardcover)",
  ISBN-13 =      "978-0-521-86572-2 (hardcover)",
  LCCN =         "QA267.3 .S53 2009",
  bibdate =      "Thu Mar 22 12:58:37 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0822/2008030065.html",
  acknowledgement = ack-nhfb,
  subject =      "Formal languages; Machine theory",
}

@Book{Shankar:1994:MMG,
  author =       "N. Shankar",
  title =        "Metamathematics, Machines, and {G{\"o}del}'s Proof",
  volume =       "38",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xv + 202",
  year =         "1994",
  ISBN =         "0-521-42027-X (hardcover)",
  ISBN-13 =      "978-0-521-42027-3 (hardcover)",
  LCCN =         "QA9.65 .S53 1994",
  bibdate =      "Thu Mar 22 12:38:35 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam032/94222366.html;
                 http://www.loc.gov/catdir/samples/cam034/94222366.html;
                 http://www.loc.gov/catdir/toc/cam032/94222366.html",
  acknowledgement = ack-nhfb,
  subject =      "G{\"o}del's theorem; Data processing; Automatic
                 theorem proving",
}

@Book{Shen:2008:APP,
  author =       "A. (Alexander) Shen",
  title =        "Algorithms and Programming: Problems and Solutions",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "viii + 217",
  year =         "2008",
  ISBN =         "0-8176-4761-9, 0-8176-4760-0",
  ISBN-13 =      "978-0-8176-4761-2, 978-0-8176-4760-5",
  LCCN =         "QA76.9.A43",
  bibdate =      "Fri Mar 23 08:00:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Modern Birkh{\"a}user classics",
  acknowledgement = ack-nhfb,
  remark =       "Reprint of the 1997 edition.",
  subject =      "Computer algorithms; Computer programming;
                 Algorithmes; Programmation (Informatique)",
}

@Book{Shen:2010:APP,
  author =       "A. (Alexander) Shen",
  title =        "Algorithms and Programming: Problems and Solutions",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "ix + 272",
  year =         "2010",
  ISBN =         "1-4419-1748-9, 1-4419-1747-0",
  ISBN-13 =      "978-1-4419-1748-5, 978-1-4419-1747-8",
  LCCN =         "QA76.9.A43 S47 2010",
  bibdate =      "Fri Mar 23 08:00:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Springer undergraduate texts in mathematics and
                 technology",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer programming;
                 Algorithmus; Programmierung",
}

@Book{Shoham:2009:MSA,
  author =       "Yoav Shoham and Kevin Leyton-Brown",
  title =        "Multiagent Systems: Algorithmic, Game-Theoretic, and
                 Logical Foundations",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xx + 483",
  year =         "2009",
  ISBN =         "0-521-89943-5 (hardcover)",
  ISBN-13 =      "978-0-521-89943-7 (hardcover)",
  LCCN =         "QA76.76.I58 S75 2009",
  bibdate =      "Fri Mar 23 10:29:05 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Intelligent agents (Computer software); Electronic
                 data processing; Distributed processing",
}

@Book{Shoup:2005:CIN,
  author =       "Victor Shoup",
  title =        "A Computational Introduction to Number Theory and
                 Algebra",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 517",
  year =         "2005",
  ISBN =         "0-521-85154-8 (hardcover), 0-521-61725-1 (paperback)",
  ISBN-13 =      "978-0-521-85154-1 (hardcover), 978-0-521-61725-3
                 (paperback)",
  LCCN =         "QA241 .S465 2005",
  bibdate =      "Thu Mar 22 11:55:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0664/2006530670-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0664/2006530670-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0733/2006530670-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Number theory; Data processing",
}

@Book{Shoup:2009:CIN,
  author =       "Victor Shoup",
  title =        "A Computational Introduction to Number Theory and
                 Algebra",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xvii + 580",
  year =         "2009",
  ISBN =         "0-521-51644-7 (hardcover)",
  ISBN-13 =      "978-0-521-51644-0 (hardcover)",
  LCCN =         "QA241 .S465 2009",
  bibdate =      "Thu Mar 22 11:55:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Number theory; Data processing",
}

@Book{Shparlinski:2003:CAA,
  author =       "Igor E. Shparlinski",
  title =        "Cryptographic Applications of Analytic Number Theory:
                 Complexity Lower Bounds and Pseudorandomness",
  volume =       "22",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "viii + 411",
  year =         "2003",
  ISBN =         "3-7643-6654-0 , 0-8176-6654-0",
  ISBN-13 =      "978-3-7643-6654-4, 978-0-8176-6654-5",
  LCCN =         "QA267.7 .S55 2003",
  bibdate =      "Fri Mar 23 10:30:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Coding theory; Combinatorial
                 number theory",
}

@Book{Simmons:2000:DCT,
  author =       "Harold Simmons",
  title =        "Derivation and Computation: Taking the {Curry--Howard}
                 Correspondence Seriously",
  volume =       "51",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxv + 384",
  year =         "2000",
  ISBN =         "0-521-77173-0 (hardcover)",
  ISBN-13 =      "978-0-521-77173-3 (hardcover)",
  LCCN =         "QA9.54 .S55 2000",
  bibdate =      "Fri Mar 23 10:27:25 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Cambridge tracts in theoretical computer science",
  acknowledgement = ack-nhfb,
  subject =      "proof theory; lambda calculus; type theory",
  tableofcontents = "Introduction \\
                 Preview \\
                 Part I. Development and Exercises: 1. Derivation
                 systems \\
                 2. Computation mechanisms \\
                 3. The typed combinator calculus \\
                 4. The typed l-calculus \\
                 5. Substitution algorithms \\
                 6. Applied l-calculi \\
                 7. Multi-recursive arithmetic \\
                 8. Ordinals and ordinal notation \\
                 9. Higher order recursion \\
                 Part II. Solutions: A. Derivation systems \\
                 B. Computation mechanisms \\
                 C. The typed combinator calculus \\
                 D. The typed l-calculus \\
                 E. Substitution algorithms \\
                 F. Applied l-calculi \\
                 G. Multi-recursive arithmetic \\
                 H. Ordinals and ordinal notation \\
                 I. Higher order recursion \\
                 Postview \\
                 Bibliography \\
                 Commonly used symbols \\
                 Index",
}

@Book{Simovici:2008:MTD,
  author =       "Dan A. Simovici and Chabane Djeraba",
  title =        "Mathematical Tools for Data Mining: Set Theory,
                 Partial Orders, Combinatorics",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 616",
  year =         "2008",
  ISBN =         "1-84800-200-9, 1-84800-201-7",
  ISBN-13 =      "978-1-84800-200-5, 978-1-84800-201-2",
  LCCN =         "QA76.9.D343 S595 2008",
  bibdate =      "Fri Mar 23 10:31:33 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Advanced information and knowledge processing,
                 1610-3947",
  acknowledgement = ack-nhfb,
  subject =      "Data mining; Partially ordered sets; Metric spaces;
                 Set theory; Computer science",
}

@Book{Singh:1999:CBE,
  author =       "Simon Singh",
  title =        "The Code Book: the Evolution of Secrecy from {Mary,
                 Queen of Scots}, to Quantum Cryptography",
  publisher =    pub-DOUBLEDAY,
  address =      pub-DOUBLEDAY:adr,
  pages =        "xiii + 402",
  year =         "1999",
  ISBN =         "0-385-49531-5",
  ISBN-13 =      "978-0-385-49531-8",
  LCCN =         "Z103 .S56 1999",
  bibdate =      "Mon Dec 06 16:25:40 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  price =        "US\$24.95",
  acknowledgement = ack-nhfb,
}

@Book{Skiena:1998:ADM,
  author =       "Steven S. Skiena",
  title =        "The Algorithm Design Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 486",
  year =         "1998",
  ISBN =         "0-387-94860-0",
  ISBN-13 =      "978-0-387-94860-7",
  LCCN =         "QA76.9.A43S55 1997",
  bibdate =      "Tue Feb 10 10:51:27 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  price =        "US\$54.95",
  acknowledgement = ack-nhfb,
}

@Book{Skiena:2001:CBC,
  author =       "Steven S. Skiena",
  title =        "Calculated Bets: Computers, Gambling, and Mathematical
                 Modeling to Win",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xv + 232",
  year =         "2001",
  ISBN =         "0-521-80426-4, 0-521-00962-6 (paperback)",
  ISBN-13 =      "978-0-521-80426-4, 978-0-521-00962-1 (paperback)",
  LCCN =         "QA401 .S474 2001",
  bibdate =      "Thu Mar 22 11:44:08 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Outlooks",
  URL =          "http://www.loc.gov/catdir/description/cam021/2001025483.html;
                 http://www.loc.gov/catdir/samples/cam031/2001025483.html;
                 http://www.loc.gov/catdir/toc/cam024/2001025483.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical models; Gambling; Jai alai; Betting",
}

@Book{Skiena:2008:ADM,
  author =       "Steven S. Skiena",
  title =        "The Algorithm Design Manual",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xvi + 730",
  year =         "2008",
  ISBN =         "1-84800-069-3 (hardcover), 1-84800-070-7 (ebook)",
  ISBN-13 =      "978-1-84800-069-8 (hardcover), 978-1-84800-070-4
                 (ebook)",
  LCCN =         "QA76.9.A43 S55 2008",
  bibdate =      "Mon Aug 10 17:49:11 MDT 2009",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  libnote =      "Not in my library.",
  subject =      "Computer algorithms",
}

@Book{Snyder:1991:PTG,
  author =       "Wayne Snyder",
  title =        "A Proof Theory for General Unification",
  volume =       "11",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "vi + 175",
  year =         "1991",
  ISBN =         "0-8176-3593-9 (hardcover), 3-7643-3593-9 (hardcover)",
  ISBN-13 =      "978-0-8176-3593-0 (hardcover), 978-3-7643-3593-9
                 (hardcover)",
  LCCN =         "QA76.9.A96 S6 1991",
  bibdate =      "Thu Mar 22 11:21:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "US\$28.00",
  series =       "Progress in computer science and applied logic",
  acknowledgement = ack-nhfb,
  subject =      "Automatic theorem proving",
}

@Book{Sofo:2003:CTS,
  author =       "Anthony Sofo",
  title =        "Computational Techniques for the Summation of Series",
  publisher =    "Kluwer Academic/Plenum Publishers",
  address =      "New York, NY, USA",
  pages =        "xv + 189",
  year =         "2003",
  ISBN =         "0-306-47805-6",
  ISBN-13 =      "978-0-306-47805-5",
  LCCN =         "QA295 .S6412 2003",
  bibdate =      "Thu Mar 22 11:56:28 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0820/2003054692-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Series; Summability theory; Functional equations;
                 Functions of complex variables",
}

@Book{Soifer:2009:MCB,
  author =       "Alexander Soifer",
  title =        "The Mathematical Coloring Book: Mathematics of
                 Coloring and the Colorful Life of its Creators",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxx + 607",
  year =         "2009",
  ISBN =         "0-387-74640-4 (hardcover)",
  ISBN-13 =      "978-0-387-74640-1 (hardcover)",
  LCCN =         "QA166 .S65 2009",
  bibdate =      "Fri Mar 23 18:04:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Combinatorics; Mathematics\_; History;
                 Logic, Symbolic and mathematical",
}

@Book{Stewart:2009:PSC,
  author =       "Ian Stewart",
  title =        "{Professor Stewart}'s Cabinet of Mathematical
                 Curiosities",
  publisher =    pub-BASIC,
  address =      pub-BASIC:adr,
  pages =        "x + 310",
  year =         "2009",
  ISBN =         "0-465-01302-3 (paperback)",
  ISBN-13 =      "978-0-465-01302-9 (paperback)",
  LCCN =         "QA95 .S726 2009",
  bibdate =      "Thu Mar 22 12:50:09 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical recreations; Curiosities and wonders;
                 Mathematics; Problems, exercises, etc",
}

@Book{Stichtenoth:1993:AFF,
  author =       "H. (Henning) Stichtenoth",
  title =        "Algebraic Function Fields and Codes",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 260",
  year =         "1993",
  ISBN =         "0-387-56489-6",
  ISBN-13 =      "978-0-387-56489-0",
  LCCN =         "QA341 .S75 1993",
  bibdate =      "Thu Mar 22 11:32:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Universitext",
  acknowledgement = ack-nhfb,
  subject =      "Algebraic functions; Algebraic fields",
}

@Book{Stichtenoth:2009:AFF,
  author =       "H. (Henning) Stichtenoth",
  title =        "Algebraic Function Fields and Codes",
  volume =       "254",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xiii + 355",
  year =         "2009",
  ISBN =         "3-540-76877-7 (hardcover)",
  ISBN-13 =      "978-3-540-76877-7 (hardcover)",
  LCCN =         "QA341 .S75 2009",
  bibdate =      "Thu Mar 22 11:32:20 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Graduate texts in mathematics, 0072-5285",
  acknowledgement = ack-nhfb,
  subject =      "Algebraic functions; Algebraic fields; Coding theory",
}

@Book{Stinson:1995:CTP,
  author =       "Douglas R. (Douglas Robert) Stinson",
  title =        "Cryptography: theory and practice",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "434",
  year =         "1995",
  ISBN =         "0-8493-8521-0",
  ISBN-13 =      "978-0-8493-8521-6",
  LCCN =         "QA268 .S75 1995",
  bibdate =      "Fri Mar 23 11:28:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The CRC Press series on discrete mathematics and its
                 applications",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
}

@Book{Stinson:2002:CTP,
  author =       "Douglas R. (Douglas Robert) Stinson",
  title =        "Cryptography: theory and practice",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  edition =      "Second",
  pages =        "339",
  year =         "2002",
  ISBN =         "1-58488-206-9",
  ISBN-13 =      "978-1-58488-206-0",
  LCCN =         "QA268 .S75 2002",
  bibdate =      "Fri Mar 23 11:28:34 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "The CRC Press series on discrete mathematics and its
                 applications.",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
}

@Book{Stinson:2006:CTP,
  author =       "Douglas R. (Douglas Robert) Stinson",
  title =        "Cryptography: theory and practice",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  edition =      "Third",
  pages =        "593",
  year =         "2006",
  ISBN =         "1-58488-508-4 (hardcover)",
  ISBN-13 =      "978-1-58488-508-5 (hardcover)",
  LCCN =         "QA268 .S75 2006",
  bibdate =      "Fri Mar 23 10:23:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "The CRC Press series on discrete mathematics and its
                 applications.",
  acknowledgement = ack-nhfb,
  subject =      "Coding theory; Cryptography",
  tableofcontents = "Classical cryptography \\
                 Shannon's theory \\
                 Block ciphers and the Advanced Encryption Standard \\
                 Cryptographic hash functions \\
                 The RSA Cryptosystem and factoring integers \\
                 Public-key cryptography and discrete logarithms \\
                 Signature schemes \\
                 Pseudo-random number generation \\
                 Identification schemes and entity authentication \\
                 Key distribution \\
                 Key agreement schemes \\
                 Public-key infrastructure \\
                 Secret sharing schemes \\
                 Multicast security and copyright protection",
}

@Book{Stirling:2001:MTP,
  author =       "Colin P. Stirling",
  title =        "Modal and Temporal Properties of Processes",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 190",
  year =         "2001",
  ISBN =         "0-387-98717-7",
  ISBN-13 =      "978-0-387-98717-0",
  LCCN =         "QA76.9.L63 S75 2001",
  bibdate =      "Thu Mar 22 12:39:16 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Texts in computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0818/00067924-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/00067924-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer logic; Parallel processing (Electronic
                 computers)",
}

@Book{Storer:2002:IDS,
  author =       "James A. (James Andrew) Storer",
  title =        "An Introduction to Data Structures and Algorithms",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xvii + 599",
  year =         "2002",
  ISBN =         "0-8176-4253-6 , 3-7643-4253-6",
  ISBN-13 =      "978-0-8176-4253-2, 978-3-7643-4253-1",
  LCCN =         "QA76.9.D33 S73 2002",
  bibdate =      "Thu Mar 22 12:26:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2001043503-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2001043503-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Data structures (Computer science); Computer
                 algorithms",
}

@Book{Straffin:1993:GTS,
  author =       "Philip D. Straffin",
  title =        "Game Theory and Strategy",
  volume =       "36",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "x + 244",
  year =         "1993",
  ISBN =         "0-88385-637-9",
  ISBN-13 =      "978-0-88385-637-6",
  LCCN =         "QA269 .S77 1993",
  bibdate =      "Thu Mar 22 12:14:46 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "New mathematical library",
  URL =          "http://www.loc.gov/catdir/description/cam025/92064176.html;
                 http://www.loc.gov/catdir/toc/cam027/92064176.html",
  acknowledgement = ack-nhfb,
  subject =      "Game theory",
}

@Book{Straubing:1994:FAF,
  author =       "Howard Straubing",
  title =        "Finite Automata, Formal Logic, and Circuit
                 Complexity",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xii + 226",
  year =         "1994",
  ISBN =         "3-7643-3719-2, 0-8176-3719-2",
  ISBN-13 =      "978-3-7643-3719-3, 978-0-8176-3719-4",
  LCCN =         "QA76.9.M35 S77 1994",
  bibdate =      "Thu Mar 22 11:31:32 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Progress in theoretical computer science",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Mathematics; Automata; Logic,
                 Symbolic and mathematical; Computational complexity",
  tableofcontents = "Part 1 \\
                 Mathematical preliminaries: words and languages \\
                 Automata and regular languages \\
                 Semigroups and homomorphisms \\
                 Part 2 \\
                 Formal languages and formal logic: examples definitions
                 \\
                 Part 3 \\
                 Finite automata: monadic second-order sentences and
                 regular languages \\
                 Regular numerical predicates \\
                 Infinite words and decidable theories \\
                 Part 4 \\
                 Model-theoretic games: the Ehrenfeucht--Fraisse game
                 \\
                 Application to FO [decreasing] \\
                 Application to FO [+1]. \\
                 Part 5 \\
                 Finite semigroups: the syntactic monoid \\
                 Calculation of the syntactic monoid \\
                 Application to FO [decreasing] \\
                 Semidirect products \\
                 Categories and path conditions \\
                 Pseudovarieties \\
                 Part 6 \\
                 First-order logic: characterization of FO [decreasing]
                 \\
                 a hierarchy in FO [decreasing] \\
                 another characterization of FO [+1] \\
                 sentences with regular numerical predicates \\
                 Part 7 \\
                 Modular quantifiers: definition and examples \\
                 languages in (FO + MOD(P))[decreasing] \\
                 languages in (FO + MOD)[+1] \\
                 languages in (FO + MOD)[Reg] \\
                 summary \\
                 Part 8 \\
                 Circuit complexity: examples of circuits \\
                 circuits and circuit complexity classes \\
                 lower bounds \\
                 Part 9 \\
                 Regular languages and circuit Complexity: regular
                 languages in NC1 \\
                 Formulas with arbitrary numerical predicates \\
                 Regular languages and non-regular numerical predicates
                 \\
                 Special cases of the central conjecture \\
                 Appendices \\
                 Proof of the Krohn--Rhodes theorem \\
                 Proofs of the category theorems",
}

@Book{Talbot:2006:CCI,
  author =       "John Talbot and D. J. A. Welsh",
  title =        "Complexity and Cryptography: an Introduction",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  year =         "2006",
  ISBN =         "0-521-85231-5 (hardcover)",
  ISBN-13 =      "978-0-521-85231-9 (hardcover)",
  LCCN =         "Z103 .T35 2006",
  bibdate =      "Fri Mar 23 10:26:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "Cryptography; Computational complexity",
}

@Book{Tarakanov:2003:IPA,
  author =       "A. O. Tarakanov and Victor A. Skormin and S. P.
                 (Svetlana P.) Sokolova",
  title =        "Immunocomputing: Principles and Applications",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 193",
  year =         "2003",
  ISBN =         "0-387-95533-X",
  ISBN-13 =      "978-0-387-95533-9",
  LCCN =         "QA76.875 .T37 2003",
  bibdate =      "Fri Mar 23 12:02:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0817/2002044508-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2002044508-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Immunocomputers; Molecular electronics",
}

@Book{Taubenfeld:2006:SAC,
  author =       "Gadi Taubenfeld",
  title =        "Synchronization Algorithms and Concurrent
                 Programming",
  publisher =    "Pearson/Prentice Hall",
  address =      "Harlow, England",
  pages =        "xv + 423",
  year =         "2006",
  ISBN =         "0-13-197259-6 (paperback)",
  ISBN-13 =      "978-0-13-197259-9 (paperback)",
  LCCN =         "QA76.9.D5 .T38 2006",
  bibdate =      "Thu Mar 22 13:02:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing;
                 Parallel programming (Computer science); Computer
                 algorithms",
}

@Book{Tel:2000:IDA,
  author =       "Gerard Tel",
  title =        "Introduction to Distributed Algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xii + 596",
  year =         "2000",
  ISBN =         "0-521-79483-8",
  ISBN-13 =      "978-0-521-79483-1",
  LCCN =         "QA76.9.D5 T44 2000",
  bibdate =      "Fri Mar 23 11:08:03 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/description/cam021/00036292.html;
                 http://www.loc.gov/catdir/toc/cam026/00036292.html",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing;
                 Congresses; Computer algorithms",
}

@Book{Troelstra:1996:BPT,
  author =       "A. S. (Anne Sjerp) Troelstra and Helmut
                 Schwichtenberg",
  title =        "Basic Proof Theory",
  volume =       "43",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 343",
  year =         "1996",
  ISBN =         "0-521-57223-1 (hardcover)",
  ISBN-13 =      "978-0-521-57223-1 (hardcover)",
  LCCN =         "QA9.54 .T76 1996",
  bibdate =      "Thu Mar 22 11:40:45 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam027/96028596.html;
                 http://www.loc.gov/catdir/toc/cam027/96028596.html",
  acknowledgement = ack-nhfb,
  subject =      "Proof theory",
}

@Book{Troelstra:2000:BPT,
  author =       "A. S. (Anne Sjerp) Troelstra and Helmut
                 Schwichtenberg",
  title =        "Basic Proof Theory",
  volume =       "43",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  edition =      "Second",
  pages =        "xii + 417",
  year =         "2000",
  ISBN =         "0-521-77911-1 (paperback)",
  ISBN-13 =      "978-0-521-77911-1 (paperback)",
  LCCN =         "QA9.54 .T76 2000",
  bibdate =      "Thu Mar 22 11:40:45 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam021/00702855.html;
                 http://www.loc.gov/catdir/samples/cam033/00702855.html;
                 http://www.loc.gov/catdir/toc/cam027/00702855.html",
  acknowledgement = ack-nhfb,
  subject =      "Proof theory",
}

@Book{Tse:1991:UFS,
  author =       "T. H. Tse",
  title =        "A Unifying Framework for Structured Analysis and
                 Design Models: an Approach Using Initial Algebra
                 Semantics and Category Theory",
  volume =       "11",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 179",
  year =         "1991",
  ISBN =         "0-521-39196-2",
  ISBN-13 =      "978-0-521-39196-2",
  LCCN =         "QA76.9.S84 T74 1991",
  bibdate =      "Thu Mar 22 10:34:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam025/91204091.html;
                 http://www.loc.gov/catdir/toc/cam029/91204091.html",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Structured techniques",
  tableofcontents = "1. Introduction \\
                 2. Desirable features of systems development
                 environments \\
                 3. A comparison with related projects \\
                 4. Initial algebra as a unifying framework for
                 structured models \\
                 5. Category theory as a unifying framework for
                 structured models \\
                 6. The identification of unstructuredness \\
                 7. A prototype system to implement the unifying
                 framework \\
                 8. Future directions \\
                 9. Conclusions \\
                 References \\
                 Appendices",
}

@Book{Tuchman:1966:ZT,
  author =       "Barbara W. Tuchman",
  title =        "The {Zimmermann} telegram",
  publisher =    pub-MACMILLAN,
  address =      pub-MACMILLAN:adr,
  pages =        "xii + 244",
  year =         "1966",
  LCCN =         "D511 .T77 1966",
  bibdate =      "Wed Nov 25 13:57:39 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "Reprint of original 1958 edition. Kahn
                 \cite{Kahn:1996:CSS} describes this book as
                 ``recount[ing] the political effects of the most
                 important cryptogram solution in history''.",
  acknowledgement = ack-nhfb,
}

@Book{Valiente:2009:CPM,
  author =       "Gabriel Valiente",
  title =        "Combinatorial Pattern Matching Algorithms in
                 Computational Biology Using {Perl} and {R}",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "352",
  year =         "2009",
  ISBN =         "1-4200-6973-X (hardcover)",
  ISBN-13 =      "978-1-4200-6973-0 (hardcover)",
  LCCN =         "QH324.2 .V35 2009",
  bibdate =      "Tue May 7 09:48:18 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC mathematical and computational
                 biology series",
  acknowledgement = ack-nhfb,
  subject =      "Computational biology; Pattern formation (Biology);
                 Computer simulation; Graph algorithms; Perl (Computer
                 program language); R (Computer program language)",
}

@Book{vanBenthemJutting:1979:CLG,
  author =       "L. S. {van Benthem Jutting}",
  title =        "Checking {Landau}'s {``Grundlagen''} in the {Automath}
                 System",
  publisher =    "Mathematisch Centrum",
  address =      "Amsterdam, The Netherlands",
  pages =        "120",
  year =         "1979",
  ISBN =         "90-6196-147-5 (paperback)",
  ISBN-13 =      "978-90-6196-147-5 (paperback)",
  LCCN =         "QA241 .B46",
  bibdate =      "Thu Mar 22 11:45:31 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematical Centre tracts; 83",
  acknowledgement = ack-nhfb,
  subject =      "Number theory; AUTOMATH (Formal language); Machine
                 translating; Landau, Edmund; Grundlagen des Analysis",
  subject-dates = "1877--1938.",
}

@Book{VanDerMeulen:1978:TPS,
  author =       "S. G. {Van Der Meulen} and M. Veldhorst",
  title =        "{TORIX}: a Programming System for Operations on
                 Vectors and Matrices over Arbitrary Fields and of
                 Variable Size",
  volume =       "1",
  publisher =    "Mathematisch Centrum",
  address =      "Amsterdam, The Netherlands",
  pages =        "????",
  year =         "1978",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "????",
  bibdate =      "Fri Mar 23 21:51:47 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
}

@Book{Vega-Redondo:2007:CSN,
  author =       "Fernando Vega-Redondo",
  title =        "Complex Social Networks",
  volume =       "44",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 294",
  year =         "2007",
  ISBN =         "0-521-85740-6 (hardcover), 0-521-67409-3 (paperback)",
  ISBN-13 =      "978-0-521-85740-6 (hardcover), 978-0-521-67409-6
                 (paperback)",
  LCCN =         "HM741 .V44 2007",
  bibdate =      "Thu Mar 22 11:52:02 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Econometric Society monographs",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0702/2006030242-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0702/2006030242-t.html;
                 http://www.loc.gov/catdir/enhancements/fy0729/2006030242-b.html",
  acknowledgement = ack-nhfb,
  subject =      "Social networks; Sociometry",
}

@Book{Velleman:1994:HPI,
  author =       "Daniel J. Velleman",
  title =        "How to Prove It: a Structured Approach",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "ix + 309",
  year =         "1994",
  ISBN =         "0-521-44116-1 (hardcover), 0-521-44663-5 (paperback)",
  ISBN-13 =      "978-0-521-44116-2 (hardcover), 978-0-521-44663-1
                 (paperback)",
  LCCN =         "QA9 .V38 1994",
  bibdate =      "Fri Mar 23 10:27:58 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  acknowledgement = ack-nhfb,
  subject =      "logic, symbolic and mathematical; mathematics",
}

@Book{Vempala:2004:RPM,
  author =       "Santosh S. (Santosh Srinivas) Vempala",
  title =        "The Random Projection Method",
  volume =       "65",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "ix + 105",
  year =         "2004",
  ISBN =         "0-8218-2018-4",
  ISBN-13 =      "978-0-8218-2018-6",
  LCCN =         "QA501 .V45 2004",
  bibdate =      "Thu Mar 22 12:54:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  subject =      "Random projection method; Algorithms",
}

@Book{Vince:2009:GAA,
  author =       "John Vince",
  title =        "Geometric Algebra: An Algebraic System for Computer
                 Games and Animation",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "300",
  year =         "2009",
  ISBN =         "1-84882-379-7",
  ISBN-13 =      "978-1-84882-379-2",
  LCCN =         "QA199 .V56 2009",
  bibdate =      "Fri Mar 23 18:55:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  acknowledgement = ack-nhfb,
  subject =      "Clifford algebras; computer vision; computer science;
                 algebraic geometry; geometry, algebraic; software
                 engineering; computer applications; mathematics of
                 computing; computer science, general; software
                 engineering/programming and operating systems; computer
                 imaging, vision, pattern recognition and graphics",
}

@Article{Viola:2004:BRB,
  author =       "Lorenza Viola",
  title =        "Book Review: {{\booktitle{Quantum Computing}}: Mika
                 Hirvensalo, (2001) Springer-Verlag, Berlin ISBN
                 3-540-66783-0}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "163",
  number =       "1",
  pages =        "65--66",
  day =          "15",
  month =        oct,
  year =         "2004",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/j.cpc.2004.07.007",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 23:41:43 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  note =         "See \cite{Hirvensalo:2001:QC} and review
                 \cite{deWolf:2007:JRB}.",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0010465504004114",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Book{Vovk:2005:ALR,
  author =       "Vladimir Vovk and A. (Alexander) Gammerman and Glenn
                 Shafer",
  title =        "Algorithmic Learning in a Random World",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 324",
  year =         "2005",
  ISBN =         "0-387-00152-2, 0-387-25061-1 (e-book)",
  ISBN-13 =      "978-0-387-00152-4, 978-0-387-25061-8 (e-book)",
  LCCN =         "QA279.2 .V68 2005",
  bibdate =      "Thu Mar 22 12:04:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0662/2005042556-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0817/2005042556-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Prediction theory; Algorithms; Stochastic processes",
  tableofcontents = "Preface \\
                 List of Principal results \\
                 1. Introduction \\
                 2. Conformal prediction \\
                 3. Classification with conformal predictors \\
                 4. Modifications of conformal predictors \\
                 5. Probabilistic prediction I : impossibility results
                 \\
                 6. Probabilistic prediction II : Venn predictors \\
                 7. Beyond exchangeability \\
                 8. On-line compression modeling I : conformal
                 prediction \\
                 9. On-line compression modeling II : Venn prediction
                 \\
                 10. Perspectives and contrasts \\
                 Appendix A. Probability theory \\
                 Appendix B. Data sets \\
                 Appendix C: FAQ \\
                 Notation \\
                 References \\
                 Index",
}

@Book{Wagstaff:2003:CNT,
  author =       "Samuel S. Wagstaff",
  title =        "Cryptanalysis of Number Theoretic Ciphers",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xv + 318",
  year =         "2003",
  ISBN =         "1-58488-153-4",
  ISBN-13 =      "978-1-58488-153-7",
  LCCN =         "QA76.9.A25 W33 2003",
  bibdate =      "Thu Mar 22 12:01:11 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Computational mathematics",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/2002034919-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer security; Cryptography; Number theory",
}

@Book{Wall:1963:CM,
  author =       "H. S. (Hubert Stanley) Wall",
  title =        "Creative Mathematics",
  publisher =    pub-U-TEXAS,
  address =      pub-U-TEXAS:adr,
  pages =        "189",
  year =         "1963",
  LCCN =         "QA37 .W29",
  bibdate =      "Thu Mar 22 12:00:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1902--1971",
  subject =      "Mathematical analysis",
}

@Book{Wall:2009:CM,
  author =       "H. S. (Hubert Stanley) Wall",
  title =        "Creative Mathematics",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  edition =      "Revised",
  pages =        "xx + 195",
  year =         "2009",
  ISBN =         "0-88385-750-2",
  ISBN-13 =      "978-0-88385-750-2",
  LCCN =         "QA37 .W29 2009",
  bibdate =      "Thu Mar 22 12:00:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Classroom resource materials",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1114/2008938215-b.html;
                 http://www.loc.gov/catdir/enhancements/fy1114/2008938215-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1114/2008938215-t.html",
  abstract =     "Professor H.S. Wall wrote Creative Mathematics with
                 the intention of leading students to develop their
                 mathematical abilities, helping them learn the art of
                 mathematics, and teaching them to create mathematical
                 ideas. Creative Mathematics, according to Wall, `is not
                 a compendium of mathematical facts and inventions to be
                 read over as a connoisseur of art looks over paintings.
                 It is, instead, a sketchbook in which readers try their
                 hands at mathematical discovery.' The book is
                 self-contained and assumes little formal mathematical
                 background on the part of the reader. Wall is earnest
                 about developing mathematical creativity and
                 independence in students. Wall developed Creative
                 Mathematics over a period of many years of working with
                 students at the University of Texas at Austin. In fewer
                 than 200 pages, he takes the reader on a stimulating
                 tour starting with numbers and then moving on to simple
                 graphs, the integral, simple surfaces, successive
                 approximations, linear spaces of simple graphs, and
                 concluding with mechanical systems. The student who has
                 worked through Creative Mathematics will come away with
                 heightened mathematical maturity.",
  acknowledgement = ack-nhfb,
  author-dates = "1902--1971",
  subject =      "Mathematical analysis",
  tableofcontents = "Short biography of H.S. Wall \\
                 Numbers \\
                 Ordered number pairs \\
                 Slope \\
                 Combinations of simple graphs \\
                 Theorems about simple graphs \\
                 The simple graphs of trigonometry \\
                 The integral \\
                 Computation formulas obtained by means of the integral
                 \\
                 Simple graphs made to order \\
                 More about integrals \\
                 Simple surfaces \\
                 Successive approximations \\
                 Linear spaces of simple graphs \\
                 More about linear spaces \\
                 Mechanical systems \\
                 Integral tables \\
                 Index of simple graphs \\
                 Glossary of definitions",
}

@Book{Wallis:2003:BGD,
  author =       "W. D. Wallis",
  title =        "A Beginner's Guide to Discrete Mathematics",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xi + 367",
  year =         "2003",
  ISBN =         "0-8176-4269-2 , 3-7643-4269-2",
  ISBN-13 =      "978-0-8176-4269-3, 978-3-7643-4269-2",
  LCCN =         "QA39.3 .W35 2003",
  bibdate =      "Thu Mar 22 11:41:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2002026043-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2002026043-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Computer science",
}

@Book{Wallis:2012:BGD,
  author =       "W. D. Wallis",
  title =        "A Beginner's Guide to Discrete Mathematics",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  edition =      "Second",
  pages =        "xiii + 427",
  year =         "2012",
  ISBN =         "0-8176-8285-6 (hardcover), 0-8176-8286-4 (e-book)",
  ISBN-13 =      "978-0-8176-8285-9 (hardcover), 978-0-8176-8286-6
                 (e-book)",
  LCCN =         "QA39.3 .W35 2012",
  bibdate =      "Thu Mar 22 11:41:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Textbooks; Computer science",
}

@Book{Wapner:2005:PSM,
  author =       "Leonard M. Wapner",
  title =        "The Pea and the Sun: a Mathematical Paradox",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "xiv + 218",
  year =         "2005",
  ISBN =         "1-56881-213-2",
  ISBN-13 =      "978-1-56881-213-7",
  LCCN =         "QA248 .W29 2005",
  bibdate =      "Fri Mar 23 18:42:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Banach-Tarski paradox; History",
}

@Book{Washington:2008:ECN,
  author =       "Lawrence C. Washington",
  title =        "Elliptic Curves: Number Theory and Cryptography",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  edition =      "Second",
  pages =        "xviii + 513",
  year =         "2008",
  ISBN =         "1-4200-7146-7 (hardcover)",
  ISBN-13 =      "978-1-4200-7146-7 (hardcover)",
  LCCN =         "QA567.2.E44 W37 2008",
  bibdate =      "Fri Mar 23 10:06:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/toc/ecip0810/2008006296.html",
  acknowledgement = ack-nhfb,
  subject =      "Curves, Elliptic; Number theory; Cryptography",
}

@Book{Wegener:2000:BPB,
  author =       "Ingo Wegener",
  title =        "Branching Programs and Binary Decision Diagrams:
                 Theory and Applications",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "x + 408",
  year =         "2000",
  ISBN =         "0-89871-458-3",
  ISBN-13 =      "978-0-89871-458-6",
  LCCN =         "QA274.76 .W44 2000",
  bibdate =      "Fri Mar 23 10:30:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "SIAM monographs on discrete mathematics and
                 applications",
  acknowledgement = ack-nhfb,
  subject =      "Branching processes; Decision making; Mathematical
                 models; Computational complexity",
  tableofcontents = "Preface \\
                 Introduction \\
                 1. Introduction \\
                 2. BPs and Decision Trees (DTs) \\
                 3. Ordered Binary Decision Diagrams (OBDDs) \\
                 4. The OBDD Size of Selected Functions \\
                 5. The Variable-Ordering Problem \\
                 6. Free BDDs (FBDDs) and Read-Once BPs \\
                 7. BDDs with Repeated Tests \\
                 8. Decision Diagrams (DDs) Based on Other Decomposition
                 Rules \\
                 9. Integer-Valued DDs \\
                 10. Nondeterministic DDs \\
                 11. Randomized BDDs and Algorithms \\
                 12. Summary of the Theoretical Results \\
                 13. Applications in Verification and Model Checking \\
                 14. Further CAD Applications \\
                 15. Application in Optimization, Counting, and Genetic
                 Programming \\
                 Bibliography \\
                 Index",
}

@Book{Welschenbach:2001:CCC,
  author =       "Michael Welschenbach and David Kramer",
  title =        "Cryptography in {C} and {C++}",
  publisher =    pub-APRESS,
  address =      pub-APRESS:adr,
  edition =      "Second",
  pages =        "xix + 432",
  year =         "2001",
  ISBN =         "1-893115-95-X",
  ISBN-13 =      "978-1-893115-95-8",
  LCCN =         "QA76.9.A25 W4313 2001",
  bibdate =      "Thu Mar 22 12:02:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy0702/2005298150.html",
  acknowledgement = ack-nhfb,
  remark =       "Covers Rijndael, the new American encryption standard.
                 CD-ROM includes all programs presented in the book, x86
                 assembler programs, implementations of Rijndael
                 algorithm in both C and C++.",
  subject =      "Data encryption (Computer science); Public key
                 cryptography; Cryptography; C (Computer program
                 language); C++ (Computer program language);
                 Cryptographie {\`a} cl{\'e} publique; Chiffrement
                 (Informatique); C (Langage de programmation); C++
                 (Langage de programmation); Cryptographie",
}

@Book{Welschenbach:2005:CCC,
  author =       "Michael Welschenbach",
  title =        "Cryptography in {C} and {C++}",
  publisher =    pub-APRESS,
  address =      pub-APRESS:adr,
  edition =      "Second",
  pages =        "xxv + 478",
  year =         "2005",
  ISBN =         "1-59059-502-5",
  ISBN-13 =      "978-1-59059-502-2",
  LCCN =         "QA76.9.A25 W4313 2005",
  bibdate =      "Thu Mar 22 12:02:53 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2005002553-d.html;
                 http://www.loc.gov/catdir/toc/ecip057/2005002553.html",
  acknowledgement = ack-nhfb,
  remark =       "The first American edition is a translation of the
                 second German edition, which has been revised and
                 expanded from the first German edition.",
  subject =      "Computer security; Cryptography; C (Computer program
                 language); C++ (Computer program language)",
}

@Book{Williamson:2011:DAA,
  author =       "David P. Williamson and David Bernard Shmoys",
  title =        "The design of approximation algorithms",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xi + 504",
  year =         "2011",
  ISBN =         "0-521-19527-6 (hardcover)",
  ISBN-13 =      "978-0-521-19527-0 (hardcover)",
  LCCN =         "QA221 .W55 2011",
  bibdate =      "Tue May 7 10:32:26 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg",
  abstract =     "Discrete optimization problems are everywhere, from
                 traditional operations research planning problems, such
                 as scheduling, facility location, and network design;
                 to computer science problems in databases; to
                 advertising issues in viral marketing. Yet most such
                 problems are NP-hard. Thus unless P = NP, there are no
                 efficient algorithms to find optimal solutions to such
                 problems. This book shows how to design approximation
                 algorithms: efficient algorithms that find provably
                 near-optimal solutions. The book is organized around
                 central algorithmic techniques for designing
                 approximation algorithms, including greedy and local
                 search algorithms, dynamic programming, linear and
                 semidefinite programming, and randomization. Each
                 chapter in the first part of the book is devoted to a
                 single algorithmic technique, which is then applied to
                 several different problems. The second part revisits
                 the techniques but offers more sophisticated treatments
                 of them. The book also covers methods for proving that
                 optimization problems are hard to approximate. Designed
                 as a textbook for graduate-level algorithms courses,
                 the book will also serve as a reference for researchers
                 interested in the heuristic solution of discrete
                 optimization problems.",
  acknowledgement = ack-nhfb,
  subject =      "Approximation theory; Mathematical optimization",
  tableofcontents = "I: An Introduction to the Techniques \\
                 1: An Introduction to Approximation Algorithms \\
                 1.1: The Whats and Whys of Approximation Algorithms \\
                 1.2: An Introduction to the Techniques and to Linear
                 Programming: The Set Cover Problem \\
                 1.3: A Deterministic Rounding Algorithm \\
                 1.4: Rounding a Dual Solution \\
                 1.5: Constructing a Dual Solution: The Primal-Dual
                 Method \\
                 1.6: A Greedy Algorithm \\
                 1.7: A Randomized Rounding Algorithm \\
                 Exercises \\
                 Chapter Notes \\
                 2: Greedy Algorithms and Local Search \\
                 2.1: Scheduling Jobs with Deadlines on a Single Machine
                 \\
                 2.2: The $k$-Center Problem \\
                 2.3: Scheduling Jobs on Identical Parallel Machines \\
                 2.4: The Traveling Salesman Problem \\
                 2.5: Maximizing Float in Bank Accounts \\
                 2.6: Finding Minimum-Degree Spanning Trees \\
                 2.7: Edge Coloring \\
                 Exercises \\
                 Chapter Notes \\
                 3: Rounding Data and Dynamic Programming \\
                 3.1: The Knapsack Problem \\
                 3.2: Scheduling Jobs on Identical Parallel Machines \\
                 3.3: The Bin-Packing Problem \\
                 Exercises \\
                 Chapter Notes \\
                 4: Deterministic Rounding of Linear Programs \\
                 4.1: Minimizing the Sum of Completion Times on a Single
                 Machine \\
                 4.2: Minimizing the Weighted Sum of Completion Times on
                 a Single Machine \\
                 4.3: Solving Large Linear Programs in Polynomial Time
                 via the Ellipsoid Method \\
                 4.4: The Prize-Collecting Steiner Tree Problem \\
                 4.5: The Uncapacitated Facility Location Problem \\
                 4.6: The Bin-Packing Problem \\
                 Exercises \\
                 Chapter Notes \\
                 5: Random Sampling and Randomized Rounding of Linear
                 Programs \\
                 5.1: Simple Algorithms for MAX SAT and MAX CUT \\
                 5.2: Derandomization \\
                 5.3: Flipping Biased Coins \\
                 5.4: Randomized Rounding \\
                 5.5: Choosing the Better of Two Solutions \\
                 5.6: Nonlinear Randomized Rounding \\
                 5.7: The Prize-Collecting Steiner Tree Problem \\
                 5.8: The Uncapacitated Facility Location Problem \\
                 5.9: Scheduling a Single Machine with Release Dates \\
                 5.10: Chernoff Bounds \\
                 5.11: Integer Multicommodity Flows \\
                 5.12: Random Sampling and Coloring Dense 3-Colorable
                 Graphs \\
                 Exercises \\
                 Chapter Notes \\
                 6: Randomized Rounding of Semidefinite Programs \\
                 6.1: A Brief Introduction to Semidefinite Programming
                 \\
                 6.2: Finding Large Cuts \\
                 6.3: Approximating Quadratic Programs \\
                 6.4: Finding a Correlation Clustering \\
                 6.5: Coloring 3-Colorable Graphs \\
                 Exercises \\
                 Chapter Notes \\
                 7: The Primal-Dual Method \\
                 7.1: The Set Cover Problem: A Review \\
                 7.2: Choosing Variables to Increase: The Feedback
                 Vertex Set Problem in Undirected Graphs \\
                 7.3: Cleaning Up the Primal Solution: The Shortest s-t
                 Path Problem \\
                 7.4: Increasing Multiple Variables at Once: The
                 Generalized Steiner Tree Problem \\
                 7.5: Strengthening Inequalities: The Minimum Knapsack
                 Problem \\
                 7.6: The Uncapacitated Facility Location Problem \\7.7:
                 Lagrangean Relaxation and the $k$-Median Problem \\
                 Exercises \\
                 Chapter Notes \\
                 8: Cuts and Metrics \\
                 8.1: The Multiway Cut Problem and a Minimum-Cut \\
                 Based Algorithm \\
                 8.2: The Multiway Cut Problem and an LP Rounding
                 Algorithm \\
                 8.3: The Multicut Problem \\
                 8.4: Balanced Cuts \\
                 8.5: Probabilistic Approximation of Metrics by Tree
                 Metrics \\
                 8.6: An Application of Tree Metrics: Buy-at-Bulk
                 Network Design \\
                 8.7: Spreading Metrics, Tree Metrics, and Linear
                 Arrangement \\
                 Exercises \\
                 Chapter Notes \\
                 II: Further Uses of the Techniques \\
                 9: Further Uses of Greedy and Local Search Algorithms
                 \\
                 9.1: A Local Search Algorithm for the Uncapacitated
                 Facility Location Problem \\
                 9.2: A Local Search Algorithm for the $k$-Median
                 Problem \\
                 9.3: Minimum-Degree Spanning Trees \\
                 9.4: A Greedy Algorithm for the Uncapacitated Facility
                 Location Problem \\
                 Exercises \\
                 Chapter Notes \\
                 10: Further Uses of Rounding Data and Dynamic
                 Programming \\
                 10.1: The Euclidean Traveling Salesman Problem \\
                 10.2: The Maximum Independent Set Problem in Planar
                 Graphs \\
                 Exercises \\
                 Chapter Notes \\
                 11: Further Uses of Deterministic Rounding of Linear
                 Programs \\
                 11.1: The Generalized Assignment Problem \\
                 11.2: Minimum-Cost Bounded-Degree Spanning Trees \\
                 11.3: Survivable Network Design and Iterated Rounding
                 \\
                 Exercises \\
                 Chapter Notes \\
                 12: Further Uses of Random Sampling and Randomized
                 Rounding of Linear Programs \\
                 12.1: The Uncapacitated Facility Location Problem \\
                 12.2: The Single-Source Rent-or-Buy Problem \\
                 12.3: The Steiner Tree Problem \\
                 12.4: Everything at Once: Finding a Large Cut in a
                 Dense Graph \\
                 Exercises \\
                 Chapter Notes \\
                 13: Further Uses of Randomized Rounding of Semidefinite
                 Programs \\
                 13.1: Approximating Quadratic Programs \\
                 13.2: Coloring 3-Colorable Graphs \\
                 13.3: Unique Games \\
                 Exercises \\
                 Chapter Notes \\
                 14: Further Uses of the Primal-Dual Method \\
                 14.1: The Prize-Collecting Steiner Tree Problem \\
                 14.2: The Feedback Vertex Set Problem in Undirected
                 Graphs \\
                 Exercises \\
                 Chapter Notes \\
                 15: Further Uses of Cuts and Metrics \\
                 15.1: Low-Distortion Embeddings and the Sparsest Cut
                 Problem \\
                 15.2: Oblivious Routing and Cut-Tree Packings \\
                 15.3: Cut-Tree Packings and the Minimum Bisection
                 Problem \\
                 15.4: The Uniform Sparsest Cut Problem \\
                 Exercises \\
                 Chapter Notes \\
                 16: Techniques in Proving the Hardness of Approximation
                 \\
                 16.1: Reductions from NP-Complete Problems \\
                 16.2: Reductions that Preserve Approximation \\
                 16.3: Reductions from Probabilistically Checkable
                 Proofs \\
                 16.4: Reductions from Label Cover \\
                 16.5: Reductions from Unique Games \\
                 Chapter Notes \\
                 17: Open Problems",
}

@Book{Willinsky:2006:APC,
  author =       "John Willinsky",
  title =        "The Access Principle: the Case for Open Access to
                 Research and Scholarship",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xv + 287",
  year =         "2006",
  ISBN =         "0-262-23242-1",
  ISBN-13 =      "978-0-262-23242-5",
  LCCN =         "Z286.O63 W55 2006",
  bibdate =      "Thu Mar 22 11:30:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Digital libraries and electronic publishing",
  URL =          "http://edrev.asu.edu/reviews/rev478.htm;
                 http://mitpress.mit.edu/catalog/item/default.asp?tid=10611\%26ttype=2",
  acknowledgement = ack-nhfb,
  subject =      "Open access publishing; Scholarly electronic
                 publishing; Science publishing; Libraries and
                 electronic publishing; Communication in learning and
                 scholarship; Communication in science",
}

@Book{Wolfram:1993:CTT,
  author =       "D. A. Wolfram",
  title =        "The Clausal Theory of Types",
  volume =       "21",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "viii + 124",
  year =         "1993",
  ISBN =         "0-521-39538-0 (hardcover)",
  ISBN-13 =      "978-0-521-39538-0 (hardcover)",
  LCCN =         "QA76.63 .W64 1993",
  bibdate =      "Thu Mar 22 11:46:52 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  price =        "\$124.95",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam026/93246461.html;
                 http://www.loc.gov/catdir/toc/cam029/93246461.html",
  acknowledgement = ack-nhfb,
  subject =      "Logic programming",
}

@Book{Wolfram:2002:NKS,
  author =       "Stephen Wolfram",
  title =        "A New Kind of Science",
  publisher =    pub-WOLFRAM-MEDIA,
  address =      pub-WOLFRAM-MEDIA:adr,
  pages =        "xiv + 1197",
  year =         "2002",
  ISBN =         "1-57955-008-8",
  ISBN-13 =      "978-1-57955-008-0",
  LCCN =         "QA267.5.C45 W67 2002",
  bibdate =      "Thu Mar 22 12:42:21 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/fy031/2001046603.html",
  acknowledgement = ack-nhfb,
  subject =      "Cellular automata; Computational complexity",
  tableofcontents = "Machine generated contents note: Preface ix \\
                 1 The Foundations for a New Kind of Science I \\
                 2 The Crucial Experiment 23 \\
                 3 The World of Simple Programs 51 \\
                 4 Systems Based on Numbers 115 \\
                 5 Two Dimensions and Beyond 169 \\
                 6 Starting from Randomness 223 \\
                 7 Mechanisms in Programs and Nature 297 \\
                 8 Implications for Everyday Systems 363 \\
                 9 Fundamental Physics 433 \\
                 10 Processes of Perception and Analysis 547 \\
                 11 The Notion of Computation 637 \\
                 12 The Principle of Computational Equivalence 715 \\
                 Notes 849 \\
                 Index 1201",
}

@Book{Wolsey:1998:IP,
  author =       "Laurence A. Wolsey",
  title =        "Integer programming",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "xviii + 264",
  year =         "1998",
  ISBN =         "0-471-28366-5",
  ISBN-13 =      "978-0-471-28366-9",
  LCCN =         "T57.74 .W67 1998",
  bibdate =      "Fri Mar 23 09:53:48 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Wiley-Interscience series in discrete mathematics and
                 optimization",
  URL =          "http://www.loc.gov/catdir/bios/wiley047/98007296.html;
                 http://www.loc.gov/catdir/description/wiley032/98007296.html;
                 http://www.loc.gov/catdir/toc/onix02/98007296.html",
  acknowledgement = ack-nhfb,
  subject =      "Integer programming",
}

@Book{Yan:2002:NTC,
  author =       "Song Y. Yan",
  title =        "Number Theory for Computing",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  edition =      "Second",
  pages =        "xxii + 435",
  year =         "2002",
  ISBN =         "3-540-43072-5",
  ISBN-13 =      "978-3-540-43072-8",
  LCCN =         "QA241 .Y27 2002",
  bibdate =      "Fri Mar 23 11:11:47 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  note =         "Foreword by Martin E. Hellman.",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0812/2002510398-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0812/2002510398-t.html",
  acknowledgement = ack-nhfb,
  subject =      "number theory; computer science; mathematics",
}

@Book{Yan:2007:CAR,
  author =       "Song Y. Yan",
  title =        "Cryptanalytic attacks on {RSA}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 254",
  year =         "2007",
  ISBN =         "0-387-48741-7",
  ISBN-13 =      "978-0-387-48741-0",
  LCCN =         "QA76.9.A25 Y34 2007",
  bibdate =      "Fri Mar 23 19:15:13 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  abstract =     "RSA is a public-key cryptographic system, and is the
                 most famous and widely-used cryptographic system in
                 today's digital world. Cryptanalytic Attacks on RSA, a
                 professional book, covers almost all known
                 cryptanalytic attacks and defenses of the RSA
                 cryptographic system and its variants. Since RSA
                 depends heavily on computational complexity theory and
                 number theory, background information on complexity
                 theory and number theory is presented first, followed
                 by an account of the RSA cryptographic system and its
                 variants. This book is also suitable as a secondary
                 text for advanced-level students in computer science
                 and mathematics",
  acknowledgement = ack-nhfb,
  subject =      "Data encryption (Computer science); Computer networks;
                 Security measures; Cryptography",
}

@Book{Yanofsky:2008:QCC,
  author =       "Noson S. Yanofsky and Mirco A. Mannucci",
  title =        "Quantum Computing for Computer Scientists",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xvi + 384",
  year =         "2008",
  ISBN =         "0-521-87996-5 (hardcover)",
  ISBN-13 =      "978-0-521-87996-5 (hardcover)",
  LCCN =         "QA76.889 .Y35 2008",
  bibdate =      "Thu Mar 22 12:53:51 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0818/2008020507.html",
  acknowledgement = ack-nhfb,
  subject =      "Quantum computers",
}

@Book{Zimand:2004:CCQ,
  author =       "Marius Zimand",
  title =        "Computational Complexity: a Quantitative Perspective",
  volume =       "196",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xii + 340",
  year =         "2004",
  ISBN =         "0-444-82841-9",
  ISBN-13 =      "978-0-444-82841-5",
  LCCN =         "QA267.7 .Z55 2004",
  bibdate =      "Thu Mar 22 12:00:11 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "North-Holland mathematics studies, 0304-0208",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0632/2006273471-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity",
  tableofcontents = "1. Preliminaries \\
                 2. Abstract complexity theory \\
                 3. P, NP, and E \\
                 4. Quantum computation \\
                 5. One-way functions, pseudo-random generators \\
                 6. Optimization problems \\
                 A. Tail bounds \\
                 Bibliography \\
                 Index",
}

%%% ====================================================================
%%% Conference proceedings come last.  Entries are sorted by year, then
%%% by citation label.
@Proceedings{ACM:2012:PAS,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the 2012 ACM Symposium on Principles
                 of Distributed Computing}",
  title =        "{Proceedings of the 2012 ACM Symposium on Principles
                 of Distributed Computing}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xiv + 396",
  year =         "2012",
  ISBN =         "1-4503-1450-3",
  ISBN-13 =      "978-1-4503-1450-3",
  LCCN =         "????",
  bibdate =      "Tue May 7 10:37:16 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing;
                 Congresses; Computer networks",
}

@Proceedings{Aguilera:2012:DCH,
  editor =       "Marcos K. Aguilera",
  booktitle =    "{Distributed Computing: 26th International Symposium,
                 DISC 2012, Salvador, Brazil, October 16--18, 2012.
                 Proceedings}",
  title =        "{Distributed Computing: 26th International Symposium,
                 DISC 2012, Salvador, Brazil, October 16--18, 2012.
                 Proceedings}",
  volume =       "7611",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvi + 450",
  year =         "2012",
  DOI =          "https://doi.org/10.1007/978-3-642-33651-5",
  ISBN =         "3-642-33651-5",
  ISBN-13 =      "978-3-642-33651-5",
  LCCN =         "TK5105.5-5105.9",
  bibdate =      "Tue May 7 10:40:25 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "Lecture Notes in Computer Science",
  abstract =     "This book constitutes the refereed proceedings of the
                 26th International Symposium on Distributed Computing,
                 DISC 2012, held in Salvador, Brazil, in October 2012.
                 The 27 revised full papers presented together with 24
                 brief announcements were carefully reviewed and
                 selected from 119 submissions. The papers are organized
                 in topical sections on shared memory, mobile agents and
                 overlay networks, wireless and multiple access channel
                 networks, dynamic networks, distributed graph
                 algorithms, wireless and loosely connected networks,
                 robots, and lower bounds and separation.",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Computer Communication Networks;
                 Software engineering; Computer software; Artificial
                 intelligence",
  tableofcontents = "CBTree: A Practical Concurrent Self-Adjusting
                 Search Tree \\
                 Efficient Fetch-and-Increment \\
                 Show No Weakness: Sequentially Consistent
                 Specifications of TSO Libraries \\
                 Collecting Information by Power-Aware Mobile Agents \\
                 Memory Lower Bounds for Randomized Collaborative Search
                 and Implications for Biology \\
                 A Generalized Algorithm for Publish/Subscribe Overlay
                 Design and Its Fast Implementation \\
                 Bounded-Contention Coding for Wireless Networks in the
                 High SNR Regime \\
                 Distributed Backbone Structure for Algorithms in the
                 SINR Model of Wireless Networks \\
                 Distributed Online and Stochastic Queuing on a Multiple
                 Access Channel \\
                 Fast Distributed Computation in Dynamic Networks via
                 Random Walks \\
                 Dense Subgraphs on Dynamic Networks \\
                 Lower Bounds on Information Dissemination in Dynamic
                 Networks \\
                 No Sublogarithmic-Time Approximation Scheme for
                 Bipartite Vertex Cover \\
                 ``Tri, Tri Again'': Finding Triangles and Small
                 Subgraphs in a Distributed Setting \\
                 Distributed 2-Approximation Algorithm for the
                 Semi-matching Problem \\
                 Bounds on Contention Management in Radio Networks \\
                 Efficient Symmetry Breaking in Multi-Channel Radio
                 Networks \\
                 On Byzantine Broadcast in Loosely Connected Networks
                 \\
                 RMR-Efficient Randomized Abortable Mutual Exclusion \\
                 Abortable Reader-Writer Locks Are No More Complex Than
                 Abortable Mutex Locks \\
                 Pessimistic Software Lock-Elision \\
                 Asynchronous Pattern Formation by Anonymous Oblivious
                 Mobile Robots \\
                 How to Gather Asynchronous Oblivious Robots on
                 Anonymous Rings \\
                 Position Discovery for a System of Bouncing Robots \\
                 Counting-Based Impossibility Proofs for Renaming and
                 Set Agreement \\
                 Randomized Distributed Decision \\
                 The Strong At-Most-Once Problem \\
                 Brief Announcement: Wait-Free Gathering of Mobile
                 Robots \\
                 Brief Announcement: Distributed Exclusive and Perpetual
                 Tree Searching \\
                 Brief Announcement: Reaching Approximate Byzantine
                 Consensus in Partially-Connected Mobile Networks \\
                 Brief Announcement: Distributed Algorithms for Maximum
                 Link Scheduling in the Physical Interference Model \\
                 Brief Announcement: A Fast Distributed Approximation
                 Algorithm for Minimum Spanning Trees in the SINR Model
                 \\
                 Brief Announcement: Deterministic Protocol for the
                 Membership Problem in Beeping Channels \\
                 Brief Announcement: Probabilistic Stabilization under
                 Probabilistic Schedulers \\
                 Brief Announcement: An Analysis Framework for
                 Distributed Hierarchical Directories \\
                 Brief Announcement: Flooding in Dynamic Graphs with
                 Arbitrary Degree Sequence \\
                 Brief Announcement: Node Sampling Using Centrifugal
                 Random Walks \\
                 Brief Announcement: Concurrent Wait-Free Red-Black
                 Trees \\
                 Brief Announcement: A Contention-Friendly, Non-blocking
                 Skip List \\
                 Brief Announcement: Consensus and Efficient Passive
                 Replication \\
                 Brief Announcement: Anonymity, Failures, Detectors and
                 Consensus \\
                 Brief Announcement: Do VNet Embeddings Leak Information
                 about ISP Topology \\
                 Brief Announcement: Efficient Private Distributed
                 Computation on Unbounded Input Streams \\
                 Brief Announcement: Fast Travellers:
                 Infrastructure-Independent Deadlock Resolution in
                 Resource-restricted Distributed Systems \\
                 Brief Announcement: Hashed Predecessor Patricia Trie
                 \\
                 A Data Structure for Efficient Predecessor Queries in
                 Peer-to-Peer Systems \\
                 Brief Announcement: Naming and Counting in Anonymous
                 Unknown Dynamic Networks \\
                 Brief Announcement: SplayNets: Towards Self-Adjusting
                 Distributed Data Structures \\
                 Brief Announcement: Semantics of Eventually Consistent
                 Replicated Sets \\
                 Brief Announcement: Decoupled and Consensus-Free
                 Reconfiguration for Fault-Tolerant Storage \\
                 Brief Announcement: Atomic Consistency and Partition
                 Tolerance in Scalable Key-Value Stores \\
                 Brief Announcement: Weighted Partial Message Matching
                 for Implicit Multicast Systems \\
                 Efficient Fetch-and-Increment \\
                 Show No Weakness: Sequentially Consistent
                 Specifications of TSO Libraries \\
                 Collecting Information by Power-Aware Mobile Agents \\
                 Memory Lower Bounds for Randomized Collaborative Search
                 and Implications for Biology \\
                 A Generalized Algorithm for Publish/Subscribe Overlay
                 Design and Its Fast Implementation \\
                 Bounded-Contention Coding for Wireless Networks in the
                 High SNR Regime \\
                 Distributed Backbone Structure for Algorithms in the
                 SINR Model of Wireless Networks \\
                 Distributed Online and Stochastic Queuing on a Multiple
                 Access Channel \\
                 Fast Distributed Computation in Dynamic Networks via
                 Random Walks \\
                 Dense Subgraphs on Dynamic Networks \\
                 Lower Bounds on Information Dissemination in Dynamic
                 Networks \\
                 No Sublogarithmic-Time Approximation Scheme for
                 Bipartite Vertex Cover \\
                 ``Tri, Tri Again'': Finding Triangles and Small
                 Subgraphs in a Distributed Setting \\
                 Distributed 2-Approximation Algorithm for the
                 Semi-matching Problem \\
                 Bounds on Contention Management in Radio Networks \\
                 Efficient Symmetry Breaking in Multi-Channel Radio
                 Networks \\
                 On Byzantine Broadcast in Loosely Connected Networks
                 \\
                 RMR-Efficient Randomized Abortable Mutual Exclusion \\
                 Abortable Reader-Writer Locks Are No More Complex Than
                 Abortable Mutex Locks \\
                 Pessimistic Software Lock-Elision \\
                 Asynchronous Pattern Formation by Anonymous Oblivious
                 Mobile Robots \\
                 How to Gather Asynchronous Oblivious Robots on
                 Anonymous Rings \\
                 Position Discovery for a System of Bouncing Robots \\
                 Counting-Based Impossibility Proofs for Renaming and
                 Set Agreement \\
                 Randomized Distributed Decision \\
                 The Strong At-Most-Once Problem \\
                 Brief Announcement: Wait-Free Gathering of Mobile
                 Robots \\
                 Brief Announcement: Distributed Exclusive and Perpetual
                 Tree Searching \\
                 Brief Announcement: Reaching Approximate Byzantine
                 Consensus in Partially-Connected Mobile Networks \\
                 Brief Announcement: Distributed Algorithms for Maximum
                 Link Scheduling in the Physical Interference Model \\
                 Brief Announcement: A Fast Distributed Approximation
                 Algorithm for Minimum Spanning Trees in the SINR Model
                 \\
                 Brief Announcement: Deterministic Protocol for the
                 Membership Problem in Beeping Channels \\
                 Brief Announcement: Probabilistic Stabilization under
                 Probabilistic Schedulers \\
                 Brief Announcement: An Analysis Framework for
                 Distributed Hierarchical Directories \\
                 Brief Announcement: Flooding in Dynamic Graphs with
                 Arbitrary Degree Sequence \\
                 Brief Announcement: Node Sampling Using Centrifugal
                 Random Walks \\
                 Brief Announcement: Concurrent Wait-Free Red-Black
                 Trees \\
                 Brief Announcement: A Contention-Friendly, Non-blocking
                 Skip List \\
                 Brief Announcement: Consensus and Efficient Passive
                 Replication \\
                 Brief Announcement: Anonymity, Failures, Detectors and
                 Consensus \\
                 Brief Announcement: Do VNet Embeddings Leak Information
                 about ISP Topology \\
                 Brief Announcement: Efficient Private Distributed
                 Computation on Unbounded Input Streams \\
                 Brief Announcement: Fast Travellers:
                 Infrastructure-Independent Deadlock Resolution in
                 Resource-restricted Distributed Systems \\
                 Brief Announcement: Hashed Predecessor Patricia Trie
                 \\
                 A Data Structure for Efficient Predecessor Queries in
                 Peer-to-Peer Systems \\
                 Brief Announcement: Naming and Counting in Anonymous
                 Unknown Dynamic Networks \\
                 Brief Announcement: SplayNets: Towards Self-Adjusting
                 Distributed Data Structures \\
                 Brief Announcement: Semantics of Eventually Consistent
                 Replicated Sets \\
                 Brief Announcement: Decoupled and Consensus-Free
                 Reconfiguration for Fault-Tolerant Storage \\
                 Brief Announcement: Atomic Consistency and Partition
                 Tolerance in Scalable Key-Value Stores \\
                 Brief Announcement: Weighted Partial Message Matching
                 for Implicit Multicast Systems",
}

@Book{Albert:2009:GNC,
  editor =       "Michael H. Albert and Richard J. Nowakowski",
  booktitle =    "Games Of No Chance 3",
  title =        "Games Of No Chance 3",
  volume =       "56",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "x + 575",
  year =         "2009",
  ISBN =         "0-521-86134-9 (hardcover), 0-521-67854-4 (paperback)",
  ISBN-13 =      "978-0-521-86134-2 (hardcover), 978-0-521-67854-4
                 (paperback)",
  LCCN =         "QA269 .G374 2009",
  bibdate =      "Thu Mar 22 12:15:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematical Sciences Research Institute
                 publications",
  acknowledgement = ack-nhfb,
  remark =       "Sequel to: More games of no chance, 2002.",
  subject =      "Game theory; Congresses; Combinatorial analysis",
}

@Proceedings{Aldous:1998:MDP,
  editor =       "D. J. (David J.) Aldous and James Propp",
  booktitle =    "{Microsurveys in Discrete Probability: DIMACS
                 Workshop, June 2--6, 1997}",
  title =        "{Microsurveys in Discrete Probability: DIMACS
                 Workshop, June 2--6, 1997}",
  volume =       "41",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "ix + 220",
  year =         "1998",
  ISBN =         "0-8218-0827-3 (hardcover)",
  ISBN-13 =      "978-0-8218-0827-6 (hardcover)",
  LCCN =         "QA273.A1 M53 1998",
  bibdate =      "Thu Mar 22 12:38:55 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science, 1052-1798",
  acknowledgement = ack-nhfb,
  remark =       "NSF Science and Technology Center in Discrete
                 Mathematics and Theoretical Computer Science, A
                 consortium of Rutgers University, Princeton University,
                 AT and T Labs, Bell Labs, and Bellcore. This DIMACS
                 volume contains the lectures of speakers at the
                 workshop ``Microsurveys in Discrete Probability'' held
                 at the Institute for Advanced Study, Princeton, NJ,
                 June 2--6, 1997.",
  subject =      "Probabilities; Congresses",
}

@Book{Atallah:1999:ATC,
  editor =       "Mikhail J. Atallah",
  booktitle =    "Algorithms and Theory of Computation Handbook",
  title =        "Algorithms and Theory of Computation Handbook",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "????",
  year =         "1999",
  ISBN =         "0-8493-2649-4",
  ISBN-13 =      "978-0-8493-2649-3",
  LCCN =         "QA76.9.A43 A43 1999",
  bibdate =      "Thu Mar 22 11:34:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0742/98038016-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer science; Computational
                 complexity",
}

@Book{Atallah:2009:ATC,
  editor =       "Mikhail J. Atallah and Marina Blanton",
  booktitle =    "Algorithms and Theory of Computation Handbook: General
                 Concepts and Techniques",
  title =        "Algorithms and Theory of Computation Handbook: General
                 Concepts and Techniques",
  publisher =    pub-TAYLOR-FRANCIS,
  address =      pub-TAYLOR-FRANCIS:adr,
  edition =      "Second",
  pages =        "????",
  year =         "2009",
  ISBN =         "1-58488-822-9 (vol. 1)",
  ISBN-13 =      "978-1-58488-822-2 (vol. 1)",
  LCCN =         "QA76.9.A43 A432 2009",
  bibdate =      "Thu Mar 22 11:34:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC applied algorithms and data
                 structures series",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer science; Computational
                 complexity",
  tableofcontents = "[v. 1] General concepts and techniques",
}

@Book{Atallah:2010:ATC,
  editor =       "Mikhail J. Atallah and Marina Blanton",
  booktitle =    "Algorithms and Theory of Computation Handbook: Special
                 Topics and Techniques",
  title =        "Algorithms and Theory of Computation Handbook: Special
                 Topics and Techniques",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  edition =      "Second",
  pages =        "????",
  year =         "2010",
  ISBN =         "1-58488-820-2 (v. 2)",
  ISBN-13 =      "978-1-58488-820-8 (v. 2)",
  LCCN =         "QA76.9.A43 A433 2010",
  bibdate =      "Thu Mar 22 11:34:40 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC applied algorithms and data
                 structures series",
  acknowledgement = ack-nhfb,
  subject =      "Computer algorithms; Computer science; Computational
                 complexity",
  tableofcontents = "[v. 2.] Special topics and techniques",
}

@Book{Berlekamp:1999:MPP,
  editor =       "Elwyn R. Berlekamp and Tom Rodgers",
  booktitle =    "The Mathemagician and Pied Puzzler: a Collection in
                 Tribute to {Martin Gardner}",
  title =        "The Mathemagician and Pied Puzzler: a Collection in
                 Tribute to {Martin Gardner}",
  publisher =    pub-A-K-PETERS,
  address =      pub-A-K-PETERS:adr,
  pages =        "x + 266",
  year =         "1999",
  ISBN =         "1-56881-075-X",
  ISBN-13 =      "978-1-56881-075-1",
  LCCN =         "QA95 .M366 1999",
  bibdate =      "Fri Mar 23 18:47:44 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Mathematical recreations",
}

@Book{Bezem:2003:TRS,
  editor =       "M. (Marc) Bezem and J. W. Klop and Roel de Vrijer",
  booktitle =    "Term rewriting systems",
  title =        "Term rewriting systems",
  volume =       "55",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxii + 884",
  year =         "2003",
  ISBN =         "0-521-39115-6",
  ISBN-13 =      "978-0-521-39115-3",
  LCCN =         "QA267 .T43 2003",
  bibdate =      "Fri Mar 23 09:56:22 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Cambridge tracts in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/description/cam022/2002067658.html;
                 http://www.loc.gov/catdir/samples/cam033/2002067658.html;
                 http://www.loc.gov/catdir/toc/cam031/2002067658.html",
  acknowledgement = ack-nhfb,
  remark =       "Also cited as authored by Terese (Group).",
  subject =      "Rewriting systems (Computer science)",
  tableofcontents = "1. Abstract reduction systems \\
                 2. First-order term rewriting systems \\
                 3. Examples of TRSs and special rewriting formats \\
                 4. Orthogonality \\
                 5. Properties of rewriting: decidability and modularity
                 \\
                 6. Termination \\
                 7. Completion of equational specifications \\
                 8. Equivalence of reductions \\
                 9. Strategies \\
                 10. Lambda calculus \\
                 11. Higher order rewriting \\
                 12. Infinitary rewriting \\
                 13. Term graph rewriting \\
                 14. Advanced ARS theory \\
                 15. Rewriting based languages and systems \\
                 16. Mathematical background.",
}

@Book{Blackburn:2007:HML,
  editor =       "Patrick Blackburn and J. F. A. K. van Benthem and
                 Frank Wolter",
  booktitle =    "Handbook of Modal Logic",
  title =        "Handbook of Modal Logic",
  volume =       "3",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "????",
  year =         "2007",
  ISBN =         "0-444-51690-5",
  ISBN-13 =      "978-0-444-51690-9",
  LCCN =         "BC199.M6 H36 2007",
  bibdate =      "Thu Mar 22 12:39:37 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Studies in logic and practical reasoning",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0665/2006050759-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Modality (Logic); Handbooks, manuals, etc",
}

@Book{Bollobas:1991:PCA,
  editor =       "B{\'e}la Bollob{\'a}s and Fan R. K. Chung and others",
  booktitle =    "Probabilistic Combinatorics and its Applications",
  title =        "Probabilistic Combinatorics and its Applications",
  volume =       "44",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xv + 196",
  year =         "1991",
  ISBN =         "0-8218-5500-X",
  ISBN-13 =      "978-0-8218-5500-3",
  LCCN =         "QA273.45 .P76 1992",
  bibdate =      "Thu Mar 22 12:49:06 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Proceedings of symposia in applied mathematics; AMS
                 short course lecture notes",
  acknowledgement = ack-nhfb,
  remark =       "Lecture notes prepared for the American Mathematical
                 Society short course in probabilistic combinatorics and
                 its applications held in San Francisco, California,
                 January 14--15, 1991.",
  subject =      "Combinatorial probabilities; Random graphs",
}

@Proceedings{Chung:1997:SGT,
  editor =       "Fan R. K. Chung",
  booktitle =    "Spectral Graph Theory",
  title =        "Spectral Graph Theory",
  volume =       "92",
  publisher =    "Published for the Conference Board of the Mathematical
                 Sciences by the American Mathematical Society",
  address =      "Providence, RI, USA",
  pages =        "xi + 207",
  year =         "1997",
  ISBN =         "0-8218-0315-8 (softcover)",
  ISBN-13 =      "978-0-8218-0315-8 (softcover)",
  LCCN =         "QA1 .R33 no. 92",
  bibdate =      "Thu Mar 22 13:01:33 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Regional conference series in mathematics, 0160-7642",
  acknowledgement = ack-nhfb,
  remark =       "CBMS Conference on Recent Advances in Spectral Graph
                 Theory held at California State University at Fresno,
                 June 6--10, 1994.",
  subject =      "Graph theory; Congresses; Eigenvalues",
}

@Book{Cohen:2006:HEH,
  editor =       "Henri Cohen and Gerhard Frey and Roberto Avanzi and
                 others",
  booktitle =    "Handbook of Elliptic and Hyperelliptic Curve
                 Cryptography",
  title =        "Handbook of Elliptic and Hyperelliptic Curve
                 Cryptography",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xxxiv + 808",
  year =         "2006",
  ISBN =         "1-58488-518-1",
  ISBN-13 =      "978-1-58488-518-4",
  LCCN =         "QA567.2.E44 H36 2006",
  bibdate =      "Thu Mar 22 12:20:50 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0647/2005041841-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Curves, Elliptic; Handbooks, manuals, etc;
                 Cryptography; Mathematics; Machine theory",
}

@Book{Condon:2009:AB,
  editor =       "Anne Condon and David Harel and Joost N. Kok and Arto
                 Salomaa and Erik Winfree",
  booktitle =    "Algorithmic Bioprocesses",
  title =        "Algorithmic Bioprocesses",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xx + 742",
  year =         "2009",
  ISBN =         "3-540-88868-3, 3-540-88869-1 (e-book)",
  ISBN-13 =      "978-3-540-88868-0, 978-3-540-88869-7 (e-book)",
  LCCN =         "QA76.9",
  bibdate =      "Tue May 7 10:09:18 MDT 2013",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  series =       "Natural Computing Series",
  URL =          "http://public.eblib.com/EBLPublic/PublicView.do?ptiID=478040",
  abstract =     "Offers a comprehensive overview of research into
                 algorithmic self-assembly, RNA folding, the algorithmic
                 foundations for biochemical reactions, and the
                 algorithmic nature of developmental processes. This
                 book addresses subjects such as sequence discovery,
                 generation, and analysis; nanoconstructions and
                 self-assembly; and membrane computing.",
  acknowledgement = ack-nhfb,
  subject =      "Computational Biology; Festschrift; Information
                 Theory; Information theory in biology; Models,
                 Theoretical; Molecular Biology; Mathematical models;
                 Structural bioinformatics",
  tableofcontents = "Preface \\
                 Contents \\
                 Contributors \\
                 Tribute \\
                 Sequence Discovery, Generation, and Analysis \\
                 Gene Assembly in Ciliates \\
                 Nanoconstructions and Self-assembly \\
                 Membrane Computing \\
                 Formal Models and Analysis \\
                 Process Calculi and Automata \\
                 Biochemical Reactions \\
                 Broader Perspective",
}

@Book{Droste:2009:HWA,
  editor =       "Manfred Droste and Werner Kuich and Heiko Vogler",
  booktitle =    "Handbook of Weighted Automata",
  title =        "Handbook of Weighted Automata",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 608",
  year =         "2009",
  ISBN =         "3-642-01491-7",
  ISBN-13 =      "978-3-642-01491-8",
  LCCN =         "QA267 .H34 2009",
  bibdate =      "Tue May 7 09:35:55 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Monographs in theoretical computer science",
  URL =          "http://www.loc.gov/catdir/enhancements/fy1109/2009926056-d.html;
                 http://www.loc.gov/catdir/enhancements/fy1109/2009926056-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Machine theory; Gewichteter Automat",
  tableofcontents = "Semirings and formal power series / Manfred Droste
                 and Werner Kuich \\
                 Fixed point theory / Zolt{\'a}n {\'E}sik \\
                 Finite automata / Zolt{\'a}n {\'E}sik and Werner Kuich
                 \\
                 Rational and recognisable power series / Jacques
                 Sakarovitch \\
                 Weighted automata and weighted logics / Manfred Droste
                 and Paul Gastin \\
                 Weighted automata algorithms / Mehryar Mohri \\
                 Algebraic systems and pushdown automata / Ion Petre and
                 Arto Salomaa \\
                 Lindenmayer systems / Juha Honkala \\
                 Weighted tree automata and tree transducers /
                 Zolt{\'a}n F{\"u}l{\"o}p and Heiko Vogler \\
                 Traces, series-parallel posets, and pictures : a
                 weighted study / Ina Fichtner, Dietrich Kuske, and
                 Ingmar Meinecke \\
                 Digital image compression / J{\"u}rgen Albert and
                 Jarkko Kari \\
                 Fizzy languages / George Rahonis \\
                 Model checking linear-time properties of probabilistic
                 systems / Christel Baier, Marcus Gr{\"o}{\c{c}}er, and
                 Frank Ciesinski \\
                 Applications of weighted automata in natural language
                 processing / Kevin Knight and Jonathan May",
}

@Book{Dudley:2008:MIM,
  editor =       "Underwood Dudley",
  booktitle =    "Is Mathematics Inevitable?: a Miscellany",
  title =        "Is Mathematics Inevitable?: a Miscellany",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "x + 325",
  year =         "2008",
  ISBN =         "0-88385-566-6 (hardcover)",
  ISBN-13 =      "978-0-88385-566-9 (hardcover)",
  LCCN =         "QA99 .I7 2008",
  bibdate =      "Fri Mar 23 10:29:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Spectrum series",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Miscellanea",
  tableofcontents = "Dieudonn{\'e} on mathematics \\
                 Why is mathematics? \\
                 Is mathematics inevitable? \\
                 A defense of quadratic equations \\
                 Obtuse triangles \\
                 Small paradox \\
                 Applied mathematcis \\
                 The law of small numbers \\
                 Parallel postulate \\
                 Arithmetic in the United States \\
                 The Moore method \\
                 Early calculus \\
                 Problems \\
                 A tangled tale \\
                 A brief life \\
                 Cardano \\
                 Boole and finite differences \\
                 Calculating prodigies \\
                 James Smith, circle-squarer \\
                 Legislating $\pi$ \\
                 Mathematics and music \\
                 Mathematics books \\
                 Irrational square roots \\
                 The Euler--Diderot anecdote \\
                 Mathematics made difficult \\
                 Mathematical humor",
}

@Book{Farach-Colton:1999:MSM,
  editor =       "Martin Farach-Colton and others",
  booktitle =    "Mathematical Support for Molecular Biology: Papers
                 Related to the {Special Year in Mathematical Support
                 for Molecular Biology}, 1994--1998",
  title =        "Mathematical Support for Molecular Biology: Papers
                 Related to the {Special Year in Mathematical Support
                 for Molecular Biology}, 1994--1998",
  volume =       "47",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xv + 288",
  year =         "1999",
  ISBN =         "0-8218-0826-5",
  ISBN-13 =      "978-0-8218-0826-9",
  LCCN =         "QH506 .M385 1999",
  bibdate =      "Thu Mar 22 12:36:29 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science, 1052-1798",
  acknowledgement = ack-nhfb,
  subject =      "Molecular biology; Mathematics",
}

@Book{Faulon:2010:HCA,
  editor =       "Jean-Loup Faulon and Andreas Bender",
  booktitle =    "Handbook of Chemoinformatics Algorithms",
  title =        "Handbook of Chemoinformatics Algorithms",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xii + 440",
  year =         "2010",
  ISBN =         "1-4200-8292-2 (hardcover)",
  ISBN-13 =      "978-1-4200-8292-0 (hardcover)",
  LCCN =         "QD39.3.E46 H357 2010",
  bibdate =      "Thu Mar 22 12:20:10 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC mathematical and computational
                 biology series",
  acknowledgement = ack-nhfb,
  subject =      "Cheminformatics; Handbooks, manuals, etc; Algorithms;
                 Graph theory",
}

@Book{Fredriksson:2001:CSP,
  editor =       "Einar H. Fredriksson",
  booktitle =    "A Century of Science Publishing: a Collection of
                 Essays",
  title =        "A Century of Science Publishing: a Collection of
                 Essays",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "viii + 312",
  year =         "2001",
  ISBN =         "1-58603-148-1",
  ISBN-13 =      "978-1-58603-148-0",
  LCCN =         "Z286.S4 C46 2001",
  bibdate =      "Fri Mar 23 13:02:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Science publishing; History; 20th century",
}

@Book{Gay:2010:STQ,
  editor =       "Simon Gay and I. (Ian) Mackie",
  booktitle =    "Semantic Techniques in Quantum Computation",
  title =        "Semantic Techniques in Quantum Computation",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xiv + 478",
  year =         "2010",
  ISBN =         "0-521-51374-X (hardcover)",
  ISBN-13 =      "978-0-521-51374-6 (hardcover)",
  LCCN =         "QA76.889 .S36 2010",
  bibdate =      "Tue May 7 10:29:14 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://assets.cambridge.org/97805215/13746/cover/9780521513746.jpg",
  abstract =     "The study of computational processes based on the laws
                 of quantum mechanics has led to the discovery of new
                 algorithms, cryptographic techniques, and communication
                 primitives. This book explores quantum computation from
                 the perspective of the branch of theoretical computer
                 science known as semantics, as an alternative to the
                 more well-known studies of algorithmics, complexity
                 theory, and information theory. It collects chapters
                 from leading researchers in the field, discussing the
                 theory of quantum programming languages, logics and
                 tools for reasoning about quantum systems, and novel
                 approaches to the foundations of quantum mechanics.
                 This book is suitable for graduate students and
                 researchers in quantum information and computation, as
                 well as those in semantics, who want to learn about a
                 new field arising from the application of semantic
                 techniques to quantum information and
                 computation.\par

                 The study of computational processes based on the laws
                 of quantum mechanics has led to the discovery of new
                 algorithms, cryptographic techniques, and communication
                 primitives. This book explores quantum computation from
                 the perspective of the branch of theoretical computer
                 science known as semantics, as an alternative to the
                 more well-known studies of algorithmics, complexity
                 theory, and information theory. It collects chapters
                 from leading researchers in the field, discussing the
                 theory of quantum programming languages, logics and
                 tools for reasoning about quantum systems, and novel
                 approaches to the foundations of quantum mechanics.
                 This book is suitable for graduate students and
                 researchers in quantum information and computation, as
                 well as those in semantics, who want to learn about a
                 new field arising from the application of semantic
                 techniques to quantum information and computation.",
  acknowledgement = ack-nhfb,
  subject =      "Quantum computers; Programming languages (Electronic
                 computers); Semantics; Quantum theory",
  tableofcontents = "No-cloning in categorical quantum mechanics /
                 Samson Abramsky \\
                 Classical and quantum structuralism / Bob Coecke,
                 {\'E}ric Oliver Paquette, and Dusko Pavlovic \\
                 Generalized proof-nets for compact categories with
                 biproducts / Ross Duncan \\
                 Quantum lambda calculus / Peter Selinger and Beno{\^i}t
                 Valiron \\
                 The quantum IO monad / Thorsten Altenkirch and
                 Alexander S. Green \\
                 Abstract interpretation techniques for quantum
                 computation / Philippe Jorrand and Simon Perdrix \\
                 Extended measurement calculus / Cincent Danos [et al.]
                 \\
                 Predicate transformer semantics of quantum programs /
                 Minsheng Ying [et al.] \\
                 The structure of partial isometries / Peter Hines and
                 Samuel L. Braunstein \\
                 Temporal logics for reasoning about quantum systems /
                 Paulo Mateus [et al.] \\
                 Specification and verification of quantum protocols /
                 Simon J. Gay, Rajagopal Nagarajan, and Nikolaos
                 Papanikolaou",
}

@Book{Gold:2008:POD,
  editor =       "Bonnie Gold and Roger A. Simons",
  booktitle =    "Proof and other dilemmas: mathematics and philosophy",
  title =        "Proof and other dilemmas: mathematics and philosophy",
  publisher =    pub-MATH-ASSOC-AMER,
  address =      pub-MATH-ASSOC-AMER:adr,
  pages =        "xxxii + 346",
  year =         "2008",
  ISBN =         "0-88385-567-4 (hardcover)",
  ISBN-13 =      "978-0-88385-567-6 (hardcover)",
  LCCN =         "QA8.4 .P755 2008",
  bibdate =      "Fri Mar 23 10:29:19 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "Spectrum series",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics; Philosophy",
  tableofcontents = "Proof and how it is changing. : Proof : its nature
                 and significance / Michael Detlefsen \\
                 Implications of experimental mathematics for the
                 philosophy of mathematics / Jonathan Borwein \\
                 On the roles of proof in mathematics / Joseph Auslander
                 \\
                 Social constructivist views of mathematics. : When is a
                 problem solved? / Philip J. Davis \\
                 Mathematical practice as a scientific problem / Reuben
                 Hersh \\
                 Mathematical domains : social constructs? / Julian Cole
                 \\
                 The nature of mathematical objects and mathematical
                 knowledge. : The existence of mathematical objects /
                 Charles Chihara \\
                 Mathematical objects / Stewart Shapiro \\
                 Mathematical platonism / Mark Balaguer \\
                 The nature of mathematical objects / {\O}ystein Linnebo
                 \\
                 When is one thing equal to some other thing? / Barry
                 Mazur \\
                 The nature of mathematics and its applications. :
                 Extreme science : mathematics as the science of
                 relations as such / R.S.D. Thomas \\
                 What is mathematics? A pedagogical answer to a
                 philosophical question / Guershon Harel \\
                 What will count as mathematics in 2100? / Keith Devlin
                 \\
                 Mathematics applied : the case of addition / Mark
                 Steiner \\
                 Probability : a philosophical overview / Alan
                 H{\'a}jek",
}

@Proceedings{Goldwasser:2002:DSN,
  editor =       "Michael H. Goldwasser and David S. Johnson and
                 Catherine C. McGeoch",
  booktitle =    "{Data structures, near neighbor searches, and
                 methodology: fifth and sixth DIMACS implementation
                 challenges: papers related to the DIMACS challenge on
                 dictionaries and priority queues (1995--1996) and the
                 DIMACS challenge on near neighbor searches
                 (1998--1999)}",
  title =        "{Data structures, near neighbor searches, and
                 methodology: fifth and sixth DIMACS implementation
                 challenges: papers related to the DIMACS challenge on
                 dictionaries and priority queues (1995--1996) and the
                 DIMACS challenge on near neighbor searches
                 (1998--1999)}",
  volume =       "59",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xi + 256",
  year =         "2002",
  ISBN =         "0-8218-2892-4 (hardcover)",
  ISBN-13 =      "978-0-8218-2892-2 (hardcover)",
  LCCN =         "QA76.9.D35 D385 2002",
  bibdate =      "Fri Mar 23 10:25:01 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  remark =       "Proceedings of workshops held October 1996 and January
                 1999.",
  subject =      "Data structures (Computer science); Congresses",
  tableofcontents = "Partially persistent dynamic sets for
                 history-sensitive heuristics by R. Battiti \\
                 A practical perfect hashing algorithm by C. Silverstein
                 \\
                 Computational evaluation of hot queues by A. V.
                 Goldberg and C. Silverstein \\
                 Nearest neighbor search for data compression by K.
                 Zatloukal, M. H. Johnson, and R. E. Ladner \\
                 Experimental evaluation of disk-based data structures
                 for nearest neighbor searching by N. Katayama and S.
                 Satoh \\
                 Analysis of approximate nearest neighbor searching with
                 clustered point sets by S. Maneewongvatana and D. M.
                 Mount \\
                 Approximate nearest neighbor search using the extended
                 general space-filling curves heuristic by J.-C.
                 Perez-Cortes and E. Vidal \\
                 Locally lifting the curse of dimensionality for nearest
                 neighbor search by P. N. Yianilos \\
                 The role of experiment in the theory of algorithms by
                 R. J. Anderson \\
                 Towards a discipline of experimental algorithmics by B.
                 M. E. Moret \\
                 A theoretician's guide to the experimental analysis of
                 algorithms by D. S. Johnson \\
                 A bibliography of algorithm experimentation by C. C.
                 McGeoch",
}

@Book{Gowers:2008:PCM,
  editor =       "Timothy Gowers and June Barrow-Green and Imre Leader",
  booktitle =    "The {Princeton} Companion to Mathematics",
  title =        "The {Princeton} Companion to Mathematics",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "xx + 1034",
  year =         "2008",
  DOI =          "https://doi.org/10.1515/9781400830398",
  ISBN =         "0-691-11880-9 (hardcover)",
  ISBN-13 =      "978-0-691-11880-2 (hardcover)",
  LCCN =         "QA11.2 .P745 2008",
  bibdate =      "Thu Jun 27 09:20:50 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
                 http://www.math.utah.edu/pub/tex/bib/histmath.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/toc/ecip0818/2008020450.html",
  acknowledgement = ack-nhfb,
  subject =      "Mathematics",
}

@Book{Graham:1995:HC,
  editor =       "Ronald L. Graham and Martin Gr{\"o}tschel and
                 L{\'a}szl{\'o} Lov{\'a}sz",
  booktitle =    "Handbook of Combinatorics",
  title =        "Handbook of Combinatorics",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "cii + 2198 (2 volumes)",
  year =         "1995",
  ISBN =         "0-444-88002-X (set: Elsevier), 0-262-07169-X (set: MIT
                 Press), 0-444-82346-8 (v. 1.: Elsevier), 0-262-07170-3
                 (v. l.: MIT), 0-444-82351-4 (v. 2.: Elsevier),
                 0-262-07171-1 (v. 2.: MIT)",
  ISBN-13 =      "978-0-444-88002-4 (set: Elsevier), 978-0-262-07169-7
                 (set: MIT Press), 978-0-444-82346-5 (v. 1.: Elsevier),
                 978-0-262-07170-3 (v. l.: MIT), 978-0-444-82351-9 (v.
                 2.: Elsevier), 978-0-262-07171-0 (v. 2.: MIT)",
  LCCN =         "QA164 .H33 1995",
  bibdate =      "Thu Mar 22 12:20:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Combinatorial analysis; Handbooks, manuals, etc",
}

@Book{Gross:2004:HGT,
  editor =       "Jonathan L. Gross and Jay Yellen",
  booktitle =    "Handbook of Graph Theory",
  title =        "Handbook of Graph Theory",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "1167",
  year =         "2004",
  ISBN =         "1-58488-090-2",
  ISBN-13 =      "978-1-58488-090-5",
  LCCN =         "QA166 .H36 2004",
  bibdate =      "Thu Mar 22 12:21:10 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Discrete mathematics and its applications",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0646/2003065270-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Graph theory; Handbooks, manuals, etc",
}

@Book{Hemaspaandra:1997:CTR,
  editor =       "Lane A. Hemaspaandra and Alan L. Selman",
  booktitle =    "Complexity Theory Retrospective {II}",
  title =        "Complexity Theory Retrospective {II}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 339",
  year =         "1997",
  ISBN =         "0-387-94973-9 (hardcover)",
  ISBN-13 =      "978-0-387-94973-4 (hardcover)",
  LCCN =         "QA267.7 .C674 1997",
  bibdate =      "Thu Mar 22 11:53:23 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0815/96029772-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity",
}

@Book{Hochbaum:1997:AAN,
  editor =       "Dorit S. Hochbaum",
  booktitle =    "Approximation Algorithms for {NP}-Hard Problems",
  title =        "Approximation Algorithms for {NP}-Hard Problems",
  publisher =    pub-PWS,
  address =      pub-PWS:adr,
  pages =        "xxii + 596",
  year =         "1997",
  ISBN =         "0-534-94968-1 (hardcover)",
  ISBN-13 =      "978-0-534-94968-6 (hardcover)",
  LCCN =         "T57.7 .A68 1997",
  bibdate =      "Thu Mar 22 11:38:06 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  subject =      "Programming (Mathematics); Approximation theory;
                 Algorithms",
}

@Book{Lakatos:1976:PRL,
  editor =       "Imre Lakatos",
  booktitle =    "Proofs and Refutations: the Logic of Mathematical
                 Discovery",
  title =        "Proofs and Refutations: the Logic of Mathematical
                 Discovery",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 174",
  year =         "1976",
  ISBN =         "0-521-21078-X, 0-521-29038-4",
  ISBN-13 =      "978-0-521-21078-2, 978-0-521-29038-8",
  LCCN =         "QA8.4 .L34",
  bibdate =      "Fri Mar 23 07:44:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn;
                 z3950.loc.gov:7090/Voyager",
  note =         "Edited by John Worrall and Elie Zahar after Lakatos'
                 death.",
  URL =          "http://www.loc.gov/catdir/description/cam032/75032478.html;
                 http://www.loc.gov/catdir/toc/cam031/75032478.html",
  acknowledgement = ack-nhfb,
  subject =      "mathematics; philosophy; logic, symbolic and
                 mathematical",
  tableofcontents = "Editors' preface \\
                 Acknowledgments \\
                 Author's introduction \\
                 1. A problem and a conjecture \\
                 2. A proof \\
                 3. Criticism of the proof by counterexamples which are
                 local but not global \\
                 4. Criticism of the conjecture by global
                 counterexamples \\
                 5. Criticism of the proof-analysis by counterexamples
                 which are global but not local: the problem of rigour
                 \\
                 6. Return to criticism of the proof by counterexamples
                 which are local but not global: the problem of content
                 \\
                 7. The problem of content revisited \\
                 8. Concept-formation \\
                 9. How criticism may turn mathematical truth into
                 logical truth \\
                 Appendices \\
                 Bibliography \\
                 Index of names \\
                 Index of subjects",
}

@Proceedings{Landweber:1999:DBC,
  editor =       "Laura F. (Laura Faye) Landweber and Eric B. Baum",
  booktitle =    "{DNA Based Computers II: DIMACS Workshop, June 10--12,
                 1996}",
  title =        "{DNA Based Computers II: DIMACS Workshop, June 10--12,
                 1996}",
  volume =       "44",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xi + 275",
  year =         "1999",
  ISBN =         "0-8218-0756-0",
  ISBN-13 =      "978-0-8218-0756-9",
  LCCN =         "QA76.887 .D52 1999",
  bibdate =      "Fri Mar 23 08:04:39 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  remark =       "NSF Science and Technology Center in Discrete
                 Mathematics and Theoretical Computer Science, a
                 consortium of Rutgers University, Princeton University,
                 AT and T Labs, Bell Labs, and Bellcore.",
  subject =      "Molecular computers; Congresses",
  tableofcontents = "A sticker based model for DNA computation by S.
                 Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F.
                 Goodman, P. W. K. Rothemund, and L. M. Adleman \\
                 On applying molecular computation to the data
                 encryption standard by L. M. Adleman, P. W. K.
                 Rothemund, S. Roweis, and E. Winfree \\
                 Massively parallel DNA computation: Expansion of
                 symbolic determinants by T. H. Leete, M. D. Schwartz,
                 R. M. Williams, D. H. Wood, J. S. Salem, and H. Rubin
                 \\
                 Universal DNA computing models based on the splicing
                 operation by G. Paun \\
                 Running dynamic programming algorithms on a DNA
                 computer by E. B. Baum and D. Boneh \\
                 A molecular computation of the road coloring problem by
                 N. Jonoska and S. A. Karl \\
                 DNA based molecular computation: Template-template
                 interactions in PCR by P. D. Kaplan, G. Cecchi, and A.
                 Libchaber \\
                 Use of a horizontal chain reaction for DNA-based
                 addition by F. Guarnieri and C. Bancroft \\
                 Computation with DNA: Matrix multiplication by J. S.
                 Oliver \\
                 A surface-based approach to DNA computation by Q. Liu,
                 Z. Guo, Z. Fei, A. E. Condon, R. M. Com, M. G. Lagally,
                 and L. M. Smith \\
                 Mesoscopic computer engineering: Automating DNA-based
                 molecular computing via traditional practices of
                 parallel computer architecture design by J.-T. Amenyo
                 \\
                 Error-resistant implementation of DNA computations by
                 M. Amos, A. Gibbons, and D. Hodgson \\
                 Making DNA computers error resistant by D. Boneh, C.
                 Dunworth, R. J. Lipton, and J. Sgall \\
                 Active transport in biological computing by S. A.
                 Kurtz, S. R. Mahaney, J. S. Royer, and J. Simon \\
                 RNA based computing: Some examples from RNA catalysis
                 and RNA editing by L. F. Landweber \\
                 Universal computation via self-assembly of DNA: Some
                 theory and experiments by E. Winfree, X. Yang, and N.
                 C. Seeman \\
                 The perils of polynucleotides: The experimental gap
                 between the design and assembly of unusual DNA
                 structures by N. C. Seeman, H. Wang, B. Liu, J. Qi, X.
                 Li, X. Yang, F. Liu, W. Sun, Z. Shen, R. Sha, C. Mao,
                 Y. Wang, S. Zhang, T.-J. Fu, S. Du, J. E. Mueller, Y.
                 Zhang, and J. Chen \\
                 DNA sequences useful for computation by E. B. Baum \\
                 A restricted genetic alphabet for DNA computing by K.
                 U. Mir \\
                 Good encodings for DNA-based solutions to combinatorial
                 problems by R. Deaton, R. C. Murphy, M. Garzon, D. R.
                 Franceschetti, and S. E. Stevens, Jr. \\
                 DNA computations can have global memory by R. J. Lipton
                 \\
                 Exascale computer algebra problems interconnect with
                 molecular reactions and complexity theory by R. M.
                 Williams and D. H. Wood",
}

@Proceedings{Lindenmayer:1976:ALD,
  editor =       "Aristid Lindenmayer and Grzegorz Rozenberg",
  booktitle =    "Automata, Languages, Development",
  title =        "Automata, Languages, Development",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "viii + 529",
  year =         "1976",
  ISBN =         "0-7204-0474-6 (North Holland), 0-444-11118-2 (American
                 Elsevier)",
  ISBN-13 =      "978-0-7204-0474-6 (North Holland), 978-0-444-11118-0
                 (American Elsevier)",
  LCCN =         "QH491 .A95",
  bibdate =      "Thu Mar 22 11:39:24 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  remark =       "Selected contributions from an international
                 conference held at Noordwijkerhout in the Netherlands,
                 Mar. 31 to April 6, 1975.",
  subject =      "L systems; Developmental biology; Data processing;
                 Mathematical models",
}

@Book{Linton:2010:PPP,
  editor =       "Steve Linton and Nik Ru{\v{s}}kuc and Vincent Vatter",
  booktitle =    "Permutation Patterns: [Proceedings of the Fifth
                 International Conference on Permutation Patterns,
                 11--15 June 2007, University of St. Andrews,
                 Scotland]",
  title =        "Permutation Patterns: [Proceedings of the Fifth
                 International Conference on Permutation Patterns,
                 11--15 June 2007, University of St. Andrews,
                 Scotland]",
  volume =       "376",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "352",
  year =         "2010",
  ISBN =         "0-521-72834-7 (paperback), 0-511-90249-2 (e-book)",
  ISBN-13 =      "978-0-521-72834-8 (paperback), 978-0-511-90249-9
                 (e-book)",
  LCCN =         "QA164 .P476 2007",
  bibdate =      "Tue May 7 09:55:38 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.bibsys.no:2100/BIBSYS",
  series =       "London Mathematical Society Lecture Note Series",
  acknowledgement = ack-nhfb,
  subject =      "Probabilities; Combinatorial analysis",
  tableofcontents = "Some general results in combinatorial enumeration
                 \\
                 A survey of simple permutations \\
                 Permuting machines and permutation patterns \\
                 On three different notions of monotone subsequences \\
                 A survey on partially ordered patterns \\
                 Generalized permutation patterns --- a short survey \\
                 An introduction to structural methods in permutation
                 patterns \\
                 Combinatorial properties of permutation tableaux \\
                 Enumeration schemes for words avoiding permutations \\
                 The lexicographic first occurrence of a
                 I-II-III-pattern \\
                 Enumeration of partitions by rises, levels and
                 descentsRestricted patience sorting and barred pattern
                 avoidance \\
                 Permutations with $k$-regular descent patterns \\
                 Packing rates of measures and a conjecture for the
                 packing density of 2413 \\
                 On the permutational power of token passing networks
                 \\
                 Problems and conjectures presented at the problem
                 session",
  xxpages =      "345",
}

@Book{Lipton:2010:PQG,
  author =       "Richard J. Lipton",
  title =        "The {$ {\rm P} = {\rm NP} $} question and G{\"o}del's
                 lost letter",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 239",
  year =         "2010",
  ISBN =         "1-4419-7154-8, 1-4419-7155-6 (e-book)",
  ISBN-13 =      "978-1-4419-7154-8, 978-1-4419-7155-5 (e-book)",
  LCCN =         "QA9.65",
  bibdate =      "Sat Mar 15 09:54:50 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/sigact.bib",
  URL =          "http://catdir.loc.gov/catdir/enhancements/fy1208/2010932770-b.html;
                 http://catdir.loc.gov/catdir/enhancements/fy1208/2010932770-d.html;
                 http://catdir.loc.gov/catdir/enhancements/fy1208/2010932770-t.html;
                 http://www.gbv.de/dms/bowker/toc/9781441971548.pdf;
                 http://www.gbv.de/dms/ilmenau/toc/629401365.PDF",
  abstract =     "The P=NP question is one of the greatest problems of
                 science, which has intrigued computer scientists and
                 mathematicians for decades. Despite the abundant
                 research in theoretical computer science regarding the
                 P=NP question, it has not been solved. This book covers
                 historical developments (including the G{\"o}del's lost
                 letter), the importance of P=NP and the future of P=NP.
                 This guide is also based on a new blog by the author,
                 located at: http://rjlipton.wordpress.com.",
  acknowledgement = ack-nhfb,
  subject =      "Computational complexity; Computer algorithms;
                 G{\"o}del's theorem; Logic, Symbolic and mathematical",
  tableofcontents = "Part I. A prologue. \\
                 A walk in the snow \\
                 Part II. On the P=NP question. \\
                 Algorithms: tiny yet powerful \\
                 Is P=NP posed? \\
                 What would you bet? \\
                 What happens when P=NP is resolved? \\
                 NP too big or P too small? \\
                 How to solve P=NP ? \\
                 Why believe P not equal to NP? \\
                 A nightmare about SAT \\
                 Bait and switch \\
                 Who's afraid of natural proofs? \\
                 An approach to P=NP \\
                 Is SAT easy? \\
                 SAT is not too easy \\
                 Ramsey's Theorem and NP \\
                 Can they do that? \\
                 Rabin flips a coin \\
                 A proof we all missed \\
                 Barrington gets simple \\
                 Exponential algorithms \\
                 An EXPSPACE lower bound \\
                 Randomness has unbounded power \\
                 Counting cycles and logspace \\
                 Ron Graham gives a talk \\
                 An approximate counting method \\
                 Easy and hard sums \\
                 How to avoid O-Abuse \\
                 How good is the worst case model? \\
                 Savitch's Theorem \\
                 Adaptive sampling and timed adversaries \\
                 On the intersection of finite automata \\
                 Where are the movies? \\
                 Part III. On integer factoring. \\
                 Factoring and factorials \\
                 BDD's \\
                 Factoring and Fermat \\
                 Part IV. On mathematics. \\
                 A curious logarithm \\
                 Edit distance \\
                 Protocols \\
                 Erd{\H{o}}s and the Quantum Method \\
                 Amplifiers \\
                 Amplifying on the PCR amplifier \\
                 Mathematical embarrassments \\
                 Mathematical diseases \\
                 Mathematical surprises \\
                 Erratum A. G{\"o}del lost letter",
}

@Book{Nisan:2007:AGT,
  editor =       "Noam Nisan and Tim Roughgarden and Eva Tardos and
                 Vijay V. Vazirani",
  booktitle =    "Algorithmic Game Theory",
  title =        "Algorithmic Game Theory",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xxi + 754",
  year =         "2007",
  ISBN =         "0-521-87282-0 (hardcover)",
  ISBN-13 =      "978-0-521-87282-9 (hardcover)",
  LCCN =         "QA269.A43 2007",
  bibdate =      "Thu Mar 22 12:33:56 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.mit.edu:9909/mit01",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0729/2007014231-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0729/2007014231-d.html;
                 http://www.loc.gov/catdir/toc/ecip0715/2007014231.html",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Algorithms",
  tableofcontents = "Introduction Noam Nisan, Tim Roughgarden, Eva
                 Tardos and Vijay V. Vazirani \\
                 Part I. Computing in Games: \\
                 1. Basic Solution Concepts and Computational Issues /
                 Eva Tardos and Vijay V. Vazirani \\
                 2. The Complexity of Finding Nash Equilibria / Christos
                 H. Papadimitriou \\
                 3. Equilibrium Computation for Two-Player Games in
                 Strategic and Extensive Form / Bernhard von Stengel \\
                 4. Learning, Regret Minimization, and Equilibria /
                 Avrim Blum and Yishay Mansour \\
                 5. Combinatorial Algorithms for Market Equilibria /
                 Vijay V. Vazirani \\
                 6. Computation of Market Equilibria by Convex
                 Programming / Bruno Codenotti and Kasturi Varadarajan
                 \\
                 7. Graphical Games / Michael Kearns \\
                 8. Cryptography and Game Theory / Yevgeniy Dodis and
                 Tal Rabin \\
                 9. Introduction to Mechanism Design (for Computer
                 Scientists) / Noam Nisan \\
                 10. Mechanism Design without Money / James Schummer and
                 Rakesh V. Vohra \\
                 Part II. Algorithmic Mechanism Design \\
                 11. Combinatorial Auctions / Liad Blumrosen and Noam
                 Nisan \\
                 12. Computationally Efficient Approximation Mechanisms
                 / Ron Lavi \\
                 13. Profit Maximization in Mechanism Design / Jason D.
                 Hartline and Anna R. Karlin \\
                 14. Distributed Algorithmic Mechanism Design / Joan
                 Feigenbaun, Michael Schapira and Scott Shenker \\
                 15. Cost Sharing / Kamal Jain and Mohammad Mahdian \\
                 16. Online Mechanisms / David C. Parkes \\
                 Part III. Quantifying the Inefficiency of Equilibria
                 \\
                 17. Introduction to the Inefficiency of Equilibria /
                 Tim Roughgarden and Eva Tardos \\
                 18. Routing Games / Tim Roughgarden \\
                 19. Network Formation Games and the Potential Function
                 Method / Eva Tardos and Tom Wexler \\
                 20. Selfish Load Balancing / Berthold Vocking \\
                 21. The Price of Anarchy and the Design of Scalable
                 Resource Allocation Mechanisms / Ramesh Johari \\
                 Part IV. Additional Topics \\
                 22. Incentives and Pricing in Communications Networks /
                 Asuman Ozdaglar and R. Srikant \\
                 23. Incentives in Peer-to-Peer Systems / Moshe
                 Babaioff, John Chuang and Michal Feldman \\
                 24. Cascading Behavior in Networks: Algorithmic and
                 Economic Issues / Jon Kleinberg --25. Incentives and
                 Information Security / Ross Anderson, Tyler Moore,
                 Shishir Nagaraja and Andy Ozment \\
                 26. Computational Aspects of Prediction Markets / David
                 M. Pennock and Rahul Sami \\
                 27. Manipulation-Resistant Reputation Systems / Eric
                 Friedman, Paul Resnick and Rahul Sami \\
                 28. Sponsored Search Auctions / Sebastien Lahaie, David
                 M. Pennock, Amin Saberi and Rakesh V. Vohra \\
                 29. Computational Evolutionary Game Theory / Siddharth
                 Suri",
}

@Book{Nowakowski:2002:MGN,
  editor =       "Richard J. Nowakowski",
  booktitle =    "More Games of No Chance",
  title =        "More Games of No Chance",
  volume =       "42",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "xii + 535",
  year =         "2002",
  ISBN =         "0-521-80832-4",
  ISBN-13 =      "978-0-521-80832-3",
  LCCN =         "QA269 .M63 2002",
  bibdate =      "Thu Mar 22 12:15:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Mathematical Sciences Research Institute
                 publications",
  URL =          "http://www.loc.gov/catdir/description/cam031/2002034798.html;
                 http://www.loc.gov/catdir/toc/cam031/2002034798.html",
  acknowledgement = ack-nhfb,
  subject =      "Game theory; Congresses; Combinatorial analysis",
}

@Book{Olariu:2006:HBA,
  editor =       "Stephan Olariu and Albert Y. Zomaya",
  booktitle =    "Handbook of Bioinspired Algorithms and Applications",
  title =        "Handbook of Bioinspired Algorithms and Applications",
  publisher =    pub-CHAPMAN-HALL-CRC,
  address =      pub-CHAPMAN-HALL-CRC:adr,
  pages =        "xvii + 679",
  year =         "2006",
  ISBN =         "1-58488-475-4",
  ISBN-13 =      "978-1-58488-475-0",
  LCCN =         "QA76.618 .H36 2006",
  bibdate =      "Thu Mar 22 12:19:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC computer and information science
                 series",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0647/2005051859-d.html",
  acknowledgement = ack-nhfb,
  subject =      "Evolutionary programming (Computer science);
                 Handbooks, manuals, etc; Genetic algorithms;
                 Biomimicry",
}

@Book{Olariu:2009:VNT,
  editor =       "Stephan Olariu and Michele Aylene Clark Weigle",
  booktitle =    "Vehicular networks: from theory to practice",
  title =        "Vehicular networks: from theory to practice",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xi + 473",
  year =         "2009",
  ISBN =         "1-4200-8588-3 (hardcover), 1-4200-8589-1",
  ISBN-13 =      "978-1-4200-8588-4 (hardcover), 978-1-4200-8589-4",
  LCCN =         "TE228.37 .V44 2009",
  bibdate =      "Tue May 7 10:13:34 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC computer and information science
                 series",
  acknowledgement = ack-nhfb,
  subject =      "Vehicular ad hoc networks (Computer networks)",
  tableofcontents = "1: Traffic Monitoring / Michael D. Fontaine \\
                 2: Models for Traffic Flow and Vehicle Motion / Martin
                 Treiber and Arne Kesting \\
                 3: Vehicle-Infrastructure Cooperation / James A.
                 Misenter, Susan Dickey, Joel VanderWerf and Raja
                 Sengupta \\
                 4: CAR-2-X Communication in Europe / Long Le, Andreas
                 Festag, Roberto Baldessari and Wenhui Zhang \\
                 5: Safety-Related Vehicular Applications / Mohammad S.
                 Almalag \\
                 6: Emerging Vehicular Applications / Uichin Lee, Ryan
                 Cheung and Mario Gerla \\
                 7: Use of Infrastructure in VANETs / Michele C. Weigle,
                 Stephan Olariu, Mahmoud Abuelela and Gongjun Yan \\
                 8: Content Delivery in Zero-Infrastructure VANETs /
                 Mahmoud Abuelela and Stephan Olariu9: Mobile Ad Hoc
                 Routing in the Context of Vehicular Networks /
                 Francisco J. Ros, Pedro M. Ruiz, Juan A. Sanchez and
                 Ivan Stojmenovic \\
                 10: Delay-Tolerant Networks in VANETs / Yifeng Shao,
                 Cong Liu and Jie Wu \\
                 11: Localization in Vehicular Ad-Hoc Networks /
                 Azzedine Boukerche, Horacio A. B. F. Oliveira, Eduardo
                 F. Nakamura and Antonio A. F. Loureiro \\
                 12: Vehicular Mobility Models / Marco Fiore \\
                 13: Vehicular Network Simulators / Gongjun Yan, Khaled
                 Ibrahim and Michele C. Weigle \\
                 14: Mental Workload and Driver Distraction with
                 In-Vehicle Displays / Carryl L. Baldwin",
}

@Proceedings{Pardalos:1998:NDC,
  editor =       "P. M. (Panos M.) Pardalos and Dingzhu Du",
  booktitle =    "{Network Design: Connectivity and Facilities Location:
                 DIMACS Workshop, April 28--30, 1997}",
  title =        "{Network Design: Connectivity and Facilities Location:
                 DIMACS Workshop, April 28--30, 1997}",
  volume =       "40",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 461",
  year =         "1998",
  ISBN =         "0-8218-0834-6",
  ISBN-13 =      "978-0-8218-0834-4",
  LCCN =         "T57.85 .N4557 1998",
  bibdate =      "Fri Mar 23 08:12:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  remark =       "Papers from the DIMACS Workshop on Network Design:
                 Connectivity and Facilities Location, held April
                 28--30, 1997, at Princeton University.",
  subject =      "Network analysis (Planning); Congresses; Combinatorial
                 analysis; Combinatorial optimization",
  tableofcontents = "Nearly linear time approximation schemes for
                 Euclidean TSP and other geometric problems by S. Arora
                 \\
                 Differential greedy for the 0--1 equicut problem by R.
                 Battiti and A. Bertossi \\
                 Gradient-constrained minimal Steiner trees by M.
                 Brazil, D. A. Thomas, and J. F. Weng \\
                 The Steiner tree problem for terminals on the boundary
                 of a rectilinear polygon by S.-W. Cheng \\
                 Using Hadwiger numbers in network design by D. Cieslik
                 \\
                 Reducing the graphical Steiner problem with a
                 sensitivity test by C. Duin \\
                 A frequency assignment problem in cellular phone
                 networks by A. Eisenblatter \\
                 An optimal greedy algorithm for wavelength allocation
                 in directed tree networks by T. Erlebach, K. Jansen, C.
                 Kaklamanis, and P. Persiano \\
                 A GRASP algorithm for the single source uncapacitated
                 minimum concave-cost network flow problem by K.
                 Holmqvist, A. Migdalas, and P. M. Pardalos \\
                 Approximation results for the optimum cost chromatic
                 partition problem by K. Jansen \\
                 Approximating dense cases of covering problems by M.
                 Karpinski and A. Zelikovsky \\
                 Connected facility location problems by S. Guha and S.
                 Khuller \\
                 Constrained spanning tree problems: Approximate methods
                 and parallel computation by N. Deo and N. Kumar \\
                 Star, grid, ring topologies in facility location and
                 network design by W.-J. Li and J. M. Smith \\
                 Network improvement problems by S. O. Krumke, M. V.
                 Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi \\
                 Improved results on service-constrained network design
                 problems by M. V. Marathe, R. Ravi, and R. Sundaram \\
                 A greedy randomized adaptive search procedure for the
                 multitarget multisensor tracking problem by R. A.
                 Murphey, P. M. Pardalos, and L. Pitsoulis \\
                 A generalized threshold algorithm for the shortest path
                 problem with time windows by W. B. Powell and Z.-L.
                 Chen \\
                 A case study of derandomization methods for
                 combinatorial approximation algorithms by J. D. P.
                 Rolim and L. Trevisan \\
                 A chunking based genetic algorithm for the Steiner tree
                 problem in graphs by S. Voss and K. Gutenschwager \\
                 A new exact algorithm for rectilinear Steiner trees by
                 D. M. Warme \\
                 A scalable TWDM lightwave network based on generalized
                 de Bruijn digraph by P.-J. Wan and A. Pavan \\
                 A new model of generalized Steiner trees and
                 3-coordinate systems by J. F. Weng \\
                 A model for network design by R. Wessaly Nonlinear and
                 mixed-integer optimization in chemical process network
                 systems by C. S. Adjiman, C. A. Schweiger, and C. A.
                 Floudas \\
                 Shortest networks on spheres by M. Brazil, J. H.
                 Rubinstein, D. A. Thomas, J. F. Weng, and N. C.
                 Wormald",
}

@Book{Plotkin:2000:PLI,
  editor =       "G. (Gordon) Plotkin and Colin P. Stirling and Mads
                 Tofte and R. (Robin) Milner",
  booktitle =    "Proof, Language, and Interaction: Essays in Honour of
                 {Robin Milner}",
  title =        "Proof, Language, and Interaction: Essays in Honour of
                 {Robin Milner}",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "xiv + 722",
  year =         "2000",
  ISBN =         "0-262-16188-5 (hardcover)",
  ISBN-13 =      "978-0-262-16188-6 (hardcover)",
  LCCN =         "QA76.P699 2000",
  bibdate =      "Fri Mar 23 08:25:41 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 library.mit.edu:9909/mit01",
  series =       "Foundations of computing",
  acknowledgement = ack-nhfb,
  subject =      "Computer science; Milner, R; (Robin)",
  subject-dates = "1934--2010",
  tableofcontents = "A Brief Scientific Biography of Robin Milner \\
                 1. Bistructures, Bidomains, and Linear Logic /
                 Pierre-Louis Curien, Gordon Plotkin and Glynn Winskel
                 \\
                 2. Axioms for Definability and Full Completeness /
                 Samson Abramsky \\
                 3. Algebraic Derivation of an Operational Semantics /
                 C. A. R. Hoare, He Jifeng and Augusto Sampaio \\
                 4. From Banach to Milner: Metric Semantics for Second
                 Order Communication and Concurrency / Jaco de Bakker
                 and Franck van Breugel \\
                 5. The Tile Model / Fabio Gadducci and Ugo Montanari
                 \\
                 6. From LCF to HOL: A Short History / Mike Gordon \\
                 7. A Fixedpoint Approach to (Co)Inductive and
                 (Co)Datatype Definitions / Lawrence C. Paulson \\
                 8. Constructively Formalizing Automata Theory / Robert
                 L. Constable, Paul B. Jackson and Pavel Naumov / [et
                 al.] \\
                 9. Constructive Category Theory / Gerard Huet and
                 Amokrane Saibi \\
                 10. Enhancing the Tractability of Rely/Guarantee
                 Specifications in the Development of Interfering
                 Operations / Pierre Collette and Cliff B. Jones \\
                 11. Model Checking Algorithms for the [mu]-Calculus /
                 Sergey Berezin, Edmund Clarke and Somesh Jha / [et al.]
                 \\
                 12. A Type-Theoretic Interpretation of Standard ML /
                 Robert Harper and Christopher Stone \\
                 13. Unification and Polymorphism in Region Inference /
                 Mads Tofte and Lars Birkedal \\
                 14. The Foundations of Esterel / Gerard Berry \\
                 15. Pict: A Programming Language Based on the
                 Pi-Calculus / Benjamin C. Pierce and David N. Turner
                 \\
                 16. On the Star Height of Unary Regular Behaviours /
                 Yoram Hirshfeld and Faron Moller \\
                 17. Combining the Typed $\lambda$-Calculus with CCS /
                 William Ferreira, Mathew Hennessy and Alan S. A.
                 Jeffrey \\
                 18. Discrete Time Process Algebra with Silent Step / J.
                 C. M. Baeten, J. A. Bergstra and M. A. Reniers \\
                 19. A Complete Axiom System for Finite-State
                 Probabilistic Processes / Eugene W. Stark and Scott A.
                 Smolka \\
                 20. A Calculus of Communicating Systems with Label
                 Passing - Ten Years After / Uffe H. Engberg and Mogens
                 Nielsen \\
                 21. Trios in Concert / Joachim Parrow \\
                 22. Concurrent Objects as Mobile Processes / Xinxin Liu
                 and David Walker \\
                 23. $\lambda$-Calculus, Multiplicities, and the
                 $\pi$-Calculus / Gerard Boudol and Cosimo Laneve \\
                 24. Lazy Functions and Mobile Processes / Davide
                 Sangiorgi",
}

@Book{Robert:2010:IS,
  editor =       "Yves Robert and Fr{\'e}d{\'e}ric Vivien",
  booktitle =    "Introduction to Scheduling",
  title =        "Introduction to Scheduling",
  publisher =    pub-CRC,
  address =      pub-CRC:adr,
  pages =        "xx + 313",
  year =         "2010",
  ISBN =         "1-4200-7273-0 (hardcover)",
  ISBN-13 =      "978-1-4200-7273-0 (hardcover)",
  LCCN =         "QA76.9.D5 I673 2010",
  bibdate =      "Tue May 7 10:25:44 MDT 2013",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Chapman and Hall/CRC computational science series",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Distributed processing;
                 Computer scheduling; Mathematical models;
                 Multiprocessors; Computational grids (Computer
                 systems)",
  tableofcontents = "On the complexity of scheduling / Peter Brucker and
                 Sigrid Knust \\
                 Approximation algorithms for scheduling problems /
                 Jean-Claude K{\"o}nig and Rodolphe Giroudeau \\
                 Online scheduling / Susanne Albers \\
                 Job scheduling / Uwe Schwiegelshohn \\
                 Cyclic Scheduling / Claire Hanen \\
                 Cyclic scheduling for the synthesis of embedded systems
                 / Olivier Marchetti and Alix Munier-Kordon \\
                 Steady-state scheduling / Olivier Beaumont and Loris
                 Marchal \\
                 Divisible load scheduling / Matthieu Gallet, Yves
                 Robert, and Fr{\'e}d{\'e}ric Vivien \\
                 Multi-objective scheduling / Pierre-Fran{\c{c}}ois
                 Dutot \ldots{} [et al.] \\
                 Comparisons of stochastic task-resource systems / Bruno
                 Gaujal and Jean-Marc Vincent \\
                 The influence of platform models on scheduling
                 techniques / Lionel Eyraud-Dubois and Arnaud Lagrand",
}

@Proceedings{Rosenstein:1997:DMS,
  editor =       "Joseph G. Rosenstein and Deborah S. Franzblau and Fred
                 S. Roberts",
  booktitle =    "Discrete Mathematics in the Schools",
  title =        "Discrete Mathematics in the Schools",
  volume =       "36",
  publisher =    "American Mathematical Society, National Council of
                 Teachers of Mathematics",
  address =      "Providence, RI, USA",
  pages =        "xxxiii + 452",
  year =         "1997",
  ISBN =         "0-8218-0448-0 (hardcover)",
  ISBN-13 =      "978-0-8218-0448-3 (hardcover)",
  LCCN =         "QA11.A1 D57 1997",
  bibdate =      "Thu Mar 22 12:06:54 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science, 1052-1798",
  acknowledgement = ack-nhfb,
  remark =       "Papers from a conference held at DIMACS at Rutgers
                 University in October 1992. NSF Science and Technology
                 Center in Discrete Mathematics and Theoretical Computer
                 Science. A consortium of Rutgers University, Princeton
                 University, AT\&T Labs, Bell Labs, and Bellcore.",
  subject =      "Mathematics; Study and teaching; Congresses",
}

@Book{Rota:1997:IT,
  editor =       "Gian-Carlo Rota and Fabrizio Palombi",
  booktitle =    "Indiscrete Thoughts",
  title =        "Indiscrete Thoughts",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "xxii + 280",
  year =         "1997",
  ISBN =         "0-8176-3866-0 , 3-7643-3866-0",
  ISBN-13 =      "978-0-8176-3866-5, 978-3-7643-3866-4",
  LCCN =         "QA7 .R65 1997",
  bibdate =      "Thu Mar 22 12:24:49 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  author-dates = "1932--1999",
  subject =      "Mathematics; Science; Philosophy",
}

@Proceedings{Rubin:1999:DBC,
  editor =       "Harvey Rubin and David Harlan Wood",
  booktitle =    "{DNA Based Computers III: DIMACS Workshop, June
                 23--25, 1997}",
  title =        "{DNA Based Computers III: DIMACS Workshop, June
                 23--25, 1997}",
  volume =       "48",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 375",
  year =         "1999",
  ISBN =         "0-8218-0842-7",
  ISBN-13 =      "978-0-8218-0842-9",
  LCCN =         "QA76.887 .D523 1999",
  bibdate =      "Fri Mar 23 08:04:00 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 jenson.stanford.edu:2210/unicorn",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  remark =       "NSF Science and Technology Center in Discrete
                 Mathematics and Theoretical Computer Science, a
                 consortium of Rutgers University, Princeton University,
                 AT\&T Labs, Bell Labs, Bellcore and NEC Research
                 Institute. This DIMACS volume contains papers from the
                 Third DIMACS Workshop on DNA Based Computers \ldots{}
                 University of Pennsylvania.",
  subject =      "Molecular computers; Congresses",
  tableofcontents = "Physical chemistry of nucleic acid hybridization by
                 J. G. Wetmur \\
                 Thermodynamic simulation of deoxyoligonucleotide
                 hybridization for DNA computation by A. J. Hartemink
                 and D. K. Gifford \\
                 The efficiency of sequence-specific separation of DNA
                 mixtures for biological computing by J. Khodor and D.
                 K. Gifford \\
                 A new DNA separation technique with a low error rate by
                 J. Chen and D. H. Wood \\
                 Towards parallel evaluation and learning of Boolean
                 $\mu$-formulas with molecules by M. Hagiya, M. Arita,
                 D. Kiga, K. Sakamoto, and S. Yokoyama \\
                 Wet splicing systems by E. Laun and K. J. Reddy
                 Parallel operations in DNA-based computation by F.
                 Guarnieri, M. Orlian, and C. Bancroft \\
                 Protein folding, spin glass and computational
                 complexity by A. S. Fraenkel \\
                 Creating 3-dimensional graph structures with DNA by N.
                 Jonoska, S. A. Karl, and M. Saito \\
                 DNA implementation of nondeterminism by Y. Gao, M.
                 Garzon, R. C. Murphy, J. A. Rose, R. Deaton, D. R.
                 Franceschetti, and S. E. Stevens, Jr. \\
                 Arithmetic and logic operations with DNA by V. Gupta,
                 S. Parthasarathy, and M. J. Zaki DNA$^2$DNA
                 computations: A potential ``killer app?'' by L. F.
                 Landweber, R. J. Lipton, and M. O. Rabin \\
                 Strategies for DNA computing by A. D. Ellington, M. P.
                 Robertson, K. D. James, and J. C. Cox \\
                 A surface-based DNA algorithm for minimal set cover by
                 T. L. Eng and B. M. Serridge \\
                 Solid phase DNA solution to the Hamiltonian path
                 problem by N. Morimoto, M. Arita, and A. Suyama \\
                 On molecular approximation algorithms for NP
                 optimization problem by B. Fu and R. Beigel \\
                 Local parallel biomolecular computation by J. H. Reif
                 \\
                 DNA-based parallel computation by ``counting'' by M.
                 Ogihara and A. Ray \\
                 Parallel computation on a DNA substrate by A. J.
                 Blumberg \\
                 Design for a DNA conformational processor by M. Conrad
                 and K.-P. Zauner \\
                 Linear DNA self-assembly with hairpins generates linear
                 context-free grammars by T. L. Eng \\
                 Watson-Crick finite automata by R. Freund, Gh. Paun, G.
                 Rozenberg, and A. Salomaa \\
                 At the crossroads of DNA computing and formal
                 languages: Characterizing recursively enumerable
                 languages using insertion-deletion systems by L. Kari,
                 G. Paun, G. Thierrin, and S. Yu \\
                 DNA-EC: A model of DNA-computing based on equality
                 checking by T. Yokomori and S. Kobayashi \\
                 Splicing on tree-like structures by Y. Sakakibara and
                 C. Ferretti",
}

@Proceedings{Winfree:2000:DBC,
  editor =       "Erik Winfree and David K. Gifford",
  booktitle =    "{DNA Based Computers V: DIMACS Workshop DNA Based
                 Computers V, June 14--15, 1999, Massachusetts Institute
                 of Technology}",
  title =        "{DNA Based Computers V: DIMACS Workshop DNA Based
                 Computers V, June 14--15, 1999, Massachusetts Institute
                 of Technology}",
  volume =       "54",
  publisher =    pub-AMS,
  address =      pub-AMS:adr,
  pages =        "xiii + 249",
  year =         "2000",
  ISBN =         "0-8218-2053-2",
  ISBN-13 =      "978-0-8218-2053-7",
  LCCN =         "QA76.887. D5 1999",
  bibdate =      "Thu Mar 22 12:08:19 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "DIMACS series in discrete mathematics and theoretical
                 computer science",
  acknowledgement = ack-nhfb,
  meetingname =  "DIMACS Workshop on DNA Based Computers (5th: 1999 :
                 Massachusetts Institute of Technology)",
  subject =      "Molecular computers; Congresses",
}

@Book{Zampolli:1977:LSP,
  editor =       "Antonio Zampolli",
  booktitle =    "Linguistic structures processing",
  title =        "Linguistic structures processing",
  volume =       "5",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "xii + 585",
  year =         "1977",
  ISBN =         "0-444-85017-1",
  ISBN-13 =      "978-0-444-85017-1",
  LCCN =         "P98 .I575 1974",
  bibdate =      "Fri Mar 23 07:41:26 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Fundamental studies in computer science",
  acknowledgement = ack-nhfb,
  meetingname =  "International Summer School on Computational and
                 Mathematical Linguistics, 3d, Pisa, 1974.",
  subject =      "computational linguistics; grammar, comparative and
                 general; discourse analysis; psycholinguistics;
                 artificial intelligence",
}

@Book{Zomaya:2006:HNI,
  editor =       "Albert Y. Zomaya",
  booktitle =    "Handbook of Nature-Inspired and Innovative Computing:
                 Integrating Classical Models with Emerging
                 Technologies",
  title =        "Handbook of Nature-Inspired and Innovative Computing:
                 Integrating Classical Models with Emerging
                 Technologies",
  publisher =    "Springer Science+Business Media",
  address =      "New York, NY, USA",
  pages =        "xiv + 736",
  year =         "2006",
  ISBN =         "0-387-40532-1",
  ISBN-13 =      "978-0-387-40532-2",
  LCCN =         "MLCM 2006/40164 (Q); QA76.618 .H363x 2006",
  bibdate =      "Thu Mar 22 12:21:30 MDT 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigact.bib;
                 z3950.loc.gov:7090/Voyager",
  URL =          "http://www.loc.gov/catdir/enhancements/fy0663/2005933256-d.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2005933256-b.html;
                 http://www.loc.gov/catdir/enhancements/fy0818/2005933256-t.html",
  acknowledgement = ack-nhfb,
  subject =      "Evolutionary programming (Computer science);
                 Handbooks, manuals, etc; Computer algorithms; Machine
                 theory",
}