Abstract is missing.
- A Complexity Theory for Unbounded Fan-In ParallelismAshok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin. 1-13
- On the Complexity of Unique SolutionsChristos H. Papadimitriou. 14-20
- Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-CompleteThiet-Dung Huynh. 21-31
- The Computational Complexity of Simultaneous Diophantine Approximation ProblemsJ. C. Lagarias. 32-39
- A Natural Encoding Scheme Proved Probabilistic Polynomial CompleteUmesh V. Vazirani, Vijay V. Vazirani. 40-44
- Three Applications of Kolmogorov-ComplexityStefan Reisch, Georg Schnitger. 45-52
- On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear TimeWolfgang J. Paul. 53-56
- A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial FactorizationErich Kaltofen. 57-64
- Fast Parallel Matrix and GCD ComputationsAllan Borodin, Joachim von zur Gathen, John E. Hopcroft. 65-71
- Generalised Symmetries of Polynomials in Algebraic ComplexityCarl Sturtivant. 72-79
- Theory and Applications of Trapdoor Functions (Extended Abstract)Andrew Chi-Chih Yao. 80-91
- An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)Benny Chor, Charles E. Leiserson, Ronald L. Rivest. 92-99
- An Application of Higher Reciprocity to Computational Number Theory (Abstract)Leonard M. Adleman, Robert McDonnell. 100-106
- Probabilistic Analysis of Some Bin-Packing ProblemsNarendra Karmarkar. 107-111
- How to Generate Cryptographically Strong Sequences of Pseudo Random BitsManuel Blum, Silvio Micali. 112-117
- An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent GraphsZvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber. 118-125
- A Compact Representation for Permutation GroupsMark Jerrum. 126-133
- Why and How to Establish a Private Code on a Public Network (Extended Abstract)Shafi Goldwasser, Silvio Micali, Po Tong. 134-144
- A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman CryptosystemAdi Shamir. 145-152
- Inferring a Sequence Generated by a Linear CongruenceJoan B. Plumstead. 153-159
- Protocols for Secure Computations (Extended Abstract)Andrew Chi-Chih Yao. 160-164
- Storing a Sparse Table with O(1) Worst Case Access TimeMichael L. Fredman, János Komlós, Endre Szemerédi. 165-169
- On the Program Size of Perfect and Universal Hash FunctionsKurt Mehlhorn. 170-175
- On Decomposition of Relational DatabasesMoshe Y. Vardi. 176-185
- Generic Transformation of Data StructuresColm Ó Dúnlaing, Chee-Keng Yap. 186-195
- Eventual Is Earlier than Immediate Danny Dolev, Rüdiger Reischuk, H. Raymond Strong. 196-203
- Deterministic Process Logic Is ElementaryJoseph Y. Halpern. 204-216
- A Temporal Logic to Deal with Fairness in Transition SystemsJean-Pierre Queille, Joseph Sifakis. 217-225
- On Equations Including String VariablesKazuo Iwama. 226-235
- Substitution of Bounded Rational ConeJoffroy Beauquier, Michel Latteux. 236-243
- Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version)Donald B. Johnson, Shankar M. Venkatesan. 244-254
- Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General GraphsZvi Galil, Silvio Micali, Harold N. Gabow. 255-261
- Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted TreesMoon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner. 262-271
- Using Clerks in Parallel ProcessingQuentin F. Stout. 272-279
- On the Movement of Robot Arms in 2-Dimensional Bounded RegionsJohn E. Hopcroft, Deborah Joseph, Sue Whitesides. 280-289
- Parallel Time O(log N) Acceptance of Deterministic CFLsJohn H. Reif. 290-296
- Wafer-Scale Integration of Systolic Arrays (Extended Abstract)Frank Thomson Leighton, Charles E. Leiserson. 297-311
- An Efficient Approximation Scheme for the One-Dimensional Bin-Packing ProblemNarendra Karmarkar, Richard M. Karp. 312-320
- The Ellipsoid Algorithm for Linear Inequalities in Exact ArithmeticSilvio Ursic. 321-326
- An Old Linear Programming Algorithm Runs in Polynomial TimeBoris Yamnitsky, Leonid A. Levin. 327-328
- Linear-Time Algorithms for Linear Programming in R^3 and Related ProblemsNimrod Megiddo. 329-338
- A Theorem on Polygon Cutting with ApplicationsBernard Chazelle. 339-349
- Three Layers Are EnoughFranco P. Preparata, Witold Lipski Jr.. 350-357
- The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version)Thomas Lengauer. 358-368
- On Driving Many Long Lines in a VLSI LayoutVijaya Ramachandran. 369-378
- Optimal Allocation of Computational Resources in VLSIZvi M. Kedem. 379-385