stoc78.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1978</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>10. <a href="index.html">STOC</a> 1978</h1> Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 <ul> <li><a name="Megiddo78" href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>: Combinatorial Optimization with Rational Objective Functions. 1-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Megiddo78">BibTeX</a></font> <li><a name="Lueker78" href="../../indices/a-tree/l/Lueker:George_S=.html">George S. Lueker</a>: Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract). 13-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lueker78">BibTeX</a></font> <li><a name="BrownT78" href="../../indices/a-tree/b/Brown:Mark_R=.html">Mark R. Brown</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: A Representation for Linear Lists with Movable Fingers. 19-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrownT78">BibTeX</a></font> <li><a name="StorerS78" href="../../indices/a-tree/s/Storer:James_A=.html">James A. Storer</a>, <a href="../../indices/a-tree/s/Szymanski:Thomas_G=.html">Thomas G. Szymanski</a>: The Macro Model for Data Compression (Extended Abstract). 30-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/StorerS78">BibTeX</a></font> <li><a name="LapaughR78" href="../../indices/a-tree/l/LaPaugh:Andrea_S=.html">Andrea S. LaPaugh</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>: The Subgraph Homeomorphism Problem. 40-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LapaughR78">BibTeX</a></font> <li><a name="Miller78" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: On the n^log n Isomorphism Technique: A Preliminary Report. 51-58 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller78">BibTeX</a></font> <li><a name="CarterFGMW78" href="../../indices/a-tree/c/Carter:Larry.html">Larry Carter</a>, <a href="../../indices/a-tree/f/Floyd:Robert_W=.html">Robert W. Floyd</a>, <a href="../../indices/a-tree/g/Gill:John.html">John Gill</a>, <a href="../../indices/a-tree/m/Markowsky:George.html">George Markowsky</a>, <a href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>: Exact and Approximate Membership Testers. 59-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CarterFGMW78">BibTeX</a></font> <li><a name="EngelfrietRS78" href="../../indices/a-tree/e/Engelfriet:Joost.html">Joost Engelfriet</a>, <a href="../../indices/a-tree/r/Rozenberg:Grzegorz.html">Grzegorz Rozenberg</a>, <a href="../../indices/a-tree/s/Slutzki:Giora.html">Giora Slutzki</a>: Tree Transducers, L Systems and Two-Way Machines (Extended Abstract). 66-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EngelfrietRS78">BibTeX</a></font> <li><a name="RaoultV78" href="../../indices/a-tree/r/Raoult:Jean=Claude.html">Jean-Claude Raoult</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Operational and Semantic Equivalence between Recursive Programs. 75-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RaoultV78">BibTeX</a></font> <li><a name="Katseff78" href="../../indices/a-tree/k/Katseff:Howard_P=.html">Howard P. Katseff</a>: A New Solution to the Critical Section Problem. 86-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Katseff78">BibTeX</a></font> <li><a name="Goldschlager78" href="../../indices/a-tree/g/Goldschlager:Leslie_M=.html">Leslie M. Goldschlager</a>: A Unified Approach to Models of Synchronous Parallel Machines. 89-94 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Goldschlager78">BibTeX</a></font> <li><a name="ScioreT78" href="../../indices/a-tree/s/Sciore:Edward.html">Edward Sciore</a>, <a href="../../indices/a-tree/t/Tang:A=.html">A. Tang</a>: Computability Theory in Admissible Domains. 95-104 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ScioreT78">BibTeX</a></font> <li><a name="MillerY78" href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: On Formulating Simultaneity for Studying Parallelism and Synchronization. 105-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MillerY78">BibTeX</a></font> <li><a name="FortuneW78" href="../../indices/a-tree/f/Fortune:Steven.html">Steven Fortune</a>, <a href="../../indices/a-tree/w/Wyllie:James.html">James Wyllie</a>: Parallelism in Random Access Machines. 114-118 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FortuneW78">BibTeX</a></font> <li><a name="ThatcherWW78" 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/w/Wright:Jesse_B=.html">Jesse B. Wright</a>: Data Type Specification: Parameterization and the Power of Specification Techniques. 119-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ThatcherWW78">BibTeX</a></font> <li><a name="Filotti78" href="../../indices/a-tree/f/Filotti:I=_S=.html">I. S. Filotti</a>: An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal. 133-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Filotti78">BibTeX</a></font> <li><a name="Wegener78" href="../../indices/a-tree/w/Wegener:Ingo.html">Ingo Wegener</a>: Switching Functions Whose Monotone Complexity Is Nearly Quadratic. 143-149 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wegener78">BibTeX</a></font> <li><a name="Lynch78" href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>: Straight-Line Program Length as a Parameter for Complexity Measures. 150-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lynch78">BibTeX</a></font> <li><a name="Pan78" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers. 162-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pan78">BibTeX</a></font> <li><a name="JaJa78" href="../../indices/a-tree/j/J=aacute=J=aacute=:Joseph.html">Joseph JáJá</a>: Optimal Evaluation of Pairs of Bilinear Forms. 173-183 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JaJa78">BibTeX</a></font> <li><a name="GabowK78" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/k/Kariv:Oded.html">Oded Kariv</a>: Algorithms for Edge Coloring Bipartite Graphs. 184-192 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GabowK78">BibTeX</a></font> <li><a name="Hyafil78" href="../../indices/a-tree/h/Hyafil:Laurent.html">Laurent Hyafil</a>: On the Parallel Evaluation of Multivariate Polynomials. 193-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hyafil78">BibTeX</a></font> <li><a name="Tompa78" href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits. 196-204 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tompa78">BibTeX</a></font> <li><a name="GurariI78" href="../../indices/a-tree/g/Gurari:Eitan_M=.html">Eitan M. Gurari</a>, <a href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>: An NP-Complete Number-Theoretic Problem. 205-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GurariI78">BibTeX</a></font> <li><a name="Schaefer78" href="../../indices/a-tree/s/Schaefer:Thomas_J=.html">Thomas J. Schaefer</a>: The Complexity of Satisfiability Problems. 216-226 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Schaefer78">BibTeX</a></font> <li><a name="RivestMKWS78" href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/k/Kleitman:Daniel_J=.html">Daniel J. Kleitman</a>, <a href="../../indices/a-tree/w/Winklmann:Karl.html">Karl Winklmann</a>, <a href="../../indices/a-tree/s/Spencer:Joel.html">Joel Spencer</a>: Coping with Errors in Binary Search Procedures (Preliminary Report). 227-232 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RivestMKWS78">BibTeX</a></font> <li><a name="BrussM78" href="../../indices/a-tree/b/Bruss:Anni_R=.html">Anni R. Bruss</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: On Time-Space Classes and Their Relation to the Theory of Real Addition. 233-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrussM78">BibTeX</a></font> <li><a name="KirkpatrickH78" href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>, <a href="../../indices/a-tree/h/Hell:Pavol.html">Pavol Hell</a>: On the Completeness of a Generalized Matching Problem. 240-245 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KirkpatrickH78">BibTeX</a></font> <li><a name="Dowd78" href="../../indices/a-tree/d/Dowd:Martin.html">Martin Dowd</a>: Propositional Representation of Arithmetic Proofs (Preliminary Version). 246-252 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Dowd78">BibTeX</a></font> <li><a name="Yannakakis78" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Node- and Edge-Deletion NP-Complete Problems. 253-264 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yannakakis78">BibTeX</a></font> <li><a name="Lewis78" href="../../indices/a-tree/l/Lewis:John_M=.html">John M. Lewis</a>: On the Complexity of the Maximum Subgraph Problem. 265-274 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lewis78">BibTeX</a></font> <li><a name="SakodaS78" href="../../indices/a-tree/s/Sakoda:William_J=.html">William J. Sakoda</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Nondeterminism and the Size of Two Way Finite Automata. 275-286 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SakodaS78">BibTeX</a></font> <li><a name="Kozen78" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: Indexing of Subrecursive Classes. 287-295 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kozen78">BibTeX</a></font> <li><a name="Baudet78" href="../../indices/a-tree/b/Baudet:G=eacute=rard_M=.html">Gérard M. Baudet</a>: An Analysis of the Full Alpha-Beta Pruning Algorithm. 296-313 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Baudet78">BibTeX</a></font> <li><a name="CaseS78" href="../../indices/a-tree/c/Case:John.html">John Case</a>, <a href="../../indices/a-tree/s/Smith:Carl.html">Carl Smith</a>: Anomaly Hierarchies of Mechanized Inductive Inference. 314-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CaseS78">BibTeX</a></font> <li><a name="ReddyL78" href="../../indices/a-tree/r/Reddy:C=_R=.html">C. R. Reddy</a>, <a href="../../indices/a-tree/l/Loveland:Donald_W=.html">Donald W. Loveland</a>: Presburger Arithmetic with Bounded Quantifier Alternation. 320-325 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ReddyL78">BibTeX</a></font> <li><a name="Pratt78" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. 326-337 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pratt78">BibTeX</a></font> <li><a name="Rackoff78" href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>: Relativized Questions Involving Probabilistic Algorithms. 338-342 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rackoff78">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
