focs79.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>20. FOCS 1979: San Juan, Puerto Rico</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>20. <a href="index.html">FOCS</a> 1979: San Juan, Puerto Rico</h1> 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 29-31 October 1979. IEEE Computer Society <ul> <li><a name="Yemini79" href="../../indices/a-tree/y/Yemini:Yechiam.html">Yechiam Yemini</a>: Some Theoretical Aspects of Position-Location Problems. 1-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yemini79">BibTeX</a></font> <li><a name="DobkinS79" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>, <a href="../../indices/a-tree/s/Snyder:Lawrence.html">Lawrence Snyder</a>: On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract). 9-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DobkinS79">BibTeX</a></font> <li><a name="Kirkpatrick79" href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>: Efficient Computation of Continuous Skeletons. 18-27 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kirkpatrick79">BibTeX</a></font> <li><a name="Pan79" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: Field Extension and Triangular Aggregating, Uniting and Canceling for the Acceleration of Matrix Multiplications. 28-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pan79">BibTeX</a></font> <li><a name="BabaiK79" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/k/Kucera:Ludek.html">Ludek Kucera</a>: Canonical Labelling of Graphs in Linear Average Time. 39-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BabaiK79">BibTeX</a></font> <li><a name="Lagarias79" href="../../indices/a-tree/l/Lagarias:J=_C=.html">J. C. Lagarias</a>: Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations. 47-54 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lagarias79">BibTeX</a></font> <li><a name="Adleman79" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract). 55-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Adleman79">BibTeX</a></font> <li><a name="Greibach79" href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Formal Languages: Origins and Directions. 66-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Greibach79">BibTeX</a></font> <li><a name="Blattner79" href="../../indices/a-tree/b/Blattner:Meera.html">Meera Blattner</a>: The Decidability of the Equivalence of Context-Free Grammar Forms. 91-96 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Blattner79">BibTeX</a></font> <li><a name="MaurerN79" href="../../indices/a-tree/m/Maurer:Hermann_A=.html">Hermann A. Maurer</a>, <a href="../../indices/a-tree/n/Nivat:Maurice.html">Maurice Nivat</a>: Bijective A-Transducers. 97-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MaurerN79">BibTeX</a></font> <li><a name="Kozen79" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: Semantics of Probabilistic Programs. 101-114 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kozen79">BibTeX</a></font> <li><a name="Pratt79" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: Models of Program Logics. 115-122 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pratt79">BibTeX</a></font> <li><a name="Dershowitz79" href="../../indices/a-tree/d/Dershowitz:Nachum.html">Nachum Dershowitz</a>: Orderings for Term-Rewriting Systems. 123-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Dershowitz79">BibTeX</a></font> <li><a name="LieberherrS79" href="../../indices/a-tree/l/Lieberherr:Karl_J=.html">Karl J. Lieberherr</a>, <a href="../../indices/a-tree/s/Specker:Ernst.html">Ernst Specker</a>: Complexity of Partial Satisfaction. 132-139 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LieberherrS79">BibTeX</a></font> <li><a name="PreparataV79" href="../../indices/a-tree/p/Preparata:Franco_P=.html">Franco P. Preparata</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract). 140-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PreparataV79">BibTeX</a></font> <li><a name="SaxeB79" href="../../indices/a-tree/s/Saxe:James_B=.html">James B. Saxe</a>, <a href="../../indices/a-tree/b/Bentley:Jon_Louis.html">Jon Louis Bentley</a>: Transforming Static Data Structures to Dynamic Structures (Abridged Version). 148-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SaxeB79">BibTeX</a></font> <li><a name="GonnetMS79" href="../../indices/a-tree/g/Gonnet:Gaston_H=.html">Gaston H. Gonnet</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>, <a href="../../indices/a-tree/s/Suwanda:Hendra.html">Hendra Suwanda</a>: Toward Self-Organizing Linear Search (Preliminary Draught). 169-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GonnetMS79">BibTeX</a></font> <li><a name="WegmanC79" href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>, <a href="../../indices/a-tree/c/Carter:Larry.html">Larry Carter</a>: New Classes and Applications of Hash Functions. 175-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/WegmanC79">BibTeX</a></font> <li><a name="FlajoletFV79" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/f/Fran=ccedil=on:Jean.html">Jean Françon</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version). 183-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlajoletFV79">BibTeX</a></font> <li><a name="GabowT79" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Efficient Algorithms for Simple Matroid Intersection Problems. 196-204 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GabowT79">BibTeX</a></font> <li><a name="AspvallS79" href="../../indices/a-tree/a/Aspvall:Bengt.html">Bengt Aspvall</a>, <a href="../../indices/a-tree/s/Shiloach:Yossi.html">Yossi Shiloach</a>: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. 205-217 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AspvallS79">BibTeX</a></font> <li><a name="AleliunasKLLR79" href="../../indices/a-tree/a/Aleliunas:Romas.html">Romas Aleliunas</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. 218-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AleliunasKLLR79">BibTeX</a></font> <li><a name="Hartmanis79" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: Observations about the Development of Theoretical Computer Science. 224-233 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hartmanis79">BibTeX</a></font> <li><a name="FischerLBB79" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/b/Burns:James_E=.html">James E. Burns</a>, <a href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>: Resource Allocation with Immunity to Limited Process Failure (Preliminary Report). 234-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerLBB79">BibTeX</a></font> <li><a name="ClarkeL79" href="../../indices/a-tree/c/Clarke:Edmund_M=.html">Edmund M. Clarke</a>, <a href="../../indices/a-tree/l/Liu:Lishing.html">Lishing Liu</a>: Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs (Preliminary Report). 255-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ClarkeL79">BibTeX</a></font> <li><a name="AhoUY79" 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>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Modeling Communications Protocols by Automata. 267-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoUY79">BibTeX</a></font> <li><a name="KedemS79" href="../../indices/a-tree/k/Kedem:Zvi_M=.html">Zvi M. Kedem</a>, <a href="../../indices/a-tree/s/Silberschatz:Abraham.html">Abraham Silberschatz</a>: Controlling Concurrency Using Locking Protocols (Preliminary Report). 274-285 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KedemS79">BibTeX</a></font> <li><a name="YannakakisPK79" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: Locking Policies: Safety and Freedom from Deadlock. 286-297 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/YannakakisPK79">BibTeX</a></font> <li><a name="PaulR79" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">Rüdiger Reischuk</a>: On Time versus Space II. 298-306 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaulR79">BibTeX</a></font> <li><a name="Ruzzo79" href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>: On Uniform Circuit Complexity (Extended Abstract). 312-318 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ruzzo79">BibTeX</a></font> <li><a name="BorodinFKLT79" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. 319-327 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BorodinFKLT79">BibTeX</a></font> <li><a name="SchroeppelS79" href="../../indices/a-tree/s/Schroeppel:Richard.html">Richard Schroeppel</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems. 328-336 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SchroeppelS79">BibTeX</a></font> <li><a name="Immerman79" href="../../indices/a-tree/i/Immerman:Neil.html">Neil Immerman</a>: Length of Predicate Calculus Formulas as a New Complexity Measure. 337-347 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Immerman79">BibTeX</a></font> <li><a name="PetersonR79" href="../../indices/a-tree/p/Peterson:Gary_L=.html">Gary L. Peterson</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Multiple-Person Alternation. 348-363 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PetersonR79">BibTeX</a></font> <li><a name="GabberG79" href="../../indices/a-tree/g/Gabber:Ofer.html">Ofer Gabber</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Explicit Constructions of Linear Size Superconcentrators. 364-370 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GabberG79">BibTeX</a></font> <li><a name="Kleene79" href="../../indices/a-tree/k/Kleene:Stephen_Cole.html">Stephen Cole Kleene</a>: Origins of Recursive Function Theory. 371-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kleene79">BibTeX</a></font> <li><a name="Brassard79" href="../../indices/a-tree/b/Brassard:Gilles.html">Gilles Brassard</a>: Relativized Cryptography. 383-391 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Brassard79">BibTeX</a></font> <li><a name="BakerH79" href="../../indices/a-tree/b/Baker:Theodore_P=.html">Theodore P. Baker</a>, <a href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages. 392-396 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BakerH79">BibTeX</a></font> <li><a name="AdlemanM79" 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>: Reductions that Lie. 397-410 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AdlemanM79">BibTeX</a></font> <li><a name="Simon79" href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: Division Is Good. 411-420 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Simon79">BibTeX</a></font> <li><a name="Reif79" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Complexity of the Mover's Problem and Generalizations (Extended Abstract). 421-427 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reif79">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
