JCSS, Volume 24

Volume 24, Number 1, February 1982

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

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

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

Last update Fri May 25 09:30:22 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page