focs85.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>26. FOCS 1985: Portland, Oregon</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>26. <a href="index.html">FOCS</a> 1985: Portland, Oregon</h1> 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, 21-23 October 1985. IEEE Computer Society <ul> <li><a name="Yao85" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version). 1-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao85">BibTeX</a></font> <li><a name="AjtaiW85" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version). 11-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AjtaiW85">BibTeX</a></font> <li><a name="Boppana85" href="../../indices/a-tree/b/Boppana:Ravi_B=.html">Ravi B. Boppana</a>: Amplification of Probabilistic Boolean Formulas. 20-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Boppana85">BibTeX</a></font> <li><a name="Pippenger85" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: On Networks of Noisy Gates. 30-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pippenger85">BibTeX</a></font> <li><a name="JohnsonPY85" href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: How Easy Is Local Search? (Extended Abstract). 39-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JohnsonPY85">BibTeX</a></font> <li><a name="JaJa85" href="../../indices/a-tree/j/J=aacute=J=aacute=:Joseph.html">Joseph JáJá</a>: Identification Is Easier Than Decoding. 43-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JaJa85">BibTeX</a></font> <li><a name="Ambos-Spies85" href="../../indices/a-tree/a/Ambos=Spies:Klaus.html">Klaus Ambos-Spies</a>: Three Theorems on Polynomial Degrees of NP-Sets. 51-55 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ambos-Spies85">BibTeX</a></font> <li><a name="Li85" href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>: Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time. 56-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Li85">BibTeX</a></font> <li><a name="Heide85" href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>: Nondeterministic versus Probabilistic Linear Search Algorithms. 65-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Heide85">BibTeX</a></font> <li><a name="PapadimitriouW85" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/w/Wolfe:David.html">David Wolfe</a>: The Complexity of Facets Resolved. 74-78 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PapadimitriouW85">BibTeX</a></font> <li><a name="HochbaumS85" href="../../indices/a-tree/h/Hochbaum:Dorit_S=.html">Dorit S. Hochbaum</a>, <a href="../../indices/a-tree/s/Shmoys:David_B=.html">David B. Shmoys</a>: Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results. 79-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HochbaumS85">BibTeX</a></font> <li><a name="Gabow85" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: A Scaling Algorithm for Weighted Matching on General Graphs. 90-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gabow85">BibTeX</a></font> <li><a name="MoffatT85" href="../../indices/a-tree/m/Moffat:Alistair.html">Alistair Moffat</a>, <a href="../../indices/a-tree/t/Takaoka:Tadao.html">Tadao Takaoka</a>: An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). 101-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MoffatT85">BibTeX</a></font> <li><a name="GaborHS85" href="../../indices/a-tree/g/Gabor:Csaba_P=.html">Csaba P. Gabor</a>, <a href="../../indices/a-tree/h/Hsu:Wen=Lian.html">Wen-Lian Hsu</a>, <a href="../../indices/a-tree/s/Supowit:Kenneth_J=.html">Kenneth J. Supowit</a>: Recognizing Circle Graphs in Polynomial Time. 106-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GaborHS85">BibTeX</a></font> <li><a name="BernLW85" href="../../indices/a-tree/b/Bern:Marshall_W=.html">Marshall W. Bern</a>, <a href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>, <a href="../../indices/a-tree/w/Wong:A=_L=.html">A. L. Wong</a>: Why Certain Subgraph Computations Require Only Linear Time. 117-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BernLW85">BibTeX</a></font> <li><a name="LandauV85" href="../../indices/a-tree/l/Landau:Gad_M=.html">Gad M. Landau</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Efficient String Matching in the Presence of Errors. 126-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LandauV85">BibTeX</a></font> <li><a name="HirschbergL85" href="../../indices/a-tree/h/Hirschberg:Daniel_S=.html">Daniel S. Hirschberg</a>, <a href="../../indices/a-tree/l/Larmore:Lawrence_L=.html">Lawrence L. Larmore</a>: The Least Weight Subsequence Problem (Extended Abstract). 137-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HirschbergL85">BibTeX</a></font> <li><a name="ReifS85" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>: Motion Planning in the Presence of Moving Obstacles. 144-154 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ReifS85">BibTeX</a></font> <li><a name="AsanoAGHI85" href="../../indices/a-tree/a/Asano:Takao.html">Takao Asano</a>, <a href="../../indices/a-tree/a/Asano:Tetsuo.html">Tetsuo Asano</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/h/Hershberger:John.html">John Hershberger</a>, <a href="../../indices/a-tree/i/Imai:Hiroshi.html">Hiroshi Imai</a>: Visibility-Polygon Search and Euclidean Shortest Paths. 155-164 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AsanoAGHI85">BibTeX</a></font> <li><a name="Chazelle85" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: Slimming Down Search Structures: A Functional Approach to Algorithm Design. 165-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle85">BibTeX</a></font> <li><a name="KirousisP85" href="../../indices/a-tree/k/Kirousis:Lefteris_M=.html">Lefteris M. Kirousis</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: The Complexity of Recognizing Polyhedral Scenes (Extended Abstract). 175-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KirousisP85">BibTeX</a></font> <li><a name="AggarwalKLLW85" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/k/Klawe:Maria_M=.html">Maria M. Klawe</a>, <a href="../../indices/a-tree/l/Lichtenstein:David.html">David Lichtenstein</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Multi-Layer Grid Embeddings. 186-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AggarwalKLLW85">BibTeX</a></font> <li><a name="Vitanyi85" href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>: Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary Version). 197-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vitanyi85">BibTeX</a></font> <li><a name="ColeS85" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/s/Siegel:Alan.html">Alan Siegel</a>: On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract). 208-221 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ColeS85">BibTeX</a></font> <li><a name="AtallahH85" href="../../indices/a-tree/a/Atallah:Mikhail_J=.html">Mikhail J. Atallah</a>, <a href="../../indices/a-tree/h/Hambrusch:Susanne_E=.html">Susanne E. Hambrusch</a>: Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version). 222-231 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AtallahH85">BibTeX</a></font> <li><a name="Huang85" href="../../indices/a-tree/h/Huang:Ming=Deh_A=.html">Ming-Deh A. Huang</a>: Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks. 232-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Huang85">BibTeX</a></font> <li><a name="GreenbergL85" href="../../indices/a-tree/g/Greenberg:Ronald_I=.html">Ronald I. Greenberg</a>, <a href="../../indices/a-tree/l/Leiserson:Charles_E=.html">Charles E. Leiserson</a>: Randomized Routing on Fat-Trees (Preliminary Version). 241-249 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GreenbergL85">BibTeX</a></font> <li><a name="AwerbuchG85" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/g/Gallager:Robert_G=.html">Robert G. Gallager</a>: Distributed BFS Algorithms. 250-256 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchG85">BibTeX</a></font> <li><a name="ChinT85" href="../../indices/a-tree/c/Chin:Francis_Y=_L=.html">Francis Y. L. Chin</a>, <a href="../../indices/a-tree/t/Ting:H=_F=.html">H. F. Ting</a>: An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. 257-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChinT85">BibTeX</a></font> <li><a name="FeldmanM85" href="../../indices/a-tree/f/Feldman:Paul.html">Paul Feldman</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: Byzantine Agreement in Constant Expected Time (and Trusting No One). 267-276 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeldmanM85">BibTeX</a></font> <li><a name="AlonFR85" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/f/Frankl:Peter.html">Peter Frankl</a>, <a href="../../indices/a-tree/r/R=ouml=dl:Vojtech.html">Vojtech Rödl</a>: Geometrical Realization of Set Systems and Probabilistic Communication Complexity. 277-280 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonFR85">BibTeX</a></font> <li><a name="CelisLM85" href="../../indices/a-tree/c/Celis:Pedro.html">Pedro Celis</a>, <a href="../../indices/a-tree/l/Larson:Per==Aring=ke.html">Per-Åke Larson</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: Robin Hood Hashing (Preliminary Report). 281-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CelisLM85">BibTeX</a></font> <li><a name="FischerP85" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Dynamic Monotone Priorities on Planar Sets (Extended Abstract). 289-292 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerP85">BibTeX</a></font> <li><a name="Vitter85" href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: Design and Analysis of Dynamic Huffman Coding (Extended Abstract). 293-302 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vitter85">BibTeX</a></font> <li><a name="Mairson85" href="../../indices/a-tree/m/Mairson:Harry_G=.html">Harry G. Mairson</a>: Average Case Lower Bounds on the Construction and Searching of Partial Orders. 303-311 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mairson85">BibTeX</a></font> <li><a name="SharirL85" href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/l/Livne:Ron.html">Ron Livne</a>: On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences. 312-320 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SharirL85">BibTeX</a></font> <li><a name="Rudich85" href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: Inferring the Structure of a Markov Chain from its Output. 321-326 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rudich85">BibTeX</a></font> <li><a name="Vardi85" href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>: Automatic Verification of Probabilistic Concurrent Finite-State Programs. 327-338 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vardi85">BibTeX</a></font> <li><a name="Boehm85" href="../../indices/a-tree/b/Boehm:Hans=Juergen.html">Hans-Juergen Boehm</a>: Partial Polymorphic Type Inference Is Undecidable. 339-345 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Boehm85">BibTeX</a></font> <li><a name="GurevichS85" href="../../indices/a-tree/g/Gurevich:Yuri.html">Yuri Gurevich</a>, <a href="../../indices/a-tree/s/Shelah:Saharon.html">Saharon Shelah</a>: Fixed-Point Extensions of First-Order Logic. 346-353 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GurevichS85">BibTeX</a></font> <li><a name="Courcelle85" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>: Equivalences and Transformations of Recursive Definitions. 354-359 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Courcelle85">BibTeX</a></font> <li><a name="GalilHY85" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/h/Haber:Stuart.html">Stuart Haber</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract). 360-371 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GalilHY85">BibTeX</a></font> <li><a name="CohenF85" href="../../indices/a-tree/c/Cohen:Josh_D=.html">Josh D. Cohen</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract). 372-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CohenF85">BibTeX</a></font> <li><a name="ChorGMA85" href="../../indices/a-tree/c/Chor:Benny.html">Benny Chor</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). 383-395 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChorGMA85">BibTeX</a></font> <li><a name="ChorGHFRS85" href="../../indices/a-tree/c/Chor:Benny.html">Benny Chor</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>, <a href="../../indices/a-tree/f/Friedman:Joel.html">Joel Friedman</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>, <a href="../../indices/a-tree/s/Smolensky:Roman.html">Roman Smolensky</a>: The Bit Extraction Problem of t-Resilient Functions (Preliminary Version). 396-407 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChorGHFRS85">BibTeX</a></font> <li><a name="Ben-OrL85" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>: Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values. 408-416 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ben-OrL85">BibTeX</a></font> <li><a name="VaziraniV85" href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: Random Polynomial Time Is Equal to Slightly-random Polynomial Time. 417-428 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VaziraniV85">BibTeX</a></font> <li><a name="ChorG85" href="../../indices/a-tree/c/Chor:Benny.html">Benny Chor</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract). 429-442 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChorG85">BibTeX</a></font> <li><a name="BachS85" href="../../indices/a-tree/b/Bach:Eric.html">Eric Bach</a>, <a href="../../indices/a-tree/s/Shallit:Jeffrey.html">Jeffrey Shallit</a>: Factoring with Cyclotomic Polynomials. 443-450 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BachS85">BibTeX</a></font> <li><a name="Kaltofen85" href="../../indices/a-tree/k/Kaltofen:Erich.html">Erich Kaltofen</a>: Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization. 451-458 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kaltofen85">BibTeX</a></font> <li><a name="FrankT85" href="../../indices/a-tree/f/Frank:Andr=aacute=s.html">András Frank</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: An Application of Simultaneous Approximation in Combinatorial Optimization. 459-463 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FrankT85">BibTeX</a></font> <li><a name="Lovasz85" href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>: Computing ears and branchings in parallel. 464-467 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lovasz85">BibTeX</a></font> <li><a name="AggarwalCGOY85" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/=/=Oacute==D=uacute=nlaing:Colm.html">Colm Ó'Dúnlaing</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: Parallel Computational Geometry (Extended Abstract). 468-477 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AggarwalCGOY85">BibTeX</a></font> <li><a name="MillerR85" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Parallel Tree Contraction and Its Application. 478-489 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MillerR85">BibTeX</a></font> <li><a name="GalilP85" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC. 490-495 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GalilP85">BibTeX</a></font> <li><a name="Reif85" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: An Optimal Parallel Algorithm for Integer Sorting. 496-504 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reif85">BibTeX</a></font> <li><a name="LuksM85" href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>, <a href="../../indices/a-tree/m/McKenzie:Pierre.html">Pierre McKenzie</a>: Fast Parallel Computation with Permutation Groups. 505-514 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LuksM85">BibTeX</a></font> <li><a name="KozenY85" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: Algebraic Cell Decomposition in NC (Preliminary Version). 515-521 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KozenY85">BibTeX</a></font> <li><a name="Pan85" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: Fast and Efficient Algorithms for Sequential and Parallel Evaluation of Polynomial Zeros and of Matrix Polynomials. 522-531 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pan85">BibTeX</a></font> <li><a name="HeideW85" href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: The Complexity of Parallel Sorting. 532-540 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HeideW85">BibTeX</a></font> <li><a name="KarpUW85" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: The Complexity of Parallel Computation on Matroids. 541-550 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpUW85">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:25 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
