focs75.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>16. FOCS 1975: Berkeley, California</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>16. <a href="index.html">FOCS</a> 1975: Berkeley, California</h1> 16th Annual Symposium on Foundations of Computer Science, Berkeley, California, 13-15 October 1975. IEEE Computer Society <ul> <li><a name="Winograd75" href="../../indices/a-tree/w/Winograd:Shmuel.html">Shmuel Winograd</a>: The Effect of the Field of Constants on the Number of Multiplication. 1-2 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Winograd75">BibTeX</a></font> <li><a name="Floyd75" href="../../indices/a-tree/f/Floyd:Robert_W=.html">Robert W. Floyd</a>: The Exact Time Required to Perform Generalized Addition. 3-5 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Floyd75">BibTeX</a></font> <li><a name="Lipton75" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: Polynomials with 0-1 Coefficients that Are Hard to Evaluate. 6-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lipton75">BibTeX</a></font> <li><a name="Csanky75" href="../../indices/a-tree/c/Csanky:L=.html">L. Csanky</a>: Fast Parallel Matrix Inversion Algorithms. 11-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Csanky75">BibTeX</a></font> <li><a name="ArjomandiC75" href="../../indices/a-tree/a/Arjomandi:Eshrat.html">Eshrat Arjomandi</a>, <a href="../../indices/a-tree/c/Corneil:Derek_G=.html">Derek G. Corneil</a>: Parallel Computations in Graph Theory. 13-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArjomandiC75">BibTeX</a></font> <li><a name="LiptonMS75" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>, <a href="../../indices/a-tree/s/Snyder:Lawrence.html">Lawrence Snyder</a>: Synchronization and Computing Capabilities of Linear Asynchronous Structures. 19-28 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LiptonMS75">BibTeX</a></font> <li><a name="Bakker75" href="../../indices/a-tree/b/Bakker:J=_W=_de.html">J. W. de Bakker</a>: Flow of Control in the Proof Theory of Structured Programming. 29-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bakker75">BibTeX</a></font> <li><a name="MarkowskyR75" href="../../indices/a-tree/m/Markowsky:George.html">George Markowsky</a>, <a href="../../indices/a-tree/r/Rosen:Barry_K=.html">Barry K. Rosen</a>: Bases for Chain-Complete Posets. 34-47 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MarkowskyR75">BibTeX</a></font> <li><a name="DowneyS75" 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>: Correct Computation Rules for Recursive Languages (Extended Abstract). 48-56 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DowneyS75">BibTeX</a></font> <li><a name="HopcroftPV75" href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: On Time versus Space and Related Problems. 57-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HopcroftPV75">BibTeX</a></font> <li><a name="HartmanisB75" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/b/Berman:Leonard.html">Leonard Berman</a>: A Note on Tape Bounds for SLA Language Processing. 65-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartmanisB75">BibTeX</a></font> <li><a name="Pohl75" href="../../indices/a-tree/p/Pohl:Ira.html">Ira Pohl</a>: Minimean Optimality in Sorting Algorithms. 71-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pohl75">BibTeX</a></font> <li><a name="Boas75" href="../../indices/a-tree/b/Boas:Peter_van_Emde.html">Peter van Emde Boas</a>: Preserving Order in a Forest in less than Logarithmic Time. 75-84 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Boas75">BibTeX</a></font> <li><a name="Yao75" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: On the Complexity of Comparison Problems using Linear Functions (Preliminary Report). 85-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao75">BibTeX</a></font> <li><a name="SzymanskiU75" 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>: Evaluating Relational Expressions with Dense and Sparse Arguments. 90-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SzymanskiU75">BibTeX</a></font> <li><a name="Fredman75" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>: On the Decision Tree Complexity of the Shortest Path Problems. 98-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fredman75">BibTeX</a></font> <li><a name="EvenK75" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>, <a href="../../indices/a-tree/k/Kariv:Oded.html">Oded Kariv</a>: An O(n^2.5) Algorithm for Maximum Matching in General Graphs. 100-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenK75">BibTeX</a></font> <li><a name="Pippenger75" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: Information Theory and the Complexity of Switching Networks (Preliminary Version). 113-118 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pippenger75">BibTeX</a></font> <li><a name="Pratt75" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: The Effect of Basis on Size of Boolean Expressions. 119-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pratt75">BibTeX</a></font> <li><a name="GellerHSU75" href="../../indices/a-tree/g/Geller:Matthew_M=.html">Matthew M. Geller</a>, <a 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>: Economy of Descriptions by Parsers, DPDA's, and PDA's. 122-127 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GellerHSU75">BibTeX</a></font> <li><a name="Beeri75" href="../../indices/a-tree/b/Beeri:Catriel.html">Catriel Beeri</a>: An Improvement of Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata. 128-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Beeri75">BibTeX</a></font> <li><a name="Rounds75" href="../../indices/a-tree/r/Rounds:William_C=.html">William C. Rounds</a>: A Grammatical Characterization of Exponential-Time Languages. 135-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rounds75">BibTeX</a></font> <li><a name="HuntR75" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/r/Rangel:J=_L=.html">J. L. Rangel</a>: Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract). 144-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuntR75">BibTeX</a></font> <li><a name="ShamosH75" 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>: Closest-Point Problems. 151-162 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShamosH75">BibTeX</a></font> <li><a name="KleitmanK75" href="../../indices/a-tree/k/Kleitman:Daniel_J=.html">Daniel J. Kleitman</a>, <a href="../../indices/a-tree/k/Krieger:Michael_M=.html">Michael M. Krieger</a>: An Optimal Bound for Two Dimensional Bin Packing. 163-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleitmanK75">BibTeX</a></font> <li><a name="AdlemanM75" 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>: Computational Complexity of Decision Procedures for Polynomials (Extended Abstract). 169-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AdlemanM75">BibTeX</a></font> <li><a name="GareyJS75" href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/s/So:H=_C=.html">H. C. So</a>: An Application of Graph Coloring to Printed Circuit Testing (Working Paper). 178-183 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GareyJS75">BibTeX</a></font> <li><a name="EvenIS75" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>, <a href="../../indices/a-tree/i/Itai:Alon.html">Alon Itai</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: On the Complexity of Timetable and Multi-Commodity Flow Problems. 184-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenIS75">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
