focs80.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>21. FOCS 1980: Syracuse, New York</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>21. <a href="index.html">FOCS</a> 1980: Syracuse, New York</h1> 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, 13-15 October 1980. IEEE Computer Society <ul> <li><a name="KarpP80" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: On Linear Characterizations of Combinatorial Optimization Problems. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpP80">BibTeX</a></font> <li><a name="Yannakakis80" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: On a Class of Totally Unimodular Matrices. 10-16 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yannakakis80">BibTeX</a></font> <li><a name="MicaliV80" href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs. 17-27 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MicaliV80">BibTeX</a></font> <li><a name="HuS80" href="../../indices/a-tree/h/Hu:T=_C=.html">T. C. Hu</a>, <a href="../../indices/a-tree/s/Shing:M=_T=.html">M. T. Shing</a>: Some Theorems about Matrix Multiplication (Extended Abstract). 28-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuS80">BibTeX</a></font> <li><a name="FurstHL80" href="../../indices/a-tree/f/Furst:Merrick_L=.html">Merrick L. Furst</a>, <a href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>: Polynomial-Time Algorithms for Permutation Groups. 36-41 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FurstHL80">BibTeX</a></font> <li><a name="Luks80" href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>: Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time. 42-49 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Luks80">BibTeX</a></font> <li><a name="Simons80" href="../../indices/a-tree/s/Simons:Barbara.html">Barbara Simons</a>: A Fast Algorithm for Multiprocessor Scheduling. 50-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Simons80">BibTeX</a></font> <li><a name="Mahaney80" href="../../indices/a-tree/m/Mahaney:Stephen_R=.html">Stephen R. Mahaney</a>: Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis. 54-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mahaney80">BibTeX</a></font> <li><a name="Sudborough80" href="../../indices/a-tree/s/Sudborough:Ivan_Hal.html">Ivan Hal Sudborough</a>: Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes. 62-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sudborough80">BibTeX</a></font> <li><a name="Immerman80" href="../../indices/a-tree/i/Immerman:Neil.html">Neil Immerman</a>: Upper and Lower Bounds for First Order Expressibility. 74-82 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Immerman80">BibTeX</a></font> <li><a name="Gurari80" href="../../indices/a-tree/g/Gurari:Eitan_M=.html">Eitan M. Gurari</a>: The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable. 83-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gurari80">BibTeX</a></font> <li><a name="Peterson80" href="../../indices/a-tree/p/Peterson:Gary_L=.html">Gary L. Peterson</a>: Succinct Representation, Random Strings, and Complexity Classes. 86-95 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Peterson80">BibTeX</a></font> <li><a name="HuetH80" href="../../indices/a-tree/h/Huet:G=eacute=rard_P=.html">Gérard P. Huet</a>, <a href="../../indices/a-tree/h/Hullot:Jean=Marie.html">Jean-Marie Hullot</a>: Proofs by Induction in Equational Theories with Constructors. 96-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuetH80">BibTeX</a></font> <li><a name="Chew80" href="../../indices/a-tree/c/Chew:Paul.html">Paul Chew</a>: An Improved Algorithm for Computing With Equations. 108-117 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chew80">BibTeX</a></font> <li><a name="Constable80" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: Programs and Types. 118-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Constable80">BibTeX</a></font> <li><a name="HarelKP80" href="../../indices/a-tree/h/Harel:David.html">David Harel</a>, <a href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>, <a href="../../indices/a-tree/p/Parikh:Rohit.html">Rohit Parikh</a>: Process Logic: Expressiveness, Decidability, Completeness. 129-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HarelKP80">BibTeX</a></font> <li><a name="FrancezLP80" href="../../indices/a-tree/f/Francez:Nissim.html">Nissim Francez</a>, <a href="../../indices/a-tree/l/Lehmann:Daniel_J=.html">Daniel J. Lehmann</a>, <a href="../../indices/a-tree/p/Pnueli:Amir.html">Amir Pnueli</a>: A Linear History Semantics for Distributed Languages (Extended Abstract). 143-151 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FrancezLP80">BibTeX</a></font> <li><a name="HuntR80" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>: The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract). 152-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HuntR80">BibTeX</a></font> <li><a name="CourcelleF80" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>, <a href="../../indices/a-tree/f/Franchi=Zannettacci:Paul.html">Paul Franchi-Zannettacci</a>: On the Expressive Power of Attribute Grammars. 161-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CourcelleF80">BibTeX</a></font> <li><a name="Kfoury80" href="../../indices/a-tree/k/Kfoury:A=_J=.html">A. J. Kfoury</a>: Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report). 173-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kfoury80">BibTeX</a></font> <li><a name="JonesM80" href="../../indices/a-tree/j/Jones:Neil_D=.html">Neil D. Jones</a>, <a href="../../indices/a-tree/m/Muchnick:Steven_S=.html">Steven S. Muchnick</a>: Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra. 185-190 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JonesM80">BibTeX</a></font> <li><a name="Fredman80" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>: The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries. 191-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fredman80">BibTeX</a></font> <li><a name="DobkinM80" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: Efficient Uses of the Past. 200-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DobkinM80">BibTeX</a></font> <li><a name="FlajoletO80" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/o/Odlyzko:Andrew_M=.html">Andrew M. Odlyzko</a>: Exploring Binary Trees and Other Simple Trees. 207-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlajoletO80">BibTeX</a></font> <li><a name="BentleyB80" href="../../indices/a-tree/b/Bentley:Jon_Louis.html">Jon Louis Bentley</a>, <a href="../../indices/a-tree/b/Brown:Donna_J=.html">Donna J. Brown</a>: A General Class of Resource Tradeoffs (Extended Abstract). 217-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BentleyB80">BibTeX</a></font> <li><a name="Doberkat80" href="../../indices/a-tree/d/Doberkat:Ernst=Erich.html">Ernst-Erich Doberkat</a>: Some Observations on the Average Behavior of Heapsort (Preliminary Report). 229-237 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Doberkat80">BibTeX</a></font> <li><a name="Vitter80" href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract). 238-247 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vitter80">BibTeX</a></font> <li><a name="BentST80" href="../../indices/a-tree/b/Bent:Samuel_W=.html">Samuel W. Bent</a>, <a href="../../indices/a-tree/s/Sleator:Daniel_Dominic.html">Daniel Dominic Sleator</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Biased 2-3 Trees. 248-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BentST80">BibTeX</a></font> <li><a name="Frederickson80" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>: Implicit Data Structures with Fast Update (Preliminary Report). 255-259 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Frederickson80">BibTeX</a></font> <li><a name="FloydU80" href="../../indices/a-tree/f/Floyd:Robert_W=.html">Robert W. Floyd</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). 260-269 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FloydU80">BibTeX</a></font> <li><a name="Leiserson80" href="../../indices/a-tree/l/Leiserson:Charles_E=.html">Charles E. Leiserson</a>: Area-Efficient Graph Layouts (for VLSI). 270-281 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Leiserson80">BibTeX</a></font> <li><a name="LaPaugh80" href="../../indices/a-tree/l/LaPaugh:Andrea_S=.html">Andrea S. LaPaugh</a>: A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract). 282-293 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LaPaugh80">BibTeX</a></font> <li><a name="Vuillemin80" href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract). 294-300 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vuillemin80">BibTeX</a></font> <li><a name="Yao80" href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report). 301-307 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao80">BibTeX</a></font> <li><a name="Harel80" href="../../indices/a-tree/h/Harel:Dov.html">Dov Harel</a>: A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract). 308-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Harel80">BibTeX</a></font> <li><a name="Wegman80" href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>: Parsing for Structural Editors (Extended Abstract). 320-327 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wegman80">BibTeX</a></font> <li><a name="YannakakisP80" 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>: Algebraic Dependencies (Extended Abstract). 328-332 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/YannakakisP80">BibTeX</a></font> <li><a name="ChandraH80" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/h/Harel:David.html">David Harel</a>: Structure and Complexity of Relational Queries. 333-347 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChandraH80">BibTeX</a></font> <li><a name="Hong80" href="../../indices/a-tree/h/Hong:Jia=Wei.html">Jia-Wei Hong</a>: On Similarity and Duality of Computation (Extended Abstract). 348-359 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hong80">BibTeX</a></font> <li><a name="DymondC80" href="../../indices/a-tree/d/Dymond:Patrick_W=.html">Patrick W. Dymond</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Hardware Complexity and Parallel Computation (Preliminary Version). 360-372 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DymondC80">BibTeX</a></font> <li><a name="FrancezR80" href="../../indices/a-tree/f/Francez:Nissim.html">Nissim Francez</a>, <a href="../../indices/a-tree/r/Rodeh:Michael.html">Michael Rodeh</a>: A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme. 373-379 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FrancezR80">BibTeX</a></font> <li><a name="Brassard80" href="../../indices/a-tree/b/Brassard:Gilles.html">Gilles Brassard</a>: A Time-Luck Tradeoff in Cryptography. 380-386 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Brassard80">BibTeX</a></font> <li><a name="Adleman80" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: On Distinguishing Prime Numbers from Composite Numbers (Abstract). 387-406 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Adleman80">BibTeX</a></font> <li><a name="Rabin80" href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>: N-Process Synchronization by 4 log _2 N-Valued Shared Variables. 407-410 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rabin80">BibTeX</a></font> <li><a name="BraunmuhlV80" href="../../indices/a-tree/b/Braunm=uuml=hl:Burchard_von.html">Burchard von Braunmühl</a>, <a href="../../indices/a-tree/v/Verbeek:Rutger.html">Rutger Verbeek</a>: A Recognition Algorithm for Deterministic CFLS optimal in Time and Space. 411-420 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BraunmuhlV80">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
