stoc75.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1975</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>7. <a href="index.html">STOC</a> 1975</h1> Proceedings of the 7th Annual ACM Symposium on Theory of Computing, May 5-7, 1975, Albuquerque, New Mexico, USA. ACM 1975 <ul> <li><a name="LiptonD75" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>: Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms. 1-5 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LiptonD75">BibTeX</a></font> <li><a name="RivestV75" href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: A Generalization and Proof of the Aanderaa-Rosenberg Conjecture. 6-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RivestV75">BibTeX</a></font> <li><a name="HyafilK75" href="../../indices/a-tree/h/Hyafil:Laurent.html">Laurent Hyafil</a>, <a href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: The Complexity of Parallel Evaluation of Linear Recurrence. 12-22 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HyafilK75">BibTeX</a></font> <li><a name="Yao75" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: On Computing the Minima of Quadratic Forms (Preliminary Report). 23-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao75">BibTeX</a></font> <li><a name="Paul75" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>: A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions. 27-36 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Paul75">BibTeX</a></font> <li><a name="FischerMP75" 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>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Lower Bounds on the Size of Boolean Formulas: Preliminary Report. 37-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerMP75">BibTeX</a></font> <li><a name="Valiant75" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: On Non-linear Lower Bounds in Computational Complexity. 45-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant75">BibTeX</a></font> <li><a name="HuntS75" 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>: On the Complexity of Grammar and Related Problems. 54-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HuntS75">BibTeX</a></font> <li><a name="EvenT75" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: a Combinatorial Problem which is Complete in Polynomial Space. 66-71 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EvenT75">BibTeX</a></font> <li><a name="Galil75" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: On the Validity and Complexity of Bounded Resolution. 72-82 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Galil75">BibTeX</a></font> <li><a name="Cook75" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version). 83-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook75">BibTeX</a></font> <li><a name="EgliC75" href="../../indices/a-tree/e/Egli:Herbert.html">Herbert Egli</a>, <a href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: Computability Concepts for Programming Language Semantics. 98-106 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EgliC75">BibTeX</a></font> <li><a name="OppenC75" href="../../indices/a-tree/o/Oppen:Derek_C=.html">Derek C. Oppen</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Proving Assertions about Programs that Manipulate Data Structures. 107-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OppenC75">BibTeX</a></font> <li><a name="EhrenfeuchtR75" href="../../indices/a-tree/e/Ehrenfeucht:Andrzej.html">Andrzej Ehrenfeucht</a>, <a href="../../indices/a-tree/r/Rozenberg:Grzegorz.html">Grzegorz Rozenberg</a>: On (Un)predictability of Formal Languages (Extended Abstract). 117-120 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EhrenfeuchtR75">BibTeX</a></font> <li><a name="Skyum75" href="../../indices/a-tree/s/Skyum:Sven.html">Sven Skyum</a>: On Decomposing Languages Defined by Parallel Devices. 121-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Skyum75">BibTeX</a></font> <li><a name="Perrault75" href="../../indices/a-tree/p/Perrault:C=_Raymond.html">C. Raymond Perrault</a>: Intercalation Theorems for Tree Transducer Languages. 126-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Perrault75">BibTeX</a></font> <li><a name="Wotschke75" href="../../indices/a-tree/w/Wotschke:Detlef.html">Detlef Wotschke</a>: Degree-Languages, Polynomial Time Recognition, and the LBA Problem. 145-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wotschke75">BibTeX</a></font> <li><a name="GinsburgL75" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>: Comparative Complexity of Grammar Forms. 153-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GinsburgL75">BibTeX</a></font> <li><a name="RosenbergS75" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Hashing Schemes for Extendible Arrays (Extended Arrays). 159-166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RosenbergS75">BibTeX</a></font> <li><a name="Pratt75" href="../../indices/a-tree/p/Pratt:Terrence_W=.html">Terrence W. Pratt</a>: Four Models for the Analysis of Optimization of Program Control Structures. 167-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pratt75">BibTeX</a></font> <li><a name="AhoU75" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Node Listings for Reducible Flow Graphs. 177-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoU75">BibTeX</a></font> <li><a name="LiptonED75" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/e/Eisenstat:Stanley_C=.html">Stanley C. Eisenstat</a>, <a href="../../indices/a-tree/d/DeMillo:Richard_A=.html">Richard A. DeMillo</a>: The Complexity of Control Structures and Data Structures. 186-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LiptonED75">BibTeX</a></font> <li><a name="MannaS75" href="../../indices/a-tree/m/Manna:Zohar.html">Zohar Manna</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: The Optimal Fixedpoint of Recursive Programs. 194-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MannaS75">BibTeX</a></font> <li><a name="AhoJ75" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/j/Johnson:Stephen_C=.html">Stephen C. Johnson</a>: Optimal Code Generation for Expression Trees. 207-217 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoJ75">BibTeX</a></font> <li><a name="Wagner75" href="../../indices/a-tree/w/Wagner:Robert_A=.html">Robert A. Wagner</a>: On the Complexity of the Extended String-to-String Correction Problem. 218-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wagner75">BibTeX</a></font> <li><a name="Shamos75" href="../../indices/a-tree/s/Shamos:Michael_Ian.html">Michael Ian Shamos</a>: Geometric Complexity. 224-233 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shamos75">BibTeX</a></font> <li><a name="Miller75" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: Riemann's Hypothesis and Tests for Primality. 234-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller75">BibTeX</a></font> <li><a name="Fredman75" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>: Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees. 240-244 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fredman75">BibTeX</a></font> <li><a name="RoseT75" href="../../indices/a-tree/r/Rose:Donald_J=.html">Donald J. Rose</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Algorithmic Aspects of Vertex Elimination. 245-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RoseT75">BibTeX</a></font> <li><a name="BoothL75" href="../../indices/a-tree/b/Booth:Kellogg_S=.html">Kellogg S. Booth</a>, <a href="../../indices/a-tree/l/Lueker:George_S=.html">George S. Lueker</a>: Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property. 255-265 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BoothL75">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:43:09 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
