@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY, USA"}
@InProceedings{Meyer:1980:DDL,
author = "Albert R. Meyer and Rohit Parikh",
title = "Definability in Dynamic Logic",
crossref = "ACM:1980:CPT",
pages = "1--7",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1980:LPP,
author = "John H. Reif",
title = "Logics for probabilistic programming (Extended
Abstract)",
crossref = "ACM:1980:CPT",
pages = "8--13",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Mirkowska:1980:CAA,
author = "Grazyna Mirkowska",
title = "Complete axiomatization of algorithmic properties of
program schemes with bounded nondeterministic
interpretations",
crossref = "ACM:1980:CPT",
pages = "14--21",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pratt:1980:DAN,
author = "V. R. Pratt",
title = "Dynamic algebras and the nature of induction",
crossref = "ACM:1980:CPT",
pages = "22--28",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ukkonen:1980:DME,
author = "Esko Ukkonen",
title = "A decision method for the equivalence of some
non-real-time deterministic pushdown automata",
crossref = "ACM:1980:CPT",
pages = "29--38",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Plaisted:1980:DIF,
author = "David A. Plaisted",
title = "On the distribution of independent formulae of number
theory",
crossref = "ACM:1980:CPT",
pages = "39--44",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{DeMillo:1980:CPE,
author = "Richard A. DeMillo and Richard J. Lipton",
title = "The consistency of {``P $=$ NP''}, and related
problems with fragments of number theory",
crossref = "ACM:1980:CPT",
pages = "45--57",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Joseph:1980:IRC,
author = "Deborah Joseph and Paul Young",
title = "Independence results in {Computer Science}?
(Preliminary Version)",
crossref = "ACM:1980:CPT",
pages = "58--69",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lynch:1980:FAN,
author = "Nancy A. Lynch",
title = "Fast allocation of nearby resources in a distributed
system",
crossref = "ACM:1980:CPT",
pages = "70--81",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Angluin:1980:LGP,
author = "Dana Angluin",
title = "Local and global properties in networks of processors
(Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "82--93",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Toueg:1980:DLF,
author = "Sam Toueg",
title = "Deadlock- and livelock-free packet switching
networks",
crossref = "ACM:1980:CPT",
pages = "94--99",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Brown:1980:KSA,
author = "Donna J. Brown",
title = "{Kraft} storage and access for list
implementations(Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "100--107",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Strong:1980:VEF,
author = "H. R. Strong",
title = "Vector execution of flow graphs(Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "108--116",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sadri:1980:CAL,
author = "Fereidoon Sadri and Jeffrey D. Ullman",
title = "A complete axiomatization for a large class of
dependencies in relational databases",
crossref = "ACM:1980:CPT",
pages = "117--122",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Fagin:1980:HCD,
author = "Ronald Fagin",
title = "{Horn} clauses and database dependencies (Extended
Abstract)",
crossref = "ACM:1980:CPT",
pages = "123--134",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Overmars:1980:DMC,
author = "Mark H. Overmars and Jan van Leeuwen",
title = "Dynamically maintaining configurations in the plane
(Detailed Abstract)",
crossref = "ACM:1980:CPT",
pages = "135--145",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chazelle:1980:DET,
author = "Bernard Chazelle and David P. Dobkin",
title = "Detection is easier than computation (Extended
Abstract)",
crossref = "ACM:1980:CPT",
pages = "146--153",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Guibas:1980:TSR,
author = "Leo J. Guibas and F. Frances Yao",
title = "On translating a set of rectangles",
crossref = "ACM:1980:CPT",
pages = "154--160",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Tompa:1980:OSW,
author = "Martin Tompa",
title = "An optimal solution to a wire-routing problem
(preliminary version)",
crossref = "ACM:1980:CPT",
pages = "161--176",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Fischer:1980:OTL,
author = "Michael J. Fischer and Michael S. Paterson",
title = "Optimal tree layout (Preliminary Version)",
crossref = "ACM:1980:CPT",
pages = "177--189",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Brent:1980:CCB,
author = "R. P. Brent and H. T. Kung",
title = "The chip complexity of binary arithmetic",
crossref = "ACM:1980:CPT",
pages = "190--200",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Storer:1980:NCM,
author = "James A. Storer",
title = "The node cost measure for embedding graphs on the
planar grid (Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "201--210",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Cypher:1980:AKP,
author = "Allen Cypher",
title = "An approach to the k paths problem",
crossref = "ACM:1980:CPT",
pages = "211--217",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lichtenstein:1980:IGE,
author = "David Lichtenstein",
title = "Isomorphism for graphs embeddable on the projective
plane",
crossref = "ACM:1980:CPT",
pages = "218--224",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Miller:1980:ITG,
author = "Gary Miller",
title = "Isomorphism testing for graphs of bounded genus",
crossref = "ACM:1980:CPT",
pages = "225--235",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Filotti:1980:PTA,
author = "I. S. Filotti and Jack N. Mayer",
title = "A polynomial-time algorithm for determining the
isomorphism of graphs of fixed genus",
crossref = "ACM:1980:CPT",
pages = "236--243",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hoffmann:1980:TIC,
author = "Christoph M. Hoffmann",
title = "Testing isomorphism of cone graphs(Extended
Abstract)",
crossref = "ACM:1980:CPT",
pages = "244--251",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kannan:1980:OPD,
author = "Ravindran Kannan and Richard J. Lipton",
title = "The orbit problem is decidable",
crossref = "ACM:1980:CPT",
pages = "252--261",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Heintz:1980:TPW,
author = "J. Heintz and C. P. Schnorr",
title = "Testing polynomials which are easy to compute
(Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "262--272",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ibarra:1980:CEP,
author = "Oscar H. Ibarra and Brian S. Leininger",
title = "The complexity of the equivalence problem for
straight-line programs",
crossref = "ACM:1980:CPT",
pages = "273--280",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ehrig:1980:CIL,
author = "Hartmut Ehrig and Bernd Mahr",
title = "Complexity of implementations on the level of
algebraic specifications",
crossref = "ACM:1980:CPT",
pages = "281--293",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Borodin:1980:TST,
author = "A. Borodin and S. Cook",
title = "A time-space tradeoff for sorting on a general
sequential model of computation",
crossref = "ACM:1980:CPT",
pages = "294--301",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1980:SCB,
author = "Richard M. Karp and Richard J. Lipton",
title = "Some connections between nonuniform and uniform
complexity classes",
crossref = "ACM:1980:CPT",
pages = "302--309",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Jia-wei:1980:SDS,
author = "Hong Jia-wei",
title = "On some deterministic space complexity problems",
crossref = "ACM:1980:CPT",
pages = "310--317",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yap:1980:STT,
author = "C. K. Yap",
title = "Space-time tradeoffs and first order problems in a
model of programs",
crossref = "ACM:1980:CPT",
pages = "318--325",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Carlson:1980:GPM,
author = "David A. Carlson and John E. Savage",
title = "Graph pebbling with many free pebbles can be
difficult",
crossref = "ACM:1980:CPT",
pages = "326--332",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Tompa:1980:TFT,
author = "Martin Tompa",
title = "Two familiar transitive closure algorithms which admit
no polynomial time, sublinear space implementations",
crossref = "ACM:1980:CPT",
pages = "333--338",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{JaJa:1980:TST,
author = "Joseph Ja'Ja'",
title = "Time-space tradeoffs for some algebraic problems",
crossref = "ACM:1980:CPT",
pages = "339--350",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pippenger:1980:CSP,
author = "Nicholas Pippenger",
title = "Comparative schematology and pebbling with auxiliary
pushdowns (Preliminary Version)",
crossref = "ACM:1980:CPT",
pages = "351--356",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Paul:1980:ITA,
author = "Wolfgang J. Paul and Joel I. Seiferas and Janos
Simon",
title = "An information-theoretic approach to time bounds for
on-line computation (preliminary version)",
crossref = "ACM:1980:CPT",
pages = "357--367",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1980:LET,
author = "Richard M. Karp and Robert Endre Tarjan",
title = "Linear expected-time algorithms for connectivity
problems (Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "368--377",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bloniarz:1980:SPA,
author = "Peter Bloniarz",
title = "A shortest-path algorithm with expected time {$O(n^2
\log n \log^* n)$}",
crossref = "ACM:1980:CPT",
pages = "378--384",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1980:RM,
author = "John H. Reif and Paul G. Spirakis",
title = "Random matroids",
crossref = "ACM:1980:CPT",
pages = "385--397",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Supowit:1980:HWP,
author = "Kenneth J. Supowit and David A. Plaisted and Edward M.
Reingold",
title = "Heuristics for weighted perfect matching",
crossref = "ACM:1980:CPT",
pages = "398--419",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Frederickson:1980:GSR,
author = "Greg N. Frederickson and Donald B. Johnson",
title = "Generalized selection and ranking (Preliminary
Version)",
crossref = "ACM:1980:CPT",
pages = "420--428",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1980:EDP,
author = "F. Frances Yao",
title = "Efficient dynamic programming using quadrangle
inequalities",
crossref = "ACM:1980:CPT",
pages = "429--435",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lloyd:1980:CPS,
author = "Errol L. Lloyd",
title = "Critical path scheduling of task systems with resource
and processor constraints (Extended Abstract)",
crossref = "ACM:1980:CPT",
pages = "436--446",
year = "1980",
bibdate = "Wed Feb 20 18:33:44 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1981:SEP,
author = "Karel Culik and Tero Harju",
title = "The $\omega$-sequence equivalence problem for {DOL}
systems is decidable",
crossref = "ACM:1981:CPT",
pages = "1--6",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chew:1981:UNF,
author = "Paul Chew",
title = "Unique normal forms in term rewriting systems with
repeated variables",
crossref = "ACM:1981:CPT",
pages = "7--18",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hawrusik:1981:CFC,
author = "F. Hawrusik and K. N. Venkataraman and A. Yasuhara",
title = "Classes of functions for computing on binary trees
(Extended Abstract)",
crossref = "ACM:1981:CPT",
pages = "19--27",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Krishnamurthy:1981:EHT,
author = "Balakrishnan Krishnamurthy and Robert N. Moll",
title = "Examples of hard tautologies in the propositional
calculus",
crossref = "ACM:1981:CPT",
pages = "28--37",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Leivant:1981:CPP,
author = "Daniel Leivant",
title = "The complexity of parameter passing in polymorphic
procedures",
crossref = "ACM:1981:CPT",
pages = "38--45",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Muller:1981:PAG,
author = "David E. Muller and Paul E. Schupp",
title = "Pushdown automata, graphs, ends, second-order logic,
and reachability problems",
crossref = "ACM:1981:CPT",
pages = "46--54",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Joseph:1981:FPI,
author = "Deborah Joseph and Paul Young",
title = "Fast programs for initial segments and polynomial time
computation in weak models of arithmetic (Preliminary
Abstract)",
crossref = "ACM:1981:CPT",
pages = "55--61",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1981:LSS,
author = "S. Rao Kosaraju",
title = "Localized search in sorted lists",
crossref = "ACM:1981:CPT",
pages = "62--69",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chazelle:1981:CDP,
author = "Bernard M. Chazelle",
title = "Convex decompositions of polyhedra",
crossref = "ACM:1981:CPT",
pages = "70--79",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:1981:DSC,
author = "Chul E. Kim and Azriel Rosenfeld",
title = "Digital straightness and convexity (Extended
Abstract)",
crossref = "ACM:1981:CPT",
pages = "80--89",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gonnet:1981:LPS,
author = "Gaston H. Gonnet and J. Ian Munro",
title = "A linear probing sort and its analysis (Preliminary
Draft)",
crossref = "ACM:1981:CPT",
pages = "90--95",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Fich:1981:LBC,
author = "Faith E. Fich",
title = "Lower bounds for the cycle detection problem",
crossref = "ACM:1981:CPT",
pages = "96--105",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Galil:1981:TSO,
author = "Zvi Galil and Joel Seiferas",
title = "Time-space-optimal string matching (Preliminary
Report)",
crossref = "ACM:1981:CPT",
pages = "106--113",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sleator:1981:DSD,
author = "Daniel D. Sleator and Robert Endre Tarjan",
title = "A data structure for dynamic trees",
crossref = "ACM:1981:CPT",
pages = "114--122",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1981:PCK,
author = "Andrew Chi-Chih Yao",
title = "On the parallel computation for the knapsack problem",
crossref = "ACM:1981:CPT",
pages = "123--127",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Arjomandi:1981:DEB,
author = "Eshrat Arjomandi and Michael J. Fischer and Nancy A.
Lynch",
title = "A difference in efficiency between synchronous and
asynchronous systems",
crossref = "ACM:1981:CPT",
pages = "128--132",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1981:DAS,
author = "John Reif and Paul Spirakis",
title = "Distributed algorithms for synchronizing interprocess
communication within real time",
crossref = "ACM:1981:CPT",
pages = "133--145",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chan:1981:RCC,
author = "Tat-hung Chan",
title = "Reversal complexity of counter machines",
crossref = "ACM:1981:CPT",
pages = "146--157",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Simon:1981:SBP,
author = "Janos Simon",
title = "Space-bounded probabilistic {Turing} machine
complexity classes are closed under complement
(Preliminary Version)",
crossref = "ACM:1981:CPT",
pages = "158--167",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bertoni:1981:CCF,
author = "Alberto Bertoni and Giancarlo Mauri and Nicoletta
Sabadini",
title = "A characterization of the class of functions
computable in polynomial time on {Random Access
Machines}",
crossref = "ACM:1981:CPT",
pages = "168--176",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Duris:1981:FTW,
author = "Pavol D{\=u}ri{\=s} and Zvi Galil",
title = "Fooling a two-way automaton or one pushdown store is
better than one counter for two way machines
(Preliminary Version)",
crossref = "ACM:1981:CPT",
pages = "177--188",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{King:1981:MPA,
author = "K. N. King",
title = "Measures of parallelism in alternating computation
trees (Extended Abstract)",
crossref = "ACM:1981:CPT",
pages = "189--201",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ukkonen:1981:LKT,
author = "Esko Ukkonen and Eljas Soisalon-Soininen",
title = "{LALR(k)} testing is {PSPACE}-complete",
crossref = "ACM:1981:CPT",
pages = "202--206",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Monien:1981:BCN,
author = "Burkhard Monien and Ivan Hal Sudborough",
title = "Bandwidth constrained {NP}-Complete problems",
crossref = "ACM:1981:CPT",
pages = "207--217",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Orlin:1981:CDL,
author = "James B. Orlin",
title = "The complexity of dynamic languages and dynamic
optimization problems",
crossref = "ACM:1981:CPT",
pages = "218--227",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Adachi:1981:LLC,
author = "Akeo Adachi and Shigeki Iwata and Takumi Kasai",
title = "Low level complexity for combinatorial games",
crossref = "ACM:1981:CPT",
pages = "228--237",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Mayr:1981:AGP,
author = "Ernst W. Mayr",
title = "An algorithm for the general {Petri} net reachability
problem",
crossref = "ACM:1981:CPT",
pages = "238--246",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Galil:1981:EGP,
author = "Zvi Galil and Wolfgang J. Paul",
title = "An efficient general purpose parallel computer",
crossref = "ACM:1981:CPT",
pages = "247--262",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Valiant:1981:USP,
author = "L. G. Valiant and G. J. Brebner",
title = "Universal schemes for parallel communication",
crossref = "ACM:1981:CPT",
pages = "263--277",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kleitman:1981:NLS,
author = "Daniel Kleitman and Frank Thomson Leighton and
Margaret Lepley and Gary L. Miller",
title = "New layouts for the shuffle-exchange graph(Extended
Abstract)",
crossref = "ACM:1981:CPT",
pages = "278--292",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Paterson:1981:BME,
author = "M. S. Paterson and W. L. Ruzzo and L. Snyder",
title = "Bounds on minimax edge length for complete binary
trees",
crossref = "ACM:1981:CPT",
pages = "293--299",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lipton:1981:LBV,
author = "Richard J. Lipton and Robert Sedgewick",
title = "Lower bounds for {VLSI}",
crossref = "ACM:1981:CPT",
pages = "300--307",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1981:ELV,
author = "Andrew C. Yao",
title = "The entropic limitations on {VLSI}
computations(Extended Abstract)",
crossref = "ACM:1981:CPT",
pages = "308--311",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1981:OWB,
author = "Danny Dolev and Kevin Karplus and Alan Siegel and Alex
Strong and Jeffrey D. Ullman",
title = "Optimal wiring between rectangles",
crossref = "ACM:1981:CPT",
pages = "312--317",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chazelle:1981:MCV,
author = "Bernard Chazelle and Louis Monier",
title = "A model of computation for {VLSI} with related
complexity results",
crossref = "ACM:1981:CPT",
pages = "318--325",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Jia-Wei:1981:CRB,
author = "Hong Jia-Wei and H. T. Kung",
title = "{I/O} complexity: {The} red-blue pebble game",
crossref = "ACM:1981:CPT",
pages = "326--333",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Jia-Wei:1981:GAB,
author = "Hong Jia-Wei and Arnold L. Rosenberg",
title = "Graphs that are almost binary trees (Preliminary
Version)",
crossref = "ACM:1981:CPT",
pages = "334--341",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandra:1981:EID,
author = "Ashok K. Chandra and Harry R. Lewis and Johann A.
Makowsky",
title = "Embedded implicational dependencies and their
inference problem",
crossref = "ACM:1981:CPT",
pages = "342--354",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Beeri:1981:PAD,
author = "Catriel Beeri and Ronald Fagin and David Maier and
Alberto Mendelzon and Jeffrey Ullman and Mihalis
Yannakakis",
title = "Properties of acyclic database schemes",
crossref = "ACM:1981:CPT",
pages = "355--362",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yannakakis:1981:ICD,
author = "Mihalis Yannakakis",
title = "Issues of correctness in database concurrency control
by locking",
crossref = "ACM:1981:CPT",
pages = "363--367",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Parisi-Presicce:1981:FRE,
author = "Francesco Parisi-Presicce",
title = "On the faithful regular extensions of iterative
algebras",
crossref = "ACM:1981:CPT",
pages = "368--374",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Streett:1981:PDL,
author = "Robert S. Streett",
title = "Propositional {Dynamic Logic} of looping and
converse",
crossref = "ACM:1981:CPT",
pages = "375--383",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandra:1981:EBR,
author = "Ashok Chandra and Joe Halpern and Albert Meyer and
Rohit Parikh",
title = "Equations between regular terms and an application to
process logic",
crossref = "ACM:1981:CPT",
pages = "384--390",
year = "1981",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Duris:1982:TTB,
author = "Pavol D{\=u}ri{\=s} and Zvi Galil",
title = "Two tapes are better than one for nondeterministic
machines",
crossref = "ACM:1982:PFA",
pages = "1--7",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Furer:1982:TDT,
author = "Martin F{\"u}rer",
title = "The tight deterministic time hierarchy",
crossref = "ACM:1982:PFA",
pages = "8--16",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pippenger:1982:PSP,
author = "Nicholas Pippenger",
title = "Probabilistic simulations (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "17--26",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Vitanyi:1982:RTS,
author = "Paul M. B. Vit{\'a}nyi",
title = "Real-time simulation of multicounters by oblivious
one-tape {Turing} machines (Preliminary Draft)",
crossref = "ACM:1982:PFA",
pages = "27--36",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Inoue:1982:TDA,
author = "Katsushi Inoue and Itsuo Takanami and Hiroshi
Taniguchi",
title = "Two-dimensional alternating {Turing} machines",
crossref = "ACM:1982:PFA",
pages = "37--46",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Nivat:1982:ERM,
author = "Maurice Nivat and Dominique Perrin",
title = "Ensembles reconnaissables de mots biinfinis",
crossref = "ACM:1982:PFA",
pages = "47--59",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gurevich:1982:TAG,
author = "Yuri Gurevich and Leo Harrington",
title = "Trees, automata, and games",
crossref = "ACM:1982:PFA",
pages = "60--65",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Carter:1982:TST,
author = "J. Lawrence Carter",
title = "The theory of signature testing for {VLSI}",
crossref = "ACM:1982:PFA",
pages = "66--76",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bhatt:1982:HAT,
author = "Sandeep N. Bhatt and Charles E. Leiserson",
title = "How to assemble tree machines (Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "77--84",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Leighton:1982:LSV,
author = "Frank Thomson Leighton",
title = "A layout strategy for {VLSI} which is provably good
(Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "85--98",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kissin:1982:MEC,
author = "Gloria Kissin",
title = "Measuring energy consumption in {VLSI} circuits: {A}
foundation",
crossref = "ACM:1982:PFA",
pages = "99--104",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Rivest:1982:HRS,
author = "Ronald L. Rivest and Adi Shamir",
title = "How to reuse a ``write-once'' memory (Preliminary
Version)",
crossref = "ACM:1982:PFA",
pages = "105--113",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Willard:1982:MDS,
author = "Dan E. Willard",
title = "Maintaining dense sequential files in a dynamic
environment (Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "114--121",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dietz:1982:MOL,
author = "Paul F. Dietz",
title = "Maintaining order in a linked list",
crossref = "ACM:1982:PFA",
pages = "122--127",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1982:STT,
author = "Andrew C. Yao",
title = "Space-time tradeoff for answering range queries
(Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "128--136",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Vardi:1982:CRQ,
author = "Moshe Y. Vardi",
title = "The complexity of relational query languages (Extended
Abstract)",
crossref = "ACM:1982:PFA",
pages = "137--146",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Immerman:1982:RQC,
author = "Neil Immerman",
title = "Relational queries computable in polynomial time
(Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "147--152",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{deBakker:1982:DSC,
author = "J. W. de Bakker and J. I. Zucker",
title = "Denotational semantics of concurrency",
crossref = "ACM:1982:PFA",
pages = "153--158",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sistla:1982:CPL,
author = "A. P. Sistla and E. M. Clarke",
title = "The complexity of propositional linear temporal
logics",
crossref = "ACM:1982:PFA",
pages = "159--168",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Emerson:1982:DPE,
author = "E. Allen Emerson and Joseph Y. Halpern",
title = "Decision procedures and expressiveness in the temporal
logic of branching time",
crossref = "ACM:1982:PFA",
pages = "169--180",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Feldman:1982:PDL,
author = "Yishai A. Feldman and David Harel",
title = "A probabilistic dynamic logic",
crossref = "ACM:1982:PFA",
pages = "181--195",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Papadimitriou:1982:CC,
author = "Christos H. Papadimitriou and Michael Sipser",
title = "Communication complexity",
crossref = "ACM:1982:PFA",
pages = "196--200",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1982:SC,
author = "John H. Reif",
title = "Symmetric complementation",
crossref = "ACM:1982:PFA",
pages = "201--214",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ruzzo:1982:SBH,
author = "Walter L. Ruzzo and Janos Simon and Martin Tompa",
title = "Space-bounded hierarchies and probabilistic
computations",
crossref = "ACM:1982:PFA",
pages = "215--223",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kurtz:1982:ROH,
author = "Stuart A. Kurtz",
title = "On the random oracle hypothesis",
crossref = "ACM:1982:PFA",
pages = "224--230",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Cook:1982:BTP,
author = "Stephen Cook and Cynthia Dwork",
title = "Bounds on the time for parallel {RAM}'s to compute
simple functions",
crossref = "ACM:1982:PFA",
pages = "231--233",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Manber:1982:PNA,
author = "Udi Manber and Martin Tompa",
title = "Probabilistic, nondeterministic, and alternating
decision trees (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "234--244",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Asano:1982:EDE,
author = "Takao Asano and Tomio Hirata",
title = "Edge-deletion and edge-contraction problems",
crossref = "ACM:1982:PFA",
pages = "245--254",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Papadimitriou:1982:CFS,
author = "C. H. Papadimitriou and M. Yannakakis",
title = "The complexity of facets (and some facets of
complexity)",
crossref = "ACM:1982:PFA",
pages = "255--260",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaltofen:1982:PRM,
author = "Erich Kaltofen",
title = "A polynomial reduction from multivariate to bivariate
integral polynomial factorization",
crossref = "ACM:1982:PFA",
pages = "261--266",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1982:DRV,
author = "S. Rao Kosaraju",
title = "Decidability of reachability in vector addition
systems (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "267--281",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Boyce:1982:FEP,
author = "James E. Boyce and David P. Dobkin and Robert L.
(Scot) Drysdale and Leo J. Guibas",
title = "Finding extremal polygons",
crossref = "ACM:1982:PFA",
pages = "282--289",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bach:1982:FAU,
author = "Eric Bach",
title = "Fast algorithms under the {Extended Riemann
Hypothesis}: {A} concrete estimate",
crossref = "ACM:1982:PFA",
pages = "290--295",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hong:1982:NMN,
author = "Zhu Hong and Robert Sedgewick",
title = "Notes on merging networks (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "296--302",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bar-Yehuda:1982:AVC,
author = "R. Bar-Yehuda and S. Even",
title = "On approximating a vertex cover for planar graphs",
crossref = "ACM:1982:PFA",
pages = "303--309",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Babai:1982:IGB,
author = "L{\'a}szl{\'o} Babai and D. Yu. Grigoryev and David M.
Mount",
title = "Isomorphism of graphs with bounded eigenvalue
multiplicity",
crossref = "ACM:1982:PFA",
pages = "310--324",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wigderson:1982:NAG,
author = "Avi Wigderson",
title = "A new approximate graph coloring algorithm",
crossref = "ACM:1982:PFA",
pages = "325--329",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Mehlhorn:1982:VBT,
author = "Kurt Mehlhorn and Erik M. Schmidt",
title = "{Las Vegas} is better than determinism in {VLSI} and
distributed computing (Extended Abstract)",
crossref = "ACM:1982:PFA",
pages = "330--337",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Borodin:1982:RMS,
author = "A. Borodin and J. E. Hopcroft",
title = "Routing, merging and sorting on parallel models of
computation",
crossref = "ACM:1982:PFA",
pages = "338--344",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Atallah:1982:GPM,
author = "Mikhail J. Atallah and S. Rao Kosaraju",
title = "Graph problems on a mesh-connected processor array
(Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "345--353",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Greenberg:1982:TCB,
author = "Albert G. Greenberg",
title = "On the time complexity of broadcast communication
schemes (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "354--364",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldwasser:1982:PEH,
author = "Shafi Goldwasser and Silvio Micali",
title = "Probabilistic encryption \& how to play mental poker
keeping secret all partial information",
crossref = "ACM:1982:PFA",
pages = "365--377",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pachl:1982:TPL,
author = "J. Pachl and E. Korach and D. Rotem",
title = "A technique for proving lower bounds for distributed
maximum-finding algorithms (Preliminary Version)",
crossref = "ACM:1982:PFA",
pages = "378--382",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{DeMillo:1982:CP,
author = "Richard A. DeMillo and Nancy A. Lynch and Michael J.
Merritt",
title = "Cryptographic protocols",
crossref = "ACM:1982:PFA",
pages = "383--400",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1982:PAM,
author = "Danny Dolev and H. Raymond Strong",
title = "Polynomial algorithms for multiple processor
agreement",
crossref = "ACM:1982:PFA",
pages = "401--407",
year = "1982",
bibdate = "Wed Feb 20 18:33:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ajtai:1983:SN,
author = "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di",
title = "An {$O(n \log n)$} sorting network",
crossref = "ACM:1983:PFA",
pages = "1--9",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1983:LTS,
author = "John H. Reif and Leslie G. Valiant",
title = "A logarithmic time sort for linear size networks",
crossref = "ACM:1983:PFA",
pages = "10--16",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{vonzurGathen:1983:PAA,
author = "Joachim von zur Gathen",
title = "Parallel algorithms for algebraic problems",
crossref = "ACM:1983:PFA",
pages = "17--23",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Stout:1983:TM,
author = "Quentin F. Stout",
title = "Topological matching",
crossref = "ACM:1983:PFA",
pages = "24--31",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gacs:1983:RCC,
author = "P{\'e}ter G{\'a}cs",
title = "Reliable computation with cellular automata",
crossref = "ACM:1983:PFA",
pages = "32--41",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1983:SGG,
author = "Danny Dolev and Cynthia Dwork and Nicholas Pippenger
and Avi Wigderson",
title = "Superconcentrators, generalizers and generalized
connectors with limited depth",
crossref = "ACM:1983:PFA",
pages = "42--51",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandra:1983:UFC,
author = "Ashok K. Chandra and Steven Fortune and Richard
Lipton",
title = "Unbounded fan-in circuits and associative functions",
crossref = "ACM:1983:PFA",
pages = "52--60",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sipser:1983:BSC,
author = "Michael Sipser",
title = "{Borel} sets and circuit complexity",
crossref = "ACM:1983:PFA",
pages = "61--69",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{aufderHeide:1983:PLS,
author = "Friedhelm Meyer auf der Heide",
title = "A polynomial linear search algorithm for the
$n$-dimensional knapsack problem",
crossref = "ACM:1983:PFA",
pages = "70--79",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1983:LBA,
author = "Michael Ben-Or",
title = "Lower bounds for algebraic computation trees",
crossref = "ACM:1983:PFA",
pages = "80--86",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Borodin:1983:BWT,
author = "Allan Borodin and Danny Dolev and Faith E. Fich and
Wolfgang Paul",
title = "Bounds for width two branching programs",
crossref = "ACM:1983:PFA",
pages = "87--93",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandra:1983:MPP,
author = "Ashok K. Chandra and Merrick L. Furst and Richard J.
Lipton",
title = "Multi-party protocols",
crossref = "ACM:1983:PFA",
pages = "94--99",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Fich:1983:NBP,
author = "Faith E. Fich",
title = "New bounds for parallel prefix circuits",
crossref = "ACM:1983:PFA",
pages = "100--109",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Valiant:1983:ELB,
author = "L. G. Valiant",
title = "Exponential lower bounds for restricted monotone
circuits",
crossref = "ACM:1983:PFA",
pages = "110--117",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Stockmeyer:1983:CAC,
author = "Larry Stockmeyer",
title = "The complexity of approximate counting",
crossref = "ACM:1983:PFA",
pages = "118--126",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Duris:1983:TNL,
author = "Pavol D{\=u}ri{\=s} and Wolfgang Paul and Zvi Galil
and Ruediger Reischuk",
title = "Two nonlinear lower bounds",
crossref = "ACM:1983:PFA",
pages = "127--132",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Aho:1983:NIT,
author = "Alfred V. Aho and Jeffrey D. Ullman and Mihalis
Yannakakis",
title = "On notions of information transfer in {VLSI}
circuits",
crossref = "ACM:1983:PFA",
pages = "133--139",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Landau:1983:SRP,
author = "Susan Landau and Gary Lee Miller",
title = "Solvability by radicals is in polynomial time",
crossref = "ACM:1983:PFA",
pages = "140--151",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Driscoll:1983:DPG,
author = "James R. Driscoll and Merrick L. Furst",
title = "On the diameter of permutation groups",
crossref = "ACM:1983:PFA",
pages = "152--160",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Furer:1983:NFT,
author = "Martin F{\"u}rer and Walter Schnyder and Ernst
Specker",
title = "Normal forms for trivalent graphs and graphs of
bounded valence",
crossref = "ACM:1983:PFA",
pages = "161--170",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Babai:1983:CLG,
author = "L{\'a}szl{\'o} Babai and Eugene M. Luks",
title = "Canonical labeling of graphs",
crossref = "ACM:1983:PFA",
pages = "171--183",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bach:1983:HGR,
author = "Eric Bach",
title = "How to generate random integers with known
factorization",
crossref = "ACM:1983:PFA",
pages = "184--188",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lenstra:1983:FMP,
author = "Arjen K. Lenstra",
title = "Factoring multivariate polynomials over finite
fields",
crossref = "ACM:1983:PFA",
pages = "189--192",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kannan:1983:IAI,
author = "Ravi Kannan",
title = "Improved algorithms for integer programming and
related lattice problems",
crossref = "ACM:1983:PFA",
pages = "193--206",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{oDunlaing:1983:RNA,
author = "Colm {\'o}'D{\'u}nlaing and Micha Sharir and Chee K.
Yap",
title = "Retraction: {A} new approach to motion-planning",
crossref = "ACM:1983:PFA",
pages = "207--220",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Guibas:1983:PMG,
author = "Leo J. Guibas and Jorge Stolfi",
title = "Primitives for the manipulation of general
subdivisions and the computation of {Voronoi}
diagrams",
crossref = "ACM:1983:PFA",
pages = "221--234",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sleator:1983:SAB,
author = "Daniel Dominic Sleator and Robert Endre Tarjan",
title = "Self-adjusting binary trees",
crossref = "ACM:1983:PFA",
pages = "235--245",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gabow:1983:LTA,
author = "Harold N. Gabow and Robert Endre Tarjan",
title = "A linear-time algorithm for a special case of disjoint
set union",
crossref = "ACM:1983:PFA",
pages = "246--251",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Frederickson:1983:DSL,
author = "Greg N. Frederickson",
title = "Data structures for on-line updating of minimum
spanning trees",
crossref = "ACM:1983:PFA",
pages = "252--257",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1983:SPA,
author = "F. Frances Yao",
title = "A $3$-space partition and its applications",
crossref = "ACM:1983:PFA",
pages = "258--263",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kanellakis:1983:UID,
author = "Paris C. Kanellakis and Stavros S. Cosmadakis and
Moshe Y. Vardi",
title = "Unary inclusion dependencies have polynomial time
inference problems",
crossref = "ACM:1983:PFA",
pages = "264--277",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pnueli:1983:EFT,
author = "Amir Pnueli",
title = "On the extremely fair treatment of probabilistic
algorithms",
crossref = "ACM:1983:PFA",
pages = "278--290",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kozen:1983:PP,
author = "Dexter Kozen",
title = "A probabilistic {PDL}",
crossref = "ACM:1983:PFA",
pages = "291--297",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Feidman:1983:DPP,
author = "Yishai A. Feidman",
title = "A decidable propositional probabilistic dynamic
logic",
crossref = "ACM:1983:PFA",
pages = "298--309",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Halpern:1983:LRA,
author = "Joseph Y. Halpern and Michael O. Rabin",
title = "A logic to reason about likelihood",
crossref = "ACM:1983:PFA",
pages = "310--319",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Olderog:1983:CHL,
author = "Ernst-R{\"u}diger Olderog",
title = "A characterization of {Hoare}'s logic for programs
with {Pascal-like} procedures",
crossref = "ACM:1983:PFA",
pages = "320--329",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sipser:1983:CTA,
author = "Michael Sipser",
title = "A complexity theoretic approach to randomness",
crossref = "ACM:1983:PFA",
pages = "330--335",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dymond:1983:SDM,
author = "Patrick W. Dymond and Martin Tompa",
title = "Speedups of deterministic machines by synchronous
parallel machines",
crossref = "ACM:1983:PFA",
pages = "336--343",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kannan:1983:APN,
author = "Ravi Kannan",
title = "Alternation and the power of nondeterminism",
crossref = "ACM:1983:PFA",
pages = "344--346",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Immerman:1983:LWC,
author = "Neil Immerman",
title = "Languages which capture complexity classes",
crossref = "ACM:1983:PFA",
pages = "347--354",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Myers:1983:RAH,
author = "Dale Myers",
title = "The random access hierarchy",
crossref = "ACM:1983:PFA",
pages = "355--364",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Engelfriet:1983:IPA,
author = "Joost Engelfriet",
title = "Iterated pushdown automata and complexity classes",
crossref = "ACM:1983:PFA",
pages = "365--373",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Iwama:1983:UDS,
author = "Kazuo Iwama",
title = "Unique decomposability of shuffled strings: {A} formal
treatment of asynchronous time-multiplexed
communication",
crossref = "ACM:1983:PFA",
pages = "374--381",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hartmanis:1983:SSN,
author = "J. Hartmanis and V. Sewelson and N. Immerman",
title = "Sparse sets in {NP-P}: {Exptime} versus nexptime",
crossref = "ACM:1983:PFA",
pages = "382--391",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Young:1983:SSP,
author = "Paul Young",
title = "Some structural properties of polynomial
reducibilities and sets in {NP}",
crossref = "ACM:1983:PFA",
pages = "392--401",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Adleman:1983:BGK,
author = "Leonard M. Adleman",
title = "On breaking generalized knapsack public key
cryptosystems",
crossref = "ACM:1983:PFA",
pages = "402--412",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Long:1983:HDD,
author = "Douglas L. Long and Avi Wigderson",
title = "How discreet is the discrete log?",
crossref = "ACM:1983:PFA",
pages = "413--420",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1983:CSS,
author = "Michael Ben-Or and Benny Chor and Adi Shamir",
title = "On the cryptographic security of single {RSA} bits",
crossref = "ACM:1983:PFA",
pages = "421--430",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldwasser:1983:SSS,
author = "Shafi Goldwasser and Silvio Micali and Andy Yao",
title = "Strong signature schemes",
crossref = "ACM:1983:PFA",
pages = "431--439",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Blum:1983:HES,
author = "Manuel Blum",
title = "How to exchange (secret) keys",
crossref = "ACM:1983:PFA",
pages = "440--447",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gabow:1983:ERT,
author = "Harold N. Gabow",
title = "An efficient reduction technique for
degree-constrained subgraph and bidirected network flow
problems",
crossref = "ACM:1983:PFA",
pages = "448--456",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Spinrad:1983:TON,
author = "Jeremy Spinrad",
title = "Transitive orientation in 0(n2) time",
crossref = "ACM:1983:PFA",
pages = "457--466",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Turner:1983:PAB,
author = "Jonathan Turner",
title = "Probabilistic analysis of bandwidth minimization
algorithms",
crossref = "ACM:1983:PFA",
pages = "467--476",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Baker:1983:AAM,
author = "Brenda S. Baker and Sandeep N. Bhatt and Frank Thomson
Leighton",
title = "An approximation algorithm for {Manhattan} routing",
crossref = "ACM:1983:PFA",
pages = "477--486",
year = "1983",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hart:1984:PTL,
author = "Sergiu Hart and Micha Sharir",
title = "Probabilistic temporal logics for finite and bounded
models",
crossref = "ACM:1984:PSA",
pages = "1--13",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Emerson:1984:DBT,
author = "E. Allen Emerson and A. Prasad Sistla",
title = "Deciding branching time logic",
crossref = "ACM:1984:PSA",
pages = "14--24",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hennessy:1984:MFP,
author = "Matthew Hennessy",
title = "Modelling fair processes",
crossref = "ACM:1984:PSA",
pages = "25--30",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Degano:1984:LPC,
author = "Pierpaolo Degano and Ugo Montanari",
title = "Liveness properties as convergence in metric spaces",
crossref = "ACM:1984:PSA",
pages = "31--38",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gerth:1984:TLH,
author = "Rob Gerth",
title = "Transition logic: {How} to reason about temporal
properties in a compositional way",
crossref = "ACM:1984:PSA",
pages = "39--50",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Barringer:1984:NYM,
author = "Howard Barringer and Ruurd Kuiper and Amir Pnueli",
title = "Now you may compose temporal logic specifications",
crossref = "ACM:1984:PSA",
pages = "51--63",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bilardi:1984:MAV,
author = "G. Bilardi and F. P. Preparata",
title = "A minimum area {VLSI} network for {$O(\log n)$} time
sorting",
crossref = "ACM:1984:PSA",
pages = "64--70",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Leighton:1984:TBC,
author = "Tom Leighton",
title = "Tight bounds on the complexity of parallel sorting",
crossref = "ACM:1984:PSA",
pages = "71--80",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Duris:1984:LBC,
author = "Pavol Duris and Zvi Galil and Georg Schnitger",
title = "Lower bounds on communication complexity",
crossref = "ACM:1984:PSA",
pages = "81--91",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Blum:1984:AME,
author = "Norbert Blum",
title = "An area-maximum edge length tradeoff for {VLSI}
layout",
crossref = "ACM:1984:PSA",
pages = "92--97",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Buss:1984:PPG,
author = "Jonathan F. Buss and Peter W. Shor",
title = "On the pagenumber of planar graphs",
crossref = "ACM:1984:PSA",
pages = "98--100",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Mirzaian:1984:CRV,
author = "A. Mirzaian",
title = "Channel routing in {VLSI}",
crossref = "ACM:1984:PSA",
pages = "101--107",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Post:1984:MSE,
author = "Mark J. Post",
title = "Minimum spanning ellipsoids",
crossref = "ACM:1984:PSA",
pages = "108--116",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:1984:DDD,
author = "Chul E. Kim and Timothy A. Anderson",
title = "Digital disks and a digital compactness measure",
crossref = "ACM:1984:PSA",
pages = "117--124",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Chaselle:1984:IET,
author = "Bernard Chaselle",
title = "Intersecting is easier than sorting",
crossref = "ACM:1984:PSA",
pages = "125--134",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gabow:1984:SRT,
author = "Harold N. Gabow and Jon Louis Bentley and Robert E.
Tarjan",
title = "Scaling and related techniques for geometry problems",
crossref = "ACM:1984:PSA",
pages = "135--143",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sharir:1984:SPP,
author = "Micha Sharir and Amir Schorr",
title = "On shortest paths in polyhedral spaces",
crossref = "ACM:1984:PSA",
pages = "144--153",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Cole:1984:HRP,
author = "Richard Cole and Micha Sharir and Chee K. Yap",
title = "On $k$-hulls and related problems",
crossref = "ACM:1984:PSA",
pages = "154--166",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Franzblau:1984:ACR,
author = "Deborah S. Franzblau and Daniel J. Kleitman",
title = "An algorithm for constructing regions with rectangles:
{Independence} and minimum generating sets for
collections of intervals",
crossref = "ACM:1984:PSA",
pages = "167--174",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:1984:FPF,
author = "Ming-Deh A. Huang",
title = "Factorization of polynomials over finite fields and
factorization of primes in algebraic number fields",
crossref = "ACM:1984:PSA",
pages = "175--182",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bach:1984:SDP,
author = "Eric Bach and Gary Miller and Jeffrey Shallit",
title = "Sums of divisors, perfect numbers, and factoring",
crossref = "ACM:1984:PSA",
pages = "183--190",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kannan:1984:PFN,
author = "R. Kannan and A. K. Lenstra and L. Lov{\'a}sz",
title = "Polynomial factorization and nonrandomness of bits of
algebraic and some transcendental numbers",
crossref = "ACM:1984:PSA",
pages = "191--200",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Coppersmith:1984:ELG,
author = "Don Coppersmith",
title = "Evaluating logarithms in {GF(2n)}",
crossref = "ACM:1984:PSA",
pages = "201--207",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ong:1984:ESS,
author = "H. Ong and C. P. Schnorr and A. Shamir",
title = "An efficient signature scheme based on quadratic
equations",
crossref = "ACM:1984:PSA",
pages = "208--216",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Orlitsky:1984:CSC,
author = "Alon Orlitsky and Abbas {El Gamal}",
title = "Communication with secrecy constraints",
crossref = "ACM:1984:PSA",
pages = "217--224",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1984:CFW,
author = "Danny Dolev and David Maier and Ilarry Mairson and
Jeffrey Ullman",
title = "Correcting faults in write-once memory",
crossref = "ACM:1984:PSA",
pages = "225--229",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Vishkin:1984:RSU,
author = "Uzi Vishkin",
title = "Randomized speed-ups in parallel computation",
crossref = "ACM:1984:PSA",
pages = "230--239",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Galil:1984:OPA,
author = "Zvi Galil",
title = "Optimal parallel algorithms for string matching",
crossref = "ACM:1984:PSA",
pages = "240--248",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Awerbuch:1984:FEC,
author = "B. Awerbuch and A. Israeli and Y. Shiloach",
title = "Finding {Euler} circuits in logarithmic parallel
time",
crossref = "ACM:1984:PSA",
pages = "249--257",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Upfal:1984:PRB,
author = "Eli Upfal",
title = "A probabilistic relation between desirable and
feasible, models of parallel computation",
crossref = "ACM:1984:PSA",
pages = "258--265",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1984:FPA,
author = "Richard M. Karp and Avi Wigderson",
title = "A fast parallel algorithm for the maximal independent
set problem",
crossref = "ACM:1984:PSA",
pages = "266--272",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Manber:1984:MDI,
author = "Udi Manber",
title = "On maintaining dynamic information in a concurrent
environment",
crossref = "ACM:1984:PSA",
pages = "273--278",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bentley:1984:SUE,
author = "J. L. Bentley and D. S. Johnson and F. T. Leighton and
C. C. McGeoch and L. A. McGeoch",
title = "Some unexpected expected behavior results for bin
packing",
crossref = "ACM:1984:PSA",
pages = "279--288",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1984:PAM,
author = "Richard M. Karp and Michael Luby and A.
Marchetti-Spaccamela",
title = "A probabilistic analysis of multidimensional bin
packing problems",
crossref = "ACM:1984:PSA",
pages = "289--298",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kahn:1984:EPG,
author = "Jeff Kahn and Michael Saks",
title = "Every poset has a good comparison",
crossref = "ACM:1984:PSA",
pages = "299--301",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Karmarkar:1984:NPT,
author = "N. Karmarkar",
title = "A new polynomial-time algorithm for linear
programming",
crossref = "ACM:1984:PSA",
pages = "302--311",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Adler:1984:SAW,
author = "Ilan Adler and Nimrod Megiddo",
title = "A simplex algorithm whose average number of steps is
bounded between two quadratic functions of the smaller
dimension",
crossref = "ACM:1984:PSA",
pages = "312--323",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Hochbaum:1984:PGP,
author = "Dorit S. Hochbaum and David B. Shmoys",
title = "Powers of graphs: {A} powerful approximation technique
for bottleneck problems",
crossref = "ACM:1984:PSA",
pages = "324--333",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gonnet:1984:DEE,
author = "Gaston H. Gonnet",
title = "Determining equivalence of expressions in random
polynomial time",
crossref = "ACM:1984:PSA",
pages = "334--341",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Clarkson:1984:FET,
author = "Kenneth L. Clarkson",
title = "Fast expected-time and approximation algorithms for
geometric minimum spanning trees",
crossref = "ACM:1984:PSA",
pages = "342--348",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Blumer:1984:BCI,
author = "A. Blumer and J. Blumer and A. Ehrenfeucht and D.
Haussler and R. McConnell",
title = "Building a complete inverted file for a set of text
files in linear time",
crossref = "ACM:1984:PSA",
pages = "349--358",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1984:FES,
author = "A. V. Goldberg and A. Marchetti-Spaccamela",
title = "On finding the exact solution of a zero-one knapsack
problem",
crossref = "ACM:1984:PSA",
pages = "359--368",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Cunto:1984:ACS,
author = "Walter Cunto and J. Ian Munro",
title = "Average case selection",
crossref = "ACM:1984:PSA",
pages = "369--375",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Miller:1984:FSS,
author = "Gary L. Miller",
title = "Finding small simple cycle separators for
$2$-connected planar graphs",
crossref = "ACM:1984:PSA",
pages = "376--382",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Frederickson:1984:DSL,
author = "Greg N. Frederickson and Mandayam A. Srinivas",
title = "Data structures for on-line updating of matroid
intersection solutions",
crossref = "ACM:1984:PSA",
pages = "383--390",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Slot:1984:TVC,
author = "C. Slot and P. van Emde Boas",
title = "On tape versus core an application of space efficient
perfect hash functions to the invariance of space",
crossref = "ACM:1984:PSA",
pages = "391--400",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Maass:1984:QLB,
author = "Wolfgang Maass",
title = "Quadratic lower bounds for deterministic and
nondeterministic one-tape {Turing} machines",
crossref = "ACM:1984:PSA",
pages = "401--408",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{deRougemont:1984:UDF,
author = "Michel de Rougemont",
title = "Uniform definability on finite structures with
successor",
crossref = "ACM:1984:PSA",
pages = "409--417",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Harel:1984:GRI,
author = "David Harel",
title = "A general result on infinite trees and its
applications",
crossref = "ACM:1984:PSA",
pages = "418--427",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kozen:1984:PEE,
author = "Dexter Kozen",
title = "Pebblings, edgings, and equational logic",
crossref = "ACM:1984:PSA",
pages = "428--435",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Valiant:1984:TL,
author = "L. G. Valiant",
title = "A theory of the learnable",
crossref = "ACM:1984:PSA",
pages = "436--445",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Vardi:1984:ATT,
author = "Moshe Y. Vardi and Pierre Wolper",
title = "Automata theoretic techniques for modal logics of
programs: (Extended abstract)",
crossref = "ACM:1984:PSA",
pages = "446--456",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1984:CEA,
author = "Michael Ben-Or and Dexter Kozen and John Reif",
title = "The complexity of elementary algebra and geometry",
crossref = "ACM:1984:PSA",
pages = "457--464",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Levin:1984:PCA,
author = "Leonid A. Levin",
title = "Problems, complete in ``average'' instance",
crossref = "ACM:1984:PSA",
pages = "465--465",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Alt:1984:CAF,
author = "Helmut Alt",
title = "Comparison of arithmetic functions with respect to
boolean circuit depth",
crossref = "ACM:1984:PSA",
pages = "466--470",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ajtai:1984:TPC,
author = "Miklos Ajtai and Michael Ben-Or",
title = "A theorem on probabilistic constant depth
{Computations}",
crossref = "ACM:1984:PSA",
pages = "471--474",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Boppana:1984:TFB,
author = "Ravi B. Boppana",
title = "Threshold functions and bounded depth monotone
circuits",
crossref = "ACM:1984:PSA",
pages = "475--479",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Klawe:1984:MFR,
author = "Maria Klawe and Wolfgang J. Paul and Nicholas
Pippenger and Mihalis Yannakakis",
title = "On monotone formulae with restricted depth",
crossref = "ACM:1984:PSA",
pages = "480--487",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Sleator:1984:AEL,
author = "Daniel Dominic Sleator and Robert Endre Tarjan",
title = "Amortized efficiency of list update rules",
crossref = "ACM:1984:PSA",
pages = "488--492",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Frederickson:1984:ISC,
author = "Greg N. Frederickson and Nancy A. Lynch",
title = "The impact of synchronous communication on the problem
of electing a leader in a ring",
crossref = "ACM:1984:PSA",
pages = "493--503",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1984:PIA,
author = "Danny Dolev and Joe Halpern and H. Raymond Strong",
title = "On the possibility and impossibility of achieving
clock synchronization",
crossref = "ACM:1984:PSA",
pages = "504--511",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Willard:1984:LLP,
author = "Dan E. Willard",
title = "Log-logarithmic protocols for resolving {Ethernet} and
semaphore conflicts",
crossref = "ACM:1984:PSA",
pages = "512--521",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Awerbuch:1984:ENS,
author = "Baruch Awerbuch",
title = "An efficient network synchronization protocol",
crossref = "ACM:1984:PSA",
pages = "522--525",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1984:NLF,
author = "Danny Dolev and Joe Halpern and Barbara Simons and Ray
Strong",
title = "A new look at fault tolerant network routing",
crossref = "ACM:1984:PSA",
pages = "526--535",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Broder:1984:EFT,
author = "Andrei Broder and Michael Fischer and Danny Dolev and
Barbara Simons",
title = "Efficient fault tolerant routings in networks",
crossref = "ACM:1984:PSA",
pages = "536--541",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Vitanyi:1984:DEA,
author = "Paul M. B. Vit{\'a}nyi",
title = "Distributed elections in an archimedean ring of
processors",
crossref = "ACM:1984:PSA",
pages = "542--547",
year = "1984",
bibdate = "Thu Feb 21 06:51:34 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Luby:1985:SPA,
author = "M. Luby",
title = "A simple parallel algorithm for the maximal
independent set problem",
crossref = "ACM:1985:PSA",
pages = "1--10",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/22145/p1-luby/p1-luby.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/22145/p1-luby/",
acknowledgement = ack-nhfb,
}
@InProceedings{Vazirani:1985:TPS,
author = "U. Vazirani and V. V. Vazirani",
title = "The two-processor scheduling problem is in {R-NC}",
crossref = "ACM:1985:PSA",
pages = "11--21",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p11-vazirani/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p11-vazirani/p11-vazirani.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1985:CPM,
author = "R. M. Karp and E. Upfal and A. Wigderson",
title = "Constructing a perfect matching is in random {NC}",
crossref = "ACM:1985:PSA",
pages = "22--32",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p22-karp/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p22-karp/p22-karp.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Anderson:1985:PAM,
author = "R. Anderson",
title = "A parallel algorithm for the maximal path problem",
crossref = "ACM:1985:PSA",
pages = "33--37",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p33-anderson/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p33-anderson/p33-anderson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fich:1985:PCE,
author = "F. E. Fich and M. Tompa",
title = "The parallel complexity of exponentiating polynomials
over finite fields",
crossref = "ACM:1985:PSA",
pages = "38--47",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p38-fich/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p38-fich/p38-fich.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fich:1985:OTT,
author = "F. E. Fich and F. Meyer auf der Heide and P. Ragde and
A. Wigderson",
title = "One, two, three \ldots{} infinity: lower bounds for
parallel computation",
crossref = "ACM:1985:PSA",
pages = "48--58",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p48-fich/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p48-fich/p48-fich.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1985:TVM,
author = "A. Aggarwal",
title = "Tradeoffs for {VLSI} models with subpolynomial delay",
crossref = "ACM:1985:PSA",
pages = "59--68",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p59-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p59-aggarwal/p59-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Leiserson:1985:ART,
author = "C. E. Leiserson and F. M. Maley",
title = "Algorithms for routing and testing routability of
planar {VLSI} layouts",
crossref = "ACM:1985:PSA",
pages = "69--78",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p69-leiserson/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p69-leiserson/p69-leiserson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Raghavan:1985:PGR,
author = "P. Raghavan and C. D. Thompson",
title = "Provably good routing in graphs: regular arrays",
crossref = "ACM:1985:PSA",
pages = "79--87",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p79-raghavan/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p79-raghavan/p79-raghavan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Jimbo:1985:EOA,
author = "S. Jimbo and A. Maruoka",
title = "Expanders obtained from affine transformations",
crossref = "ACM:1985:PSA",
pages = "88--97",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p88-jimbo/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p88-jimbo/p88-jimbo.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Alon:1985:ESR,
author = "N. Alon",
title = "Expanders, sorting in rounds and superconcentrators of
limited depth",
crossref = "ACM:1985:PSA",
pages = "98--102",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p98-alon/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p98-alon/p98-alon.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Wilber:1985:WPH,
author = "R. Wilber",
title = "White pebbles help",
crossref = "ACM:1985:PSA",
pages = "103--112",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p103-wilber/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p103-wilber/p103-wilber.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Baker:1985:SPT,
author = "B. S. Baker and S. Fortune and E. Grosse",
title = "Stable prehension with three fingers",
crossref = "ACM:1985:PSA",
pages = "114--120",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p114-baker/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p114-baker/p114-baker.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:1985:RHF,
author = "M.-D. A. Huang",
title = "{Riemann} hypothesis and finding roots over finite
fields",
crossref = "ACM:1985:PSA",
pages = "121--130",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p121-huang/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p121-huang/p121-huang.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaltofen:1985:CPG,
author = "E. Kaltofen",
title = "Computing with polynomials given by straight-line
programs {I}: greatest common divisors",
crossref = "ACM:1985:PSA",
pages = "131--142",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p131-kaltofen/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p131-kaltofen/p131-kaltofen.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Pan:1985:EPS,
author = "V. Pan and J. Reif",
title = "Efficient parallel solution of linear systems",
crossref = "ACM:1985:PSA",
pages = "143--152",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p143-pan/",
acknowledgement = ack-nhfb,
}
@InProceedings{Friedl:1985:PTS,
author = "K. Friedl and L. R{\'o}nyai",
title = "Polynomial time solutions of some problems of
computational algebra",
crossref = "ACM:1985:PSA",
pages = "153--162",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p153-friedl/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p153-friedl/p153-friedl.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1985:GAD,
author = "A. C. Yao and F. F. Yao",
title = "A general approach to $d$-dimensional geometric
queries",
crossref = "ACM:1985:PSA",
pages = "163--168",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/22145/p163-yao/p163-yao.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/22145/p163-yao/",
acknowledgement = ack-nhfb,
}
@InProceedings{Vaidya:1985:STT,
author = "P. M. Vaidya",
title = "Space-time tradeoffs for orthogonal range queries",
crossref = "ACM:1985:PSA",
pages = "169--174",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p169-vaidya/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p169-vaidya/p169-vaidya.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Clarkson:1985:PAP,
author = "K. Clarkson",
title = "A probabilistic algorithm for the post office
problem",
crossref = "ACM:1985:PSA",
pages = "175--184",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p175-clarkson/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p175-clarkson/p175-clarkson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Harel:1985:LAF,
author = "D. Harel",
title = "A linear algorithm for finding dominators in flow
graphs and related problems",
crossref = "ACM:1985:PSA",
pages = "185--194",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p185-harel/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p185-harel/p185-harel.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Suzuki:1985:MFP,
author = "H. Suzuki and T. Nishizeki and N. Saito",
title = "Multicommodity flows in planar undirected graphs and
shortest paths",
crossref = "ACM:1985:PSA",
pages = "195--204",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p195-suzuki/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p195-suzuki/p195-suzuki.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Culberson:1985:EUB,
author = "J. C. Culberson",
title = "The effect of updates in binary search trees",
crossref = "ACM:1985:PSA",
pages = "205--212",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p205-culberson/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p205-culberson/p205-culberson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bent:1985:FMR,
author = "S. W. Bent and J. W. John",
title = "Finding the median requires $2n$ comparisons",
crossref = "ACM:1985:PSA",
pages = "213--216",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p213-bent/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p213-bent/p213-bent.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Chung:1985:SOS,
author = "F. R. Chung and D. J. Hajela and P. D. Seymour",
title = "Self-organizing sequential search and {Hilbert}'s
inequalities",
crossref = "ACM:1985:PSA",
pages = "217--223",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p217-chung/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p217-chung/p217-chung.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bollobas:1985:EBD,
author = "B. Bollob{\'a}s and I. Simon",
title = "On the expected behavior of disjoint set union
algorithms",
crossref = "ACM:1985:PSA",
pages = "224--231",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p224-bollobas/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p224-bollobas/p224-bollobas.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Peleg:1985:CDL,
author = "D. Peleg",
title = "Concurrent dynamic logic",
crossref = "ACM:1985:PSA",
pages = "232--239",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p232-peleg/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p232-peleg/p232-peleg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Vardi:1985:IUL,
author = "M. Y. Vardi and L. Stockmeyer",
title = "Improved upper and lower bounds for modal logics of
programs",
crossref = "ACM:1985:PSA",
pages = "240--251",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p240-vardi/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p240-vardi/p240-vardi.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bakker:1985:TSI,
author = "J. W. de Bakker and J. J. Meyer and E. R. Olderog and
J. I. Zucker",
title = "Transition systems, infinitary languages and the
semantics of uniform concurrency",
crossref = "ACM:1985:PSA",
pages = "252--262",
year = "1985",
bibdate = "Wed Apr 4 18:53:04 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p252-de_bakker/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p252-de_bakker/p252-de_bakker.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{deBakker:1985:TSI,
author = "J. W. de Bakker and J. J. Meyer and E. R. Olderog and
J. I. Zucker",
title = "Transition systems, infinitary languages and the
semantics of uniform concurrency",
crossref = "ACM:1985:PSA",
pages = "252--262",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bruce:1985:PID,
author = "K. B. Bruce and G. Longo",
title = "Provable isomorphisms and domain equations in models
of typed languages",
crossref = "ACM:1985:PSA",
pages = "263--272",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p263-bruce/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p263-bruce/p263-bruce.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cosmadakis:1985:ETD,
author = "S. S. Cosmadakis and P. C. Kanellakis",
title = "Equational theories and database constraints",
crossref = "ACM:1985:PSA",
pages = "273--284",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p273-cosmadakis/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p273-cosmadakis/p273-cosmadakis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Buss:1985:PHF,
author = "S. R. Buss",
title = "The polynomial hierarchy and fragments of bounded
arithmetic",
crossref = "ACM:1985:PSA",
pages = "285--290",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p285-buss/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p285-buss/p285-buss.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldwasser:1985:KCI,
author = "S. Goldwasser and S. Micali and C. Rackoff",
title = "The knowledge complexity of interactive
proof-systems",
crossref = "ACM:1985:PSA",
pages = "291--304",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p291-goldwasser/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p291-goldwasser/p291-goldwasser.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fagin:1985:ISM,
author = "R. Fagin and M. Y. Vardi",
title = "An internal semantics for modal logic",
crossref = "ACM:1985:PSA",
pages = "305--315",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p305-fagin/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p305-fagin/p305-fagin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bracha:1985:ERR,
author = "G. Bracha",
title = "An {$O(\lg n)$} expected rounds randomized {Byzantine}
generals protocol",
crossref = "ACM:1985:PSA",
pages = "316--326",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p316-bracha/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p316-bracha/p316-bracha.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Feldman:1985:FTM,
author = "P. Feldman",
title = "Fault tolerance of minimal path routings in a
network",
crossref = "ACM:1985:PSA",
pages = "327--334",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p327-feldman/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p327-feldman/p327-feldman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Coan:1985:DFS,
author = "B. A. Coan and D. Dolev and C. Dwork and L.
Stockmeyer",
title = "The distributed firing squad problem",
crossref = "ACM:1985:PSA",
pages = "335--345",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p335-coan/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p335-coan/p335-coan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Halpern:1985:OPP,
author = "J. Y. Halpern and N. Megiddo and A. A. Munshi",
title = "Optimal precision in the presence of uncertainty",
crossref = "ACM:1985:PSA",
pages = "346--355",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p346-halpern/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p346-halpern/p346-halpern.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Haastad:1985:CST,
author = "J. H{\aa}stad and A. Shamir",
title = "The cryptographic security of truncated linearly
related variables",
crossref = "ACM:1985:PSA",
pages = "356--362",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p356-hastad/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p356-hastad/p356-hastad.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Levin:1985:OWF,
author = "L. A. Levin",
title = "One-way functions and pseudorandom generators",
crossref = "ACM:1985:PSA",
pages = "363--365",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p363-levin/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p363-levin/p363-levin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Vazirani:1985:TSC,
author = "U. V. Vazirani",
title = "Towards a strong communication complexity theory or
generating quasi-random sequences from two
communicating slightly-random sources",
crossref = "ACM:1985:PSA",
pages = "366--378",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p366-vazirani/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p366-vazirani/p366-vazirani.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goodman:1985:SE,
author = "J. Goodman and A. G. Greenberg and N. Madras and P.
March",
title = "On the stability of the {Ethernet}",
crossref = "ACM:1985:PSA",
pages = "379--387",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p379-goodman/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p379-goodman/p379-goodman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Gacs:1985:STD,
author = "P. G{\'a}cs and J. Reif",
title = "A simple three-dimensional real-time cellular array",
crossref = "ACM:1985:PSA",
pages = "388--395",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p388-gacs/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p388-gacs/p388-gacs.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Lubiw:1985:DLO,
author = "A. Lubiw",
title = "Doubly lexical orderings of matrices",
crossref = "ACM:1985:PSA",
pages = "396--404",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p396-lubiw/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p396-lubiw/p396-lubiw.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Huynh:1985:CEP,
author = "D. T. Huynh",
title = "The complexity of the equivalence problem for
commutative semigroups and symmetric vector addition
systems",
crossref = "ACM:1985:PSA",
pages = "405--412",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p405-huynh/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p405-huynh/p405-huynh.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{MeyeraufderHeide:1985:FAD,
author = "F. {Meyer auf der Heide}",
title = "Fast algorithms for $n$-dimensional restrictions of
hard problems",
crossref = "ACM:1985:PSA",
pages = "413--420",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p413-meyer_auf_der_heide/",
acknowledgement = ack-nhfb,
}
@InProceedings{Babai:1985:TGT,
author = "L. Babai",
title = "Trading group theory for randomness",
crossref = "ACM:1985:PSA",
pages = "421--429",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p421-babai/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p421-babai/p421-babai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bollobas:1985:AFH,
author = "B. Bollob{\'a}s and T. I. Fenner and A. M. Frieze",
title = "An algorithm for finding {Hamilton} cycles in random
graphs",
crossref = "ACM:1985:PSA",
pages = "430--439",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p430-bollobas/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p430-bollobas/p430-bollobas.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1985:CR,
author = "A. Goldberg and M. Sipser",
title = "Compression and ranking",
crossref = "ACM:1985:PSA",
pages = "440--448",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p440-goldberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p440-goldberg/p440-goldberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Carter:1985:CBS,
author = "L. Carter and L. Stockmeyer and M. Wegman",
title = "The complexity of backtrack searches",
crossref = "ACM:1985:PSA",
pages = "449--457",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p449-carter/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p449-carter/p449-carter.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Valiant:1985:NED,
author = "L. G. Valiant and V. V. Vazirani",
title = "{NP} is as easy as detecting unique solutions",
crossref = "ACM:1985:PSA",
pages = "458--463",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p458-valiant/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p458-valiant/p458-valiant.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1985:SDP,
author = "R. M. Karp and E. Upfal and A. Wigderson",
title = "Are search and decision programs computationally
equivalent?",
crossref = "ACM:1985:PSA",
pages = "464--475",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p464-karp/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p464-karp/p464-karp.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aharoni:1985:DIL,
author = "R. Aharoni and P. Erd{\H{o}}s and N. Linial",
title = "Dual integer linear programs and the relationship
between their optima",
crossref = "ACM:1985:PSA",
pages = "476--483",
year = "1985",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/22145/p476-aharoni/;
http://www.acm.org/pubs/articles/proceedings/stoc/22145/p476-aharoni/p476-aharoni.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Barrington:1986:BWP,
author = "D. A. Barrington",
title = "Bounded-width polynomial-size branching programs
recognize exactly those languages in {NC$^1$}",
crossref = "ACM:1986:PEA",
pages = "1--5",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p1-barrington/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p1-barrington/p1-barrington.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Haastad:1986:AOL,
author = "J. H{\aa}stad",
title = "Almost optimal lower bounds for small depth circuits",
crossref = "ACM:1986:PEA",
pages = "6--20",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p6-hastad/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p6-hastad/p6-hastad.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cai:1986:POR,
author = "J. Y. Cai",
title = "With probability one, a random oracle separates
{PSPACE} from the polynomial-time hierarchy",
crossref = "ACM:1986:PEA",
pages = "21--29",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p21-cai/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p21-cai/p21-cai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ajtai:1986:TLB,
author = "M. Ajtai and L. Babai and P. Hajnal and J. Komlos and
P. Pudlak",
title = "Two lower bounds for branching programs",
crossref = "ACM:1986:PEA",
pages = "30--38",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p30-ajtai/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p30-ajtai/p30-ajtai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Galil:1986:NSP,
author = "Z. Galil and R. Kannan and E. Szemeredi",
title = "On nontrivial separators for $k$-page graphs and
simulations by nondeterministic one-tape {Turing}
machines",
crossref = "ACM:1986:PEA",
pages = "39--49",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p39-galil/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p39-galil/p39-galil.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Broder:1986:HHI,
author = "A. Z. Broder",
title = "How hard is it to marry at random? ({$O(n)$} the
approximation of the permanent)",
crossref = "ACM:1986:PEA",
pages = "50--58",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p50-broder/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p50-broder/p50-broder.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldwasser:1986:PCV,
author = "S. Goldwasser and M. Sipser",
title = "Private coins versus public coins in interactive proof
systems",
crossref = "ACM:1986:PEA",
pages = "59--68",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p59-goldwasser/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p59-goldwasser/p59-goldwasser.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Krentel:1986:COP,
author = "M. W. Krentel",
title = "The complexity of optimization problems",
crossref = "ACM:1986:PEA",
pages = "69--76",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p69-krentel/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p69-krentel/p69-krentel.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Coffman:1986:PEA,
author = "E. G. Coffman and F. T. Leighton",
title = "A provably efficient algorithm for dynamic storage
allocation",
crossref = "ACM:1986:PEA",
pages = "77--90",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p77-coffman/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p77-coffman/p77-coffman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Leighton:1986:TBM,
author = "F. T. Leighton and P. Shor",
title = "Tight bounds for minimax grid matching, with
applications to the average case analysis of
algorithms",
crossref = "ACM:1986:PEA",
pages = "91--103",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p91-leighton/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p91-leighton/p91-leighton.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Yannakakis:1986:FPN,
author = "M. Yannakakis",
title = "Four pages are necessary and sufficient for planar
graphs",
crossref = "ACM:1986:PEA",
pages = "104--108",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p104-yannakakis/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p104-yannakakis/p104-yannakakis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Driscoll:1986:MDS,
author = "J. R. Driscoll and N. Sarnak and D. D. Sleator and R.
E. Tarjan",
title = "Making data structures persistent",
crossref = "ACM:1986:PEA",
pages = "109--121",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p109-driscoll/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p109-driscoll/p109-driscoll.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Sleator:1986:RDT,
author = "D. D. Sleator and R. E. Tarjan and W. P. Thurston",
title = "Rotation distance, triangulations, and hyperbolic
geometry",
crossref = "ACM:1986:PEA",
pages = "122--135",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p122-sleator/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p122-sleator/p122-sleator.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1986:NAM,
author = "A. V. Goldberg and R. E. Tarjan",
title = "A new approach to the maximum flow problem",
crossref = "ACM:1986:PEA",
pages = "136--146",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p136-goldberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p136-goldberg/p136-goldberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kapoor:1986:FAC,
author = "S. Kapoor and P. M. Vaidya",
title = "Fast algorithms for convex quadratic programming and
multicommodity flows",
crossref = "ACM:1986:PEA",
pages = "147--159",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p147-kapoor/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p147-kapoor/p147-kapoor.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karlin:1986:PHE,
author = "A. R. Karlin and E. Upfal",
title = "Parallel hashing --- an efficient implementation of
shared memory",
crossref = "ACM:1986:PEA",
pages = "160--168",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p160-karlin/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p160-karlin/p160-karlin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Beame:1986:LPC,
author = "P. Beame",
title = "Limits on the power of concurrent-write parallel
machines",
crossref = "ACM:1986:PEA",
pages = "169--176",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p169-beame/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p169-beame/p169-beame.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:1986:NLB,
author = "M. Li and Y. Yesha",
title = "New lower bounds for parallel computation",
crossref = "ACM:1986:PEA",
pages = "177--187",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p177-li/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p177-li/p177-li.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ajtai:1986:DSL,
author = "M. Ajtai and J. Komlos and W. L. Steiger and E.
Szemeredi",
title = "Deterministic selection in {$O(\log \log N)$} parallel
time",
crossref = "ACM:1986:PEA",
pages = "188--195",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p188-ajtai/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p188-ajtai/p188-ajtai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Lueker:1986:LPT,
author = "G. S. Lueker and N. Megiddo and V. Ramachandran",
title = "Linear programming with two variables per inequality
in poly-log time",
crossref = "ACM:1986:PEA",
pages = "196--205",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p196-lueker/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p196-lueker/p196-lueker.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cole:1986:DCT,
author = "R. Cole and U. Vishkin",
title = "Deterministic coin tossing and accelerating cascades:
micro and macro techniques for designing parallel
algorithms",
crossref = "ACM:1986:PEA",
pages = "206--219",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p206-cole/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p206-cole/p206-cole.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Landau:1986:IEP,
author = "G. M. Landau and U. Vishkin",
title = "Introducing efficient parallelism into approximate
string matching and a new serial algorithm",
crossref = "ACM:1986:PEA",
pages = "220--230",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p220-landau/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p220-landau/p220-landau.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1986:PED,
author = "S. R. Kosaraju",
title = "Parallel evaluation of division-free arithmetic
equations",
crossref = "ACM:1986:PEA",
pages = "231--239",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p231-kosaraju/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p231-kosaraju/p231-kosaraju.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Lubotzky:1986:EER,
author = "A. Lubotzky and R. Phillips and P. Sarnak",
title = "Explicit expanders and the {Ramanujan} conjectures",
crossref = "ACM:1986:PEA",
pages = "240--246",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p240-lubotzky/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p240-lubotzky/p240-lubotzky.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Feldman:1986:NBN,
author = "P. Feldman and J. Friedman and N. Pippenger",
title = "Non-blocking networks",
crossref = "ACM:1986:PEA",
pages = "247--254",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p247-feldman/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p247-feldman/p247-feldman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Schnorr:1986:OSA,
author = "C. P. Schnorr and A. Shamir",
title = "An optimal sorting algorithm for mesh connected
computers",
crossref = "ACM:1986:PEA",
pages = "255--263",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p255-schnorr/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p255-schnorr/p255-schnorr.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1986:OSB,
author = "S. R. Kosaraju and M. J. Atallah",
title = "Optimal simulations between mesh-connected arrays of
processors",
crossref = "ACM:1986:PEA",
pages = "264--272",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p264-kosaraju/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p264-kosaraju/p264-kosaraju.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Blumer:1986:CLG,
author = "A. Blumer and A. Ehrenfeucht and D. Haussler and M.
Warmuth",
title = "Classifying learnable geometric concepts with the
{Vapnik--Chervonenkis} dimension",
crossref = "ACM:1986:PEA",
pages = "273--282",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p273-blumer/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p273-blumer/p273-blumer.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Courcoubetis:1986:RAF,
author = "C. Courcoubetis and M. Y. Vardi and P. Wolper",
title = "Reasoning about fair concurrent programs",
crossref = "ACM:1986:PEA",
pages = "283--294",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p283-courcoubetis/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p283-courcoubetis/p283-courcoubetis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ko:1986:NOW,
author = "K. I. Ko and T. J. Long and D. Z. Du",
title = "A note on one-way functions and polynomial-time
isomorphisms",
crossref = "ACM:1986:PEA",
pages = "295--303",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p295-ko/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p295-ko/p295-ko.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Halpern:1986:CRA,
author = "J. Y. Halpern and M. Y. Vardi",
title = "The complexity of reasoning about knowledge and time",
crossref = "ACM:1986:PEA",
pages = "304--315",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p304-halpern/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p304-halpern/p304-halpern.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldwasser:1986:AAP,
author = "S. Goldwasser and J. Kilian",
title = "Almost all primes can be quickly certified",
crossref = "ACM:1986:PEA",
pages = "316--329",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p316-goldwasser/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p316-goldwasser/p316-goldwasser.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaltofen:1986:UCP,
author = "E. Kaltofen",
title = "Uniform closure properties of {P-computable}
functions",
crossref = "ACM:1986:PEA",
pages = "330--337",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p330-kaltofen/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p330-kaltofen/p330-kaltofen.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Mulmuley:1986:FPA,
author = "K. Mulmuley",
title = "A fast parallel algorithm to compute the rank of a
matrix over an arbitrary field",
crossref = "ACM:1986:PEA",
pages = "338--339",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p338-mulmuley/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p338-mulmuley/p338-mulmuley.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1986:FPA,
author = "M. Ben-Or and E. Feig and D. Kozen and P. Tiwari",
title = "A fast parallel algorithm for determining all roots of
a polynomial with real roots",
crossref = "ACM:1986:PEA",
pages = "340--349",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p340-ben-or/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p340-ben-or/p340-ben-or.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Adleman:1986:FIP,
author = "L. M. Adleman and H. W. Lenstra",
title = "Finding irreducible polynomials over finite fields",
crossref = "ACM:1986:PEA",
pages = "350--355",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p350-adleman/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p350-adleman/p350-adleman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Luby:1986:PRP,
author = "M. Luby and C. Rackoff",
title = "Pseudo-random permutation generators and cryptographic
composition",
crossref = "ACM:1986:PEA",
pages = "356--363",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p356-luby/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p356-luby/p356-luby.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cleve:1986:LSC,
author = "R. Cleve",
title = "Limits on the security of coin flips when half the
processors are faulty",
crossref = "ACM:1986:PEA",
pages = "364--369",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p364-cleve/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p364-cleve/p364-cleve.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Dwork:1986:FTN,
author = "C. Dwork and D. Peleg and N. Pippenger and E. Upfal",
title = "Fault tolerance in networks of bounded degree",
crossref = "ACM:1986:PEA",
pages = "370--379",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p370-dwork/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p370-dwork/p370-dwork.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Tarjan:1986:LTA,
author = "R. E. Tarjan and C. J. {Van Wyk}",
title = "A linear-time algorithm for triangulating simple
polygons",
crossref = "ACM:1986:PEA",
pages = "380--388",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p380-tarjan/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p380-tarjan/p380-tarjan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Edelsbrunner:1986:TSA,
author = "H. Edelsbrunner and L. J. Guibas",
title = "Topologically sweeping an arrangement",
crossref = "ACM:1986:PEA",
pages = "389--403",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p389-edelsbrunner/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p389-edelsbrunner/p389-edelsbrunner.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Seidel:1986:CHD,
author = "R. Seidel",
title = "Constructing higher-dimensional convex hulls at
logarithmic cost per face",
crossref = "ACM:1986:PEA",
pages = "404--413",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p404-seidel/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p404-seidel/p404-seidel.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Clarkson:1986:FAR,
author = "K. L. Clarkson",
title = "Further applications of random sampling to
computational geometry",
crossref = "ACM:1986:PEA",
pages = "414--423",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p414-clarkson/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p414-clarkson/p414-clarkson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Dobkin:1986:PCP,
author = "D. Dobkin and H. Edelsbrunner and C. K. Yap",
title = "Probing convex polytopes",
crossref = "ACM:1986:PEA",
pages = "424--432",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p424-dobkin/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p424-dobkin/p424-dobkin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bern:1986:TPR,
author = "M. W. Bern",
title = "Two probabilistic results on rectilinear {Steiner}
trees",
crossref = "ACM:1986:PEA",
pages = "433--441",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p433-bern/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p433-bern/p433-bern.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Furedi:1986:CVD,
author = "Z. Furedi and I. Barany",
title = "Computing the volume is difficult",
crossref = "ACM:1986:PEA",
pages = "442--447",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p442-furedi/",
acknowledgement = ack-nhfb,
}
@InProceedings{Siegel:1986:AIF,
author = "A. Siegel",
title = "Aspects of information flow in {VLSI} circuits",
crossref = "ACM:1986:PEA",
pages = "448--459",
year = "1986",
bibdate = "Wed Feb 20 18:33:46 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/12130/p448-siegel/;
http://www.acm.org/pubs/articles/proceedings/stoc/12130/p448-siegel/p448-siegel.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Coppersmith:1987:MMA,
author = "D. Coppersmith and S. Winograd",
title = "Matrix multiplication via arithmetic progressions",
crossref = "ACM:1987:PNA",
pages = "1--6",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p1-coppersmith/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p1-coppersmith/p1-coppersmith.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1987:SMC,
author = "A. Goldberg and R. Tarjan",
title = "Solving minimum-cost flow problems by successive
approximation",
crossref = "ACM:1987:PNA",
pages = "7--18",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p7-goldberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p7-goldberg/p7-goldberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Frederickson:1987:NAA,
author = "G. N. Frederickson",
title = "A new approach to all pairs shortest paths in planar
graphs",
crossref = "ACM:1987:PNA",
pages = "19--28",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p19-frederickson/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p19-frederickson/p19-frederickson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Vaidya:1987:ALP,
author = "P. M. Vaidya",
title = "An algorithm for linear programming which requires
{$O(((m + n)n^2 + (m + n)^{1.5}n)L)$} arithmetic
operations",
crossref = "ACM:1987:PNA",
pages = "29--38",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p29-vaidya/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p29-vaidya/p29-vaidya.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1987:LTA,
author = "A. Aggarwal and L. Guibas and J. Saxe and P. Shor",
title = "A linear time algorithm for computing the {Voronoi}
diagram of a convex polygon",
crossref = "ACM:1987:PNA",
pages = "39--45",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p39-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p39-aggarwal/p39-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Iwano:1987:TCI,
author = "K. Iwano and K. Steiglitz",
title = "Testing for cycles in infinite graphs with periodic
structure",
crossref = "ACM:1987:PNA",
pages = "46--55",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p46-iwano/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p46-iwano/p46-iwano.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Clarkson:1987:AAS,
author = "K. Clarkson",
title = "Approximation algorithms for shortest path motion
planning",
crossref = "ACM:1987:PNA",
pages = "56--65",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p56-clarkson/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p56-clarkson/p56-clarkson.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Chazelle:1987:CCC,
author = "B. Chazelle and H. Edelsbrunner and L. Guibas",
title = "The complexity of cutting convex polytypes",
crossref = "ACM:1987:PNA",
pages = "66--76",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p66-chazelle/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p66-chazelle/p66-chazelle.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Smolensky:1987:AMT,
author = "R. Smolensky",
title = "Algebraic methods in the theory of lower bounds for
{Boolean} circuit complexity",
crossref = "ACM:1987:PNA",
pages = "77--82",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p77-smolensky/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p77-smolensky/p77-smolensky.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Beame:1987:OBD,
author = "P. Beame and J. H{\aa}stad",
title = "Optimal bounds for decision problems on the {CRCW
PRAM}",
crossref = "ACM:1987:PNA",
pages = "83--93",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p83-beame/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p83-beame/p83-beame.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Maass:1987:TTB,
author = "W. Maass and G. Schnitger and E. Szemeredi",
title = "Two tapes are better than one for off-line {Turing}
machines",
crossref = "ACM:1987:PNA",
pages = "94--100",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p94-maass/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p94-maass/p94-maass.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Barrington:1987:FMF,
author = "D. Barrington and D. Therien",
title = "Finite monoids and the fine structure of {NC$^1$}",
crossref = "ACM:1987:PNA",
pages = "101--109",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p101-barrington/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p101-barrington/p101-barrington.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Hemachandra:1987:SEH,
author = "L. A. Hemachandra",
title = "The strong exponential hierarchy collapses",
crossref = "ACM:1987:PNA",
pages = "110--122",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p110-hemachandra/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p110-hemachandra/p110-hemachandra.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Buss:1987:BFV,
author = "S. R. Buss",
title = "The {Boolean} formula value problem is in {ALOGTIME}",
crossref = "ACM:1987:PNA",
pages = "123--131",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p123-buss/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p123-buss/p123-buss.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ajtai:1987:DSL,
author = "M. Ajtai and J. Komlos and E. Szemeredi",
title = "Deterministic simulation in {LOGSPACE}",
crossref = "ACM:1987:PNA",
pages = "132--140",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p132-ajtai/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p132-ajtai/p132-ajtai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Venkateswaran:1987:PCL,
author = "H. Venkateswaran",
title = "Properties that characterize {LOGCFL}",
crossref = "ACM:1987:PNA",
pages = "141--150",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p141-venkateswaran/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p141-venkateswaran/p141-venkateswaran.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Allender:1987:SCE,
author = "E. Allender",
title = "Some consequences of the existence of pseudorandom
generators",
crossref = "ACM:1987:PNA",
pages = "151--159",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p151-allender/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p151-allender/p151-allender.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Vazirani:1987:ECU,
author = "U. Vazirani",
title = "Efficiency considerations in using semi-random
sources",
crossref = "ACM:1987:PNA",
pages = "160--168",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p160-vazirani/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p160-vazirani/p160-vazirani.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Lichtenstein:1987:IRS,
author = "D. Lichtenstein and N. Linial and M. Saks",
title = "Imperfect random sources and discrete controlled
processes",
crossref = "ACM:1987:PNA",
pages = "169--177",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p169-lichtenstein/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p169-lichtenstein/p169-lichtenstein.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Furer:1987:PRC,
author = "M. Furer",
title = "The power of randomness for communication complexity",
crossref = "ACM:1987:PNA",
pages = "178--181",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p178-furer/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p178-furer/p178-furer.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldreich:1987:TTS,
author = "O. Goldreich",
title = "Towards a theory of software protection and simulation
by oblivious {RAMs}",
crossref = "ACM:1987:PNA",
pages = "182--194",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p182-goldreich/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p182-goldreich/p182-goldreich.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Abadi:1987:HIO,
author = "M. Abadi and J. Feigenbaum and J. Kilian",
title = "On hiding information from an oracle",
crossref = "ACM:1987:PNA",
pages = "195--203",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p195-abadi/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p195-abadi/p195-abadi.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fortnow:1987:CPZ,
author = "L. Fortnow",
title = "The complexity of perfect zero-knowledge",
crossref = "ACM:1987:PNA",
pages = "204--209",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p204-fortnow/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p204-fortnow/p204-fortnow.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fiege:1987:ZKP,
author = "U. Fiege and A. Fiat and A. Shamir",
title = "Zero knowledge proofs of identity",
crossref = "ACM:1987:PNA",
pages = "210--217",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p210-fiege/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p210-fiege/p210-fiege.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldreich:1987:HPM,
author = "O. Goldreich and S. Micali and A. Wigderson",
title = "How to play {ANY} mental game",
crossref = "ACM:1987:PNA",
pages = "218--229",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p218-goldreich/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p218-goldreich/p218-goldreich.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Awerbuch:1987:ODA,
author = "B. Awerbuch",
title = "Optimal distributed algorithms for minimum weight
spanning tree, counting, leader election, and related
problems",
crossref = "ACM:1987:PNA",
pages = "230--240",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p230-awerbuch/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p230-awerbuch/p230-awerbuch.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Haastad:1987:ABP,
author = "J. H{\aa}stad and T. Leighton and B. Rogoff",
title = "Analysis of backoff protocols for multiple access
channels",
crossref = "ACM:1987:PNA",
pages = "241--253",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p241-hastad/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p241-hastad/p241-hastad.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Miller:1987:DPC,
author = "G. Miller and S. Teng",
title = "Dynamic parallel complexity of computational
circuits",
crossref = "ACM:1987:PNA",
pages = "254--263",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p254-miller/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p254-miller/p254-miller.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Peleg:1987:CDP,
author = "D. Peleg and E. Upfal",
title = "Constructing disjoint paths on expander graphs",
crossref = "ACM:1987:PNA",
pages = "264--273",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p264-peleg/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p264-peleg/p264-peleg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Haastad:1987:RHP,
author = "J. H{\aa}stad and T. Leighton and M. Newman",
title = "Reconfiguring a hypercube in the presence of faults",
crossref = "ACM:1987:PNA",
pages = "274--284",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p274-hastad/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p274-hastad/p274-hastad.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kearns:1987:LBF,
author = "M. Kearns and M. Li and L. Pitt and L. Valiant",
title = "On the learnability of {Boolean} formulae",
crossref = "ACM:1987:PNA",
pages = "285--295",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p285-kearns/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p285-kearns/p285-kearns.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Natarajan:1987:LBF,
author = "B. K. Natarajan",
title = "On learning {Boolean} functions",
crossref = "ACM:1987:PNA",
pages = "296--304",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p296-natarajan/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p296-natarajan/p296-natarajan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1987:MHM,
author = "A. Aggarwal and B. Alpern and A. Chandra and M. Snir",
title = "A model for hierarchical memory",
crossref = "ACM:1987:PNA",
pages = "305--314",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p305-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p305-aggarwal/p305-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1987:PSB,
author = "A. Goldberg and S. Plotkin and G. Shannon",
title = "Parallel symmetry-breaking in sparse graphs",
crossref = "ACM:1987:PNA",
pages = "315--324",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p315-goldberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p315-goldberg/p315-goldberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1987:RNA,
author = "A. Aggarwal and R. Anderson",
title = "A random {NC} algorithm for depth first search",
crossref = "ACM:1987:PNA",
pages = "325--334",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p325-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p325-aggarwal/p325-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Miller:1987:NGT,
author = "G. Miller and V. Ramachandran",
title = "A new graphy triconnectivity algorithm and its
parallelization",
crossref = "ACM:1987:PNA",
pages = "335--344",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p335-miller/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p335-miller/p335-miller.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Mulmuley:1987:MEM,
author = "Ketan Mulmuley and Umesh V. Vazirani and Vijay V.
Vazirani",
title = "Matching is as easy as matrix inversion",
crossref = "ACM:1987:PNA",
pages = "345--354",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Naor:1987:FPA,
author = "J. Naor and M. Naor and A. Schaffer",
title = "Fast parallel algorithms for chordal graphs",
crossref = "ACM:1987:PNA",
pages = "355--364",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p355-naor/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p355-naor/p355-naor.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Dietz:1987:TAM,
author = "P. Dietz and D. Sleator",
title = "Two algorithms for maintaining order in a list",
crossref = "ACM:1987:PNA",
pages = "365--372",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p365-dietz/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p365-dietz/p365-dietz.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Borodin:1987:OOA,
author = "A. Borodin and N. Linial and M. Saks",
title = "An optimal online algorithm for metrical task
systems",
crossref = "ACM:1987:PNA",
pages = "373--382",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p373-borodin/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p373-borodin/p373-borodin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Munro:1987:STK,
author = "J. I. Munro",
title = "Searching a two key table under a single key",
crossref = "ACM:1987:PNA",
pages = "383--387",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p383-munro/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p383-munro/p383-munro.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Heath:1987:PNG,
author = "L. Heath and S. Istrail",
title = "The page number of genus $g$ graphs is {$O(g)$}",
crossref = "ACM:1987:PNA",
pages = "388--397",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p388-heath/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p388-heath/p388-heath.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ronyai:1987:SAD,
author = "L. Ronyai",
title = "Simple algebras are difficult",
crossref = "ACM:1987:PNA",
pages = "398--408",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p398-ronyai/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p398-ronyai/p398-ronyai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Babai:1987:PGN,
author = "L. Babai and E. Luks and A. Seress",
title = "Permutation groups in {NC}",
crossref = "ACM:1987:PNA",
pages = "409--420",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p409-babai/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p409-babai/p409-babai.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Shelah:1987:TSR,
author = "S. Shelah and J. Spencer",
title = "Threshold spectra for random graphs",
crossref = "ACM:1987:PNA",
pages = "421--424",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p421-shelah/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p421-shelah/p421-shelah.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kolaitis:1987:DPP,
author = "P. Kolaitis and M. Vardi",
title = "The decision problem for the probabilities of
higher-order properties",
crossref = "ACM:1987:PNA",
pages = "425--435",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p425-kolaitis/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p425-kolaitis/p425-kolaitis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bilardi:1987:STC,
author = "G. Bilardi and F. P. Preparata",
title = "Size-time complexity of {Boolean} networks for prefix
computations",
crossref = "ACM:1987:PNA",
pages = "436--442",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p436-bilardi/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p436-bilardi/p436-bilardi.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaltofen:1987:SFH,
author = "E. Kaltofen",
title = "Single-factor {Hensel} lifting and its application to
the straight-line complexity of certain polynomials",
crossref = "ACM:1987:PNA",
pages = "443--452",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p443-kaltofen/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p443-kaltofen/p443-kaltofen.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bach:1987:RAS,
author = "E. Bach",
title = "Realistic analysis of some randomized algorithms",
crossref = "ACM:1987:PNA",
pages = "453--461",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p453-bach/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p453-bach/p453-bach.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Adleman:1987:RPR,
author = "L. Adleman and M. Huang",
title = "Recognizing primes in random polynomial time",
crossref = "ACM:1987:PNA",
pages = "462--469",
year = "1987",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/28395/p462-adleman/;
http://www.acm.org/pubs/articles/proceedings/stoc/28395/p462-adleman/p462-adleman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1988:CTN,
author = "Michael Ben-Or and Avi Wigderson",
title = "Completeness theorems for non-cryptographic
fault-tolerant distributed computation",
crossref = "ACM:1988:PTA",
pages = "1--10",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p1-ben-or/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p1-ben-or/p1-ben-or.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Chaum:1988:MUS,
author = "David Chaum and Ivaa Damgard",
title = "Multiparty unconditionally secure protocols",
crossref = "ACM:1988:PTA",
pages = "11--19",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p11-chaum/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p11-chaum/p11-chaum.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kilian:1988:FCO,
author = "Joe Kilian",
title = "Founding cryptography on oblivious transfer",
crossref = "ACM:1988:PTA",
pages = "20--31",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p20-kilian/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p20-kilian/p20-kilian.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bellare:1988:HSG,
author = "Mihir Bellare and Silvio Micali",
title = "How to sign given any trapdoor function",
crossref = "ACM:1988:PTA",
pages = "32--42",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p32-bellare/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p32-bellare/p32-bellare.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Peleg:1988:TBS,
author = "David Peleg and Eli Upfal",
title = "A tradeoff between space and efficiency for routing
tables",
crossref = "ACM:1988:PTA",
pages = "43--52",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p43-peleg/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p43-peleg/p43-peleg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Halpern:1988:RAK,
author = "Joseph Halpern and Joseph Halpern Vardi",
title = "Reasoning about knowledge and time in asynchronous
systems",
crossref = "ACM:1988:PTA",
pages = "53--65",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p53-halpern/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p53-halpern/p53-halpern.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Berman:1988:IFT,
author = "Piotr Berman and J'anos Simon",
title = "Investigations of fault-tolerant networks of
computers",
crossref = "ACM:1988:PTA",
pages = "66--77",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p66-berman/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p66-berman/p66-berman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1988:TNA,
author = "Danny Dolev and Eli Gafni and Nir Shavit",
title = "Toward a non-atomic era: $l$-exclusion as a test
case",
crossref = "ACM:1988:PTA",
pages = "78--92",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p78-dolev/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p78-dolev/p78-dolev.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Krizanc:1988:TRT,
author = "Danny Krizanc and David Peleg and Eli Upfal",
title = "A time-randomness tradeoff for oblivious routing",
crossref = "ACM:1988:PTA",
pages = "93--102",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p93-krizanc/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p93-krizanc/p93-krizanc.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Blum:1988:NIZ,
author = "Manuel Blum and Paul Feldman and Silvio Micali",
title = "Non-interactive zero-knowledge and its applications",
crossref = "ACM:1988:PTA",
pages = "103--112",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p103-blum/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p103-blum/p103-blum.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1988:MPI,
author = "Michael Ben-Or and Shafi Goldwasser and Joe Kilian and
Avi Widgerson",
title = "Multi-prover interactive proofs: how to remove
intractability",
crossref = "ACM:1988:PTA",
pages = "113--131",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p113-ben-or/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p113-ben-or/p113-ben-or.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Halpern:1988:KBA,
author = "Joseph Halpern and Yjoram Moses and Mark Tuttle",
title = "A knowledge-based analysis of zero knowledge",
crossref = "ACM:1988:PTA",
pages = "132--147",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p132-halpern/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p132-halpern/p132-halpern.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Feldman:1988:OAB,
author = "Paul Feldman and Silvio Micali",
title = "Optimal algorithms for {Byzantine} agreement",
crossref = "ACM:1988:PTA",
pages = "148--161",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p148-feldman/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p148-feldman/p148-feldman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Halstenberg:1988:DMC,
author = "Bernd Halstenberg and Rudiger Reischuk",
title = "On different modes of communication",
crossref = "ACM:1988:PTA",
pages = "162--172",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p162-halstenberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p162-halstenberg/p162-halstenberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1988:VMA,
author = "Alok Aggarwal and Ashok Chandra",
title = "Virtual memory algorithms",
crossref = "ACM:1988:PTA",
pages = "173--185",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p173-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p173-aggarwal/p173-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Hajnal:1988:CCG,
author = "Andr{\'a}s Hajnal and Wolfgang Maass and Gy{\"o}rgy
Tur{\'a}n",
title = "On the communication complexity of graph properties",
crossref = "ACM:1988:PTA",
pages = "186--191",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p186-hajnal/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p186-hajnal/p186-hajnal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Bhatt:1988:OSB,
author = "Sandeep Bhatt and Fan Chung and Jia-Wei Hong and
Arnold Rosenberg",
title = "Optimal simulations by {Butterfly Networks}",
crossref = "ACM:1988:PTA",
pages = "192--204",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p192-bhatt/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p192-bhatt/p192-bhatt.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1988:ECV,
author = "Alok Aggarwal and Ashok Chandra and Prabhakar
Raghavan",
title = "Energy consumption in {VLSI} circuits",
crossref = "ACM:1988:PTA",
pages = "205--216",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p205-aggarwal/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p205-aggarwal/p205-aggarwal.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Venkatesan:1988:RIG,
author = "Ramarathnam Venkatesan and Leonid Levin",
title = "Random instances of a graph coloring problem are
hard",
crossref = "ACM:1988:PTA",
pages = "217--222",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p217-venkatesan/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p217-venkatesan/p217-venkatesan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Yannakakis:1988:ECO,
author = "Mihalis Yannakakis",
title = "Expressing combinatorial optimization problems by
linear programs",
crossref = "ACM:1988:PTA",
pages = "223--228",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p223-yannakakis/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p223-yannakakis/p223-yannakakis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Papadimitriou:1988:OAC,
author = "Christos Papadimitriou and Mihalis Yannakakis",
title = "Optimization, approximation, and complexity classes",
crossref = "ACM:1988:PTA",
pages = "229--234",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p229-papadimitriou/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p229-papadimitriou/p229-papadimitriou.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Jerrum:1988:CRM,
author = "Mark Jerrum and Alistair Sinclair",
title = "Conductance and the rapid mixing property for {Markov}
chains: the approximation of permanent resolved",
crossref = "ACM:1988:PTA",
pages = "235--244",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p235-jerrum/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p235-jerrum/p235-jerrum.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ko:1988:RPT,
author = "Ker-I. Ko",
title = "Relativized polynomial time hierarchies having exactly
{$K$} levels",
crossref = "ACM:1988:PTA",
pages = "245--253",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p245-ko/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p245-ko/p245-ko.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cleve:1988:CAF,
author = "Richard Cleve",
title = "Computing algebraic formulas with a constant number of
registers",
crossref = "ACM:1988:PTA",
pages = "254--257",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p254-cleve/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p254-cleve/p254-cleve.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kalyanasundaram:1988:PWP,
author = "Balasubramanian Kalyanasundaram and George Schnitger",
title = "On the power of white pebbles",
crossref = "ACM:1988:PTA",
pages = "258--266",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p258-kalyanasundaram/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p258-kalyanasundaram/p258-kalyanasundaram.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kearns:1988:LPM,
author = "Michael Kearns and Ming Li",
title = "Learning in the presence of malicious errors",
crossref = "ACM:1988:PTA",
pages = "267--280",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p267-kearns/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p267-kearns/p267-kearns.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Gurevich:1988:NLT,
author = "Yuri Gurevich and Saharon Shelah",
title = "Nondeterministic linear tasks may require
substantially nonlinear deterministic time in the case
of sublinear work space",
crossref = "ACM:1988:PTA",
pages = "281--289",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p281-gurevich/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p281-gurevich/p281-gurevich.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karp:1988:RPB,
author = "Richard Karp and Yanjun Zhang",
title = "A randomized parallel branch-and-bound procedure",
crossref = "ACM:1988:PTA",
pages = "290--300",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p290-karp/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p290-karp/p290-karp.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-Or:1988:DAS,
author = "Michael Ben-Or",
title = "A deterministic algorithm for sparse multivariate
polynomial interpolation",
crossref = "ACM:1988:PTA",
pages = "301--309",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p301-ben-or/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p301-ben-or/p301-ben-or.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karloff:1988:RAP,
author = "Howard Karloff and Prabhakar Raghavan",
title = "Randomized algorithms and pseudorandom numbers",
crossref = "ACM:1988:PTA",
pages = "310--321",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p310-karloff/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p310-karloff/p310-karloff.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Manasse:1988:CAL,
author = "Mark Manasse and Lyle McGeoch and Daniel Sleator",
title = "Competitive algorithms for on-line problems",
crossref = "ACM:1988:PTA",
pages = "322--333",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p322-manasse/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p322-manasse/p322-manasse.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kannan:1988:IRG,
author = "Sampath Kannan and Moni Naor and Steven Rudich",
title = "Implicit representation of graphs",
crossref = "ACM:1988:PTA",
pages = "334--343",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p334-kannan/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p334-kannan/p334-kannan.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fiat:1988:SSM,
author = "Amos Fiat and Moni Naor and Alexandro Sch{\"a}ffer and
Jeanette Schmidt and Alan Siegel",
title = "Storing and searching a multikey table",
crossref = "ACM:1988:PTA",
pages = "344--353",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p344-fiat/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p344-fiat/p344-fiat.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Lueker:1988:MAD,
author = "George Lueker and Mariko Molodowitch",
title = "More analysis of double hashing",
crossref = "ACM:1988:PTA",
pages = "354--359",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p354-lueker/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p354-lueker/p354-lueker.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Loebl:1988:LUS,
author = "Martin Loebl and Jaroslav Ne{\v{s}}et{\v{r}}il",
title = "Linearity and unprovability of set union problem",
crossref = "ACM:1988:PTA",
pages = "360--366",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p360-loebl/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p360-loebl/p360-loebl.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fiat:1988:NOH,
author = "Amos Fiat and Moni Naor and Jeanette Schmidt and Alan
Siegel",
title = "Non-oblivious hashing",
crossref = "ACM:1988:PTA",
pages = "367--376",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p367-fiat/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p367-fiat/p367-fiat.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Orlin:1988:FSP,
author = "James Orlin",
title = "A faster strongly polynomial minimum cost flow
algorithm",
crossref = "ACM:1988:PTA",
pages = "377--387",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p377-orlin/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p377-orlin/p377-orlin.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldberg:1988:FMC,
author = "Andrew Goldberg and Robert Tarjan",
title = "Finding minimum-cost circulations by canceling
negative cycles",
crossref = "ACM:1988:PTA",
pages = "388--397",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p388-goldberg/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p388-goldberg/p388-goldberg.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1988:DCD,
author = "S. Rao Kosaraju and Gregory Sullivan",
title = "Detecting cycles in dynamic graphs in polynomial
time",
crossref = "ACM:1988:PTA",
pages = "398--406",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p398-kosaraju/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p398-kosaraju/p398-kosaraju.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Gabow:1988:FFG,
author = "Harold Gabow and Herbert Westermann",
title = "Forests, frames, and games: algorithms for matroid
sums and applications",
crossref = "ACM:1988:PTA",
pages = "407--421",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p407-gabow/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p407-gabow/p407-gabow.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Vaidya:1988:GHM,
author = "Pravin Vaidya",
title = "Geometry helps in matching",
crossref = "ACM:1988:PTA",
pages = "422--425",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p422-vaidya/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p422-vaidya/p422-vaidya.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{deFraysseix:1988:SSS,
author = "Hubert de Fraysseix and J{\'a}nos Pach and Richard
Pollack",
title = "Small sets supporting fary embeddings of planar
graphs",
crossref = "ACM:1988:PTA",
pages = "426--433",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/62212/p426-de_fraysseix/p426-de_fraysseix.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/62212/p426-de_fraysseix/",
acknowledgement = ack-nhfb,
}
@InProceedings{Feder:1988:OAA,
author = "Tom{\'a}s Feder and Daniel Greene",
title = "Optimal algorithms for approximate clustering",
crossref = "ACM:1988:PTA",
pages = "434--444",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p434-feder/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p434-feder/p434-feder.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Fortune:1988:PCM,
author = "Steven Fortune and Gordon Wilfong",
title = "Planning constrained motion",
crossref = "ACM:1988:PTA",
pages = "445--459",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p445-fortune/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p445-fortune/p445-fortune.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Canny:1988:SAG,
author = "John Canny",
title = "Some algebraic and geometric computations in
{PSPACE}",
crossref = "ACM:1988:PTA",
pages = "460--469",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p460-canny/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p460-canny/p460-canny.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{King:1988:LBC,
author = "Valerie King",
title = "Lower bounds on the complexity of graph properties",
crossref = "ACM:1988:PTA",
pages = "468--476",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p468-king/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p468-king/p468-king.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Cosmadakis:1988:DOP,
author = "Stavros Cosmadakis and Haim Gaifman and Paris
Kanellakis and Moshe Vardi",
title = "Decidable optimization problems for database logic
programs",
crossref = "ACM:1988:PTA",
pages = "477--490",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p477-cosmadakis/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p477-cosmadakis/p477-cosmadakis.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Istrail:1988:PUT,
author = "Sorin Istrail",
title = "Polynomial universal traversing sequences for cycles
are constructible",
crossref = "ACM:1988:PTA",
pages = "491--503",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p491-istrail/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p491-istrail/p491-istrail.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Pintz:1988:TIS,
author = "J{\'a}nos Pintz and William Steiger and Endre
Szemer{\'e}di",
title = "Two infinite sets of primes with fast primality
tests",
crossref = "ACM:1988:PTA",
pages = "504--509",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p504-pintz/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p504-pintz/p504-pintz.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Papadimitriou:1988:TAI,
author = "Christos Papadimitriou and Mihalis Yannakakis",
title = "Towards an architecture-independent analysis of
parallel algorithms",
crossref = "ACM:1988:PTA",
pages = "510--513",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p510-papadimitriou/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p510-papadimitriou/p510-papadimitriou.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Gabow:1988:AOS,
author = "Harold Gabow and Robert Tarjan",
title = "Almost-optimum speed-ups of algorithms for bipartite
matching and related problems",
crossref = "ACM:1988:PTA",
pages = "514--527",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p514-gabow/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p514-gabow/p514-gabow.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Adleman:1988:USA,
author = "Leonard Adleman and Kireeti Kompella",
title = "Using smoothness to achieve parallelism",
crossref = "ACM:1988:PTA",
pages = "528--538",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p528-adleman/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p528-adleman/p528-adleman.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Karchmer:1988:MCC,
author = "Mauricio Karchmer and Avi Wigderson",
title = "Monotone circuits for connectivity require
super-logarithmic depth",
crossref = "ACM:1988:PTA",
pages = "539--550",
year = "1988",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/stoc/62212/p539-karchmer/;
http://www.acm.org/pubs/articles/proceedings/stoc/62212/p539-karchmer/p539-karchmer.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Babai:1989:MPL,
author = "L. Babai and N. Nisan",
title = "Multiparty protocols and logspace-hard pseudorandom
sequences",
crossref = "ACM:1989:PTF",
pages = "1--11",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p1-babai/p1-babai.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p1-babai/",
acknowledgement = ack-nhfb,
}
@InProceedings{Impagliazzo:1989:PRG,
author = "R. Impagliazzo and L. A. Levin and M. Luby",
title = "Pseudo-random generation from one-way functions",
crossref = "ACM:1989:PTF",
pages = "12--24",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p12-impagliazzo/p12-impagliazzo.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p12-impagliazzo/",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldreich:1989:HCP,
author = "O. Goldreich and L. A. Levin",
title = "A hard-core predicate for all one-way functions",
crossref = "ACM:1989:PTF",
pages = "25--32",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p25-goldreich/p25-goldreich.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p25-goldreich/",
acknowledgement = ack-nhfb,
}
@InProceedings{Naor:1989:UOW,
author = "M. Naor and M. Yung",
title = "Universal one-way hash functions and their
cryptographic applications",
crossref = "ACM:1989:PTF",
pages = "33--43",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p33-naor/p33-naor.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p33-naor/",
acknowledgement = ack-nhfb,
}
@InProceedings{Impagliazzo:1989:LPC,
author = "R. Impagliazzo and S. Rudich",
title = "Limits on the provable consequences of one-way
permutations",
crossref = "ACM:1989:PTF",
pages = "44--61",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p44-impagliazzo/p44-impagliazzo.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p44-impagliazzo/",
acknowledgement = ack-nhfb,
}
@InProceedings{Chor:1989:ZOL,
author = "B. Chor and E. Kushilevitz",
title = "A zero-one law for {Boolean} privacy",
crossref = "ACM:1989:PTF",
pages = "62--72",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p62-chor/p62-chor.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p62-chor/",
acknowledgement = ack-nhfb,
}
@InProceedings{Rabin:1989:VSS,
author = "T. Rabin and M. Ben-Or",
title = "Verifiable secret sharing and multiparty protocols
with honest majority",
crossref = "ACM:1989:PTF",
pages = "73--85",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p73-rabin/p73-rabin.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p73-rabin/",
acknowledgement = ack-nhfb,
}
@InProceedings{Blum:1989:DPC,
author = "M. Blum and S. Kanna",
title = "Designing programs that check their work",
crossref = "ACM:1989:PTF",
pages = "86--97",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p86-blum/p86-blum.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p86-blum/",
acknowledgement = ack-nhfb,
}
@InProceedings{Vallee:1989:PFI,
author = "B. Vall{\'e}e",
title = "Provably fast integer factoring with quasi-uniform
small quadratic residues",
crossref = "ACM:1989:PTF",
pages = "98--106",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p98-vallee/p98-vallee.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p98-vallee/",
acknowledgement = ack-nhfb,
}
@InProceedings{Cook:1989:FIF,
author = "S. Cook and A. Urquhart",
title = "Functional interpretations of feasibly constructive
arithmetic",
crossref = "ACM:1989:PTF",
pages = "107--112",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p107-cook/p107-cook.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p107-cook/",
acknowledgement = ack-nhfb,
}
@InProceedings{Afrati:1989:ERR,
author = "F. Afrati and S. S. Cosmadakis",
title = "Expressiveness of restricted recursive queries",
crossref = "ACM:1989:PTF",
pages = "113--126",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p113-afrati/p113-afrati.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p113-afrati/",
acknowledgement = ack-nhfb,
}
@InProceedings{Safra:1989:ATL,
author = "S. Safra and M. Y. Vardi",
title = "On $\omega$-automata and temporal logic",
crossref = "ACM:1989:PTF",
pages = "127--137",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p127-safra/p127-safra.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p127-safra/",
acknowledgement = ack-nhfb,
}
@InProceedings{Ierardi:1989:QET,
author = "D. Ierardi",
title = "Quantifier elimination in the theory of an
algebraically-closed field",
crossref = "ACM:1989:PTF",
pages = "138--147",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p138-ierardi/p138-ierardi.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p138-ierardi/",
acknowledgement = ack-nhfb,
}
@InProceedings{Fortnow:1989:PCL,
author = "L. Fortnow and M. Sipser",
title = "Probabilistic computation and linear time",
crossref = "ACM:1989:PTF",
pages = "148--156",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p148-fortnow/p148-fortnow.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p148-fortnow/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kurtz:1989:ICF,
author = "S. A. Kurtz and S. R. Mahaney and J. S. Royer",
title = "The ismorphism conjecture fails relative to a random
oracle",
crossref = "ACM:1989:PTF",
pages = "157--166",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p157-kurtz/p157-kurtz.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p157-kurtz/",
acknowledgement = ack-nhfb,
}
@InProceedings{Razborov:1989:MA,
author = "A. A. Razborov",
title = "On the method of approximations",
crossref = "ACM:1989:PTF",
pages = "167--176",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p167-razborov/p167-razborov.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p167-razborov/",
acknowledgement = ack-nhfb,
}
@InProceedings{Bshouty:1989:EDS,
author = "N. H. Bshouty",
title = "On the extended direct sum conjecture",
crossref = "ACM:1989:PTF",
pages = "177--185",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p177-bshouty/p177-bshouty.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p177-bshouty/",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:1989:CLC,
author = "A. C. Yao",
title = "Circuits and local computation",
crossref = "ACM:1989:PTF",
pages = "186--196",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p186-yao/p186-yao.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p186-yao/",
acknowledgement = ack-nhfb,
}
@InProceedings{Beame:1989:GST,
author = "P. Beame",
title = "A general sequential time-space tradeoff for finding
unique elements",
crossref = "ACM:1989:PTF",
pages = "197--203",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p197-beame/p197-beame.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p197-beame/",
acknowledgement = ack-nhfb,
}
@InProceedings{Ben-David:1989:TAC,
author = "S. Ben-David and B. Chor and O. Goldreich",
title = "On the theory of average case complexity",
crossref = "ACM:1989:PTF",
pages = "204--216",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p204-ben-david/p204-ben-david.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p204-ben-david/",
acknowledgement = ack-nhfb,
}
@InProceedings{Lam:1989:TBC,
author = "T. Lam and P. Tiwari and M. Tompa",
title = "Tradeoffs between communication and space",
crossref = "ACM:1989:PTF",
pages = "217--226",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p217-lam/p217-lam.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p217-lam/",
acknowledgement = ack-nhfb,
}
@InProceedings{Koch:1989:WPE,
author = "R. Koch and T. Leighton and B. Maggs and S. Rao",
title = "Work-preserving emulations of fixed-connection
networks",
crossref = "ACM:1989:PTF",
pages = "227--240",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p227-koch/p227-koch.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p227-koch/",
acknowledgement = ack-nhfb,
}
@InProceedings{Upfal:1989:DPR,
author = "E. Upfal",
title = "An {$O(\log N)$} deterministic packet routing scheme",
crossref = "ACM:1989:PTF",
pages = "241--249",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p241-upfal/p241-upfal.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p241-upfal/",
acknowledgement = ack-nhfb,
}
@InProceedings{Haastad:1989:FCU,
author = "J. H{\aa}stad and T. Leighton",
title = "Fast computation using faulty hypercubes",
crossref = "ACM:1989:PTF",
pages = "251--263",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p251-hastad/p251-hastad.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p251-hastad/",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1989:OSI,
author = "J. H. Reif",
title = "Optimal size integer division circuits",
crossref = "ACM:1989:PTF",
pages = "264--273",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p264-reif/p264-reif.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p264-reif/",
acknowledgement = ack-nhfb,
}
@InProceedings{Alon:1989:CRC,
author = "N. Alon and A. Bar-Noy and N. Linial and D. Peleg",
title = "On the complexity of radio communication",
crossref = "ACM:1989:PTF",
pages = "274--285",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p274-alon/p274-alon.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p274-alon/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kao:1989:LRG,
author = "M.-Y. Kao and G. E. Shannon",
title = "Local reorientation, global order, and planar
topology",
crossref = "ACM:1989:PTF",
pages = "286--296",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p286-kao/p286-kao.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p286-kao/",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:1989:PDF,
author = "A. Aggarwal and R. J. Anderson and M.-Y. Kao",
title = "Parallel depth-first search in general directed
graphs",
crossref = "ACM:1989:PTF",
pages = "297--308",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p297-aggarwal/p297-aggarwal.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p297-aggarwal/",
acknowledgement = ack-nhfb,
}
@InProceedings{Berkman:1989:HPP,
author = "O. Berkman and Z. Galil and B. Schieber and U.
Vishkin",
title = "Highly parallelizable problems",
crossref = "ACM:1989:PTF",
pages = "309--319",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p309-berkman/p309-berkman.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p309-berkman/",
acknowledgement = ack-nhfb,
}
@InProceedings{Boppana:1989:OSB,
author = "R. B. Boppana",
title = "Optimal separations between concurrent-write parallel
machines",
crossref = "ACM:1989:PTF",
pages = "320--326",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p320-boppana/p320-boppana.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p320-boppana/",
acknowledgement = ack-nhfb,
}
@InProceedings{Nisan:1989:CPD,
author = "N. Nisan",
title = "{CREW PRAMS} and decision trees",
crossref = "ACM:1989:PTF",
pages = "327--335",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p327-nisan/p327-nisan.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p327-nisan/",
acknowledgement = ack-nhfb,
}
@InProceedings{Fiat:1989:IPS,
author = "A. Fiat and M. Noar",
title = "Implicit {$O(1)$} probe search",
crossref = "ACM:1989:PTF",
pages = "336--344",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p336-fiat/p336-fiat.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p336-fiat/",
acknowledgement = ack-nhfb,
}
@InProceedings{Fredman:1989:CPC,
author = "M. Fredman and M. Saks",
title = "The cell probe complexity of dynamic data structures",
crossref = "ACM:1989:PTF",
pages = "345--354",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p345-fredman/p345-fredman.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p345-fredman/",
acknowledgement = ack-nhfb,
}
@InProceedings{Schmidt:1989:AUP,
author = "J. P. Schmidt and A. Siegel",
title = "On aspects of university and performance for closed
hashing",
crossref = "ACM:1989:PTF",
pages = "355--366",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p355-schmidt/p355-schmidt.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p355-schmidt/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kenyon-Mathieu:1989:VPO,
author = "C. Kenyon-Mathieu and V. King",
title = "Verifying partial orders",
crossref = "ACM:1989:PTF",
pages = "367--374",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p367-kenyon-mathieu/p367-kenyon-mathieu.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p367-kenyon-mathieu/",
acknowledgement = ack-nhfb,
}
@InProceedings{Dyer:1989:RPT,
author = "M. Dyer and A. Frieze",
title = "A random polynomial time algorithm for approximating
the volume of convex bodies",
crossref = "ACM:1989:PTF",
pages = "375--381",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p375-dyer/p375-dyer.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p375-dyer/",
acknowledgement = ack-nhfb,
}
@InProceedings{Chazelle:1989:LSC,
author = "B. Chazelle and H. Edelsbrunner and L. Guibas and M.
Sharir",
title = "Lines in space-combinators, algorithms and
applications",
crossref = "ACM:1989:PTF",
pages = "382--393",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p382-chazelle/p382-chazelle.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p382-chazelle/",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1989:PNR,
author = "J. H. Reif and S. Sen",
title = "Polling: a new randomized sampling technique for
computational geometry",
crossref = "ACM:1989:PTF",
pages = "394--404",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p394-reif/p394-reif.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p394-reif/",
acknowledgement = ack-nhfb,
}
@InProceedings{Goodman:1989:CRO,
author = "J. E. Goodman and R. Pollack and B. Sturmfels",
title = "Coordinate representation of order types requires
exponential storage",
crossref = "ACM:1989:PTF",
pages = "405--410",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p405-goodman/p405-goodman.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p405-goodman/",
acknowledgement = ack-nhfb,
}
@InProceedings{Rivest:1989:IFA,
author = "R. L. Rivest and R. E. Schapire",
title = "Inference of finite automata using homing sequences",
crossref = "ACM:1989:PTF",
pages = "411--420",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p411-rivest/p411-rivest.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p411-rivest/",
acknowledgement = ack-nhfb,
}
@InProceedings{Pitt:1989:MCD,
author = "L. Pitt and M. K. Warmuth",
title = "The minimum consistent {DFA} problem cannot be
approximated within and polynomial",
crossref = "ACM:1989:PTF",
pages = "421--432",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p421-pitt/p421-pitt.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p421-pitt/",
acknowledgement = ack-nhfb,
}
@InProceedings{Kearns:1989:CLL,
author = "M. Kearns and L. G. Valiant",
title = "Cryptographic limitations on learning {Boolean}
formulae and finite automata",
crossref = "ACM:1989:PTF",
pages = "433--444",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p433-kearns/p433-kearns.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p433-kearns/",
acknowledgement = ack-nhfb,
}
@InProceedings{Birget:1989:PCR,
author = "J.-C. Birget",
title = "Proof of a conjecture of {R. Kannan}",
crossref = "ACM:1989:PTF",
pages = "445--453",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p445-birget/p445-birget.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p445-birget/",
acknowledgement = ack-nhfb,
}
@InProceedings{Dolev:1989:BCT,
author = "D. Dolev and N. Shavit",
title = "Bounded concurrrent time-stamp systems are
constructible",
crossref = "ACM:1989:PTF",
pages = "454--466",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p454-dolev/p454-dolev.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p454-dolev/",
acknowledgement = ack-nhfb,
}
@InProceedings{Graham:1989:IRB,
author = "R. L. Graham and A. C. Yao",
title = "On the improbability of reaching {Byzantine}
agreements",
crossref = "ACM:1989:PTF",
pages = "467--478",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p467-graham/p467-graham.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p467-graham/",
acknowledgement = ack-nhfb,
}
@InProceedings{Awerbuch:1989:CDD,
author = "B. Awerbuch and A. Bar-Noy and N. Linial and D.
Peleg",
title = "Compact distributed data structures for adaptive
routing",
crossref = "ACM:1989:PTF",
pages = "479--489",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p479-awerbuch/p479-awerbuch.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p479-awerbuch/",
acknowledgement = ack-nhfb,
}
@InProceedings{Awerbuch:1989:RDS,
author = "B. Awerbuch",
title = "Randomized distributed shortest paths algorithms",
crossref = "ACM:1989:PTF",
pages = "490--500",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p490-awerbuch/p490-awerbuch.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p490-awerbuch/",
acknowledgement = ack-nhfb,
}
@InProceedings{Fellows:1989:SDE,
author = "M. R. Fellows and M. A. Langston",
title = "On search decision and the efficiency of
polynomial-time algorithms",
crossref = "ACM:1989:PTF",
pages = "501--512",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p501-fellows/p501-fellows.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p501-fellows/",
acknowledgement = ack-nhfb,
}
@InProceedings{Feder:1989:NFP,
author = "T. Feder",
title = "A new fixed point approach for stable networks stable
marriages",
crossref = "ACM:1989:PTF",
pages = "513--522",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p513-feder/p513-feder.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p513-feder/",
acknowledgement = ack-nhfb,
}
@InProceedings{Cohen:1989:SPT,
author = "E. Cohen and N. Megiddo",
title = "Strongly polynomial-time and {NC} algorithms for
detecting cycles in dynamic graphs",
crossref = "ACM:1989:PTF",
pages = "523--534",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p523-cohen/p523-cohen.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p523-cohen/",
acknowledgement = ack-nhfb,
}
@InProceedings{Blum:1989:AAC,
author = "A. Blum",
title = "An {$O(n^{0.4})$}-approximation algorithm for
$3$-coloring",
crossref = "ACM:1989:PTF",
pages = "535--542",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p535-blum/p535-blum.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p535-blum/",
acknowledgement = ack-nhfb,
}
@InProceedings{Broder:1989:TST,
author = "A. Z. Broder and A. R. Karlin and P. Raghavan and E.
Upfal",
title = "Trading space for time in undirected $s$--$t$
connectivity",
crossref = "ACM:1989:PTF",
pages = "543--549",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p543-broder/p543-broder.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p543-broder/",
acknowledgement = ack-nhfb,
}
@InProceedings{Motwani:1989:EGA,
author = "R. Motwani",
title = "Expanding graphs and the average-case analysis of
algorithms for matchings and related problems",
crossref = "ACM:1989:PTF",
pages = "550--561",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p550-motwani/p550-motwani.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p550-motwani/",
acknowledgement = ack-nhfb,
}
@InProceedings{Borodin:1989:LBL,
author = "A. Borodin and W. L. Ruzzo and M. Tompa",
title = "Lower bounds on the length of universal traversal
sequences",
crossref = "ACM:1989:PTF",
pages = "562--573",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p562-borodin/p562-borodin.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p562-borodin/",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandra:1989:ERG,
author = "A. K. Chandra and P. Raghavan and W. L. Ruzzo and R.
Smolensky",
title = "The electrical resistance of a graph captures its
commute and cover times",
crossref = "ACM:1989:PTF",
pages = "574--586",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p574-chandra/p574-chandra.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p574-chandra/",
acknowledgement = ack-nhfb,
}
@InProceedings{Friedman:1989:SER,
author = "J. Friedman and J. Kahn and E. Szemer{\'e}di",
title = "On the second eigenvalue of random regular graphs",
crossref = "ACM:1989:PTF",
pages = "587--598",
year = "1989",
bibdate = "Wed Feb 20 18:33:47 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/73007/p587-friedman/p587-friedman.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/73007/p587-friedman/",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:1980:CPT,
editor = "ACM",
booktitle = "Conference proceedings of the twelfth annual {ACM}
Symposium on Theory of Computing: papers presented at
the symposium, Los Angeles, California, April 28--30,
1980",
title = "Conference proceedings of the twelfth annual {ACM}
Symposium on Theory of Computing: papers presented at
the symposium, Los Angeles, California, April 28--30,
1980",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "v + 447",
year = "1980",
ISBN = "0-89791-017-6 (paperback)",
ISBN-13 = "978-0-89791-017-0 (paperback)",
LCCN = "QA 76.6 A13 1980",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508800.",
price = "US\$17.00 (US\$14.00 to members)",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses; electronic
digital computers --- programming --- congresses",
}
@Proceedings{ACM:1981:CPT,
editor = "ACM",
booktitle = "Conference proceedings of the Thirteenth Annual {ACM}
Symposium on Theory of Computing: papers presented at
the Symposium, Milwaukee, Wisconsin, May 11--13, 1981",
title = "Conference proceedings of the Thirteenth Annual {ACM}
Symposium on Theory of Computing: papers presented at
the Symposium, Milwaukee, Wisconsin, May 11--13, 1981",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "v + 391",
year = "1981",
ISBN = "0-89791-041-9 (paperback)",
ISBN-13 = "978-0-89791-041-5 (paperback)",
LCCN = "????",
bibdate = "Thu Dec 03 08:30:27 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508810. Also published in {\em Journal
of computer and system sciences}, vol. 26, no. 3.",
acknowledgement = ack-nhfb,
keywords = "Electronic digital computers --- Programming ---
Congresses.; Machine theory --- Congresses.;
Computational complexity --- Congresses.",
}
@Proceedings{ACM:1982:PFA,
editor = "{ACM}",
booktitle = "Proceedings of the fourteenth annual {ACM} Symposium
on Theory of Computing, San Francisco, California, May
5--7, 1982",
title = "Proceedings of the fourteenth annual {ACM} Symposium
on Theory of Computing, San Francisco, California, May
5--7, 1982",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "v + 408",
year = "1982",
ISBN = "0-89791-070-2",
ISBN-13 = "978-0-89791-070-5",
LCCN = "QA75.5 .A14 1982",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508820.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses; programming
(electronic computers) --- congresses",
}
@Proceedings{ACM:1983:PFA,
editor = "{ACM}",
booktitle = "Proceedings of the fifteenth annual {ACM} Symposium on
Theory of Computing, Boston, Massachusetts, April
25--27, 1983",
title = "Proceedings of the fifteenth annual {ACM} Symposium on
Theory of Computing, Boston, Massachusetts, April
25--27, 1983",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "v + 487",
year = "1983",
ISBN = "0-89791-099-0",
ISBN-13 = "978-0-89791-099-6",
LCCN = "QA75.5.A14 1983",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508830.",
acknowledgement = ack-nhfb,
annote = "Sponsored by the ACM Special Interest Group for
Automata and Computability Theory.",
keywords = "computational complexity --- congresses; electronic
digital computers --- programming --- congresses",
}
@Proceedings{ACM:1984:PSA,
editor = "{ACM}",
booktitle = "Proceedings of the sixteenth annual {ACM} Symposium on
Theory of Computing, Washington, DC, April 30--May 2,
1984",
title = "Proceedings of the sixteenth annual {ACM} Symposium on
Theory of Computing, Washington, {DC}, April 30--May 2,
1984",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "vi + 547",
year = "1984",
ISBN = "0-89791-133-4",
ISBN-13 = "978-0-89791-133-7",
LCCN = "QA 76.6 A13 1984",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508840.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses",
}
@Proceedings{ACM:1985:PSA,
editor = "{ACM}",
booktitle = "Proceedings of the seventeenth annual {ACM} Symposium
on Theory of Computing, Providence, Rhode Island, May
6--8, 1985",
title = "Proceedings of the seventeenth annual {ACM} Symposium
on Theory of Computing, Providence, Rhode Island, May
6--8, 1985",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "vi + 484",
year = "1985",
ISBN = "0-89791-151-2 (paperback)",
ISBN-13 = "978-0-89791-151-1 (paperback)",
LCCN = "QA 76.6 A13 1985",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508850.",
acknowledgement = ack-nhfb,
keywords = "electronic digital computers --- programming ---
congresses; computational complexity --- congresses",
}
@Proceedings{ACM:1986:PEA,
editor = "{ACM}",
booktitle = "Proceedings of the Eighteenth annual {ACM} Symposium
on Theory of Computing, Berkeley, California, May
28--30, 1986",
title = "Proceedings of the Eighteenth annual {ACM} Symposium
on Theory of Computing, Berkeley, California, May
28--30, 1986",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "v + 461",
year = "1986",
ISBN = "0-89791-193-8",
ISBN-13 = "978-0-89791-193-1",
LCCN = "QA 76.6 A13 1986",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508860.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses; programming
(electronic computers) --- congresses",
}
@Proceedings{ACM:1987:PNA,
editor = "{ACM}",
booktitle = "Proceedings of the nineteenth annual {ACM} Symposium
on Theory of Computing, New York City, May 25--27,
1987",
title = "Proceedings of the nineteenth annual {ACM} Symposium
on Theory of Computing, New York City, May 25--27,
1987",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 471",
year = "1987",
ISBN = "0-89791-221-7 (paperback)",
ISBN-13 = "978-0-89791-221-1 (paperback)",
LCCN = "QA 76.6 A13 1987",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508870",
acknowledgement = ack-nhfb,
keywords = "electronic digital computers --- programming ---
congresses; computational complexity --- congresses",
}
@Proceedings{ACM:1988:PTA,
editor = "{ACM}",
booktitle = "Proceedings of the twentieth annual {ACM} Symposium on
Theory of Computing, Chicago, Illinois, May 2--4,
1988",
title = "Proceedings of the twentieth annual {ACM} Symposium on
Theory of Computing, Chicago, Illinois, May 2--4,
1988",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 553",
year = "1988",
ISBN = "0-89791-264-0",
ISBN-13 = "978-0-89791-264-8",
LCCN = "QA 76.6 A13 1988",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508880.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses",
}
@Proceedings{ACM:1989:PTF,
editor = "{ACM}",
booktitle = "Proceedings of the twenty-first annual {ACM} Symposium
on Theory of Computing, Seattle, Washington, May
15--17, 1989",
title = "Proceedings of the twenty-first annual {ACM} Symposium
on Theory of Computing, Seattle, Washington, May
15--17, 1989",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 600",
year = "1989",
ISBN = "0-89791-307-8",
ISBN-13 = "978-0-89791-307-2",
LCCN = "QA 76.6 A13 1989",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
note = "ACM order no. 508890.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses",
}
