| 1987 | 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987 |
| 1987 | A New Algebraic Method for Robot Motion Planning and Real Geometry John F. Canny |
| 1987 | A New Parallel Algorithm for the Maximal Independent Set Problem Mark K. Goldberg, Thomas H. Spencer |
| 1987 | A Parallel Algorithm for Finding a Separator in Planar Graphs Hillel Gazit, Gary L. Miller |
| 1987 | A Practical Scheme for Non-interactive Verifiable Secret Sharing Paul Feldman |
| 1987 | Achievable Cases in an Asynchronous Environment (Extended Abstract) Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk |
| 1987 | An Output Sensitive Algorithm for Computing Visibility Graphs Subir Kumar Ghosh, David M. Mount |
| 1987 | Applying Static Network Protocols to Dynamic Networks Yehuda Afek, Baruch Awerbuch, Eli Gafni |
| 1987 | Approximation Algorithms for Scheduling Unrelated Parallel Machines Jan Karel Lenstra, David B. Shmoys, Éva Tardos |
| 1987 | Bounded Time-Stamps (Extended Abstract) Amos Israeli, Ming Li |
| 1987 | Canonical Labeling of Regular Graphs in Linear Average Time Ludek Kucera |
| 1987 | Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms Mikhail J. Atallah, Richard Cole, Michael T. Goodrich |
| 1987 | Channel Routing of Multiterminal Nets Shaodi Gao, Michael Kaufmann |
| 1987 | Complete and Incomplete Randomized NP Problems Yuri Gurevich |
| 1987 | Concurrent Reading While Writing II: The Multi-writer Case Gary L. Peterson, James E. Burns |
| 1987 | Correction to "A Linear-Time Algorithm for Triangulating Simple Polygons" Robert Endre Tarjan, Christopher J. Van Wyk |
| 1987 | Database Theory and Cylindric Lattices (Extended Abstract) Stavros S. Cosmadakis |
| 1987 | Delaunay Graphs are Almost as Good as Complete Graphs David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit |
| 1987 | Determining Edge Connectivity in O(nm) David W. Matula |
| 1987 | Distributive Graph Algorithms-Global Solutions from Local Data Nathan Linial |
| 1987 | Diversity-Based Inference of Finite Automata (Extended Abstract) Ronald L. Rivest, Robert E. Schapire |
| 1987 | Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract) Ravi B. Boppana |
| 1987 | Errata to "Atomic Shared Register Access by Asynchronous Hardware" Paul M. B. Vitányi, Baruch Awerbuch |
| 1987 | Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract) Michael D. Hirsch, Stephen A. Vavasis |
| 1987 | Factoring Polynomials over Finite Fields Lajos Rónyai |
| 1987 | Finding Near Optimal Separators in Planar Graphs Satish Rao |
| 1987 | Functional Decomposition of Polynomials Joachim von zur Gathen, Dexter Kozen, Susan Landau |
| 1987 | Generic Oracles and Oracle Classes (Extended Abstract) Manuel Blum, Russell Impagliazzo |
| 1987 | Hierarchical Memory with Block Transfer Alok Aggarwal, Ashok K. Chandra, Marc Snir |
| 1987 | How to emulate shared memory (Preliminary Version) Abhiram G. Ranade |
| 1987 | Improved Algorithms for Graph Four-Connectivity Arkady Kanevsky, Vijaya Ramachandran |
| 1987 | Incomparability in Parallel Computation Vince Grolmusz, Prabhakar Ragde |
| 1987 | Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) Oded Goldreich, Yishay Mansour, Michael Sipser |
| 1987 | Learning One-Counter Languages in Polynomial Time (Extended Abstract) Piotr Berman, Robert Roos |
| 1987 | Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract) Nick Littlestone |
| 1987 | Local Management of a Global Resource in a Communication Network Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks |
| 1987 | Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) Andrew Chi-Chih Yao |
| 1987 | Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) Michael Kaminski, Nader H. Bshouty |
| 1987 | New Lower Bound Techniques for Robot Motion Planning Problems John F. Canny, John H. Reif |
| 1987 | On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs (Extended Abstract) Yair Oren |
| 1987 | On the Lower Envelope of Bivariate Functions and its Applications Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir |
| 1987 | On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) Andrei Z. Broder, Eli Shamir |
| 1987 | Parallel Graph Algorithms that Are Efficient on Average Don Coppersmith, Prabhakar Raghavan, Martin Tompa |
| 1987 | Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds William Aiello, Johan Håstad |
| 1987 | Polytope Range Searching and Integral Geometry (Extended Abstract) Bernard Chazelle |
| 1987 | Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information Martin Tompa, Heather Woll |
| 1987 | Recursive Construction for 3-Regular Expanders Miklós Ajtai |
| 1987 | Secret Linear Congruential Generators Are Not Cryptographically Secure Jacques Stern |
| 1987 | Some Polynomial and Toeplitz Matrix Computations Victor Y. Pan, John H. Reif |
| 1987 | The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms Noga Alon, Yossi Azar |
| 1987 | The Complexity of Parallel Comparison Merging Mihály Geréb-Graus, Danny Krizanc |
| 1987 | The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract) Dima Grigoriev, Marek Karpinski |
| 1987 | The Multiplicative Complexity of Quadratic Boolean Forms Roland Mirwald, Claus-Peter Schnorr |
| 1987 | The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract) Joe Kilian, Shlomo Kipnis, Charles E. Leiserson |
| 1987 | Threshold circuits of bounded depth András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán |
| 1987 | Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version) Pavol Duris, Zvi Galil |