@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 "
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@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"}
@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"}
@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 = "https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "https://dl.acm.org/loi/sigact",
}
@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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/cbofn.bib;
http://portal.acm.org/;
https://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 = "https://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",
}
@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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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",
}
@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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/pearce.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/graph.coloring.bib;
https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/alspaugh.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/gragra.bib;
https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/allison.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Intro.Algorithms.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/arith.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/complexity.information.bib;
https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Multi.bib;
https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/LogicProgramming/prolog.1.bib;
https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/COMPASS.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/obscure.bib;
https://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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
https://www.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 = "https://www.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 = "https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "https://dl.acm.org/loi/sigact",
}
@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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Intro.Algorithms.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Neural/automata-NN.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Neural/neural.6.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/auto.diff.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/RISC.parlab.bib;
https://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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/tq.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/parallel.symbolic.comp.bib;
https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/eureca.bib;
https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/finite.model.theory.bib;
https://www.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 = "https://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1989.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1990.bib;
https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/RISC.parlab.bib;
https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/dynamic.graph.alg.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/deduction.bib;
https://www.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 = "https://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Ai/deduction.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/Par.Arch.Indep.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/CLiCS.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/linbib.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/linear.logic.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/scedrov.bib;
https://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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/reengineering.bib;
https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/ProbAlgs.bib;
https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/crypto.security.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/interactive.proofs.bib;
https://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 = "https://www.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 = "https://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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/SEL-HPC.bib;
https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/RC.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/crypto.security.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/interactive.proofs.bib;
https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/abstract.state.machines.bib;
https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
https://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 = "https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
https://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 = "https://www.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 = "https://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 = "https://www.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/;
https://www.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/TOPPS.bib;
https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/Contrib.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/logic.program.construction.bib;
https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/fernau.bib;
https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://www.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 = "https://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 = "https://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 = "https://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
