focs78.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>19. FOCS 1978: Ann Arbor, Michigan</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>19. <a href="index.html">FOCS</a> 1978: Ann Arbor, Michigan</h1> 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, 16-18 October 1978. IEEE Computer Society <ul> <li><a name="FranconVV78" href="../../indices/a-tree/f/Fran=ccedil=on:Jean.html">Jean Françon</a>, <a href="../../indices/a-tree/v/Viennot:G=.html">G. Viennot</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Description and Analysis of an Efficient Priority Queue Representation. 1-7 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FranconVV78">BibTeX</a></font> <li><a name="GuibasS78" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/s/Sedgewick:Robert.html">Robert Sedgewick</a>: A Dichromatic Framework for Balanced Trees. 8-21 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuibasS78">BibTeX</a></font> <li><a name="Yao78" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Should Tables Be Sorted? (Extended Abstract). 22-27 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao78">BibTeX</a></font> <li><a name="Lueker78" href="../../indices/a-tree/l/Lueker:George_S=.html">George S. Lueker</a>: A Data Structure for Orthogonal Range Queries. 28-34 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lueker78">BibTeX</a></font> <li><a name="Lewis78" href="../../indices/a-tree/l/Lewis:Harry_R=.html">Harry R. Lewis</a>: Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus. 35-47 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lewis78">BibTeX</a></font> <li><a name="LichtensteinS78" href="../../indices/a-tree/l/Lichtenstein:David.html">David Lichtenstein</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: GO Is PSPACE Hard. 48-54 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LichtensteinS78">BibTeX</a></font> <li><a name="FraenkelGJSY78" href="../../indices/a-tree/f/Fraenkel:Aviezri_S=.html">Aviezri S. Fraenkel</a>, <a href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/s/Schaefer:T=.html">T. Schaefer</a>, <a href="../../indices/a-tree/y/Yesha:Yaacov.html">Yaacov Yesha</a>: The Complexity of Checkers on an N * N Board - Preliminary Report. 55-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FraenkelGJSY78">BibTeX</a></font> <li><a name="HartmanisIM78" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/i/Immerman:Neil.html">Neil Immerman</a>, <a href="../../indices/a-tree/m/Mahaney:Stephen_R=.html">Stephen R. Mahaney</a>: One-Way Log-Tape Reductions. 65-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartmanisIM78">BibTeX</a></font> <li><a name="Sipser78" href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Halting Space-Bounded Computations. 73-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sipser78">BibTeX</a></font> <li><a name="Adleman78" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: Two Theorems on Random Polynomial Time. 75-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Adleman78">BibTeX</a></font> <li><a name="Reischuk78" href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">Rüdiger Reischuk</a>: Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version). 84-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reischuk78">BibTeX</a></font> <li><a name="LadnerLS78" href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Alternating Pushdown Automata (Preliminary Report). 92-106 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LadnerLS78">BibTeX</a></font> <li><a name="SimonGH78" href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>, <a href="../../indices/a-tree/g/Gill:John.html">John Gill</a>, <a href="../../indices/a-tree/h/Hunt:James.html">James Hunt</a>: On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract). 107-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SimonGH78">BibTeX</a></font> <li><a name="PaulPR78" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/p/Prau=szlig=:Ernst_J=.html">Ernst J. Prauß</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">Rüdiger Reischuk</a>: On Alternation (Preliminary Version). 113-122 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaulPR78">BibTeX</a></font> <li><a name="EngelfrietR78" href="../../indices/a-tree/e/Engelfriet:Joost.html">Joost Engelfriet</a>, <a href="../../indices/a-tree/r/Rozenberg:Grzegorz.html">Grzegorz Rozenberg</a>: Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages. 123-126 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EngelfrietR78">BibTeX</a></font> <li><a name="Chandra78" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>: Computable Nondeterministic Functions. 127-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chandra78">BibTeX</a></font> <li><a name="BlumK78" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). 132-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumK78">BibTeX</a></font> <li><a name="Simon78" href="../../indices/a-tree/s/Simon:Imre.html">Imre Simon</a>: Limited Subsets of a Free Monoid. 143-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Simon78">BibTeX</a></font> <li><a name="Abelson78" href="../../indices/a-tree/a/Abelson:Harold.html">Harold Abelson</a>: Lower Bounds on Information Transfer in Distributed Computations. 151-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Abelson78">BibTeX</a></font> <li><a name="Wiele78" href="../../indices/a-tree/w/Wiele:Jean=Paul_Van_de.html">Jean-Paul Van de Wiele</a>: An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex Numbers. 159-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wiele78">BibTeX</a></font> <li><a name="Pan78" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations. 166-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pan78">BibTeX</a></font> <li><a name="Parikh78" href="../../indices/a-tree/p/Parikh:Rohit.html">Rohit Parikh</a>: A Decidability Result for a Second Order Process Logic. 177-183 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Parikh78">BibTeX</a></font> <li><a name="FlonS78" href="../../indices/a-tree/f/Flon:Lawrence.html">Lawrence Flon</a>, <a href="../../indices/a-tree/s/Suzuki:Norihisa.html">Norihisa Suzuki</a>: Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs. 184-192 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlonS78">BibTeX</a></font> <li><a name="Lipton78" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: Model Theoretic Aspects of Computational Complexity. 193-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lipton78">BibTeX</a></font> <li><a name="Courcelle78" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>: On Recursive Equations Having a Unique Solution. 201-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Courcelle78">BibTeX</a></font> <li><a name="Lehmann78" href="../../indices/a-tree/l/Lehmann:Daniel_J=.html">Daniel J. Lehmann</a>: On the Algebra of Order (Extended Abstract). 214-220 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lehmann78">BibTeX</a></font> <li><a name="Kanda78" href="../../indices/a-tree/k/Kanda:Akira.html">Akira Kanda</a>: Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract). 221-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kanda78">BibTeX</a></font> <li><a name="Galil78" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: A New Algorithm for the Maximal Flow Problem. 231-245 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Galil78">BibTeX</a></font> <li><a name="Simons78" href="../../indices/a-tree/s/Simons:Barbara.html">Barbara Simons</a>: A Fast Algorithm for Single Processor Scheduling. 246-252 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Simons78">BibTeX</a></font> <li><a name="MunroP78" href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Selection and Sorting with Limited Storage. 253-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MunroP78">BibTeX</a></font> <li><a name="Christen78" href="../../indices/a-tree/c/Christen:C=.html">C. Christen</a>: Improving the Bounds on Optimal Merging. 259-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Christen78">BibTeX</a></font> <li><a name="Yap78" href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: On Lifted Problems (Preliminary Reports). 267-279 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yap78">BibTeX</a></font> <li><a name="YaoY78" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>, <a href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: On the Average-case Complexity of Selecting k-th Best. 280-289 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/YaoY78">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:12:24 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
