focs74.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>15. FOCS 1974: New Orleans, Louisiana</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>15. <a href="index.html">FOCS</a> 1974: New Orleans, Louisiana</h1> 15th Annual Symposium on Foundations of Computer Science, New Orleans, Louisiana, 14-16 October 1974. IEEE Computer Society <ul> <li><a name="CarlyleGP74" href="../../indices/a-tree/c/Carlyle:Jack_W=.html">Jack W. Carlyle</a>, <a href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>, <a href="../../indices/a-tree/p/Paz:Azaria.html">Azaria Paz</a>: A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report). 1-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CarlyleGP74">BibTeX</a></font> <li><a name="HartmanisS74" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: On the Power of Multiplication in Random Access Machines. 13-23 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartmanisS74">BibTeX</a></font> <li><a name="Rangel74" href="../../indices/a-tree/r/Rangel:Jos=eacute=_Lucas.html">José Lucas Rangel</a>: The Equivalence Problem for Regular Expressions over one Letter Is Elementary. 24-27 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rangel74">BibTeX</a></font> <li><a name="SahniG74" href="../../indices/a-tree/s/Sahni:Sartaj.html">Sartaj Sahni</a>, <a href="../../indices/a-tree/g/Gonzalez:Teofilo_F=.html">Teofilo F. Gonzalez</a>: P-Complete Problems and Approximate Solutions. 28-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SahniG74">BibTeX</a></font> <li><a name="RosenkrantzSL74" href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>, <a href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>, <a href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>: Approximate Algorithms for the Traveling Salesperson Problem. 33-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RosenkrantzSL74">BibTeX</a></font> <li><a name="Friedman74" href="../../indices/a-tree/f/Friedman:Emily_P=.html">Emily P. Friedman</a>: Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages. 43-51 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman74">BibTeX</a></font> <li><a name="Courcelle74" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>: Recursive Schemes, Algebraic Trees and Deterministic Languages. 52-62 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Courcelle74">BibTeX</a></font> <li><a name="GoguenT74" href="../../indices/a-tree/g/Goguen:Joseph_A=.html">Joseph A. Goguen</a>, <a href="../../indices/a-tree/t/Thatcher:James_W=.html">James W. Thatcher</a>: Initial Algebra Semantics. 63-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoguenT74">BibTeX</a></font> <li><a name="HoffmanL74" href="../../indices/a-tree/h/Hoffmann:Christoph_M=.html">Christoph M. Hoffmann</a>, <a href="../../indices/a-tree/l/Landweber:Lawrence_H=.html">Lawrence H. Landweber</a>: Axiomatic Equivalence of Programs with Structured Variables. 78-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HoffmanL74">BibTeX</a></font> <li><a name="TokuraKF74" href="../../indices/a-tree/t/Tokura:Nobuki.html">Nobuki Tokura</a>, <a href="../../indices/a-tree/k/Kasami:Tadao.html">Tadao Kasami</a>, <a href="../../indices/a-tree/f/Furuta:Shukichi.html">Shukichi Furuta</a>: Ianov Schemas Augmented by a Pushdown Memory. 84-94 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TokuraKF74">BibTeX</a></font> <li><a name="AhoHU74" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/h/Hirschberg:Daniel_S=.html">Daniel S. Hirschberg</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). 104-109 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoHU74">BibTeX</a></font> <li><a name="Yao74" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Bounds on Selection Networks. 110-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao74">BibTeX</a></font> <li><a name="Kung74" href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: On the Computational Complexity of Finding the Maxima of a Set of Vectors. 117-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kung74">BibTeX</a></font> <li><a name="HuntSU74" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/s/Szymanski:Thomas_G=.html">Thomas G. Szymanski</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). 127-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuntSU74">BibTeX</a></font> <li><a name="Hayes74" href="../../indices/a-tree/h/Hayes:John_P=.html">John P. Hayes</a>: Minimization of Fanout in Switching Networks. 133-139 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hayes74">BibTeX</a></font> <li><a name="LamagnaS74" href="../../indices/a-tree/l/Lamagna:Edmund_A=.html">Edmund A. Lamagna</a>, <a href="../../indices/a-tree/s/Savage:John_E=.html">John E. Savage</a>: Combinational Complexity of Some Monotone Functions. 140-144 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LamagnaS74">BibTeX</a></font> <li><a name="LiptonSZ74" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/s/Snyder:Lawrence.html">Lawrence Snyder</a>, <a href="../../indices/a-tree/z/Zalcstein:Yechezkel.html">Yechezkel Zalcstein</a>: A Comparative Study of Models of Parallel Computation. 145-155 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LiptonSZ74">BibTeX</a></font> <li><a name="Hack74" href="../../indices/a-tree/h/Hack:Michel.html">Michel Hack</a>: The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems. 156-164 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hack74">BibTeX</a></font> <li><a name="Daley74" href="../../indices/a-tree/d/Daley:Robert_P=.html">Robert P. Daley</a>: Non-Complex Sequences: Characterizations and Examples. 165-169 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Daley74">BibTeX</a></font> <li><a name="Galil74" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation. 170-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Galil74">BibTeX</a></font> <li><a name="Baker74" href="../../indices/a-tree/b/Baker:Theodore_P=.html">Theodore P. Baker</a>: ``Natural'' Properties of Flowchart Complexity Measures. 178-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Baker74">BibTeX</a></font> <li><a name="Demers74" href="../../indices/a-tree/d/Demers:Alan_J=.html">Alan J. Demers</a>: Skeletal LR Parsing. 185-198 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Demers74">BibTeX</a></font> <li><a name="CremersG74" href="../../indices/a-tree/c/Cremers:Armin_B=.html">Armin B. Cremers</a>, <a href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>: Characterization of Context-Free Grammatical Families. 199-204 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CremersG74">BibTeX</a></font> <li><a name="Kerntopf74" href="../../indices/a-tree/k/Kerntopf:Pawel.html">Pawel Kerntopf</a>: On Boolean Functions Having Maximal Number of Subfunction Classes. 205-211 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kerntopf74">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
