Volume 12, Number 1, February 1983
- Volker Strassen:
The Computational Complexity of Continued Fractions.
1-27
- David G. Kirkpatrick:
Optimal Search in Planar Subdivisions.
28-35
- Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis:
Tools for Template Dependencies.
36-59
- Donald K. Friesen, Michael A. Langston:
Bounds for Multifit Scheduling on Uniform Processors.
60-70
- John H. Reif:
Minimum s-t Cut of a Planar Undirected Network in O(n log²(n)) Time.
71-81
- Gerald E. Peterson:
A Technique for Establishing Completeness Results in Theorem Proving with Equality.
82-100
- Hans F. de Groote:
Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties.
101-117
- Kenneth J. Supowit, Edward M. Reingold:
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.
118-143
- Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted:
The Traveling Salesman Problem and Minimum Matching in the Unit Square.
144-156
- Dan Gusfield:
Simple Construction for Multi-Terminal Network Flow Synthesis.
157-165
- Arthur C. Fleck, R. S. Limaye:
Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms.
166-188
- John V. Guttag, Deepak Kapur, David R. Musser:
On Proving Uniform Termination and Restricted Termination of Rewriting Systems.
189-214
Volume 12, Number 2, May 1983
Volume 12, Number 3, August 1983
- Yaacov Yesha:
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets.
411-425
- David M. Choy, C. K. Wong:
Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval.
426-446
- Charles E. Leiserson, Ron Y. Pinter:
Optimal Placement for River Routing.
447-462
- Michael C. Loui:
Optimal Dynamic Embedding of Trees into Arrays.
463-472
- Erich Kaltofen, David R. Musser, B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor.
473-483
- Jacob E. Goodman, Richard Pollack:
Multidimensional Sorting.
484-507
- Brenda S. Baker, Jerald S. Schwarz:
Shelf Algorithms for Two-Dimensional Packing Problems.
508-525
- John H. Rowland, Leslie E. Shader:
On the Selection of Test Data for Vector-Valued Recursive Subroutines.
526-538
- Hisao Yamada, Masatosi Imori:
One Step Transformation of Periodic Sequences by Cellular Automata.
539-550
- Trevor I. Fenner, George Loizou:
Tree Traversal Related Algorithms for Generating Integer Partitions.
551-564
- Alan L. Selman, Xu Mei-Rui, Ronald V. Book:
Positive Relativizations of Complexity Classes.
565-579
- Esko Ukkonen:
Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets.
580-587
- Peter A. Bloniarz:
A Shortest-Path Algorithm with Expected Time O(n² log n log* n).
588-600
- David G. Kirkpatrick, Pavol Hell:
On the Complexity of General Graph Factor Problems.
601-609
Volume 12, Number 4, November 1983
- M. D. Atkinson, S. Lloyd:
The Ranks of m * n * (mn-2) Tensors.
611-615
- David S. Johnson, Anthony C. Klug:
Optimizing Conjunctive Queries that Contain Untyped Variables.
616-640
- Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff:
Fast Parallel Computation of Polynomials Using Few Processors.
641-644
- Timothy J. Hickey, Jacques Cohen:
Uniform Random Generation of Strings in a Context-Free Language.
645-655
- Danny Dolev, H. Raymond Strong:
Authenticated Algorithms for Byzantine Agreement.
656-666
- Wen-Chin Chen, Jeffrey Scott Vitter:
Analysis of Early-Insertion Standard Coalesced Hashing.
667-676
- Stephen L. Bloom, Ralph Tindell:
Varieties of ``if-then-else''.
677-707
- Tat-hung Chan, Oscar H. Ibarra:
On the Space and Time Complexity of Functions Computable by Simple Programs.
708-716
- Paul Walton Purdom Jr., Cynthia A. Brown:
An Analysis of Backtracking with Search Rearrangement.
717-733
- John L. Pfaltz:
Convex Clusters in a Discrete m-Dimensional Space.
734-750
- Nimrod Megiddo, Arie Tamir:
New Results on the Complexity of p-Center Problems.
751-758
- Nimrod Megiddo:
Linear-Time Algorithms for Linear Programming in R³ and Related Problems.
759-776
- J. Scott Provan, Michael O. Ball:
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected.
777-788
- Debasis Mitra, John A. Morrison:
Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System.
789-802
Copyright © Mon Mar 15 04:06:08 2010
by Michael Ley (ley@uni-trier.de)
