| 1982 | 'Eventual' Is Earlier than 'Immediate' Danny Dolev, Rüdiger Reischuk, H. Raymond Strong |
| 1982 | 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982 |
| 1982 | A Compact Representation for Permutation Groups Mark Jerrum |
| 1982 | A Complexity Theory for Unbounded Fan-In Parallelism Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin |
| 1982 | A Natural Encoding Scheme Proved Probabilistic Polynomial Complete Umesh V. Vazirani, Vijay V. Vazirani |
| 1982 | A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem Adi Shamir |
| 1982 | A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization Erich L. Kaltofen |
| 1982 | A Temporal Logic to Deal with Fairness in Transition Systems Jean-Pierre Queille, Joseph Sifakis |
| 1982 | A Theorem on Polygon Cutting with Applications Bernard Chazelle |
| 1982 | An Application of Higher Reciprocity to Computational Number Theory (Abstract) Leonard M. Adleman, Robert McDonnell |
| 1982 | An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) Benny Chor, Charles E. Leiserson, Ronald L. Rivest |
| 1982 | An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem Narendra Karmarkar, Richard M. Karp |
| 1982 | An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber |
| 1982 | An Old Linear Programming Algorithm Runs in Polynomial Time Boris Yamnitsky, Leonid A. Levin |
| 1982 | Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete Thiet-Dung Huynh |
| 1982 | Deterministic Process Logic Is Elementary Joseph Y. Halpern |
| 1982 | Fast Parallel Matrix and GCD Computations Allan Borodin, Joachim von zur Gathen, John E. Hopcroft |
| 1982 | Generalised Symmetries of Polynomials in Algebraic Complexity Carl Sturtivant |
| 1982 | Generic Transformation of Data Structures Colm Ó'Dúnlaing, Chee-Keng Yap |
| 1982 | How to Generate Cryptographically Strong Sequences of Pseudo Random Bits Manuel Blum, Silvio Micali |
| 1982 | Inferring a Sequence Generated by a Linear Congruence Joan B. Plumstead |
| 1982 | Linear-Time Algorithms for Linear Programming in R^3 and Related Problems Nimrod Megiddo |
| 1982 | On Decomposition of Relational Databases Moshe Y. Vardi |
| 1982 | On Driving Many Long Lines in a VLSI Layout Vijaya Ramachandran |
| 1982 | On Equations Including String Variables Kazuo Iwama |
| 1982 | On the Complexity of Unique Solutions Christos H. Papadimitriou |
| 1982 | On the Movement of Robot Arms in 2-Dimensional Bounded Regions John E. Hopcroft, Deborah Joseph, Sue Whitesides |
| 1982 | On the Program Size of Perfect and Universal Hash Functions Kurt Mehlhorn |
| 1982 | On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time Wolfgang J. Paul |
| 1982 | Optimal Allocation of Computational Resources in VLSI Zvi M. Kedem |
| 1982 | Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) Donald B. Johnson, Shankar M. Venkatesan |
| 1982 | Parallel Time O(log N) Acceptance of Deterministic CFLs John H. Reif |
| 1982 | Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner |
| 1982 | Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs Zvi Galil, Silvio Micali, Harold N. Gabow |
| 1982 | Probabilistic Analysis of Some Bin-Packing Problems Narendra Karmarkar |
| 1982 | Protocols for Secure Computations (Extended Abstract) Andrew Chi-Chih Yao |
| 1982 | Storing a Sparse Table with O(1) Worst Case Access Time Michael L. Fredman, János Komlós, Endre Szemerédi |
| 1982 | Substitution of Bounded Rational Cone Joffroy Beauquier, Michel Latteux |
| 1982 | The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version) Thomas Lengauer |
| 1982 | The Computational Complexity of Simultaneous Diophantine Approximation Problems J. C. Lagarias |
| 1982 | The Ellipsoid Algorithm for Linear Inequalities in Exact Arithmetic Silvio Ursic |
| 1982 | Theory and Applications of Trapdoor Functions (Extended Abstract) Andrew Chi-Chih Yao |
| 1982 | Three Applications of Kolmogorov-Complexity Stefan Reisch, Georg Schnitger |
| 1982 | Three Layers Are Enough Franco P. Preparata, Witold Lipski Jr. |
| 1982 | Using Clerks in Parallel Processing Quentin F. Stout |
| 1982 | Wafer-Scale Integration of Systolic Arrays (Extended Abstract) Frank Thomson Leighton, Charles E. Leiserson |
| 1982 | Why and How to Establish a Private Code on a Public Network (Extended Abstract) Shafi Goldwasser, Silvio Micali, Po Tong |