focs72.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>13. FOCS 1972: College Park, Maryland</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>13. <a href="index.html">FOCS</a> 1972: College Park, Maryland</h1> 13th Annual Symposium on Foundations of Computer Science, College Park, Maryland, 25-27 October 1972. IEEE Computer Society <ul> <li><a name="Rosen72" href="../../indices/a-tree/r/Rosen:Barry_K=.html">Barry K. Rosen</a>: Program Equivalence and Context-Free Grammars. 7-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rosen72">BibTeX</a></font> <li><a name="Kfoury72" href="../../indices/a-tree/k/Kfoury:Denis_J=.html">Denis J. Kfoury</a>: Effective Computability in Algebraic Structures (A Schematology Approach). 19-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kfoury72">BibTeX</a></font> <li><a name="CherniavskyC72" href="../../indices/a-tree/c/Cherniavsky:John_C=.html">John C. Cherniavsky</a>, <a href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: Representing Program Schemes in Logic. 27-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CherniavskyC72">BibTeX</a></font> <li><a name="TourlakisM72" href="../../indices/a-tree/t/Tourlakis:George.html">George Tourlakis</a>, <a href="../../indices/a-tree/m/Mylopoulos:John.html">John Mylopoulos</a>: Some Results in Computational Topology. 40-51 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TourlakisM72">BibTeX</a></font> <li><a name="Goguen72" href="../../indices/a-tree/g/Goguen:Joseph_A=.html">Joseph A. Goguen</a>: On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes. 52-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Goguen72">BibTeX</a></font> <li><a name="MeyerM72" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/m/Moll:Robert.html">Robert Moll</a>: Honest Bounds for Complexity Classes of Recursive Functions. 61-66 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MeyerM72">BibTeX</a></font> <li><a name="Logrippo72" href="../../indices/a-tree/l/Logrippo:Luigi.html">Luigi Logrippo</a>: Renamings in Program Schemas (Extended Abstract). 67-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Logrippo72">BibTeX</a></font> <li><a name="BrunoCH72" href="../../indices/a-tree/b/Bruno:John_L=.html">John L. Bruno</a>, <a href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/h/Hosken:W=_H=.html">W. H. Hosken</a>: Consistency of Synchronization Nets using P and V Operations. 71-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrunoCH72">BibTeX</a></font> <li><a name="Keller72" href="../../indices/a-tree/k/Keller:Robert_M=.html">Robert M. Keller</a>: On the Decomposition of Asynchronous Systems. 78-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Keller72">BibTeX</a></font> <li><a name="MoenckB72" href="../../indices/a-tree/m/Moenck:R=.html">R. Moenck</a>, <a href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>: Fast Modular Transforms via Division. 90-96 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MoenckB72">BibTeX</a></font> <li><a name="Horowitz72" href="../../indices/a-tree/h/Horowitz:Ellis.html">Ellis Horowitz</a>: The Efficient Calculation of Powers of Polynomials. 97-104 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Horowitz72">BibTeX</a></font> <li><a name="ShawT72" href="../../indices/a-tree/s/Shaw:Mary.html">Mary Shaw</a>, <a href="../../indices/a-tree/t/Traub:J=_F=.html">J. F. Traub</a>: On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives. 105-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShawT72">BibTeX</a></font> <li><a name="Mylopoulos72" href="../../indices/a-tree/m/Mylopoulos:John.html">John Mylopoulos</a>: On the Relation of Graph Grammars and Graph Automata. 108-120 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mylopoulos72">BibTeX</a></font> <li><a name="HossleyR72" href="../../indices/a-tree/h/Hossley:R=.html">R. Hossley</a>, <a href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>: The Emptiness Problem for Automata on Infinite Trees. 121-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HossleyR72">BibTeX</a></font> <li><a name="MeyerS72" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. 125-129 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MeyerS72">BibTeX</a></font> <li><a name="Sahni72" href="../../indices/a-tree/s/Sahni:Sartaj.html">Sartaj Sahni</a>: Some Related Problems from Network Flows, Game Theory and Integer Programming. 130-138 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sahni72">BibTeX</a></font> <li><a name="Friedman72" href="../../indices/a-tree/f/Friedman:Nathan.html">Nathan Friedman</a>: Some Results on the Effect of Arithmetics on Comparison Problems. 139-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman72">BibTeX</a></font> <li><a name="Johnson72" href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>: Fast Allocation Algorithms. 144-154 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Johnson72">BibTeX</a></font> <li><a name="Liu72" href="../../indices/a-tree/l/Liu:C=_L=.html">C. L. Liu</a>: Optimal Scheduling on Multi-Processor Computing Systems. 155-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Liu72">BibTeX</a></font> <li><a name="Ullman72" href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: A Fast Algorithm for the Elimination of Common Subexpressions. 161-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ullman72">BibTeX</a></font> <li><a name="Akers72" href="../../indices/a-tree/a/Akers_Jr=:Sheldon_B=.html">Sheldon B. Akers Jr.</a>: Universal Test Sets for Logic Networks. 177-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Akers72">BibTeX</a></font> <li><a name="SalujaR72" href="../../indices/a-tree/s/Saluja:Kewal_K=.html">Kewal K. Saluja</a>, <a href="../../indices/a-tree/r/Reddy:Sudhakar_M=.html">Sudhakar M. Reddy</a>: Multiple Faults in Reed-Muller Canonic Networks. 185-191 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SalujaR72">BibTeX</a></font> <li><a name="HuangKK72" href="../../indices/a-tree/h/Huang:C=_C=.html">C. C. Huang</a>, <a href="../../indices/a-tree/k/Kain:Richard_Y=.html">Richard Y. Kain</a>, <a href="../../indices/a-tree/k/Kinney:Larry_L=.html">Larry L. Kinney</a>: Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits. 192-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuangKK72">BibTeX</a></font> <li><a name="Berstel72" href="../../indices/a-tree/b/Berstel:Jean.html">Jean Berstel</a>: On Sets of Numbers Recognized by Push-Down Automata. 200-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Berstel72">BibTeX</a></font> <li><a name="BakerB72" href="../../indices/a-tree/b/Baker:Brenda_S=.html">Brenda S. Baker</a>, <a href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>: Reversal-Bounded Multi-Pushdown Machines: Extended Abstract. 207-211 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BakerB72">BibTeX</a></font> <li><a name="JumpT72" href="../../indices/a-tree/j/Jump:J=_Robert.html">J. Robert Jump</a>, <a href="../../indices/a-tree/t/Thiagarajan:P=_S=.html">P. S. Thiagarajan</a>: On the Equivalence of Asynchronous Control Structures. 212-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JumpT72">BibTeX</a></font> <li><a name="Maibaum72" href="../../indices/a-tree/m/Maibaum:T=_S=_E=.html">T. S. E. Maibaum</a>: The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets. 224-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Maibaum72">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
