focs73.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>14. FOCS 1973: Iowa City, Iowa</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>14. <a href="index.html">FOCS</a> 1973: Iowa City, Iowa</h1> 14th Annual Symposium on Foundations of Computer Science, Iowa City, Iowa, 15-17 October 1973. IEEE Computer Society <ul> <li><a name="Weiner73" href="../../indices/a-tree/w/Weiner:Peter.html">Peter Weiner</a>: Linear Pattern Matching Algorithms. 1-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Weiner73">BibTeX</a></font> <li><a name="KamedaT73" href="../../indices/a-tree/k/Kameda:Tiko.html">Tiko Kameda</a>, <a href="../../indices/a-tree/t/Toida:S=.html">S. Toida</a>: Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). 12-15 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KamedaT73">BibTeX</a></font> <li><a name="Chandra73" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>: Efficient Compilation of Linear Recursive Programs. 16-25 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chandra73">BibTeX</a></font> <li><a name="Friedman73" href="../../indices/a-tree/f/Friedman:Emily_P=.html">Emily P. Friedman</a>: Equivalence Problems in Monadic Recursion Schemes. 26-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman73">BibTeX</a></font> <li><a name="CadiouL73" href="../../indices/a-tree/c/Cadiou:J=_M=.html">J. M. Cadiou</a>, <a href="../../indices/a-tree/l/L=eacute=vy:Jean=Jacques.html">Jean-Jacques Lévy</a>: Mechanizable Proofs about Parallel Processes. 34-48 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CadiouL73">BibTeX</a></font> <li><a name="Baugh73" href="../../indices/a-tree/b/Baugh:C=_R=.html">C. R. Baugh</a>: Chow Parameters in Pseudothreshold Logic. 49-55 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Baugh73">BibTeX</a></font> <li><a name="Bredeson73" href="../../indices/a-tree/b/Bredeson:Jon_G=.html">Jon G. Bredeson</a>: On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without Feedback. 56-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bredeson73">BibTeX</a></font> <li><a name="ChuangD73" href="../../indices/a-tree/c/Chuang:Henry_Y=_H=.html">Henry Y. H. Chuang</a>, <a href="../../indices/a-tree/d/Das:Santanu.html">Santanu Das</a>: Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops. 64-69 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChuangD73">BibTeX</a></font> <li><a name="PrattY73" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>, <a href="../../indices/a-tree/y/Yao:Foong_Frances.html">Foong Frances Yao</a>: On Lower Bounds for Computing the i-th Largest Element. 70-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PrattY73">BibTeX</a></font> <li><a name="SpiraP73" href="../../indices/a-tree/s/Spira:Philip_M=.html">Philip M. Spira</a>, <a href="../../indices/a-tree/p/Pan:A=.html">A. Pan</a>: On Finding and Updating Shortest Paths and Spanning Trees. 82-84 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SpiraP73">BibTeX</a></font> <li><a name="Savage73" href="../../indices/a-tree/s/Savage:Sam.html">Sam Savage</a>: Statistical Indicators of Optimality. 85-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Savage73">BibTeX</a></font> <li><a name="Dobkin73" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>: On the Optimal Evaluation of a Set of n-Linear Forms. 92-102 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Dobkin73">BibTeX</a></font> <li><a name="GellerH73" href="../../indices/a-tree/g/Geller:Matthew_M=.html">Matthew M. Geller</a>, <a href="../../indices/a-tree/h/Harrison:Michael_A=.html">Michael A. Harrison</a>: Characterizations of LR(0) Languages (Extended Abstract). 103-108 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GellerH73">BibTeX</a></font> <li><a name="MickunasS73" href="../../indices/a-tree/m/Mickunas:M=_Dennis.html">M. Dennis Mickunas</a>, <a href="../../indices/a-tree/s/Schneider:Victor_B=.html">Victor B. Schneider</a>: On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars. 109-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MickunasS73">BibTeX</a></font> <li><a name="SzymanskiW73" href="../../indices/a-tree/s/Szymanski:Thomas_G=.html">Thomas G. Szymanski</a>, <a href="../../indices/a-tree/w/Williams:John_H=.html">John H. Williams</a>: Non-Canonical Parsing. 122-129 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SzymanskiW73">BibTeX</a></font> <li><a name="SeiferasFM73" href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: Refinements of the Nondeterministic Time and Space Hierarchies. 130-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SeiferasFM73">BibTeX</a></font> <li><a name="Sudborough73" href="../../indices/a-tree/s/Sudborough:Ivan_Hal.html">Ivan Hal Sudborough</a>: On Tape-Bounded Complexity Classes and Multi-Head Finite Automata. 138-144 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sudborough73">BibTeX</a></font> <li><a name="Rounds73" href="../../indices/a-tree/r/Rounds:William_C=.html">William C. Rounds</a>: Complexity of Recognition in Intermediate-Level Languages. 145-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rounds73">BibTeX</a></font> <li><a name="Joyner73" href="../../indices/a-tree/j/Joyner_Jr=:William_H=.html">William H. Joyner Jr.</a>: Automatic Theorem-Proving and the Decision Problem. 159-166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Joyner73">BibTeX</a></font> <li><a name="EhrigPS73" href="../../indices/a-tree/e/Ehrig:Hartmut.html">Hartmut Ehrig</a>, <a href="../../indices/a-tree/p/Pfender:Michael.html">Michael Pfender</a>, <a href="../../indices/a-tree/s/Schneider:Hans_J=uuml=rgen.html">Hans Jürgen Schneider</a>: Graph-Grammars: An Algebraic Approach. 167-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EhrigPS73">BibTeX</a></font> <li><a name="Machtey73" href="../../indices/a-tree/m/Machtey:Michael.html">Michael Machtey</a>: A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes. 181-189 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Machtey73">BibTeX</a></font> <li><a name="Mehlhorn73" href="../../indices/a-tree/m/Mehlhorn:Kurt.html">Kurt Mehlhorn</a>: On the Size of Sets of Computable Functions. 190-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mehlhorn73">BibTeX</a></font> <li><a name="Young73" href="../../indices/a-tree/y/Young:Paul.html">Paul Young</a>: Optimization among Provably Equivalent Programs (Preliminary Abstract). 197-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Young73">BibTeX</a></font> <li><a name="BlumB73" href="../../indices/a-tree/b/Blum:Lenore.html">Lenore Blum</a>, <a href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>: Inductive Inference: A Recursion Theoretic Approach. 200-208 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumB73">BibTeX</a></font> <li><a name="Cherniavsky73" href="../../indices/a-tree/c/Cherniavsky:John_C=.html">John C. Cherniavsky</a>: The Complexity of Some Non-Classical Logics. 209-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cherniavsky73">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
