3 | -- | 27 | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer. Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees |
28 | -- | 42 | Brenda S. Baker. Parameterized Pattern Matching: Algorithms and Applications |
43 | -- | 52 | Noam Nisan, David Zuckerman. Randomness is Linear in Space |
53 | -- | 60 | Nicholas Pippenger. Self-Routing Superconcentrators |
61 | -- | 79 | Alessandra Cherubini, Pierluigi San Pietro. A Polynomial-Time Parsing Algorithm for K-Depth Languages |
80 | -- | 86 | Tsong Yueh Chen. On the Structural Properties of the Set of Fixpoints for Nondeterministic Recursive Definitions |
87 | -- | 99 | Johannes A. La Poutré. Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines |
100 | -- | 124 | Ravi Krishnamurthy, Raghu Ramakrishnan, Oded Shmueli. A Framework for Testing Safety and Effective Computability |
125 | -- | 142 | Leonid Libkin, Limsoon Wong. Semantic Representations and Query Labguages for Or-Sets |
143 | -- | 156 | Egidio Astesiano, Elena Zucca. A Free Construction of Dynamic Terms |
157 | -- | 169 | Dan E. Willard. Applications of Range Query Theory to Relational Data Base Join and Selection Operations |
170 | -- | 184 | Andrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg. Finite Languages for the Representation of Finite Graphs |
185 | -- | 190 | Juha Honkala. On Parikh Slender Languages and Power Series |
191 | -- | 197 | Lance Fortnow, Tomoyuki Yamakami. Generic Separations |