J. Comput. Syst. Sci. - researchr journal

245	--	282	Andrea Maggiolo-Schettini, Józef Winkowski. Processes of Transforming Structures
283	--	314	Joost Engelfriet, Gilberto Filé. Simple Multi-Visit Attribute Grammars
315	--	361	Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier. A Prime Decomposition Theorem for Grammatical Families
362	--	372	Hajime Machida, Takumi Kasai. Space Complexity in On-Line Computation
373	--	377	Bhavani M. Thuraisingham. Representation of One-One Degrees by Decision Problems for System Functions
378	--	0	Deborah Joseph, Paul Young. Corrigendum: Independence Results in Computer Science?

149	--	161	Anton Nijholt. The Equivalence Problem for LL- and LR-Regular Grammars
162	--	166	Michael Rodeh. Finding the Median Distributively
167	--	179	J. Albert, Karel Culik II. Tree Correspondence Problems
180	--	196	Jerry Goldman, Steven Homer. Quadratic Automata
197	--	208	Greg N. Frederickson, Donald B. Johnson. The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns
209	--	223	Joseph JáJá. The Computational Complexity of a Set of Quadratic Functions
224	--	232	Timothy J. Long. A Note on Sparse Oracles for NP
233	--	244	Kosaburo Hashiguchi. Limitedness Theorem on Finite Automata with Distance Functions

1	--	14	Sharon J. Laskowski. Computing Lower Bounds on Tensor Rank over Finite Fields
15	--	35	Ker-I Ko. The Maximum Value Problem and NP Real Numbers
36	--	68	Jan Pittl. On LLP(k) Parsers
69	--	81	Oscar H. Ibarra, Shlomo Moran. On Some Decision Problems for RAM Programs
82	--	90	Nicholas Pippenger. Superconcentrators of Depth 2
91	--	100	Amiram Yehudai. A Hierarchy of Real-Time Deterministic Languages and Their Equivalence
101	--	113	Nancy A. Lynch. Accessibility of Values as a Determinant of Relative Complexity in Algebras
114	--	146	Jirí Adámek, Evelyn Nelson, Jan Reiterman. Tree Constructions of Free Continuous Algebras

External Links