Volume 44,
Number 1,
9 November 1992
Volume 44,
Number 2,
19 November 1992
- Mireille Bousquet-Mélou:
The Number of Minimal Word Chains Computing the Thue-Morse Word.
57-64 BibTeX
- Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy:
Decidability of the Star Problem in A* x {b}*.
65-71 BibTeX
- Bettina De Iaco, Fabrizio Luccio:
Finding all the Palindromes in a Binary Tree in Linear Time and Space.
73-77 BibTeX
- Ming-Yang Kao, Fang Wan:
Not all Planar Digraphs have Small Cycle Separators.
79-83 BibTeX
- Masakatu Morii, Masao Kasahara:
Perfect Staircase Profile of Linear Complexity for Finite Sequences.
85-89 BibTeX
- Rong-Jaye Chen, Yu-Song Hou:
Non-Associative Parallel Prefix Computation.
91-94 BibTeX
- Krishnendu Mukhopadhyaya, Bhabani P. Sinha:
Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies.
95-99 BibTeX
- Kim-Heng Teo, Tai-Ching Tuan:
An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle.
101-105 BibTeX
- Been-Chian Chien, Wei-Pang Yang:
The Worst Case Analysis of Algorithm on Multiple Stacks Manipulation.
107-111 BibTeX
Volume 44,
Number 3,
30 November 1992
Volume 44,
Number 4,
10 December 1992
Volume 44,
Number 5,
21 December 1992
- Amihood Amir, Martin Farach:
Two-Dimensional Dictionary Matching.
233-239 BibTeX
- Jer-Shyan Wu, Rong-Jaye Chen:
The Towers of Hanoi Problem with Parallel Moves.
241-243 BibTeX
- Jyh-Han Lin, Jeffrey Scott Vitter:
Approximation Algorithms for Geometric Median Problems.
245-249 BibTeX
- Amotz Bar-Noy, Rajeev Motwani, Joseph Naor:
The Greedy Algorithm is Optimal for On-Line Edge Coloring.
251-253 BibTeX
- Fabrizio d'Amore, Paolo Giulio Franciosa:
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles.
255-259 BibTeX
- Mark H. Overmars:
Point Location in Fat Subdivisions.
261-265 BibTeX
- Peter Rossmanith, Wojciech Rytter:
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's.
267-272 BibTeX
- Gopal Gupta:
Dynamic Parallel Evaluation of the Cross-Product Set Using Time-Stamps.
273-280 BibTeX
- Ronald I. Greenberg, Joseph JáJá, Sridhar Krishnamurthy:
On the Difficulty of Manhattan Channel Routing.
281-284 BibTeX
- Eliezer Dekel, Jie Hu, Wen Ouyang:
An Optimal Algorithm for Finding Compact Sets.
285-289 BibTeX
Volume 44,
Number 6,
28 December 1992
Copyright © Sun May 17 00:04:02 2009
by Michael Ley (ley@uni-trier.de)
