focs76.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>17. FOCS 1976: Houston, Texas</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>17. <a href="index.html">FOCS</a> 1976: Houston, Texas</h1> 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, 25-27 October 1976. IEEE Computer Society <ul> <li><a name="RivestP76" href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report. 1-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RivestP76">BibTeX</a></font> <li><a name="HendersonZ76" href="../../indices/a-tree/h/Henderson:Peter_B=.html">Peter B. Henderson</a>, <a href="../../indices/a-tree/z/Zalcstein:Yechezkel.html">Yechezkel Zalcstein</a>: Characterization of the Synchronization Languages for PV Systems. 9-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HendersonZ76">BibTeX</a></font> <li><a name="StearnsLR76" 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>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>: Concurrency Control for Database Systems. 19-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StearnsLR76">BibTeX</a></font> <li><a name="JonesLS76" href="../../indices/a-tree/j/Jones:Anita_K=.html">Anita K. Jones</a>, <a 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 Linear Time Algorithm for Deciding Security. 33-41 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JonesLS76">BibTeX</a></font> <li><a name="FarrowKZ76" href="../../indices/a-tree/f/Farrow:Rodney.html">Rodney Farrow</a>, <a href="../../indices/a-tree/k/Kennedy:Ken.html">Ken Kennedy</a>, <a href="../../indices/a-tree/z/Zucconi:Linda.html">Linda Zucconi</a>: Graph Grammars and Global Program Data Flow Analysis. 42-56 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FarrowKZ76">BibTeX</a></font> <li><a name="DowneyS76" href="../../indices/a-tree/d/Downey:Peter_J=.html">Peter J. Downey</a>, <a href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: Assignment Commands and Array Structures. 57-66 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DowneyS76">BibTeX</a></font> <li><a name="YaoR76" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>: k+1 Heads Are Better than k. 67-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/YaoR76">BibTeX</a></font> <li><a name="BakerS76" href="../../indices/a-tree/b/Baker:Theodore_P=.html">Theodore P. Baker</a>, <a href="../../indices/a-tree/s/Selman:Alan_L=.html">Alan L. Selman</a>: A Second Step toward the Polynomial Hierarchy. 71-75 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BakerS76">BibTeX</a></font> <li><a name="Berman76" href="../../indices/a-tree/b/Berman:Leonard.html">Leonard Berman</a>: On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup. 76-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Berman76">BibTeX</a></font> <li><a name="AdlemanM76" 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>: Diophantine Complexity. 81-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AdlemanM76">BibTeX</a></font> <li><a name="Kozen76" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: On Parallelism in Turing Machines. 89-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kozen76">BibTeX</a></font> <li><a name="ChandraS76" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Alternation. 98-108 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChandraS76">BibTeX</a></font> <li><a name="Pratt76" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: Semantical Considerations on Floyd-Hoare Logic. 109-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pratt76">BibTeX</a></font> <li><a name="Lehmann76" href="../../indices/a-tree/l/Lehmann:Daniel_J=.html">Daniel J. Lehmann</a>: Categories for Fixpoint-Semantics. 122-126 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lehmann76">BibTeX</a></font> <li><a name="ChiricaM76" href="../../indices/a-tree/c/Chirica:Laurian_M=.html">Laurian M. Chirica</a>, <a href="../../indices/a-tree/m/Martin:David_F=.html">David F. Martin</a>: An Algebraic Formulation of Knuthian Semantics. 127-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChiricaM76">BibTeX</a></font> <li><a name="CourcelleN76" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>, <a href="../../indices/a-tree/n/Nivat:Maurice.html">Maurice Nivat</a>: Algebraic Families of Interpretations. 137-146 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CourcelleN76">BibTeX</a></font> <li><a name="WrightTWG76" href="../../indices/a-tree/w/Wright:Jesse_B=.html">Jesse B. Wright</a>, <a href="../../indices/a-tree/t/Thatcher:James_W=.html">James W. Thatcher</a>, <a href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>, <a href="../../indices/a-tree/g/Goguen:Joseph_A=.html">Joseph A. Goguen</a>: Rational Algebraic Theories and Fixed-Point Solutions. 147-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/WrightTWG76">BibTeX</a></font> <li><a name="Friedman76" href="../../indices/a-tree/f/Friedman:Emily_P=.html">Emily P. Friedman</a>: Simple Languages and Free Schemes. 159-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman76">BibTeX</a></font> <li><a name="AllenM76" href="../../indices/a-tree/a/Allen:Brian.html">Brian Allen</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: Self-Organizing Binary Search Trees. 166-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AllenM76">BibTeX</a></font> <li><a name="YaoY76" 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>: The Complexity of Searching an Ordered Random Table (Extended Abstract). 173-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/YaoY76">BibTeX</a></font> <li><a name="FusseneggerG76" href="../../indices/a-tree/f/Fussenegger:Frank.html">Frank Fussenegger</a>, <a href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: Using Comparison Trees to Derive Lower Bounds for Selection Problems. 178-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FusseneggerG76">BibTeX</a></font> <li><a name="Guibas76" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>: The Analysis of Hashing Algorithms that Exhibit k-ary Clustering. 183-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Guibas76">BibTeX</a></font> <li><a name="ComerS76" href="../../indices/a-tree/c/Comer:Douglas.html">Douglas Comer</a>, <a href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: Complexity of Trie Index Construction (Extended Abstract). 197-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ComerS76">BibTeX</a></font> <li><a name="ShamosH76" href="../../indices/a-tree/s/Shamos:Michael_Ian.html">Michael Ian Shamos</a>, <a href="../../indices/a-tree/h/Hoey:Dan.html">Dan Hoey</a>: Geometric Intersection Problems. 208-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShamosH76">BibTeX</a></font> <li><a name="FredericksonHK76" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>, <a href="../../indices/a-tree/h/Hecht:Matthew_S=.html">Matthew S. Hecht</a>, <a href="../../indices/a-tree/k/Kim:Chul_E=.html">Chul E. Kim</a>: Approximation Algorithms for some Routing Problems. 216-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FredericksonHK76">BibTeX</a></font> <li><a name="Leeuwen76" href="../../indices/a-tree/l/Leeuwen:Jan_van.html">Jan van Leeuwen</a>: Variations of a New Machine Model. 228-235 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Leeuwen76">BibTeX</a></font> <li><a name="GalilS76" 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>: Recognizing Certain Repetitions and Reversals Within Strings. 236-252 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GalilS76">BibTeX</a></font> <li><a name="BoassonN76" href="../../indices/a-tree/b/Boasson:Luc.html">Luc Boasson</a>, <a href="../../indices/a-tree/n/Nivat:Maurice.html">Maurice Nivat</a>: Parenthesis Generators. 253-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BoassonN76">BibTeX</a></font> <li><a name="Pippenger76" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: On the Evaluation of Powers and Related Problems (Preliminary Version). 258-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pippenger76">BibTeX</a></font> <li><a name="Plaisted76" href="../../indices/a-tree/p/Plaisted:David_A=.html">David A. Plaisted</a>: Some Polynomial and Integer Divisibility Problems Are NP-Hard. 264-267 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Plaisted76">BibTeX</a></font> <li><a name="ShamosY76" href="../../indices/a-tree/s/Shamos:Michael_Ian.html">Michael Ian Shamos</a>, <a href="../../indices/a-tree/y/Yuval:Gideon.html">Gideon Yuval</a>: Lower Bounds from Complex Function Theory. 268-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShamosY76">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
