Volume 15,
Number 1,
19 August 1982
- Fabrizio Luccio, Linda Pagli:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs.
1-4
- Wojciech Rytter:
A Note on Two-Way Nondeterministic Pushdown Automata.
5-9
- Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter.
10-13
- Larry J. Stockmeyer, Vijay V. Vazirani:
NP-Completeness of Some Generalizations of the Maximum Matching Problem.
14-19
- Coenraad Bron, E. J. Dijkstra, S. Doaitse Swierstra:
A Memory-Management Unit for the Optimal Exploitation of a Small Address Space.
20-22
- Clement H. C. Leung:
Optimal Database Reorganisation: Some Practical Difficulties.
23-27
- Maciej M. Syslo:
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph.
28-30
- Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil:
Efficient Parallel Algorithms for Linear Recurrence Computation.
31-35
- Peter M. Winkler:
On Computability of the Mean Deviation.
36-38
- Karel Culik II, Derick Wood:
A Note on Some Tree Similarity Measures.
39-42
- Leon S. Levy:
An Improved List-Searching Algorithm.
43-45
Volume 15,
Number 2,
16 September 1982
Volume 15,
Number 3,
11 October 1982
- Michael Spyratos:
A Homomorphism Theorem for Data Base Mappings.
91-96
- Anton Nijholt:
On the Relationship Between the LL(k) and LR(k) Grammars.
97-101
- Wojciech Rytter:
Time Complexity of Unambiguous Path Systems.
102-104
- P. G. Reddy, Subhash Bhalla, Bandreddi E. Prasad:
Robust, Centralized Certifier Based Concurrency Control for Distributed Databases.
105-110
- Waldemar Korczynski, Józef Winkowski:
A Communication Concept for Distributed Systems.
111-114
- To-Yat Cheung:
A Statistical Model for Estimating the Number of Records in a Relational Database.
115-118
- Teofilo F. Gonzalez, Donald B. Johnson:
Sorting Numbers in Linear Expected Time and Optimal Extra Space.
119-124
- Hiroshi Imai:
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane.
125-128
- Edsger W. Dijkstra, A. J. M. van Gasteren:
An Introduction to Three Algorithms for Sorting in Situ.
129-134
- Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs.
135-136
Volume 15,
Number 4,
31 October 1982
Volume 15,
Number 5,
10 December 1982
Copyright © Sat Nov 14 06:01:03 2009
by Michael Ley (ley@uni-trier.de)
