Search dblp for Publications

export results for "toc:db/conf/focs/focs85.bht:"

 download as .bib file

@inproceedings{DBLP:conf/focs/AggarwalCGOY85,
  author       = {Alok Aggarwal and
                  Bernard Chazelle and
                  Leonidas J. Guibas and
                  Colm {\'{O}}'D{\'{u}}nlaing and
                  Chee{-}Keng Yap},
  title        = {Parallel Computational Geometry (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {468--477},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.42},
  doi          = {10.1109/SFCS.1985.42},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AggarwalCGOY85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AggarwalKLLW85,
  author       = {Alok Aggarwal and
                  Maria M. Klawe and
                  David Lichtenstein and
                  Nathan Linial and
                  Avi Wigderson},
  title        = {Multi-Layer Grid Embeddings},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {186--196},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.37},
  doi          = {10.1109/SFCS.1985.37},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AggarwalKLLW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AjtaiW85,
  author       = {Mikl{\'{o}}s Ajtai and
                  Avi Wigderson},
  title        = {Deterministic Simulation of Probabilistic Constant Depth Circuits
                  (Preliminary Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {11--19},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.19},
  doi          = {10.1109/SFCS.1985.19},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AjtaiW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonFR85,
  author       = {Noga Alon and
                  Peter Frankl and
                  Vojtech R{\"{o}}dl},
  title        = {Geometrical Realization of Set Systems and Probabilistic Communication
                  Complexity},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {277--280},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.30},
  doi          = {10.1109/SFCS.1985.30},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AlonFR85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ambos-Spies85,
  author       = {Klaus Ambos{-}Spies},
  title        = {Three Theorems on Polynomial Degrees of NP-Sets},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {51--55},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.61},
  doi          = {10.1109/SFCS.1985.61},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Ambos-Spies85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AsanoAGHI85,
  author       = {Takao Asano and
                  Tetsuo Asano and
                  Leonidas J. Guibas and
                  John Hershberger and
                  Hiroshi Imai},
  title        = {Visibility-Polygon Search and Euclidean Shortest Paths},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {155--164},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.65},
  doi          = {10.1109/SFCS.1985.65},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AsanoAGHI85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AtallahH85,
  author       = {Mikhail J. Atallah and
                  Susanne E. Hambrusch},
  title        = {Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary
                  Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {222--231},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.53},
  doi          = {10.1109/SFCS.1985.53},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AtallahH85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AwerbuchG85,
  author       = {Baruch Awerbuch and
                  Robert G. Gallager},
  title        = {Distributed {BFS} Algorithms},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {250--256},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.20},
  doi          = {10.1109/SFCS.1985.20},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AwerbuchG85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BachS85,
  author       = {Eric Bach and
                  Jeffrey O. Shallit},
  title        = {Factoring with Cyclotomic Polynomials},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {443--450},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.24},
  doi          = {10.1109/SFCS.1985.24},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BachS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-OrL85,
  author       = {Michael Ben{-}Or and
                  Nathan Linial},
  title        = {Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf
                  Values},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {408--416},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.15},
  doi          = {10.1109/SFCS.1985.15},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Ben-OrL85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernLW85,
  author       = {Marshall W. Bern and
                  Eugene L. Lawler and
                  A. L. Wong},
  title        = {Why Certain Subgraph Computations Require Only Linear Time},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {117--125},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.66},
  doi          = {10.1109/SFCS.1985.66},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BernLW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Boehm85,
  author       = {Hans{-}Juergen Boehm},
  title        = {Partial Polymorphic Type Inference Is Undecidable},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {339--345},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.44},
  doi          = {10.1109/SFCS.1985.44},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Boehm85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Boppana85,
  author       = {Ravi B. Boppana},
  title        = {Amplification of Probabilistic Boolean Formulas},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {20--29},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.5},
  doi          = {10.1109/SFCS.1985.5},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Boppana85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CelisLM85,
  author       = {Pedro Celis and
                  Per{-}{\AA}ke Larson and
                  J. Ian Munro},
  title        = {Robin Hood Hashing (Preliminary Report)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {281--288},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.48},
  doi          = {10.1109/SFCS.1985.48},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/CelisLM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chazelle85,
  author       = {Bernard Chazelle},
  title        = {Slimming Down Search Structures: {A} Functional Approach to Algorithm
                  Design},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {165--174},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.51},
  doi          = {10.1109/SFCS.1985.51},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Chazelle85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChinT85,
  author       = {Francis Y. L. Chin and
                  H. F. Ting},
  title        = {An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm
                  for Minimum-Weight Spanning Trees},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {257--266},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.7},
  doi          = {10.1109/SFCS.1985.7},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ChinT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChorG85,
  author       = {Benny Chor and
                  Oded Goldreich},
  title        = {Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication
                  Complexity (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {429--442},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.62},
  doi          = {10.1109/SFCS.1985.62},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ChorG85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChorGHFRS85,
  author       = {Benny Chor and
                  Oded Goldreich and
                  Johan H{\aa}stad and
                  Joel Friedman and
                  Steven Rudich and
                  Roman Smolensky},
  title        = {The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {396--407},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.55},
  doi          = {10.1109/SFCS.1985.55},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ChorGHFRS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChorGMA85,
  author       = {Benny Chor and
                  Shafi Goldwasser and
                  Silvio Micali and
                  Baruch Awerbuch},
  title        = {Verifiable Secret Sharing and Achieving Simultaneity in the Presence
                  of Faults (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {383--395},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.64},
  doi          = {10.1109/SFCS.1985.64},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ChorGMA85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenF85,
  author       = {Josh D. Cohen and
                  Michael J. Fischer},
  title        = {A Robust and Verifiable Cryptographically Secure Election Scheme (Extended
                  Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {372--382},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.2},
  doi          = {10.1109/SFCS.1985.2},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/CohenF85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ColeS85,
  author       = {Richard Cole and
                  Alan Siegel},
  title        = {On Information Flow and Sorting: New Upper and Lower Bounds for {VLSI}
                  Circuits (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {208--221},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.39},
  doi          = {10.1109/SFCS.1985.39},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ColeS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Courcelle85,
  author       = {Bruno Courcelle},
  title        = {Equivalences and Transformations of Recursive Definitions},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {354--359},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.23},
  doi          = {10.1109/SFCS.1985.23},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Courcelle85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanM85,
  author       = {Paul Feldman and
                  Silvio Micali},
  title        = {Byzantine Agreement in Constant Expected Time (and Trusting No One)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {267--276},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.14},
  doi          = {10.1109/SFCS.1985.14},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FeldmanM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerP85,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Dynamic Monotone Priorities on Planar Sets (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {289--292},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.21},
  doi          = {10.1109/SFCS.1985.21},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FischerP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FrankT85,
  author       = {Andr{\'{a}}s Frank and
                  {\'{E}}va Tardos},
  title        = {An Application of Simultaneous Approximation in Combinatorial Optimization},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {459--463},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.8},
  doi          = {10.1109/SFCS.1985.8},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FrankT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaborHS85,
  author       = {Csaba P. Gabor and
                  Wen{-}Lian Hsu and
                  Kenneth J. Supowit},
  title        = {Recognizing Circle Graphs in Polynomial Time},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {106--116},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.47},
  doi          = {10.1109/SFCS.1985.47},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GaborHS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gabow85,
  author       = {Harold N. Gabow},
  title        = {A Scaling Algorithm for Weighted Matching on General Graphs},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {90--100},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.3},
  doi          = {10.1109/SFCS.1985.3},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Gabow85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilHY85,
  author       = {Zvi Galil and
                  Stuart Haber and
                  Moti Yung},
  title        = {A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge
                  Public-Key Cryptosystems (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {360--371},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.1},
  doi          = {10.1109/SFCS.1985.1},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GalilHY85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilP85,
  author       = {Zvi Galil and
                  Victor Y. Pan},
  title        = {Improved Processor Bounds for Algebraic and Combinatorial Problems
                  in {RNC}},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {490--495},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.33},
  doi          = {10.1109/SFCS.1985.33},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GalilP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GreenbergL85,
  author       = {Ronald I. Greenberg and
                  Charles E. Leiserson},
  title        = {Randomized Routing on Fat-Trees (Preliminary Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {241--249},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.46},
  doi          = {10.1109/SFCS.1985.46},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GreenbergL85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GurevichS85,
  author       = {Yuri Gurevich and
                  Saharon Shelah},
  title        = {Fixed-Point Extensions of First-Order Logic},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {346--353},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.27},
  doi          = {10.1109/SFCS.1985.27},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GurevichS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Heide85,
  author       = {Friedhelm Meyer auf der Heide},
  title        = {Nondeterministic versus Probabilistic Linear Search Algorithms},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {65--73},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.38},
  doi          = {10.1109/SFCS.1985.38},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Heide85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HeideW85,
  author       = {Friedhelm Meyer auf der Heide and
                  Avi Wigderson},
  title        = {The Complexity of Parallel Sorting},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {532--540},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.58},
  doi          = {10.1109/SFCS.1985.58},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HeideW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HirschbergL85,
  author       = {Daniel S. Hirschberg and
                  Lawrence L. Larmore},
  title        = {The Least Weight Subsequence Problem (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {137--143},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.60},
  doi          = {10.1109/SFCS.1985.60},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HirschbergL85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HochbaumS85,
  author       = {Dorit S. Hochbaum and
                  David B. Shmoys},
  title        = {Using Dual Approximation Algorithms for Scheduling Problems: Theoretical
                  and Practical Results},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {79--89},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.63},
  doi          = {10.1109/SFCS.1985.63},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/HochbaumS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Huang85,
  author       = {Ming{-}Deh A. Huang},
  title        = {Solving Some Graph Problems with Optimal or Near-Optimal Speedup on
                  Mesh-of-Trees Networks},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {232--240},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.52},
  doi          = {10.1109/SFCS.1985.52},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Huang85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JaJa85,
  author       = {Joseph F. J{\'{a}}J{\'{a}}},
  title        = {Identification Is Easier Than Decoding},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {43--50},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.32},
  doi          = {10.1109/SFCS.1985.32},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/JaJa85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnsonPY85,
  author       = {David S. Johnson and
                  Christos H. Papadimitriou and
                  Mihalis Yannakakis},
  title        = {How Easy Is Local Search? (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {39--42},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.31},
  doi          = {10.1109/SFCS.1985.31},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/JohnsonPY85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kaltofen85,
  author       = {Erich L. Kaltofen},
  title        = {Computing with Polynomials Given by Straight-Line Programs {II:} Sparse
                  Factorization},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {451--458},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.17},
  doi          = {10.1109/SFCS.1985.17},
  timestamp    = {Mon, 03 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/Kaltofen85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarpUW85,
  author       = {Richard M. Karp and
                  Eli Upfal and
                  Avi Wigderson},
  title        = {The Complexity of Parallel Computation on Matroids},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {541--550},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.57},
  doi          = {10.1109/SFCS.1985.57},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KarpUW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KirousisP85,
  author       = {Lefteris M. Kirousis and
                  Christos H. Papadimitriou},
  title        = {The Complexity of Recognizing Polyhedral Scenes (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {175--185},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.59},
  doi          = {10.1109/SFCS.1985.59},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KirousisP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KozenY85,
  author       = {Dexter Kozen and
                  Chee{-}Keng Yap},
  title        = {Algebraic Cell Decomposition in {NC} (Preliminary Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {515--521},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.4},
  doi          = {10.1109/SFCS.1985.4},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/KozenY85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LandauV85,
  author       = {Gad M. Landau and
                  Uzi Vishkin},
  title        = {Efficient String Matching in the Presence of Errors},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {126--136},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.22},
  doi          = {10.1109/SFCS.1985.22},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/LandauV85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li85,
  author       = {Ming Li},
  title        = {Simulating Two Pushdown Stores by One Tape in O(n1.5 sqrt(log n))
                  Time},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {56--64},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.50},
  doi          = {10.1109/SFCS.1985.50},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Li85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lovasz85,
  author       = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
  title        = {Computing ears and branchings in parallel},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {464--467},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.16},
  doi          = {10.1109/SFCS.1985.16},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Lovasz85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LuksM85,
  author       = {Eugene M. Luks and
                  Pierre McKenzie},
  title        = {Fast Parallel Computation with Permutation Groups},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {505--514},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.26},
  doi          = {10.1109/SFCS.1985.26},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/LuksM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mairson85,
  author       = {Harry G. Mairson},
  title        = {Average Case Lower Bounds on the Construction and Searching of Partial
                  Orders},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {303--311},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.13},
  doi          = {10.1109/SFCS.1985.13},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Mairson85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MillerR85,
  author       = {Gary L. Miller and
                  John H. Reif},
  title        = {Parallel Tree Contraction and Its Application},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {478--489},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.43},
  doi          = {10.1109/SFCS.1985.43},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MillerR85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoffatT85,
  author       = {Alistair Moffat and
                  Tadao Takaoka},
  title        = {An All Pairs Shortest Path Algorithm with Expected Running Time O(n2
                  log n)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {101--105},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.6},
  doi          = {10.1109/SFCS.1985.6},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MoffatT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Pan85,
  author       = {Victor Y. Pan},
  title        = {Fast and Efficient Algorithms for Sequential and Parallel Evaluation
                  of Polynomial Zeros and of Matrix Polynomials},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {522--531},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.25},
  doi          = {10.1109/SFCS.1985.25},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Pan85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PapadimitriouW85,
  author       = {Christos H. Papadimitriou and
                  David Wolfe},
  title        = {The Complexity of Facets Resolved},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {74--78},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.56},
  doi          = {10.1109/SFCS.1985.56},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PapadimitriouW85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Pippenger85,
  author       = {Nicholas Pippenger},
  title        = {On Networks of Noisy Gates},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {30--38},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.41},
  doi          = {10.1109/SFCS.1985.41},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Pippenger85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Reif85,
  author       = {John H. Reif},
  title        = {An Optimal Parallel Algorithm for Integer Sorting},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {496--504},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.9},
  doi          = {10.1109/SFCS.1985.9},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Reif85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ReifS85,
  author       = {John H. Reif and
                  Micha Sharir},
  title        = {Motion Planning in the Presence of Moving Obstacles},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {144--154},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.36},
  doi          = {10.1109/SFCS.1985.36},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ReifS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rudich85,
  author       = {Steven Rudich},
  title        = {Inferring the Structure of a Markov Chain from its Output},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {321--326},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.34},
  doi          = {10.1109/SFCS.1985.34},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Rudich85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SharirL85,
  author       = {Micha Sharir and
                  Ron Livne},
  title        = {On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel
                  Sequences},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {312--320},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.40},
  doi          = {10.1109/SFCS.1985.40},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/SharirL85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vardi85,
  author       = {Moshe Y. Vardi},
  title        = {Automatic Verification of Probabilistic Concurrent Finite-State Programs},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {327--338},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.12},
  doi          = {10.1109/SFCS.1985.12},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Vardi85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/VaziraniV85,
  author       = {Umesh V. Vazirani and
                  Vijay V. Vazirani},
  title        = {Random Polynomial Time Is Equal to Slightly-random Polynomial Time},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {417--428},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.45},
  doi          = {10.1109/SFCS.1985.45},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/VaziraniV85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vitanyi85,
  author       = {Paul M. B. Vit{\'{a}}nyi},
  title        = {Area Penalty for Sublinear Signal Propagation Delay on Chip (Preliminary
                  Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {197--207},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.10},
  doi          = {10.1109/SFCS.1985.10},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Vitanyi85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vitter85,
  author       = {Jeffrey Scott Vitter},
  title        = {Design and Analysis of Dynamic Huffman Coding (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {293--302},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.18},
  doi          = {10.1109/SFCS.1985.18},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Vitter85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yao85,
  author       = {Andrew Chi{-}Chih Yao},
  title        = {Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {1--10},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.49},
  doi          = {10.1109/SFCS.1985.49},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Yao85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS26,
  title        = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://ieeexplore.ieee.org/xpl/conhome/4568115/proceeding},
  isbn         = {0-8186-0644-4},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/FOCS26.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics