J. Comput. Syst. Sci. - researchr journal

265	--	279	Gary L. Miller. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs
280	--	314	John H. Reif, Harry R. Lewis. Efficient Symbolic Analysis of Programs
315	--	322	Juhani Karhumäki, Yael Maon. A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language
323	--	362	Jan A. Bergstra, Jan Willem Klop. Conditional Rewrite Rules: Confluence and Termination
363	--	369	Bernard R. Hodgson, Clement F. Kent. Uniform Normal Form for General Time-Bounded Complexity Classes
370	--	373	James C. Owings. Effective Choice Functions and Index Sets
374	--	392	Bogdan S. Chlebus. Domino-Tiling Games
393	--	406	Dominique Perrin, Jean-Eric Pin. First-Order Logic and Star-Free Sets
407	--	428	N. Lakshmipathy, Karl Winklmann. Global Graph Problems Tend to Be Intractable

156	--	182	Bernard Chazelle. Reporting and Counting Segment Intersections
183	--	221	Moshe Y. Vardi, Pierre Wolper. Automata-Theoretic Techniques for Modal Logics of Programs
222	--	229	Ravi B. Boppana. Threshold Functions and Bounded Depth Monotone Circuits
230	--	250	Danny Dolev, Joseph Y. Halpern, H. Raymond Strong. On the Possibility and Impossibility of Achieving Clock Synchronization
251	--	264	Michael Ben-Or, Dexter Kozen, John H. Reif. The Complexity of Elementary Algebra and Geometry

1	--	14	Shuo-Yen Robert Li. Binary Trees and Uniform Distribution of Traffic Cutback
15	--	78	Péter Gács. Reliable Computation with Cellular Automata
79	--	90	Dennis de Champeaux. About the Paterson-Wegman Linear Unification Algorithm
91	--	96	Ingo Wegener. Time-Space Trade-offs for Branching Programs
97	--	104	Pawel Urzyczyn. During Cannot be Expressed by After
105	--	135	Louis E. Rosier, Hsu-Chun Yen. A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems
136	--	153	Vitit Kantabutra, S. Rao Kosaraju. New Algorithms for Multilink Robot Arms

External Links