focs77.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>18. FOCS 1977: Providence, Rhode Island</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>18. <a href="index.html">FOCS</a> 1977: Providence, Rhode Island</h1> 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, 31 October - 1 November 1977. IEEE Computer Society <ul> <li><a name="Lipton77" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: A Necessary and Sufficient Condition for the Existence of Hoare Logics. 1-6 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lipton77">BibTeX</a></font> <li><a name="LehmannS77" href="../../indices/a-tree/l/Lehmann:Daniel_J=.html">Daniel J. Lehmann</a>, <a href="../../indices/a-tree/s/Smyth:Michael_B=.html">Michael B. Smyth</a>: Data Types (Extended Abstract). 7-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LehmannS77">BibTeX</a></font> <li><a name="SmythP77" href="../../indices/a-tree/s/Smyth:Michael_B=.html">Michael B. Smyth</a>, <a href="../../indices/a-tree/p/Plotkin:Gordon_D=.html">Gordon D. Plotkin</a>: The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract). 13-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SmythP77">BibTeX</a></font> <li><a name="Clarke77" href="../../indices/a-tree/c/Clarke:Edmund_M=.html">Edmund M. Clarke</a>: Program Invariants as Fixed Points (Preliminary Reports). 18-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Clarke77">BibTeX</a></font> <li><a name="Huet77" href="../../indices/a-tree/h/Huet:G=eacute=rard_P=.html">Gérard P. Huet</a>: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. 30-45 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Huet77">BibTeX</a></font> <li><a name="Pnueli77" href="../../indices/a-tree/p/Pnueli:Amir.html">Amir Pnueli</a>: The Temporal Logic of Programs. 46-57 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pnueli77">BibTeX</a></font> <li><a name="Book77" href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>: Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets. 58-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Book77">BibTeX</a></font> <li><a name="Lewis77" href="../../indices/a-tree/l/Lewis:Harry_R=.html">Harry R. Lewis</a>: A New Decidable Problem, with Applications (Extended Abstract). 62-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lewis77">BibTeX</a></font> <li><a name="Ibarra77" href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>: The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications. 74-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ibarra77">BibTeX</a></font> <li><a name="KatseffS77" href="../../indices/a-tree/k/Katseff:Howard_P=.html">Howard P. Katseff</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Several Results in Program Size Complexity. 82-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KatseffS77">BibTeX</a></font> <li><a name="Statman77" href="../../indices/a-tree/s/Statman:Richard.html">Richard Statman</a>: The Typed lambda-Calculus Is not Elementary Recursive. 90-94 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Statman77">BibTeX</a></font> <li><a name="Berman77" href="../../indices/a-tree/b/Berman:Leonard.html">Leonard Berman</a>: Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report. 95-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Berman77">BibTeX</a></font> <li><a name="BennisonS77" href="../../indices/a-tree/b/Bennison:Victor_L=.html">Victor L. Bennison</a>, <a href="../../indices/a-tree/s/Soare:Robert_I=.html">Robert I. Soare</a>: Recursion Theoretic Characterizations of Complexity Theoretic Properties. 100-106 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BennisonS77">BibTeX</a></font> <li><a name="AhoBU77" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/b/Beeri:Catriel.html">Catriel Beeri</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: The Theory of Joins in Relational Data Bases (Extended Abstract). 107-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoBU77">BibTeX</a></font> <li><a name="NelsonO77" href="../../indices/a-tree/n/Nelson:Greg.html">Greg Nelson</a>, <a href="../../indices/a-tree/o/Oppen:Derek_C=.html">Derek C. Oppen</a>: Fast Decision Algorithms Based on Union and Find. 114-119 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NelsonO77">BibTeX</a></font> <li><a name="KungS77" href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>, <a href="../../indices/a-tree/s/Song:S=_W=.html">S. W. Song</a>: An Efficient Parallel Garbage Collection System and Its Correctness Proof. 120-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KungS77">BibTeX</a></font> <li><a name="Maier77" href="../../indices/a-tree/m/Maier:David.html">David Maier</a>: A Space Efficient Method for the Lowest Common Ancestor Problem and an Application to Finding Negative Cycles. 132-141 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Maier77">BibTeX</a></font> <li><a name="Snyder77" href="../../indices/a-tree/s/Snyder:Lawrence.html">Lawrence Snyder</a>: On Uniquely Represented Data Structures (Extended Abstract). 142-146 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Snyder77">BibTeX</a></font> <li><a name="BlumS77" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/s/Sakoda:William_J=.html">William J. Sakoda</a>: On the Capability of Finite Automata in 2 and 3 Dimensional Space. 147-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumS77">BibTeX</a></font> <li><a name="LiptonT77" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Application of a Planar Separator Theorem. 162-170 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LiptonT77">BibTeX</a></font> <li><a name="Hyafil77" href="../../indices/a-tree/h/Hyafil:Laurent.html">Laurent Hyafil</a>: The Power of Commutativity. 171-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hyafil77">BibTeX</a></font> <li><a name="AdlemanMM77" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>, <a href="../../indices/a-tree/m/Manders:Kenneth_L=.html">Kenneth L. Manders</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: On Taking Roots in Finite Fields. 175-178 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AdlemanMM77">BibTeX</a></font> <li><a name="GalilS77" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>: Saving Space in Fast String-Matching. 179-188 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GalilS77">BibTeX</a></font> <li><a name="GuibasO77" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/o/Odlyzko:Andrew_M=.html">Andrew M. Odlyzko</a>: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. 189-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuibasO77">BibTeX</a></font> <li><a name="FlajoletRV77" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/r/Raoult:Jean=Claude.html">Jean-Claude Raoult</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: On the Average Number of Registers Required for Evaluating Arithmetic Expressions. 196-205 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlajoletRV77">BibTeX</a></font> <li><a name="Lawler77" href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>: Fast Approximation Algorithms for Knapsack Problems. 206-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lawler77">BibTeX</a></font> <li><a name="CoffmanL77" href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/l/Leung:Joseph_Y==T=.html">Joseph Y.-T. Leung</a>: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. 214-221 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CoffmanL77">BibTeX</a></font> <li><a name="Yao77" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract). 222-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao77">BibTeX</a></font> <li><a name="Lloyd77" href="../../indices/a-tree/l/Lloyd:Errol_L=.html">Errol L. Lloyd</a>: On Triangulations of a Set of Points in the Plane. 228-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lloyd77">BibTeX</a></font> <li><a name="Plaisted77" href="../../indices/a-tree/p/Plaisted:David_A=.html">David A. Plaisted</a>: New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. 241-253 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Plaisted77">BibTeX</a></font> <li><a name="Kozen77" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: Lower Bounds for Natural Proof Systems. 254-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kozen77">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
