Volume 42,
Number 1,
27 April 1992
- Erkki Mäkinen:
On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars.
1-5
- Ambuj K. Singh:
Towards an Understanding of Unbounded Variables in Asynchronous Systems.
7-17
- L. H. Clark, Farhad Shahrokhi, László A. Székely:
A Linear Time Algorithm for Graph Partition Problems.
19-24
- Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
25-27
- Herbert Fleischner, Gerhard J. Woeginger:
Detecting Cycles Through Three Fixed Vertices in a Graph.
29-33
- Henk Meijer, David Rappaport:
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points.
35-38
- Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay:
On the Routing Problem in Faulty Supercubes.
39-46
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Effective Use of Memory in Iterative Deepening Search.
47-52
- Nimrod Megiddo:
A Note on Approximate Linear Programming.
53
- Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane.
55-60
Volume 42,
Number 2,
11 May 1992
Volume 42,
Number 3,
25 May 1992
- Boleslaw K. Szymanski, Balaram Sinharoy:
Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix.
121-126 ,
Corridenda: Inf. Process. Lett. 43(3): 167(1992)
- Phan Trung Huy, Igor Livotsky, Do Long Van:
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages.
127-132
- Kaizhong Zhang, Richard Statman, Dennis Shasha:
On the Editing Distance Between Unordered Labeled Trees.
133-139
- A. Parker, James O. Hamblen:
Optimal Value for the Newton-Raphson Division Algorithm.
141-144
- Ming Li, Paul M. B. Vitányi:
Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity.
145-149
- Jeffrey S. Salowe:
A Note on Lower Bounds for Rectilinear Steiner Trees.
151-152
- Thang Nguyen Bui, Curt Jones:
Finding Good Approximate Vertex and Edge Partitions is NP-Hard.
153-159
- Miranda Mowbray:
Finitary Logics for Some CCS Observational Bisimulations.
161-165
- Jan Friso Groote:
A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes.
167-171
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem.
173-177
Volume 42,
Number 4,
19 June 1992
Volume 42,
Number 5,
3 July 1992
Volume 42,
Number 6,
24 July 1992
- Glenn K. Manacher, Terrance A. Mankus:
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms.
293-294
- Peter Bro Miltersen:
Circuit Depth Relative to a Random Oracle.
295-298
- Gerhard J. Woeginger, Zhongliang Yu:
On the Equal-Subset-Sum Problem.
299-302
- Binhai Zhu:
Computing the Shortest Diagonal of a Monotone Polygon in Linear Time.
303-307
- Elias Dahlhaus, Marek Karpinski, Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
309-313
- Clifford Stein, Joel Wein:
Approximating the Minimum-Cost Maximum Flow is P-Complete.
315-319
- Samir Khuller, Baruch Schieber:
On Independent Spanning Trees.
321-323
- Kenichi Morita:
Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata.
325-329
- Antonio Brogi, Anna Ciampolini, Evelina Lamma, Paola Mello:
The Implementation of a Distributed Model for Logic Programming Based on Multiple-Headed Clauses.
331-338
- Eric Goles Ch., Servet Martínez A.:
Automata Networks and Optimization.
339-343
- Nancy G. Kinnersley:
The Vertex Separation Number of a Graph equals its Path-Width.
345-350
Copyright © Fri Nov 27 19:53:46 2009
by Michael Ley (ley@uni-trier.de)
