Abstract is missing.
- Probabilistic Temporal Logics for Finite and Bounded ModelsSergiu Hart, Micha Sharir. 1-13
- Deciding Branching Time LogicE. Allen Emerson, A. Prasad Sistla. 14-24
- Modelling Fair ProcessesMatthew Hennessy. 25-30
- Liveness Properties as Convergence in Metric SpacesPierpaolo Degano, Ugo Montanari. 31-38
- Transition Logic: How to Reason About Temporal Properties in a Compositional WayRob Gerth. 39-50
- Now You May Compose Temporal Logic SpecificationsHoward Barringer, Ruurd Kuiper, Amir Pnueli. 51-63
- A Minimum Area VLSI Network for O(log n) Time SortingGianfranco Bilardi, Franco P. Preparata. 64-70
- Tight Bounds on the Complexity of Parallel SortingFrank Thomson Leighton. 71-80
- Lower Bounds on Communication ComplexityPavol Duris, Zvi Galil, Georg Schnitger. 81-91
- An Area-Maximum Edge Length Tradeoff for VLSI LayoutNorbert Blum. 92-97
- On the Pagenumber of Planar GraphsJonathan F. Buss, Peter W. Shor. 98-100
- Channel Routing in VLSI (Extended Abstract)Andranik Mirzaian. 101-107
- Minimum Spanning EllipsoidsMark J. Post. 108-116
- Digital Disks and a Digital Compactness MeasureChul E. Kim, Timothy A. Anderson. 117-124
- Intersecting Is Easier than SortingBernard Chazelle. 125-134
- Scaling and Related Techniques for Geometry ProblemsHarold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan. 135-143
- On Shortest Paths in Polyhedral SpacesMicha Sharir, Amir Schorr. 144-153
- On k-hulls and Related ProblemsRichard Cole, Micha Sharir, Chee-Keng Yap. 154-166
- An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of IntervalsDeborah S. Franzblau, Daniel J. Kleitman. 167-174
- Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number FieldsMing-Deh A. Huang. 175-182
- Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract)Eric Bach, Gary L. Miller, Jeffrey Shallit. 183-190
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental NumbersRavindran Kannan, Arjen K. Lenstra, László Lovász. 191-200
- Evaluating Logarithms in GF(2^n)Don Coppersmith. 201-207
- An Efficient Signature Scheme Based on Quadratic Equations208-216
- Communication with Secrecy ConstraintsAlon Orlitsky, Abbas El Gamal. 217-224
- Correcting Faults in Write-Once MemoryDanny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman. 225-229
- Randomized Speed-Ups in Parallel ComputationUzi Vishkin. 230-239
- Optimal Parallel Algorithms for String MatchingZvi Galil. 240-248
- Finding Euler Circuits in Logarithmic Parallel TimeBaruch Awerbuch, Amos Israeli, Yossi Shiloach. 249-257
- A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version)Eli Upfal. 258-265
- A Fast Parallel Algorithm for the Maximal Independent Set ProblemRichard M. Karp, Avi Wigderson. 266-272
- On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version)Udi Manber. 273-278
- Some Unexpected Expected Behavior Results for Bin PackingJon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch. 279-288
- A Probabilistic Analysis of Multidimensional Bin Packing ProblemsRichard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela. 289-298
- Every Poset Has a Good ComparisonJeff Kahn, Michael E. Saks. 299-301
- A New Polynomial-Time Algorithm for Linear ProgrammingNarendra Karmarkar. 302-311
- A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller DimensionIlan Adler, Nimrod Megiddo. 312-323
- Powers of Graphs: A Powerful Approximation Technique for Bottleneck ProblemsDorit S. Hochbaum, David B. Shmoys. 324-333
- Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract)Gaston H. Gonnet. 334-341
- Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract)Kenneth L. Clarkson. 342-348
- Building a Complete Inverted File for a Set of Text Files in Linear TimeAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. 349-358
- On Finding the Exact Solution of a Zero-One Knapsack ProblemAndrew V. Goldberg, Alberto Marchetti-Spaccamela. 359-368
- Average Case SelectionWalter Cunto, J. Ian Munro. 369-375
- Finding Small Simple Cycle Separators for 2-Connected Planar GraphsGary L. Miller. 376-382
- Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)Greg N. Frederickson, Mandayam A. Srinivas. 383-390
- On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of SpaceCees F. Slot, Peter van Emde Boas. 391-400
- Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract)Wolfgang Maass. 401-408
- Uniform Definability on Finite Structures with SuccessorMichel de Rougemont. 409-417
- A General Result on Infinite Trees and Its Applications (Preliminary Report)David Harel. 418-427
- Pebblings, Edgings, and Equational LogicDexter Kozen. 428-435
- A Theory of the LearnableLeslie G. Valiant. 436-445
- Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)Moshe Y. Vardi, Pierre Wolper. 446-456
- The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)Michael Ben-Or, Dexter Kozen, John H. Reif. 457-464
- Problems, Complete in Average InstanceLeonid A. Levin. 465
- Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract)Helmut Alt. 466-470
- A Theorem on Probabilistic Constant Depth ComputationsMiklós Ajtai, Michael Ben-Or. 471-474
- Threshold Functions and Bounded Depth Monotone CircuitsRavi B. Boppana. 475-479
- On Monotone Formulae with Restricted Depth (Preliminary Version)Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis. 480-487
- Amortized Efficiency of List Update RulesDaniel Dominic Sleator, Robert Endre Tarjan. 488-492
- The Impact of Synchronous Communication on the Problem of Electing a Leader in a RingGreg N. Frederickson, Nancy A. Lynch. 493-503
- On the Possibility and Impossibility of Achieving Clock SynchronizationDanny Dolev, Joseph Y. Halpern, H. Raymond Strong. 504-511
- Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report)Dan E. Willard. 512-521
- An Efficient Network Synchronization ProtocolBaruch Awerbuch. 522-525
- A New Look at Fault Tolerant Network RoutingDanny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong. 526-535
- Efficient Fault Tolerant Routings in NetworksAndrei Z. Broder, Danny Dolev, Michael J. Fischer, Barbara Simons. 536-541
- Distributed Elections in an Archimedean Ring of Processors (Preliminary Version)Paul M. B. Vitányi. 542-547