Table of contents for issues of Journal of Computer and System Sciences

Last update: Thu Oct 10 08:26:51 MDT 2024                Valid HTML 3.2!

Volume 1, Number 1, April, 1967
Volume 1, Number 2, August, 1967
Volume 1, Number 3, October, 1967
Volume 1, Number 4, December, 1967
Volume 2, Number 1, June, 1968
Volume 2, Number 2, August, 1968
Volume 2, Number 3, October, 1968
Volume 2, Number 4, December, 1968
Volume 3, Number 1, February, 1969
Volume 3, Number 2, May, 1969
Volume 3, Number 3, August, 1969
Volume 3, Number 4, November, 1969
Volume 4, Number 1, February, 1970
Volume 4, Number 2, April, 1970
Volume 4, Number 3, June, 1970
Volume 4, Number 4, August, 1970
Volume 4, Number 5, October, 1970
Volume 4, Number 6, December, 1970
Volume 5, Number 1, February, 1971
Volume 5, Number 2, April, 1971
Volume 5, Number 3, June, 1971
Volume 5, Number 4, August, 1971
Volume 5, Number 5, October, 1971
Volume 5, Number 6, December, 1971
Volume 6, Number 1, February, 1972
Volume 6, Number 2, April, 1972
Volume 6, Number 3, June, 1972
Volume 6, Number 4, August, 1972
Volume 6, Number 5, October, 1972
Volume 6, Number 6, December, 1972
Volume 7, Number 1, February, 1973
Volume 7, Number 2, April, 1973
Volume 7, Number 3, June, 1973
Volume 7, Number 4, August, 1973
Volume 7, Number 5, October, 1973
Volume 7, Number 6, December, 1973
Volume 8, Number 1, February, 1974
Volume 8, Number 2, April, 1974
Volume 8, Number 3, June, 1974
Volume 9, Number 1, August, 1974
Volume 9, Number 2, October, 1974
Volume 9, Number 3, December, 1974
Volume 10, Number 1, February, 1975
Volume 10, Number 2, April, 1975
Volume 10, Number 3, June, 1975
Volume 11, Number 1, August, 1975
Volume 11, Number 2, October, 1975
Volume 11, Number 3, December, 1975
Volume 12, Number 1, February, 1976
Volume 12, Number 2, April, 1976
Volume 12, Number 3, June, 1976
Volume 13, Number 1, August, 1976
Volume 13, Number 2, October, 1976
Volume 13, Number 3, December, 1976
Volume 14, Number 1, February, 1977
Volume 14, Number 2, April, 1977
Volume 14, Number 3, June, 1977
Volume 15, Number 1, August, 1977
Volume 15, Number 2, October, 1977
Volume 15, Number 3, December, 1977
Volume 16, Number 1, February, 1978
Volume 16, Number 2, April, 1978
Volume 16, Number 3, June, 1978
Volume 17, Number 1, August, 1978
Volume 17, Number 2, October, 1978
Volume 17, Number 3, December, 1978
Volume 18, Number 1, February, 1979
Volume 18, Number 2, April, 1979
Volume 18, Number 3, June, 1979
Volume 19, Number 1, August, 1979
Volume 19, Number 2, October, 1979
Volume 19, Number 3, December, 1979
Volume 20, Number 1, February, 1980
Volume 20, Number 2, April, 1980
Volume 20, Number 3, June, 1980
Volume 21, Number 1, August, 1980
Volume 21, Number 2, October, 1980
Volume 21, Number 3, December, 1980
Volume 22, Number 1, February, 1981
Volume 22, Number 2, April, 1981
Volume 22, Number 3, June, 1981
Volume 23, Number 1, August, 1981
Volume 23, Number 2, October, 1981
Volume 23, Number 3, December, 1981
Volume 24, Number 1, February, 1982
Volume 24, Number 2, April, 1982
Volume 24, Number 3, June, 1982
Volume 25, Number 1, August, 1982
Volume 25, Number 2, October, 1982
Volume 25, Number 3, December, 1982
Volume 26, Number 1, February, 1983
Volume 26, Number 2, April, 1983
Volume 26, Number 3, June, 1983
Volume 27, Number 1, August, 1983
Volume 27, Number 2, October, 1983
Volume 27, Number 3, December, 1983
Volume 28, Number 1, February, 1984
Volume 28, Number 2, April, 1984
Volume 28, Number 3, June, 1984
Volume 29, Number 1, August, 1984
Volume 29, Number 2, October, 1984
Volume 29, Number 3, December, 1984
Volume 30, Number 1, February, 1985
Volume 30, Number 2, April, 1985
Volume 30, Number 3, June, 1985
Volume 31, Number 1, August, 1985
Volume 31, Number 2, October, 1985
Volume 31, Number 3, December, 1985
Volume 32, Number 1, February, 1986
Volume 32, Number 2, April, 1986
Volume 32, Number 3, June, 1986
Volume 33, Number 1, August, 1986
Volume 33, Number 2, October, 1986
Volume 33, Number 3, December, 1986
Volume 34, Number 1, February, 1987
Volume 34, Number 2--3, April / June, 1987
Volume 35, Number 1, August, 1987
Volume 35, Number 2, October, 1987
Volume 35, Number 3, December, 1987
Volume 36, Number 1, February, 1988
Volume 36, Number 2, April, 1988
Volume 36, Number 3, June, 1988
Volume 37, Number 1, August, 1988
Volume 37, Number 2, October, 1988
Volume 37, Number 3, December, 1988
Volume 38, Number 1, February, 1989
Volume 38, Number 2, April, 1989
Volume 38, Number 3, June, 1989
Volume 39, Number 1, August, 1989
Volume 39, Number 2, October, 1989
Volume 39, Number 3, December, 1989
Volume 40, Number 1, February, 1990
Volume 40, Number 2, April, 1990
Volume 40, Number 3, June, 1990
Volume 41, Number 1, August, 1990
Volume 41, Number 2, October, 1990
Volume 41, Number 3, December, 1990
Volume 42, Number 1, February, 1991
Volume 42, Number 2, April, 1991
Volume 42, Number 3, June, 1991
Volume 43, Number 1, August, 1991
Volume 43, Number 2, October, 1991
Volume 43, Number 3, December, 1991
Volume 44, Number 1, February, 1992
Volume 44, Number 2, April, 1992
Volume 44, Number 3, June, 1992
Volume 45, Number 1, August, 1992
Volume 45, Number 2, October, 1992
Volume 45, Number 3, December, 1992
Volume 46, Number 1, February, 1993
Volume 46, Number 2, April, 1993
Volume 46, Number 3, June, 1993
Volume 47, Number 1, August, 1993
Volume 47, Number 2, October, 1993
Volume 47, Number 3, December, 1993
Volume 48, Number 1, February, 1994
Volume 48, Number 2, April, 1994
Volume 48, Number 3, June, 1994
Volume 49, Number 1, August, 1994
Volume 49, Number 2, October, 1994
Volume 49, Number 3, December, 1994
Volume 50, Number 1, February, 1995
Volume 50, Number 2, April, 1995
Volume 50, Number 3, June, 1995
Volume 51, Number 1, August, 1995
Volume 51, Number 2, October, 1995
Volume 51, Number 3, December, 1995
Volume 52, Number 1, February, 1996
Volume 52, Number 2, April, 1996
Volume 52, Number 3, June, 1996
Volume 53, Number 1, August, 1996
Volume 53, Number 2, October, 1996
Volume 53, Number 3, December, 1996
Volume 54, Number 1, February, 1997
Volume 54, Number 2, April, 1997
Volume 54, Number 3, June, 1997
Volume 55, Number 1, August, 1997
Volume 55, Number 2, October, 1997
Volume 55, Number 3, December, 1997
Volume 56, Number 1, February, 1998
Volume 56, Number 2, April, 1998
Volume 56, Number 3, June, 1998
Volume 57, Number 1, August, 1998
Volume 57, Number 2, October, 1998
Volume 57, Number 3, December, 1998
Volume 58, Number 1, February, 1999
Volume 58, Number 2, April, 1999
Volume 58, Number 3, June, 1999
Volume 59, Number 1, August, 1999
Volume 59, Number 2, October, 1999
Volume 59, Number 3, December, 1999
Volume 60, Number 1, February, 2000
Volume 60, Number 2, April, 2000
Volume 60, Number 3, June, 2000
Volume 61, Number 1, August, 2000
Volume 61, Number 2, October, 2000
Volume 61, Number 3, December, 2000
Volume 62, Number 1, February, 2001
Volume 62, Number 2, March, 2001
Volume 62, Number 3, May, 2001
Volume 62, Number 4, June, 2001
Volume 63, Number 1, August, 2001
Volume 63, Number 2, September, 2001
Volume 63, Number 3, November, 2001
Volume 63, Number 4, December, 2001
Volume 64, Number 1, February, 2002
Volume 64, Number 2, March, 2002
Volume 64, Number 3, May, 2002
Volume 64, Number 4, June, 2002
Volume 65, Number 1, August, 2002
Volume 65, Number 2, September, 2002
Volume 65, Number 3, November, 2002
Volume 65, Number 4, December, 2002
Volume 66, Number 1, February, 2003
Volume 66, Number 2, March, 2003
Volume 66, Number 3, May, 2003
Volume 66, Number 4, June, 2003
Volume 67, Number 1, August, 2003
Volume 67, Number 2, September, 2003
Volume 67, Number 3, November, 2003
Volume 67, Number 4, December, 2003
Volume 68, Number 1, February, 2004
Volume 68, Number 2, March, 2004
Volume 68, Number 3, May, 2004
Volume 68, Number 4, June, 2004
Volume 69, Number 1, August, 2004
Volume 69, Number 2, September, 2004
Volume 69, Number 3, November, 2004
Volume 69, Number 4, December, 2004
Volume 70, Number 1, February, 2005
Volume 70, Number 2, March, 2005
Volume 70, Number 3, May, 2005
Volume 70, Number 4, June, 2005
Volume 71, Number 1, July, 2005
Volume 71, Number 2, August, 2005
Volume 71, Number 3, October, 2005
Volume 71, Number 4, November, 2005
Volume 72, Number 1, February, 2006
Volume 72, Number 2, March, 2006
Volume 72, Number 3, May, 2006
Volume 72, Number 4, June, 2006
Volume 72, Number 5, August, 2006
Volume 72, Number 6, September, 2006
Volume 72, Number 7, November, 2006
Volume 72, Number 8, December, 2006
Volume 73, Number 1, February, 2007
Volume 73, Number 2, March, 2007
Volume 73, Number 3, May, 2007
Volume 73, Number 4, June, 2007
Volume 73, Number 5, August, 2007
Volume 73, Number 6, September, 2007
Volume 73, Number 7, November, 2007
Volume 73, Number 8, December, 2007
Volume 74, Number 1, February, 2008
Volume 74, Number 2, March, 2008
Volume 74, Number 3, May, 2008
Volume 74, Number 4, June, 2008
Volume 74, Number 5, August, 2008
Volume 74, Number 6, September, 2008
Volume 74, Number 7, November, 2008
Volume 74, Number 8, December, 2008
Volume 75, Number 1, January, 2009
Volume 75, Number 2, February, 2009
Volume 75, Number 3, May, 2009
Volume 75, Number 4, June, 2009
Volume 75, Number 5, August, 2009
Volume 75, Number 6, September, 2009
Volume 75, Number 7, November, 2009
Volume 75, Number 8, December, 2009
Volume 76, Number 1, February, 2010
Volume 76, Number 2, March, 2010
Volume 76, Number 3--4, May / June, 2010
Volume 76, Number 5, August, 2010
Volume 76, Number 6, September, 2010
Volume 76, Number 7, November, 2010
Volume 76, Number 8, December, 2010
Volume 77, Number 1, January, 2011
Volume 77, Number 2, March, 2011
Volume 77, Number 3, May, 2011
Volume 77, Number 4, July, 2011
Volume 77, Number 5, September, 2011
Volume 77, Number 6, November, 2011
Volume 78, Number 1, January, 2012
Volume 78, Number 2, March, 2012
Volume 78, Number 3, May, 2012
Volume 78, Number 4, July, 2012
Volume 78, Number 5, September, 2012
Volume 78, Number 6, November, 2012
Volume 79, Number 1, February, 2013
Volume 79, Number 2, March, 2013
Volume 79, Number 3, May, 2013
Volume 79, Number 4, June, 2013
Volume 79, Number 5, August, 2013
Volume 79, Number 6, September, 2013
Volume 79, Number 7, November, 2013
Volume 79, Number 8, December, 2013
Volume 80, Number 1, February, 2014
Volume 80, Number 2, March, 2014
Volume 80, Number 3, May, 2014
Volume 80, Number 4, June, 2014
Volume 80, Number 5, August, 2014
Volume 80, Number 6, September, 2014
Volume 80, Number 7, November, 2014
Volume 80, Number 8, December, 2014
Volume 81, Number 1, February, 2015
Volume 81, Number 2, March, 2015
Volume 81, Number 3, May, 2015
Volume 81, Number 4, June, 2015
Volume 81, Number 5, August, 2015
Volume 81, Number 6, September, 2015
Volume 81, Number 7, November, 2015
Volume 81, Number 8, December, 2015
Volume 82, Number 1A, February, 2016
Volume 82, Number 1B, February, 2016
Volume 82, Number 2, March, 2016
Volume 82, Number 3, May, 2016
Volume 82, Number 4, June, 2016
Volume 82, Number 5, August, 2016
Volume 82, Number 6, September, 2016
Volume 82, Number 7, November, 2016
Volume 82, Number 8, December, 2016
Volume 83, Number 1, February, 2017
Volume 84, Number ??, March, 2017
Volume 85, Number ??, May, 2017
Volume 86, Number ??, June, 2017
Volume 87, Number ??, August, 2017
Volume 88, Number ??, September, 2017
Volume 89, Number ??, November, 2017
Volume 90, Number ??, December, 2017
Volume 91, Number ??, February, 2018
Volume 92, Number ??, March, 2018
Volume 93, Number ??, May, 2018
Volume 94, Number (supplement), June, 2018
Volume 95, Number ??, August, 2018
Volume 96, Number ??, September, 2018
Volume 97, Number ??, November, 2018
Volume 98, Number ??, December, 2018
Volume 99, Number ??, February, 2019
Volume 100, Number ??, March, 2019
Volume 101, Number ??, May, 2019
Volume 102, Number ??, June, 2019
Volume 103, Number ??, August, 2019
Volume 104, Number ??, September, 2019
Volume 105, Number ??, November, 2019
Volume 106, Number ??, December, 2019
Volume 107, Number ??, February, 2020
Volume 108, Number ??, March, 2020
Volume 109, Number ??, May, 2020
Volume 110, Number ??, June, 2020
Volume 111, Number ??, August, 2020
Volume 112, Number ??, September, 2020
Volume 113, Number ??, November, 2020
Volume 114, Number ??, December, 2020
Volume 115, Number ??, February, 2021
Volume 116, Number ??, March, 2021
Volume 117, Number ??, May, 2021
Volume 118, Number ??, June, 2021
Volume 119, Number ??, August, 2021
Volume 120, Number ??, September, 2021
Volume 121, Number ??, November, 2021
Volume 122, Number ??, December, 2021
Volume 123, Number ??, February, 2022
Volume 124, Number ??, March, 2022
Volume 125, Number ??, May, 2022
Volume 126, Number ??, June, 2022
Volume 127, Number ??, August, 2022
Volume 128, Number ??, September, 2022
Volume 129, Number ??, November, 2022
Volume 130, Number ??, December, 2022
Volume 131, Number ??, February, 2023
Volume 132, Number ??, March, 2023
Volume 133, Number ??, May, 2023
Volume 134, Number ??, June, 2023
Volume 135, Number ??, August, 2023
Volume 136, Number ??, September, 2023
Volume 137, Number ??, November, 2023
Volume 138, Number ??, December, 2023
Volume 139, Number ??, February, 2024
Volume 140, Number ??, March, 2024
Volume 141, Number ??, May, 2024
Volume 142, Number ??, June, 2024
Volume 143, Number ??, August, 2024
Volume 144, Number ??, September, 2024
Volume 145, Number ??, November, 2024
Volume 146, Number ??, December, 2024
Volume 147, Number ??, February, 2025
Volume 29, Number 3, September, 1989


Journal of Computer and System Sciences
Volume 1, Number 1, April, 1967

           Seymour Ginsburg and   
            Michael A. Harrison   Bracketed context-free languages . . . . 1--23
                     R. S. Bucy   Linear positive machines . . . . . . . . 24--28
                    J. B. Rosen   Chebyshev solution of large linear
                                  systems  . . . . . . . . . . . . . . . . 29--43
                      K. Ritter   A parametric method for solving certain
                                  nonconcave maximization problems . . . . 44--54
              Kenneth Krohn and   
          Richard Mateosian and   
                    John Rhodes   Methods of the algebraic theory of
                                  machines: I. Decomposition theorem for
                                  generalized machines; Properties
                                  preserved under series and parallel
                                  compositions of machines . . . . . . . . 55--85
                     E. K. Blum   Stationary points of functionals in
                                  pre-Hilbert spaces . . . . . . . . . . . 86--90
             A. V. Balakrishnan   Foundations of the state-space theory of
                                  continuous systems. I  . . . . . . . . . 91--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 1, Number 2, August, 1967

              Kenneth Krohn and   
             Rudolph Langer and   
                    John Rhodes   Algebraic principles for the analysis of
                                  a biochemical system . . . . . . . . . . 119--136
             Yehoshafat Give'on   On some properties of the free monoids
                                  with applications to automata theory . . 137--154
            Juris Hartmanis and   
                 Wayne A. Davis   Homomorphic images of linear sequential
                                  machines . . . . . . . . . . . . . . . . 155--165
             J. E. Hopcroft and   
                   J. D. Ullman   Nonerasing stack automata  . . . . . . . 166--186
                     Dana Scott   Some definitional suggestions for
                                  automata theory  . . . . . . . . . . . . 187--212

Journal of Computer and System Sciences
Volume 1, Number 3, October, 1967

              G. B. Dantzig and   
                R. M. Van Slyke   Generalized upper bounding techniques    213--226
                       T. Guinn   Solutions of generalized optimization
                                  problems . . . . . . . . . . . . . . . . 227--234
                       T. Guinn   First-order necessary conditions for
                                  generalized optimization problems  . . . 235--240
                      K. Ritter   A decomposition method for structured
                                  quadratic programming problems . . . . . 241--260
                 E. I. Axelband   A solution to the optimal pursuit
                                  problem for distributed parameter
                                  systems  . . . . . . . . . . . . . . . . 261--286
          Leonard Kleinrock and   
              Edward G. Coffman   Distribution of attained service in
                                  time-shared systems  . . . . . . . . . . 287--298
            Arnold L. Rosenberg   Multitape finite automata with rewind
                                  instructions . . . . . . . . . . . . . . 299--315

Journal of Computer and System Sciences
Volume 1, Number 4, December, 1967

                 J. W. Thatcher   Characterizing derivation trees of
                                  context-free grammars through a
                                  generalization of finite automata theory 317--322
                 E. J. Beltrami   On infinite-dimensional convex programs  323--329
                  D. Eggert and   
                     P. Varaiya   Affine dynamical systems . . . . . . . . 330--348
                     R. S. Bucy   Global theory of the Riccati equation    349--361
                     E. K. Blum   The computation of eigenvalues and
                                  eigenvector of a completely continuous
                                  self-adjoint operator  . . . . . . . . . 362--370
                         A. Paz   Fuzzy star functions, probabilistic
                                  automata, and their approximation by
                                  nonprobabilistic automata  . . . . . . . 371--390
         A. V. Balakrishnan and   
                    J. L. Lions   State estimation for
                                  infinite-dimensional systems . . . . . . 391--403
                      Anonymous   Author index . . . . . . . . . . . . . . 404--404


Journal of Computer and System Sciences
Volume 2, Number 1, June, 1968

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
             J. E. Hopcroft and   
                   J. D. Ullman   Deterministic stack automata and the
                                  quotient operator  . . . . . . . . . . . 1--12
                 Eric G. Wagner   Bounded action machines: Toward an
                                  abstract theory of computer structure    13--75
                Alan Schumitzky   On the equivalence between matrix
                                  Riccati equations and Fredholm
                                  resolvents . . . . . . . . . . . . . . . 76--87
         Patrick C. Fischer and   
            Arnold L. Rosenberg   Multitape one-way nonwriting automata    88--101
             A. V. Balakrishnan   A new computing technique in system
                                  identification . . . . . . . . . . . . . 102--116

Journal of Computer and System Sciences
Volume 2, Number 2, August, 1968

                   J. Hartmanis   Tape-reversal bounded Turing machine
                                  computations . . . . . . . . . . . . . . 117--135
             Patrick C. Fischer   The reduction of tape reversals for
                                  off-line one-tape Turing machines  . . . 136--147
                   Gene F. Rose   Closures which preserve finiteness in
                                  families of languages  . . . . . . . . . 148--168
                   Ronald Alter   On the nonexistence of close-packed
                                  double Hamming-error-correcting codes on
                                  $ q = 7 $ symbols  . . . . . . . . . . . 169--176
              H. A. Antosiewicz   Newton's method and boundary value
                                  problems . . . . . . . . . . . . . . . . 177--202
                   Roy Danchick   Further results on generalized
                                  predictor-corrector methods  . . . . . . 203--218

Journal of Computer and System Sciences
Volume 2, Number 3, October, 1968

            David E. Muller and   
          Gianfranco R. Putzolu   Frequency of decomposability among
                                  machines with a large number of states   219--227
           Seymour Ginsburg and   
               Edwin H. Spanier   Derivation-bounded languages . . . . . . 228--250
                   Izumi Kimura   Extensions of asynchronous circuits and
                                  the delay problem I. Good extensions and
                                  the delay problem of the first kind  . . 251--287
         Austin Blaqui\`ere and   
 Françoise Gérard   On the geometry of optimal strategies in
                                  two-person games of kind . . . . . . . . 288--304
            David W. Walkup and   
               Roger J.-B. Wets   A note on decision rules for stochastic
                                  programs . . . . . . . . . . . . . . . . 305--311
          Gianfranco R. Putzolu   Probabilistic aspects of machine
                                  decomposition theory . . . . . . . . . . 312--331

Journal of Computer and System Sciences
Volume 2, Number 4, December, 1968

                     L. Collatz   Multiparametric eigenvalue problems in
                                  inner-product spaces . . . . . . . . . . 333--341
           Vladimir F. Demjanov   Algorithms for some minimax problems . . 342--380
                H. Gallaire and   
                 J. N. Gray and   
             M. A. Harrison and   
                   G. T. Herman   Infinite linear sequential machines  . . 381--419
              J. R. H. Dempster   On the multiplying ability of two-way
                                  automata . . . . . . . . . . . . . . . . 420--426
            Marvin C. Paull and   
               Stephen H. Unger   Structural equivalence of context-free
                                  grammars . . . . . . . . . . . . . . . . 427--463
                   Dennis Allen   On a characterization of the nonregular
                                  set of primes  . . . . . . . . . . . . . 464--467
                      Anonymous   Author Index . . . . . . . . . . . . . . 468--468


Journal of Computer and System Sciences
Volume 3, Number 1, February, 1969

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
                    A. Pasquali   On the convergence of nonlinear
                                  simultaneous displacements . . . . . . . 1--7
               Melvin A. Breuer   Combinatorial equivalence of (0, 1)
                                  circulant matrices . . . . . . . . . . . 8--23
                       Y. Yavin   Optimal control for a class of
                                  distributed parameter systems where the
                                  cost functions are norms . . . . . . . . 24--36
                  A. V. Aho and   
                   J. D. Ullman   Syntax directed translations and the
                                  pushdown assembler . . . . . . . . . . . 37--56
             Lucien W. Neustadt   A general theory of extremals  . . . . . 57--92
                    D. R. Deuel   Time-varying linear sequential machines.
                                  I  . . . . . . . . . . . . . . . . . . . 93--118

Journal of Computer and System Sciences
Volume 3, Number 2, May, 1969

                    Zohar Manna   The correctness of programs  . . . . . . 119--127
                 Arthur R. Butz   Convergence with Hilbert's space filling
                                  curve  . . . . . . . . . . . . . . . . . 128--146
            Richard M. Karp and   
              Raymond E. Miller   Parallel program schemata  . . . . . . . 147--195
                Sheila Greibach   Checking automata and one-way stack
                                  languages  . . . . . . . . . . . . . . . 196--217
               J. E. Dennis and   
                A. A. Goldstein   Cubature and the Tchakaloff cone . . . . 218--220
                    Ryuichi Ito   Every semilinear set is a finite union
                                  of disjoint linear sets  . . . . . . . . 221--231

Journal of Computer and System Sciences
Volume 3, Number 3, August, 1969

            Sheila Greibach and   
                  John Hopcroft   Scattered context grammars . . . . . . . 233--247
                     E. K. Blum   Towards a theory of semantics and
                                  compilers for programming languages  . . 248--275
                   George Mager   Writing pushdown acceptors . . . . . . . 276--318
                  A. V. Aho and   
                   J. D. Ullman   Properties of syntax directed
                                  translations . . . . . . . . . . . . . . 319--334

Journal of Computer and System Sciences
Volume 3, Number 4, November, 1969

          M. D. Grigoriadis and   
                      K. Ritter   A decomposition method for structured
                                  linear and nonlinear programs  . . . . . 335--360
               Donald M. Kaplan   Regular expressions and the equivalence
                                  of programs  . . . . . . . . . . . . . . 361--386
               Alfred H. Morris   Elementary indefinite integration theory
                                  for the computer . . . . . . . . . . . . 387--408
          Masaharu Mizumoto and   
             Junichi Toyoda and   
                Kohkichi Tanaka   Some considerations on fuzzy automata    409--422
                 R. M. Baer and   
                  E. H. Spanier   Referenced automata and metaregular
                                  families . . . . . . . . . . . . . . . . 423--446
                    John Cleave   The primitive recursive analysis of
                                  ordinary differential equations and the
                                  complexity of their solutions  . . . . . 447--455
                   Ben Wegbreit   A generator of context-sensitive
                                  languages  . . . . . . . . . . . . . . . 456--461
                      Anonymous   Author index . . . . . . . . . . . . . . 462--462


Journal of Computer and System Sciences
Volume 4, Number 1, February, 1970

                   H. R. Strong   Depth-bounded computation  . . . . . . . 1--14
              Herbert B. Keller   Newton's method under mild
                                  differentiability conditions . . . . . . 15--28
            A. A. Goldstein and   
                  J. S. Meditch   Nonlinear optimal controls . . . . . . . 29--37
                       R. Conti   A convex programming problem in Banach
                                  spaces and applications to optimum
                                  control theory . . . . . . . . . . . . . 38--49
         Patrick C. Fischer and   
            Albert R. Meyer and   
            Arnold L. Rosenberg   Time-restricted sequence generation  . . 50--73
                   R. J. Orgass   Some results concerning proofs of
                                  statements about programs  . . . . . . . 74--88
                      Anonymous   International Federation for Information
                                  Processing: IFIP Congress 71 Ljubljana,
                                  Yugoslavia, 23--28 August 1971:
                                  Announcement . . . . . . . . . . . . . . 89--92
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 4, Number 2, April, 1970

        Franco P. Preparata and   
                David E. Muller   Generation of near-optimal universal
                                  Boolean functions  . . . . . . . . . . . 93--102
                Alex McNabb and   
                Alan Schumitzky   Factorization of operators II: a
                                  nonlinear Volterra method for numerical
                                  solution of linear Fredholm equations    103--128
                  A. V. Aho and   
               J. D. Ullman and   
                 J. E. Hopcroft   On the computational power of pushdown
                                  automata . . . . . . . . . . . . . . . . 129--136
                  H. Yamada and   
                     S. Amoroso   A completeness problem for pattern
                                  generation in tessellation automata  . . 137--176
              Walter J. Savitch   Relationships between nondeterministic
                                  and deterministic tape complexities  . . 177--192

Journal of Computer and System Sciences
Volume 4, Number 3, June, 1970

                   Gene F. Rose   Abstract families of processors  . . . . 193--204
                      R. Milner   Equivalences on program schemes  . . . . 205--219
              D. C. Luckham and   
              D. M. R. Park and   
                 M. S. Paterson   On formalised computer programs  . . . . 220--249
                       R. Temam   Remarks on the approximation of some
                                  nonlinear elliptic equations . . . . . . 250--259
              Rina S. Cohen and   
               J. A. Brzozowski   General properties of star height of
                                  regular events . . . . . . . . . . . . . 260--280
                  Rina S. Cohen   Star height of certain families of
                                  regular events . . . . . . . . . . . . . 281--297

Journal of Computer and System Sciences
Volume 4, Number 4, August, 1970

                  L. Y. Liu and   
                      P. Weiner   A characterization of semilinear sets    299--307
           Seymour Ginsburg and   
                Sheila Greibach   Principal AFL  . . . . . . . . . . . . . 308--338
              James W. Thatcher   Generalized 2 sequential machine maps    339--367
               J. Hartmanis and   
                 J. E. Hopcroft   What makes some language theory problems
                                  undecidable  . . . . . . . . . . . . . . 368--376
                 Ramon E. Moore   On the stability of linear recurrence
                                  equations with arbitrary time lags . . . 377--383

Journal of Computer and System Sciences
Volume 4, Number 5, October, 1970

          William Bridges Smith   Error detection in formal languages  . . 385--405
                     John Doner   Tree acceptors and some of their
                                  applications . . . . . . . . . . . . . . 406--451
                  Sanat K. Basu   On the structure of subrecursive degrees 452--464
                    Webb Miller   Recursive function theory and numerical
                                  analysis . . . . . . . . . . . . . . . . 465--472
                   Edward Angel   Invariant imbedding, difference
                                  equations, and elliptic boundary value
                                  problems . . . . . . . . . . . . . . . . 473--491
                   Takumi Kasai   An hierarchy between context-free and
                                  context-sensitive languages  . . . . . . 492--508

Journal of Computer and System Sciences
Volume 4, Number 6, December, 1970

                   A. L. Perrie   Uniform rational approximation with
                                  osculatory interpolation . . . . . . . . 509--522
                  A. V. Aho and   
                   J. D. Ullman   A characterization of two-way
                                  deterministic classes of languages . . . 523--538
                 Y. Give'on and   
                   Y. Zalcstein   Algebraic structures in linear systems
                                  theory . . . . . . . . . . . . . . . . . 539--556
               Yoshiyuki Sakawa   An application of the epsilon technique
                                  to the solution of pursuit and evasion
                                  problems . . . . . . . . . . . . . . . . 557--569
           Kailash C. Kapur and   
           Richard M. Van Slyke   Cutting plane algorithms and state space
                                  constrained linear optimal control
                                  problems . . . . . . . . . . . . . . . . 570--605
             Ronald V. Book and   
         Sheila A. Greibach and   
                   Ben Wegbreit   Time- and tape-bounded Turing acceptors
                                  and AFLs . . . . . . . . . . . . . . . . 606--621
             Ronald V. Book and   
         Sheila A. Greibach and   
            Oscar H. Ibarra and   
                   Ben Wegbreit   Tape-bounded Turing acceptors and
                                  principal AFLs . . . . . . . . . . . . . 622--625
                      Anonymous   Author index . . . . . . . . . . . . . . 626--626


Journal of Computer and System Sciences
Volume 5, Number 1, February, 1971

              Rina S. Cohen and   
               J. A. Brzozowski   Dot-depth of star-free events  . . . . . 1--16
                  Oliver Aberth   The concept of effective method applied
                                  to computational problems of linear
                                  algebra  . . . . . . . . . . . . . . . . 17--25
              J. W. Carlyle and   
                         A. Paz   Realizations by stochastic finite
                                  automata . . . . . . . . . . . . . . . . 26--40
           J. A. Brzozowski and   
            K. Culík and   
                  A. Gabrielian   Classification of noncounting events . . 41--53
               J. Hartmanis and   
                    F. D. Lewis   The use of lists in the study of
                                  undecidable problems in automata theory  54--66
                  Erwin Engeler   Algorithmic approximations . . . . . . . 67--82
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 5, Number 2, April, 1971

            A. A. Goldstein and   
              F. C. Johnson and   
                  Jurgen Spiess   On the isolation of the roots of a
                                  non-linear operator  . . . . . . . . . . 83--87
                Oscar H. Ibarra   Characterizations of some tape and time
                                  complexity classes of Turing machines in
                                  terms of multihead and auxiliary stack
                                  automata . . . . . . . . . . . . . . . . 88--117
               Giorgio Ausiello   Abstract computational complexity and
                                  cycling computations . . . . . . . . . . 118--128
                   Izumi Kimura   Extensions of asynchronous circuits and
                                  the delay problem. Part II: Spike-free
                                  extensions and the delay problem of the
                                  second kind  . . . . . . . . . . . . . . 129--162
             A. V. Balakrishnan   A computational approach to the maximum
                                  principle  . . . . . . . . . . . . . . . 163--191

Journal of Computer and System Sciences
Volume 5, Number 3, June, 1971

            Arnold L. Rosenberg   Data graphs and addressing schemes . . . 193--238
                    Zohar Manna   Mathematical theory of partial
                                  correctness  . . . . . . . . . . . . . . 239--253
                   H. R. Strong   Translating recursion equations into
                                  flow charts  . . . . . . . . . . . . . . 254--285
                    F. D. Lewis   The enumerability and invariance of
                                  complexity classes . . . . . . . . . . . 286--303
                   J. S. Ullian   Three theorems concerning principal AFLs 304--314
            Robert L. Constable   Subrecursive programming languages II on
                                  program size . . . . . . . . . . . . . . 315--334
                      Anonymous   Announcement . . . . . . . . . . . . . . 335--335
                Richard M. Karp   Special SIGACT issue . . . . . . . . . . i+(1*)

Journal of Computer and System Sciences
Volume 5, Number 4, August, 1971

György Révész   Unilateral context sensitive grammars
                                  and left-to-right parsing  . . . . . . . 337--352
                   Jozef Gruska   A characterization of context-free
                                  languages  . . . . . . . . . . . . . . . 353--364
           Seymour Ginsburg and   
               Edwin H. Spanier   AFL with the semilinear property . . . . 365--396
                 Ronald V. Book   Time-bounded grammars and their
                                  languages  . . . . . . . . . . . . . . . 397--429
                    J. B. Rosen   Minimum error bounds for
                                  multidimensional spline approximation    430--452
                      Anonymous   Erratum  . . . . . . . . . . . . . . . . 453--453

Journal of Computer and System Sciences
Volume 5, Number 5, October, 1971

           Serafino Amoroso and   
                  Gerald Cooper   Tessellation structures for reproduction
                                  of arbitrary patterns  . . . . . . . . . 455--464
        Jerzy W. Grzymala-Busse   Operation-preserving functions and
                                  autonomous factors of finite automata    465--474
                    A. C. Fleck   Towards a theory of data structures  . . 475--488
                   G. T. Herman   Every finite sequential machine is
                                  linearly realizable  . . . . . . . . . . 489--510
                F. Commoner and   
                 A. W. Holt and   
                    S. Even and   
                      A. Pnueli   Marked directed graphs . . . . . . . . . 511--523
             Peter J. Nicholson   Algebraic theory of finite Fourier
                                  transforms . . . . . . . . . . . . . . . 524--547

Journal of Computer and System Sciences
Volume 5, Number 6, December, 1971

                 Rani Siromoney   Finite-turn checking automata  . . . . . 549--559
              Terrence W. Pratt   Pair grammars, graph languages and
                                  string-to-graph translations . . . . . . 560--595
             Karel Culík   Abstract families of relations . . . . . 596--606
           Trevor I. Fenner and   
               Georghios Loizou   On fully indecomposable matrices . . . . 607--622
              Thomas J. Ostrand   Pattern reproduction in tessellation
                                  automata of arbitrary dimension  . . . . 623--628
                I. P. McWhirter   Substitution expressions . . . . . . . . 629--637
                      Anonymous   Author index . . . . . . . . . . . . . . 638--638


Journal of Computer and System Sciences
Volume 6, Number 1, February, 1972

                 Lee E. Heindel   Computation of powers of multivariate
                                  polynomials over the integers  . . . . . 1--8
             Jonathan Goldstine   Substitution and bounded languages . . . 9--29
             Sheila A. Greibach   Syntactic operators on full semiAFLs . . 30--76
                Andy N. C. Kang   Effective operators with no strong gaps
                                  *  . . . . . . . . . . . . . . . . . . . 77--87
                V. E. Itkin and   
                V. E. Itkin and   
                Z. Zwinogrodzki   On program schemata equivalence  . . . . 88--101
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 6, Number 2, April, 1972

            Jack W. Carlyle and   
            Sheila Greibach and   
            Juris Hartmanis and   
                     E. K. Blum   Eleventh Annual Switching and Automata
                                  Theory Symposium . . . . . . . . . . . . i--i
                 David Gale and   
                Richard M. Karp   A phenomenon in the theory of sorting    103--115
            Michael S. Paterson   Tape bounds for time-bounded Turing
                                  machines . . . . . . . . . . . . . . . . 116--124
                  A. V. Aho and   
                   J. D. Ullman   Equivalence of programs with structured
                                  variables  . . . . . . . . . . . . . . . 125--137
                      T. Kameda   Pushdown automata with counters  . . . . 138--150
            Yechezkel Zalcstein   Locally testable languages . . . . . . . 151--167
       Joseph Alphonso Giuliano   Writing stack acceptors  . . . . . . . . 168--204

Journal of Computer and System Sciences
Volume 6, Number 3, June, 1972

                    P. M. Spira   Complete linear proofs of systems of
                                  linear inequalities  . . . . . . . . . . 205--216
               Donald F. Stanat   A homomorphism theorem for weighted
                                  context-free grammars  . . . . . . . . . 217--232
                 Alvy Ray Smith   Real-time language recognition by
                                  one-dimensional cellular automata  . . . 233--253
                   J. P. Cleave   Combinatorial systems I. Cylindrical
                                  problems . . . . . . . . . . . . . . . . 254--266
         Jürgen Eickel and   
                 Jacques Loeckx   The relation between derivations and
                                  syntactical structures in
                                  phrase-structure grammars  . . . . . . . 267--282
              Philippe Butzbach   Les 1-convexes du mono\"\ide commutatif
                                  $ \mathbb {N}^n $. (French) [The
                                  1-convexes of the commutative monoid $
                                  \mathbb {N}^n $] . . . . . . . . . . . . 283--289
                      Anonymous   Notice . . . . . . . . . . . . . . . . . 290--290

Journal of Computer and System Sciences
Volume 6, Number 4, August, 1972

             Michael A. Golberg   The equivalence of several initial value
                                  methods for solving integral equations   291--297
              Martin H. Schultz   Discrete Tchebycheff approximation for
                                  multivariate splines . . . . . . . . . . 298--304
              James C. King and   
                Robert W. Floyd   An interpretation-oriented theorem
                                  prover over integers . . . . . . . . . . 305--323
                 Vaclav Rajlich   Absolutely parallel grammars and two-way
                                  finite-state transducers . . . . . . . . 324--342
                     R. S. Bucy   The Riccati equation and its bounds  . . 343--353
             Steve F. McCormick   A general approach to one-step iterative
                                  methods with application to eigenvalue
                                  problems . . . . . . . . . . . . . . . . 354--372

Journal of Computer and System Sciences
Volume 6, Number 5, October, 1972

                  D. Richardson   Tessellations with local transformations 373--388
                 H. B. Enderton   Degrees of computational complexity  . . 389--396
            F. P. Preparata and   
                      R. T. Yeh   Continuously valued logic  . . . . . . . 397--418
               D. E. Muller and   
                   R. E. Miller   A generalization of the theory of
                                  incompletely specified machines  . . . . 419--447
                 S. Amoroso and   
                     Y. N. Patt   Decision procedures for surjectivity and
                                  injectivity of parallel maps for
                                  tessellation structures  . . . . . . . . 448--464
              Jacob Katzenelson   The Markov algorithm as a language
                                  parser-Linear bounds . . . . . . . . . . 465--478

Journal of Computer and System Sciences
Volume 6, Number 6, December, 1972

             Michael J. Fischer   Special SIGACT issue . . . . . . . . . . 479--479
            R. L. Constable and   
                 S. S. Muchnick   Subrecursive program schemata I and II:
                                  I. Undecidable equivalence problems; II.
                                  Decidable equivalence problems . . . . . 480--537
                  David S. Wise   Generalized overlap resolvable grammars
                                  and their parsers  . . . . . . . . . . . 538--572
                  A. V. Aho and   
                   J. D. Ullman   Optimization of LR($k$) parsers  . . . . 573--602
                Michael Machtey   Augmented loop languages and classes of
                                  computable functions . . . . . . . . . . 603--624
                  Ian Munro and   
                  Allan Borodin   Efficient evaluation of polynomial forms 625--638
               Michael O. Rabin   Proving simultaneous positivity of
                                  linear forms . . . . . . . . . . . . . . 639--650
                      Anonymous   Author index . . . . . . . . . . . . . . 651--651


Journal of Computer and System Sciences
Volume 7, Number 1, February, 1973

           Seymour Ginsburg and   
                Sheila Greibach   On AFL generators for finitely encoded
                                  AFA  . . . . . . . . . . . . . . . . . . 1--27
                Oscar H. Ibarra   On two-way multihead automata  . . . . . 28--36
               Norihiro Abe and   
          Masaharu Mizumoto and   
            Jun-ichi Toyoda and   
                Kohkichi Tanaka   Web grammars and several graphs  . . . . 37--65
                Karel Culik and   
                     Rina Cohen   LR-regular grammars --- an extension of
                                  LR($k$) grammars . . . . . . . . . . . . 66--96
       Horacio Feliciangeli and   
                Gabor T. Herman   Algorithms for producing grammars from
                                  sample derivations: a common problem of
                                  formal language theory and developmental
                                  biology  . . . . . . . . . . . . . . . . 97--118
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 7, Number 2, April, 1973

         Stephen J. Garland and   
               David C. Luckham   Program schemes, recursion schemes, and
                                  formal languages . . . . . . . . . . . . 119--160
             Bernard P. Zeigler   Every discrete input machine is linearly
                                  simulatable  . . . . . . . . . . . . . . 161--167
               J. Hartmanis and   
                      H. Walter   Group theoretic characterization of
                                  linear permutation automata  . . . . . . 168--188
                  Ian Munro and   
               Michael Paterson   Optimal algorithms for parallel
                                  polynomial evaluation  . . . . . . . . . 189--198
         Yoshihide Igarashi and   
                    Namio Honda   On the extension of Gladkij's Theorem
                                  and the hierarchies of languages . . . . 199--217
                   Malcolm Bird   The equivalence problem for
                                  deterministic two-tape automata  . . . . 218--236

Journal of Computer and System Sciences
Volume 7, Number 3, June, 1973

        Michael A. Harrison and   
                  Ivan M. Havel   Strict deterministic grammars  . . . . . 237--277
               Michael A. Arbib   Coproducts and decomposable machines . . 278--287
                 Zvi Kohavi and   
                Joseph Winograd   Establishing certain bounds concerning
                                  finite automata  . . . . . . . . . . . . 288--299
         Yoshifumi Masunaga and   
            Shoichi Noguchi and   
                    Juro Oizumi   A structure theory of automata
                                  characterized by groups  . . . . . . . . 300--305
                  To-yat Cheung   Approximate solutions and error bounds
                                  for quasilinear elliptic boundary value
                                  problems . . . . . . . . . . . . . . . . 306--322
             J. E. Hopcroft and   
                   R. E. Tarjan   A $ V \log V $ algorithm for isomorphism
                                  of triconnected planar graphs  . . . . . 323--331

Journal of Computer and System Sciences
Volume 7, Number 4, August, 1973

        Arnold L. Rosenberg and   
             Edward K. Blum and   
             Patrick C. Fischer   Special SIGACT issue: Fourth Annual ACM
                                  Symposium on Theory of Computing . . . . 333--333
                     H. T. Kung   A bound on the multiplicative efficiency
                                  of iteration . . . . . . . . . . . . . . 334--342
                Stephen A. Cook   A hierarchy for nondeterministic time
                                  complexity . . . . . . . . . . . . . . . 343--353
            Stephen A. Cook and   
              Robert A. Reckhow   Time bounded random access machines  . . 354--375
                  C. P. Schnorr   Process complexity and effective random
                                  tests  . . . . . . . . . . . . . . . . . 376--388
              Walter J. Savitch   Maze recognizing automata and
                                  nondeterministic tape complexity . . . . 389--403
               S. A. Walker and   
                   H. R. Strong   Characterizations of flowchartable
                                  recursions . . . . . . . . . . . . . . . 404--447
                Manuel Blum and   
            Robert W. Floyd and   
              Vaughan Pratt and   
           Ronald L. Rivest and   
               Robert E. Tarjan   Time bounds for selection  . . . . . . . 448--461

Journal of Computer and System Sciences
Volume 7, Number 5, October, 1973

                 Meera Blattner   The unsolvability of the equality
                                  problem for sentential forms of
                                  context-free grammars  . . . . . . . . . 463--468
                 Ellis Horowitz   The efficient calculation of powers of
                                  polynomials  . . . . . . . . . . . . . . 469--480
                     Takeo Yaku   The constructibility of a configuration
                                  in a cellular automaton  . . . . . . . . 481--496
                   C. E. Hughes   Many-one degrees associated with
                                  semi-Thue systems  . . . . . . . . . . . 497--505
            Alan G. Konheim and   
                  Bernd Meister   Distributions of queue lengths and
                                  waiting times in a loop with two-way
                                  traffic  . . . . . . . . . . . . . . . . 506--521
          Svetlana P. Kartashev   State assignment for realizing modular
                                  input-free sequential logical networks
                                  without invertors  . . . . . . . . . . . 522--542

Journal of Computer and System Sciences
Volume 7, Number 6, December, 1973

                 J. D. Rutledge   Program schemata as automata. I  . . . . 543--578
        Robert D. Rosebrugh and   
                    Derick Wood   A characterization theorem for
                                  $n$-parallel right linear languages  . . 579--582
                     L. Boasson   Two iteration theorems for some families
                                  of languages . . . . . . . . . . . . . . 583--596
                       D. Nudds   Conversion of programs between
                                  computers: Interpreters, simulators and
                                  compilers  . . . . . . . . . . . . . . . 597--614
                 Akihiro Nozaki   Two entropies of a generalized sorting
                                  problem  . . . . . . . . . . . . . . . . 615--621
                      Anonymous   Author index . . . . . . . . . . . . . . 622--622


Journal of Computer and System Sciences
Volume 8, Number 1, February, 1974

               S. J. Walljasper   Left-derivation bounded languages  . . . 1--7
           Johnson Murdoch Hart   Ambiguity and decision problems for
                                  local adjunct languages  . . . . . . . . 8--21
                   Richard Bird   On transformations of programs . . . . . 22--35
                  J. P. Crestin   Structure des grammaires d'ambigu\"\ité
                                  bornée. (French) [Structure of bounded
                                  ambiguous grammars]  . . . . . . . . . . 36--40
              Ratan K. Guha and   
                 Raymond T. Yeh   On periodicity of sequential machines    41--70
                 Harry R. Lewis   Program schemata and the first-order
                                  decision problem . . . . . . . . . . . . 71--83
              Toshihide Ibaraki   Classes of discrete optimization
                                  problems and their decision problems . . 84--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 8, Number 2, April, 1974

                 Yaacov Choueka   Theories of automata on $ \omega
                                  $-tapes: a simplified approach . . . . . 117--141
               Nabil A. Khabbaz   A geometric hierarchy of languages . . . 142--157
              A. B. Cremers and   
                       O. Mayer   On vector languages  . . . . . . . . . . 158--166
         Yoshihide Igarashi and   
                    Namio Honda   Deterministic multitape automata
                                  computations . . . . . . . . . . . . . . 167--189
         Patrick C. Fischer and   
              John C. Warkentin   Predecessor machines . . . . . . . . . . 190--219
                 E. K. Blum and   
                 G. H. Rodrigue   Solution of eigenvalue problems in
                                  Hilbert spaces by a gradient method  . . 220--237
György Révész   Comment on the paper ``Error detection
                                  in formal languages''  . . . . . . . . . 238--242
           Seymour Ginsburg and   
                   Gene F. Rose   The equivalence of stack-counter
                                  acceptors and quasi-realtime
                                  stack-counter acceptors  . . . . . . . . 243--269

Journal of Computer and System Sciences
Volume 8, Number 3, June, 1974

          H. Raymond Strong and   
             Edward K. Blum and   
            Richard M. Karp and   
            Arnold L. Rosenberg   Thirteenth annual IEEE Symposium on
                                  Switching and Automata Theory  . . . . . 271--271
               David S. Johnson   Fast algorithms for bin packing  . . . . 272--314
            Brenda S. Baker and   
                 Ronald V. Book   Reversal-bounded multipushdown machines  315--332
                   J. A. Goguen   On homomorphisms, correctness,
                                  termination, unfoldments, equivalence of
                                  flow diagram programs  . . . . . . . . . 333--365
                 A. Borodin and   
                      R. Moenck   Fast modular transforms  . . . . . . . . 366--386
                   A. J. Kfoury   Translatability of schemas over
                                  restricted interpretations . . . . . . . 387--408
               T. S. E. Maibaum   A generalized approach to formal
                                  languages  . . . . . . . . . . . . . . . 409--439
                      Anonymous   Author index . . . . . . . . . . . . . . 440--440


Journal of Computer and System Sciences
Volume 9, Number 1, August, 1974

                Arthur Gill and   
                Lawrence T. Kou   Multiple-entry finite automata . . . . . 1--19
              Gerad G. L. Meyer   Algorithm model for penalty
                                  functions-type iterative procedures  . . 20--30
              Akira Maruoka and   
                Masayuki Kimura   Completeness problem of one-dimensional
                                  binary scope-3 tessellation automata . . 31--47
               Eugene M. Norris   Difunctionally induced state machines    48--55
                      Kai Hwang   Cyclic decomposition of finite
                                  stochastic systems . . . . . . . . . . . 56--68
            Edward L. Robertson   Complexity classes of partial recursive
                                  functions  . . . . . . . . . . . . . . . 69--87
           Seymour Ginsburg and   
               Edwin H. Spanier   On incomparable abstract family of
                                  languages (AFL)  . . . . . . . . . . . . 88--108
                 Lee E. Heindel   Congruence arithmetic algorithms for
                                  polynomial real zero determination . . . 109--128
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 9, Number 2, October, 1974

            Yves Rouchaleau and   
              Bostwick F. Wyman   Linear dynamical systems over integral
                                  domains  . . . . . . . . . . . . . . . . 129--142
                    Nancy Lynch   Approximations to the halting problem    143--150
                    R. P. Daley   The extent and density of sequences
                                  within the minimal-program complexity
                                  hierarchies  . . . . . . . . . . . . . . 151--163
                S. Rao Kosaraju   $1$-Way stack automaton with jumps . . . 164--176
                   Takumi Kasai   Translatability of flowcharts into while
                                  programs . . . . . . . . . . . . . . . . 177--195
                    Peter Elias   Minimum times and memories needed to
                                  compute the values of a function . . . . 196--212
                 Ronald V. Book   Comparing complexity classes . . . . . . 213--229

Journal of Computer and System Sciences
Volume 9, Number 3, December, 1974

              Alfred V. Aho and   
             Edward K. Blum and   
                  P. C. Fischer   Special SIGACT issue: Fifth Annual ACM
                                  Symposium on Theory of Computing . . . . 231--231
                S. Rao Kosaraju   Analysis of structured programs  . . . . 232--255
               David S. Johnson   Approximation algorithms for
                                  combinatorial problems . . . . . . . . . 256--278
                P. M. Lewis and   
          D. J. Rosenkrantz and   
                  R. E. Stearns   Attributed translations  . . . . . . . . 279--307
                Stephen A. Cook   An observation on time-storage trade off 308--316
         Michael J. Fischer and   
            Larry J. Stockmeyer   Fast on-line integer multiplication  . . 317--331
                 Jean Vuillemin   Correct and optimal implementations of
                                  recursion in a simple programming
                                  language . . . . . . . . . . . . . . . . 332--354
                R. Endre Tarjan   Testing flow graph reducibility  . . . . 355--365
                      Anonymous   Author index . . . . . . . . . . . . . . 366--366


Journal of Computer and System Sciences
Volume 10, Number 1, February, 1975

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
                   J. A. Goguen   Discrete-time machines in closed
                                  monoidal categories. I . . . . . . . . . 1--43
                  Victor Harnik   Effective proper procedures and
                                  universal classes of program schemata    44--61
               I. H. Sudborough   On tape-bounded complexity classes and
                                  multihead finite automata  . . . . . . . 62--76
           Serafino Amoroso and   
              Gerald Cooper and   
                      Yale Patt   Some clarifications of the concept of a
                                  Garden-of-Eden configuration . . . . . . 77--82
                James C. Owings   Splitting a Context-Sensitive Set  . . . 83--87
                 Donald I. Kiel   Two-way $a$-transducers and AFL  . . . . 88--109
                 E. A. Ashcroft   Proving assertions about parallel
                                  programs . . . . . . . . . . . . . . . . 110--135
           Aravind K. Joshi and   
               Leon S. Levy and   
               Masako Takahashi   Tree adjunct grammars  . . . . . . . . . 136--163

Journal of Computer and System Sciences
Volume 10, Number 2, April, 1975

           Seymour Ginsburg and   
         Jonathan Goldstine and   
                Sheila Greibach   Uniformly erasable AFL . . . . . . . . . 165--182
                Michael Machtey   On the density of honest subrecursive
                                  classes  . . . . . . . . . . . . . . . . 183--199
             Kenneth B. Salomon   The decidability of a mapping problem
                                  for generalized sequential machines with
                                  final states . . . . . . . . . . . . . . 200--218
                M. Mizumoto and   
                  J. Toyoda and   
                      K. Tanaka   Various kinds of automata with weights   219--236
                 S. A. Greibach   One counter languages and the IRS
                                  condition  . . . . . . . . . . . . . . . 237--247
        Wallace L. Hamilton and   
                John R. Mertens   Reproduction in tessellation structures  248--252
                 Akira Nakamura   On causal $ \omega^2$-systems  . . . . . 253--265
                  Suad Alagi\'c   Natural state transformations  . . . . . 266--307
              Leslie G. Valiant   General context-free recognition in less
                                  than cubic time  . . . . . . . . . . . . 308--315

Journal of Computer and System Sciences
Volume 10, Number 3, June, 1975

                       C. Beeri   Two-way nested stack automata are
                                  equivalent to two-way stack automata . . 317--339
          Leslie G. Valiant and   
            Michael S. Paterson   Deterministic one-counter automata . . . 340--350
             Jonathan Goldstine   Some independent families of one-letter
                                  languages  . . . . . . . . . . . . . . . 351--369
                 G. Germano and   
          A. Maggiolo-Schettini   Proving a compiler correct: a simple
                                  approach . . . . . . . . . . . . . . . . 370--383
                   J. D. Ullman   NP-complete scheduling problems  . . . . 384--393
   Sister Teresemarie McCloskey   Abstract families of length-preserving
                                  processors . . . . . . . . . . . . . . . 394--427
                      Anonymous   Author index . . . . . . . . . . . . . . 428--428


Journal of Computer and System Sciences
Volume 11, Number 1, August, 1975

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
                Branislav Rovan   Proving containment of bounded AFL . . . 1--55
            Oscar H. Ibarra and   
                Sartaj K. Sahni   Hierarchies of Turing machines with
                                  restricted tape alphabet size  . . . . . 56--67
                  Neil D. Jones   Space-bounded reducibility among
                                  combinatorial problems . . . . . . . . . 68--85
              Armin Cremers and   
               Seymour Ginsburg   Context-free grammar forms . . . . . . . 86--117
             A. R. Freedman and   
                   R. E. Ladner   Space bounds for processing contentless
                                  inputs . . . . . . . . . . . . . . . . . 118--128
               G. Rozenberg and   
                      K. P. Lee   Some properties of the class of $L$
                                  languages with interactions  . . . . . . 129--147

Journal of Computer and System Sciences
Volume 11, Number 2, October, 1975

           Michael A. Arbib and   
                     E. K. Blum   Editors' foreword  . . . . . . . . . . . 149--149
          Hidenosuke Nishio and   
                Youichi Kobuchi   Fault tolerant cellular spaces . . . . . 150--170
             Masateru Harao and   
                Shoichi Noguchi   Fault tolerant cellular automata . . . . 171--185
          Václav Rajlich   Dynamics of discrete systems and pattern
                                  reproduction . . . . . . . . . . . . . . 186--202
                Jan Van Leeuwen   The tape-complexity of
                                  context-independent developmental
                                  languages  . . . . . . . . . . . . . . . 203--211
              Hartmut Ehrig and   
           Karl Wilhelm Tischer   Graph grammars and applications to
                                  specialization and evolution in biology  212--236
        W. O. Höllerer and   
                     R. Vollmar   On ``forgetful'' cellular automata . . . 237--251
                  Adrian Walker   Formal grammars and the regeneration
                                  capability of biological systems . . . . 252--261
                  Ann Reedy and   
              Walter J. Savitch   Ambiguity in the developmental systems
                                  of Lindenmayer . . . . . . . . . . . . . 262--283

Journal of Computer and System Sciences
Volume 11, Number 3, December, 1975

                 Robert M. Baer   Computation by assembly  . . . . . . . . 285--294
            Michael J. Best and   
                   Klaus Ritter   An accelerated conjugate direction
                                  method to solve linearly constrained
                                  minimization problems  . . . . . . . . . 295--322
            J. W. de Bakker and   
           L. G. L. T. Meertens   On the completeness of the inductive
                                  assertion method . . . . . . . . . . . . 323--357
                 Barry K. Rosen   Program equivalence and context-free
                                  grammars . . . . . . . . . . . . . . . . 358--374
              Eduardo D. Sontag   On some questions of rationality and
                                  decidability . . . . . . . . . . . . . . 375--381
             S. Di Gregorio and   
                   G. Trautteur   On reversibility in cellular automata    382--391
            Andrzej Ehrenfeucht   Practical decidability . . . . . . . . . 392--396
                      Anonymous   Erratum  . . . . . . . . . . . . . . . . 397--397
                     E. K. Blum   Editor's note  . . . . . . . . . . . . . 397--397
                      Anonymous   Author index for volume 11 . . . . . . . 398--398


Journal of Computer and System Sciences
Volume 12, Number 1, February, 1976

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
                     Takeo Yaku   Surjectivity of nondeterministic
                                  parallel maps induced bynondeterministic
                                  cellular automata  . . . . . . . . . . . 1--5
                  D. Richardson   Continuous self-reproduction . . . . . . 6--12
               F. Joanne Helton   The semigroup of an algebra automaton    13--24
                 Sam Savage and   
               Peter Weiner and   
                      A. Bagchi   Neighborhood search algorithms for
                                  guaranteeing optimal traveling salesman
                                  tours must be inefficient  . . . . . . . 25--35
              Masakazu Nasu and   
                    Namio Honda   A completeness property of
                                  one-dimensional tessellation automata    36--48
            Yoshinori Ezawa and   
          Masaharu Mizumoto and   
             Junichi Toyoda and   
                 Kokichi Tanaka   Interactive languages  . . . . . . . . . 49--63
                Johnson M. Hart   The derivation language of a phrase
                                  structure grammar  . . . . . . . . . . . 64--79
                Klaus Weihrauch   The computational complexity of program
                                  schemata . . . . . . . . . . . . . . . . 80--107
                    R. R. Meyer   Sufficient conditions for the
                                  convergence of monotonic mathematical
                                  programming algorithms . . . . . . . . . 108--121
                    F. D. Lewis   On computational reducibility  . . . . . 122--131

Journal of Computer and System Sciences
Volume 12, Number 2, April, 1976

        Robert L. Constable and   
                 E. K. Blum and   
                 M. A. Harrison   Special SIGACT issue: Sixth Annual ACM
                                  Symposium on Theory of Computing . . . . 133--133
        Andrzej Ehrenfeucht and   
                    Paul Zeiger   Complexity measures for regular
                                  expressions  . . . . . . . . . . . . . . 134--146
                  Kurt Mehlhorn   Polynomial and abstract subrecursive
                                  classes  . . . . . . . . . . . . . . . . 147--178
            Bruno Courcelle and   
                 Jean Vuillemin   Completeness results for the equivalence
                                  of recursive schemas . . . . . . . . . . 179--197
           Vaughan R. Pratt and   
            Larry J. Stockmeyer   A characterization of the power of
                                  vector machines  . . . . . . . . . . . . 198--221
              Harry B. Hunt and   
      Daniel J. Rosenkrantz and   
            Thomas G. Szymanski   On the equivalence, containment, and
                                  covering problems for the regular and
                                  context-free languages . . . . . . . . . 222--268

Journal of Computer and System Sciences
Volume 12, Number 3, June, 1976

              Hartmut Ehrig and   
        Hans-Jörg Kreowski   Systematic approach to reduction and
                                  minimization in automata and system
                                  theory . . . . . . . . . . . . . . . . . 269--304
           Stephen L. Bloom and   
                Calvin C. Elgot   The existence and construction of free
                                  iterative theories . . . . . . . . . . . 305--318
                   J. Bruno and   
              E. G. Coffman and   
                  D. B. Johnson   On batch scheduling of jobs with
                                  stochastic service times and cost
                                  structures on a single server  . . . . . 319--335
                   Y. Breitbart   Some bounds on the complexity of
                                  predicate recognition by finite automata 336--349
                  Zvi Galil and   
                    Janos Simon   A note on multiple-entry finite automata 350--351
              K. Hashiguchi and   
                       N. Honda   Properties of code events and
                                  homomorphisms over regular events  . . . 352--367
                Donald A. Alton   Nonexistence of program optimizers in
                                  several abstract settings  . . . . . . . 368--393
          Peter Gordon Anderson   Another proof of the theorem on pattern
                                  reproduction in tessellation structures  394--398
                   J. Goldstine   Bounded AFLs . . . . . . . . . . . . . . 399--419
                      Anonymous   Author index for volume 12 . . . . . . . 420--420


Journal of Computer and System Sciences
Volume 13, Number 1, August, 1976

              James L. Peterson   Computation sequence sets  . . . . . . . 1--24
               Stephen Cook and   
                     Ravi Sethi   Storage requirements for deterministic
                                  polynomial-time recognizable languages   25--37
          Kenichi Taniguchi and   
                   Tadao Kasami   A result on the equivalence problem for
                                  deterministic pushdown automata  . . . . 38--50
         Patrick C. Fischer and   
        Edward L. Robertson and   
             Lawrence V. Saxton   On the sequential nature of functions    51--68
                   David Dobkin   A nonlinear lower bound on linear search
                                  tree programs for solving knapsack
                                  problems . . . . . . . . . . . . . . . . 69--73
         Yoshifumi Masunaga and   
            Shoichi Noguchi and   
                    Juro Oizumi   A characterization of automata and a
                                  direct product decomposition . . . . . . 74--89
               G. Rozenberg and   
                     A. Salomaa   Context-free grammars with
                                  graph-controlled tables  . . . . . . . . 90--99
                    Nancy Lynch   Complexity-class-encoding sets . . . . . 100--118

Journal of Computer and System Sciences
Volume 13, Number 2, October, 1976

             Robert M. Baer and   
                Jan van Leeuwen   The halting problem for linear Turing
                                  assemblers . . . . . . . . . . . . . . . 119--135
           Serafino Amoroso and   
              Irving J. Epstein   Indecomposable parallel maps in
                                  tessellation structures  . . . . . . . . 136--142
                  Yukio Shibata   On the structure of abelian automata . . 143--152
            Oscar H. Ibarra and   
                    Chul E. Kim   A useful device for showing the
                                  solvability of some decision problems    153--160
                      A. Nozaki   Hazard analysis of asynchronous circuits
                                  in Muller--Bartky's sense  . . . . . . . 161--171
                  Richard Laing   Automaton introspection  . . . . . . . . 172--183
          A. Schönhage and   
                M. Paterson and   
                   N. Pippenger   Finding the median . . . . . . . . . . . 184--199
               Stephen L. Bloom   Varieties of ordered algebras  . . . . . 200--212
                S. F. McCormick   Some convergence results on the method
                                  of gradients for $ A x = \lambda B x $   213--222
        André Arnold and   
                    Max Dauchet   Un théor\`eme de duplication pour les
                                  forêts algébriques. (French) [A
                                  duplication theorem for algebraic
                                  forests] . . . . . . . . . . . . . . . . 223--244

Journal of Computer and System Sciences
Volume 13, Number 3, December, 1976

          William C. Rounds and   
                 E. K. Blum and   
                 M. A. Harrison   Editors' foreword  . . . . . . . . . . . 245--245
            C. Raymond Perrault   Intercalation lemmas for tree transducer
                                  languages  . . . . . . . . . . . . . . . 246--277
              Leslie G. Valiant   Graph-theoretic properties in
                                  computational complexity . . . . . . . . 278--285
                  A. V. Aho and   
                   J. D. Ullman   Node listings for reducible flow graphs  286--299
                 Gary L. Miller   Riemann's hypothesis and tests for
                                  primality  . . . . . . . . . . . . . . . 300--317
              Harry B. Hunt and   
            Thomas G. Szymanski   Complexity metatheorems for context-free
                                  grammar problems . . . . . . . . . . . . 318--334
           Kellogg S. Booth and   
               George S. Lueker   Testing for the consecutive ones
                                  property, interval graphs, and graph
                                  planarity using PQ-tree algorithms . . . 335--379
                      Anonymous   Author index for volume 13 . . . . . . . 380--380


Journal of Computer and System Sciences
Volume 14, Number 1, February, 1977

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
             Herbert Fleischner   On the equivalence of Mealy-type and
                                  Moore-type automata and a relation
                                  between reducibility and
                                  Moore-reducibility . . . . . . . . . . . 1--16
             Kripasindhu Sikdar   On topological machines  . . . . . . . . 17--48
               R. J. Lipton and   
               R. E. Miller and   
                      L. Snyder   Synchronization and computing
                                  capabilities of linear asynchronous
                                  structures . . . . . . . . . . . . . . . 49--72
               Joel I. Seiferas   Techniques for separating space
                                  complexity classes . . . . . . . . . . . 73--99
               Joel I. Seiferas   Relating refined space complexity
                                  classes  . . . . . . . . . . . . . . . . 100--129
            V. J. Rayward-Smith   Hypergrammars: an extension of
                                  macrogrammars  . . . . . . . . . . . . . 130--149
             D. J. Hartfiel and   
                   C. J. Maxson   A semigroup characterization of a
                                  linearly realizable automaton over GF(p) 150--155

Journal of Computer and System Sciences
Volume 14, Number 2, April, 1977

            Arnold L. Rosenberg   On storing concatenable arrays . . . . . 157--174
                 Garry Rodrigue   The method of closest approach for
                                  finding nonisolate zeros of functions    175--186
                Detlef Wotschke   Degree-languages: a new concept of
                                  acceptance . . . . . . . . . . . . . . . 187--209
            David Alan Plaisted   Sparse complex polynomials and
                                  polynomial reducibility  . . . . . . . . 210--221
                   Ronald Fagin   Asymptotic miss ratios over independent
                                  references . . . . . . . . . . . . . . . 222--250
           Stephen L. Bloom and   
             Susanna Ginali and   
             Joseph D. Rutledge   Scalar and vector iteration  . . . . . . 251--256
                     Tadashi Ae   Direct or cascade product of pushdown
                                  automata . . . . . . . . . . . . . . . . 257--263

Journal of Computer and System Sciences
Volume 14, Number 3, June, 1977

          Matthew M. Geller and   
            Michael A. Harrison   Characteristic parsing: a framework for
                                  producing compact deterministic parsers,
                                  I  . . . . . . . . . . . . . . . . . . . 265--317
          Matthew M. Geller and   
            Michael A. Harrison   Characteristic parsing: a framework for
                                  producing compact deterministic parsers,
                                  II . . . . . . . . . . . . . . . . . . . 318--343
              Emily P. Friedman   Equivalence problems for deterministic
                                  context-free languages and monadic
                                  recursion schemes  . . . . . . . . . . . 344--359
                W. S. Ching and   
                    B. F. Wyman   Duality and the regulator problem for
                                  linear systems over commutative rings    360--368
               T. S. E. Maibaum   Erratum  . . . . . . . . . . . . . . . . 369--369
                      Anonymous   Author index for volume 14 . . . . . . . 370--370


Journal of Computer and System Sciences
Volume 15, Number 1, August, 1977

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
         Toshimasa Watanabe and   
                Shoichi Noguchi   The amalgamation of automata . . . . . . 1--16
                   T. Tsuji and   
                  J. Toyoda and   
                      K. Tanaka   Relational data graphs and some
                                  properties of them . . . . . . . . . . . 17--34
                 S. A. Greibach   Control sets on context-free grammar
                                  forms  . . . . . . . . . . . . . . . . . 35--98
                  Anton Nijholt   On the covering of parsable grammars . . 99--110
                Adrian Atanasiu   C-grammars and tree-codifications  . . . 111--120

Journal of Computer and System Sciences
Volume 15, Number 2, October, 1977

              Tadakazu Sato and   
                    Namio Honda   Certain relations between properties of
                                  maps of tessellation automata  . . . . . 121--145
                   Bernd Reusch   Linear realization of finite automata    146--168
              Rina S. Cohen and   
                   Arie Y. Gold   Theory of $ \omega $-languages: I:
                                  Characterizations of $ \omega
                                  $-context-free languages . . . . . . . . 169--184
              Rina S. Cohen and   
                   Arie Y. Gold   Theory of $ \omega $-languages. II: a
                                  study of various models of $ \omega
                                  $-type generation and recognition  . . . 185--208
                  Mitchell Wand   A characterization of weakest
                                  preconditions  . . . . . . . . . . . . . 209--212
                Tommaso Toffoli   Computation and construction
                                  universality of reversible cellular
                                  automata . . . . . . . . . . . . . . . . 213--231
György Révész   Algebraic properties of derivation words 232--240
                  Neil D. Jones   Space-bounded reducibility among
                                  combinatorial problems . . . . . . . . . 241--241

Journal of Computer and System Sciences
Volume 15, Number 3, December, 1977

             Stephen J. Willson   Limiting shapes for configurations . . . 243--261
              Armin Cremers and   
           Seymour Ginsburg and   
               Edwin H. Spanier   The structure of context-free
                                  grammatical families . . . . . . . . . . 262--279
             Walter A. Burkhard   Associative Retrieval Trie Hash-Coding   280--299
             Amelia C. Fong and   
              Jeffrey D. Ullman   Finding the depth of a flow graph  . . . 300--309
             Meera Blattner and   
                       Tom Head   Single-valued $a$-transducers  . . . . . 310--327
           Joost Engelfriet and   
          Erik Meineche Schmidt   IO and OI. I . . . . . . . . . . . . . . 328--353
                     Igal Golan   Conditional grammars . . . . . . . . . . 354--371
                      Anonymous   Author index for volume 15 . . . . . . . 372--372


Journal of Computer and System Sciences
Volume 16, Number 1, February, 1978

              Theodore P. Baker   ``Natural'' properties of flowchart
                                  step-counting measures . . . . . . . . . 1--22
                    M. B. Smyth   Power domains  . . . . . . . . . . . . . 23--36
           J. A. Brzozowski and   
                       R. Knast   The dot-depth hierarchy of star-free
                                  languages is infinite  . . . . . . . . . 37--55
           Torleiv Klòve   On complements of unary $L$ languages    56--66
           Joost Engelfriet and   
          Erik Meineche Schmidt   IO and OI. II  . . . . . . . . . . . . . 67--99
                  J. Berger and   
                        C. Pair   Inference for regular bilanguages  . . . 100--122

Journal of Computer and System Sciences
Volume 16, Number 2, April, 1978

              Ashok Chandra and   
                 E. K. Blum and   
                 M. A. Harrison   Editors' foreword  . . . . . . . . . . . 123--123
          Richard J. Lipton and   
            Larry J. Stockmeyer   Evaluation of polynomials with
                                  super-preconditioning  . . . . . . . . . 124--139
                      Zvi Galil   Palindrome recognition in real time by a
                                  multitape Turing machine . . . . . . . . 140--157
             M. S. Paterson and   
                   M. N. Wegman   Linear unification . . . . . . . . . . . 158--167
         Kenneth L. Manders and   
                Leonard Adleman   NP-Complete decision problems for binary
                                  quadratics . . . . . . . . . . . . . . . 168--184
             Thomas J. Schaefer   On the complexity of some two-person
                                  perfect-information games  . . . . . . . 185--225
              Leo J. Guibas and   
         Endre Szemerédi   The Analysis of Double Hashing . . . . . 226--274

Journal of Computer and System Sciences
Volume 16, Number 3, June, 1978

              Rina S. Cohen and   
                   Arie Y. Gold   $ \omega $-Computations on deterministic
                                  pushdown machines  . . . . . . . . . . . 275--300
           Arne T. Jonassen and   
                Donald E. Knuth   A trivial algorithm whose analysis isn't 301--322
                 Derek C. Oppen   A $ 2^{2^{2^{pn}}} $ upper bound on the
                                  complexity of Presburger Arithmetic  . . 323--332
               Francis Chin and   
                    David Houck   Algorithms for updating minimal spanning
                                  trees  . . . . . . . . . . . . . . . . . 333--344
               H. A. Maurer and   
                 A. Salomaa and   
                        D. Wood   ET0L forms . . . . . . . . . . . . . . . 345--361
            Calvin C. Elgot and   
           Stephen L. Bloom and   
                  Ralph Tindell   On the algebraic structure of rooted
                                  trees  . . . . . . . . . . . . . . . . . 362--399
                  P. F. Schuler   Inductive definability in formal
                                  language theory  . . . . . . . . . . . . 400--412
               David Dobkin and   
              Richard J. Lipton   A lower bound of $ 12 n^2 $ on linear
                                  search programs for the Knapsack problem 413--417
               J. Hartmanis and   
                      L. Berman   On polynomial time isomorphisms of some
                                  new complete sets  . . . . . . . . . . . 418--422
  Paul M. B. Vitányi and   
              Walter J. Savitch   On inverse deterministic pushdown
                                  transductions  . . . . . . . . . . . . . 423--444
                Andrew G. Barto   A note on pattern reproduction in
                                  tessellation structures  . . . . . . . . 445--455
                Detlef Wotschke   Nondeterminism and boolean operations in
                                  pda's  . . . . . . . . . . . . . . . . . 456--461
                      Anonymous   Author index for volume 16 . . . . . . . 462--462


Journal of Computer and System Sciences
Volume 17, Number 1, August, 1978

          Yasuyoshi Inagaki and   
             Toshiki Sakabe and   
                 Teruo Fukumura   Addressable approximations to
                                  nonaddressable data graphs . . . . . . . 1--34
             Anita K. Jones and   
              Richard J. Lipton   The enforcement of security policies for
                                  computation  . . . . . . . . . . . . . . 35--55
                 Seth Breidbart   On splitting recursive sets  . . . . . . 56--64
                     Masami Ito   A representation of strongly connected
                                  automata and its applications  . . . . . 65--80
                 Yaacov Choueka   Finite automata, definable sets, and
                                  regular expressions over $
                                  \omega^n$-tapes  . . . . . . . . . . . . 81--97
          Carlton J. Maxson and   
                 Kirby C. Smith   Endomorphisms of linear automata . . . . 98--107
              William F. McColl   The circuit depth of symmetric boolean
                                  functions  . . . . . . . . . . . . . . . 108--115
              Stephen J. Hegner   Duality theory for discrete-time linear
                                  systems  . . . . . . . . . . . . . . . . 116--143

Journal of Computer and System Sciences
Volume 17, Number 2, October, 1978

             Nicholas Pippenger   On rearrangeable and non-blocking
                                  switching networks . . . . . . . . . . . 145--162
                   K. Culik and   
                   Arto Salomaa   On the decidability of homomorphism
                                  equivalence for languages  . . . . . . . 163--175
                   Ulrich Golze   (A-)synchronous (non-)deterministic cell
                                  spaces simulating each other . . . . . . 176--193
                   Bernd Reusch   Realization of finite automata with
                                  linear parts . . . . . . . . . . . . . . 194--206
                Sudhir Aggarwal   A note on ``indecomposable parallel
                                  maps'' by S. Amoroso and I. J. Epstein   207--208
                     G. Plotkin   $ T^\omega $ as a Universal Domain . . . 209--236
                    Lutz Priese   A note on asynchronous cellular automata 237--252
                  Dan Moore and   
                      John Case   The complexity of total order structures 253--269
 Cláudio L. Lucchesi and   
               Sylvia L. Osborn   Candidate keys for relations . . . . . . 270--279

Journal of Computer and System Sciences
Volume 17, Number 3, December, 1978

                 K. N. King and   
                    C. Wrathall   Stack languages and $ \log n $ space . . 281--299
               Kojiro Kobayashi   The firing squad synchronization problem
                                  for a class of polyautomata networks . . 300--318
               T. S. E. Maibaum   Pumping lemmas for term languages  . . . 319--330
             A. Ehrenfeucht and   
                   G. Rozenberg   On the structure of derivations in
                                  deterministic ET0L systems . . . . . . . 331--347
                   Robin Milner   A theory of type polymorphism in
                                  programming  . . . . . . . . . . . . . . 348--375
                  Tadao Takaoka   A definition of measures over language
                                  space  . . . . . . . . . . . . . . . . . 376--387
            Bruno Courcelle and   
             Ir\`ene Guessarian   On some classes of interpretations . . . 388--413
               Moshe Rabinovitz   Closure properties and languages defined
                                  by bilinear automata . . . . . . . . . . 414--423
                      Anonymous   Author index for volume 17 . . . . . . . 424--424


Journal of Computer and System Sciences
Volume 18, Number 1, February, 1979

                  Jon T. Butler   Decomposable maps in general
                                  tessellation structures  . . . . . . . . 1--7
                      A. Nozaki   Equivalence problem of non-deterministic
                                  finite automata  . . . . . . . . . . . . 8--17
            Eitan M. Gurari and   
                Oscar H. Ibarra   Some decision problems concerning
                                  sequential transducers and checking
                                  automata . . . . . . . . . . . . . . . . 18--34
                     R. Valette   Analysis of petri nets by stepwise
                                  refinements  . . . . . . . . . . . . . . 35--46
              Akira Maruoka and   
                Masayuki Kimura   Injectivity and surjectivity of parallel
                                  maps for cellular automata . . . . . . . 47--64
            Yves Rouchaleau and   
              Eduardo D. Sontag   On the existence of minimal realizations
                                  of linear dynamical systems over
                                  Noetherian integral domains  . . . . . . 65--75
             S. L. Mitchell and   
             E. J. Cockayne and   
               S. T. Hedetniemi   Linear algorithms on recursive
                                  representations of trees . . . . . . . . 76--85
            David P. Dobkin and   
              Richard J. Lipton   On the complexity of computations under
                                  varying sets of primitives . . . . . . . 86--91
                    Matti Linna   Two decidability results for
                                  deterministic pushdown automata  . . . . 92--107

Journal of Computer and System Sciences
Volume 18, Number 2, April, 1979

          Raymond E. Miller and   
                 E. K. Blum and   
                     R. M. Karp   Editors' foreword  . . . . . . . . . . . 109--109
            Robert Endre Tarjan   A class of algorithms which require
                                  nonlinear time to maintain disjoint sets 110--127
                 Gary L. Miller   Graph isomorphism, general remarks . . . 128--142
         J. Lawrence Carter and   
                 Mark N. Wegman   Universal Classes of Hash Functions  . . 143--154
                 D. Angluin and   
                  L. G. Valiant   Fast probabilistic algorithms for
                                  Hamiltonian circuits and matchings . . . 155--193
         Michael J. Fischer and   
              Richard E. Ladner   Propositional dynamic logic of regular
                                  programs . . . . . . . . . . . . . . . . 194--211

Journal of Computer and System Sciences
Volume 18, Number 3, June, 1979

            Arthur G. Werschulz   Optimal order for approximation of
                                  derivatives  . . . . . . . . . . . . . . 213--217
             David A. Poplawski   On LL-regular grammars . . . . . . . . . 218--227
                 Susanna Ginali   Regular trees and the free iterative
                                  theory . . . . . . . . . . . . . . . . . 228--242
              Hiroakira Ono and   
                 Akira Nakamura   Undecidability of the first-order
                                  arithmetic $A [P(x), 2 x, x + 1]$  . . . 243--253
          Emily P. Friedman and   
             Sheila A. Greibach   Monadic recursion schemes: The effect of
                                  constants  . . . . . . . . . . . . . . . 254--266
           Gheorghe Páun   On the family of finite index matrix
                                  languages  . . . . . . . . . . . . . . . 267--280
              Elaine J. Weyuker   Modifications of the program scheme
                                  model  . . . . . . . . . . . . . . . . . 281--293
                     Dan Gordon   Complexity classes of provable recursive
                                  functions  . . . . . . . . . . . . . . . 294--303
         Paulo A. S. Veloso and   
                    Arthur Gill   Some remarks on multiple-entry finite
                                  automata . . . . . . . . . . . . . . . . 304--306
                 Michel Latteux   Cônes rationnels commutatifs  . . . . . . 307--333
                      Anonymous   Author index for volume 18 . . . . . . . 334--334


Journal of Computer and System Sciences
Volume 19, Number 1, August, 1979

                    C. Pair and   
               M. Amirchahy and   
                        D. Neel   Correctness proofs of syntax-directed
                                  processing descriptions by attributes    1--17
          Carlton J. Maxson and   
                 Kirby C. Smith   Automorphisms of linear automata . . . . 18--26
                  Mitchell Wand   Final algebra semantics and data type
                                  extensions . . . . . . . . . . . . . . . 27--44
             Meera Blattner and   
                       Tom Head   The decidability of equivalence for
                                  deterministic finite transducers . . . . 45--49
                David B. Benson   Parameter passing in nondeterministic
                                  recursive programs . . . . . . . . . . . 50--62
        Michael A. Harrison and   
                 Amiram Yehudai   A hierarchy of deterministic languages   63--78
             E. P. Friedman and   
                 S. A. Greibach   Superdeterministic DPDAs: The method of
                                  accepting does affect decision problems  79--117

Journal of Computer and System Sciences
Volume 19, Number 2, October, 1979

                     Tero Harju   A simulation result for the auxiliary
                                  pushdown automata  . . . . . . . . . . . 119--132
            Giorgio Germano and   
      Andrea Maggiolo-Schettini   Computable stack functions for semantics
                                  of stack programs  . . . . . . . . . . . 133--144
            Eitan M. Gurari and   
                Oscar H. Ibarra   Simple counter machines and
                                  number-theoretic problems  . . . . . . . 145--162
  Jirí Adámek and   
           Václav Koubek   Least fixed point of a functor . . . . . 163--178
               G. Rozenberg and   
                     D. Vermeir   On recursion in ETOL systems . . . . . . 179--196
                     W. J. Paul   On time hierarchies  . . . . . . . . . . 197--202
                       Tom Head   Codeterministic Lindenmayer schemes and
                                  systems  . . . . . . . . . . . . . . . . 203--210

Journal of Computer and System Sciences
Volume 19, Number 3, December, 1979

         Sharad V. Kanetkar and   
               Meghanad D. Wagh   Group character tables in discrete
                                  transform theory . . . . . . . . . . . . 211--221
                     H. B. Hunt   Observations on the complexity of
                                  regular expression problems  . . . . . . 222--236
             A. Ehrenfeucht and   
               G. Rozenberg and   
                     D. Vermeir   On ET0L Systems with rank  . . . . . . . 237--255
             Ronald V. Book and   
         Sheila A. Greibach and   
                 Celia Wrathall   Reset machines . . . . . . . . . . . . . 256--276
                G. Naudé   Universal realization  . . . . . . . . . 277--289
             Nissim Francez and   
             C. A. R. Hoare and   
          Daniel J. Lehmann and   
            Willem P. De Roever   Semantics of nondeterminism,
                                  concurrency, and communication . . . . . 290--308
                      A. Nozaki   Sorting using networks of deques . . . . 309--315
                      Anonymous   Author index for volume 19 . . . . . . . 316--316


Journal of Computer and System Sciences
Volume 20, Number 1, February, 1980

               Takumi Kasai and   
                    Akeo Adachi   A characterization of time complexity by
                                  simple loop programs . . . . . . . . . . 1--17
           William J. Masek and   
            Michael S. Paterson   A faster algorithm computing string edit
                                  distances  . . . . . . . . . . . . . . . 18--31
           J. A. Brzozowski and   
                  Faith E. Fich   Languages of R-trivial monoids . . . . . 32--49
               John Gallant and   
                David Maier and   
                  James Astorer   On finding minimal length superstrings   50--58
                  Satoru Miyano   One-way weak-stack-counter automata  . . 59--76
           Teofilo Gonzalez and   
                  Joseph Ja'Ja'   On the complexity of computing bilinear
                                  forms with 0, 1 constants  . . . . . . . 77--95
         Matthew C. B. Hennessy   A proof system for the first-order
                                  relational calculus  . . . . . . . . . . 96--110
                 Paul Dietz and   
                S. Rao Kosaraju   Recognition of topological equivalence
                                  of patterns by array automata  . . . . . 111--116

Journal of Computer and System Sciences
Volume 20, Number 2, April, 1980

             Richard Lipton and   
                 E. K. Blum and   
                      A. V. Aho   Editors' foreword  . . . . . . . . . . . 117--117
                   Martin Tompa   Time-space tradeoffs for computing
                                  functions, using connectivity properties
                                  of their circuits  . . . . . . . . . . . 118--132
          Andrea S. Lapaugh and   
               Ronald L. Rivest   The subgraph homeomorphism problem . . . 133--149
           Joost Engelfriet and   
         Grzegorz Rozenberg and   
                  Giora Slutzki   Tree transducers, $L$ systems, and
                                  two-way machines . . . . . . . . . . . . 150--202
          Raymond E. Miller and   
                    Chee K. Yap   On formulating simultaneity for studying
                                  parallelism and synchronization  . . . . 203--218
              John M. Lewis and   
             Mihalis Yannakakis   The node-deletion problem for hereditary
                                  properties is NP-complete  . . . . . . . 219--230
               Vaughan R. Pratt   A near-optimal method for reasoning
                                  about action . . . . . . . . . . . . . . 231--254
                  I. S. Filotti   An algorithm for imbedding cubic graphs
                                  in the torus . . . . . . . . . . . . . . 255--276

Journal of Computer and System Sciences
Volume 20, Number 3, June, 1980

                A. Ginzburg and   
                       M. Yoeli   Vector addition systems and regular
                                  languages  . . . . . . . . . . . . . . . 277--284
                Luc Boasson and   
                  Maurice Nivat   Adherences of languages  . . . . . . . . 285--309
                  Jan Paredaens   The interaction of integrity constraints
                                  in an information system . . . . . . . . 310--329
           Michael A. Arbib and   
                Ernest G. Manes   Foundations of system theory: The Hankel
                                  matrix . . . . . . . . . . . . . . . . . 330--378
                Karel Culik and   
                   Arto Salomaa   Test sets and checking words for
                                  homomorphism equivalence . . . . . . . . 379--395
               R. L. Rivest and   
                A. R. Meyer and   
             D. J. Kleitman and   
               K. Winklmann and   
                     J. Spencer   Coping with errors in binary search
                                  procedures . . . . . . . . . . . . . . . 396--404
                      Anonymous   Author index for volume 20 . . . . . . . 405--405


Journal of Computer and System Sciences
Volume 21, Number 1, August, 1980

              Daniel J. Lehmann   On the algebra of order  . . . . . . . . 1--23
            Lazaros P. Mavrides   A finite step-size procedure for the
                                  F--W method  . . . . . . . . . . . . . . 24--29
               Shigeko Seki and   
                Youichi Kobuchi   On DIL schemes simulated by D0L schemes  30--45
                   Dana Angluin   Finding patterns common to a set of
                                  strings  . . . . . . . . . . . . . . . . 46--62
               Satoru Fujishige   An efficient PQ-graph algorithm for
                                  solving the graph-realization problem    63--86
                       Tom Head   A-transducers and the monotonicity of IL
                                  schemes  . . . . . . . . . . . . . . . . 87--91
               Jeffrey M. Jaffe   The equivalence of R.E. program schemes
                                  and data flow schemes  . . . . . . . . . 92--109
               H. A. Maurer and   
                 A. Salomaa and   
                        D. Wood   Context-free grammar forms with strict
                                  interpretations  . . . . . . . . . . . . 110--135
                G. Ausiello and   
                  A. D'Atri and   
                     M. Protasi   Structure preserving reductions among
                                  convex optimization problems . . . . . . 136--153

Journal of Computer and System Sciences
Volume 21, Number 2, October, 1980

            Lawrence Snyder and   
                 E. K. Blum and   
             Nicholas Pippenger   Editor's foreword  . . . . . . . . . . . 155--155
           Ashok K. Chandra and   
                    David Harel   Computable queries for relational data
                                  bases  . . . . . . . . . . . . . . . . . 156--178
              Richard E. Ladner   The complexity of problems in systems of
                                  communicating sequential processes . . . 179--194
                 Michael Sipser   Lower bounds on the size of sweeping
                                  automata . . . . . . . . . . . . . . . . 195--202
                  Zvi Galil and   
                   Amnon Naamad   An $ O(E V \log^2 V) $ algorithm for the
                                  maximal flow problem . . . . . . . . . . 203--217
                Walter L. Ruzzo   Tree-size bounded alternation  . . . . . 218--235
               J. Ian Munro and   
                 Hendra Suwanda   Implicit data structures for fast search
                                  and update . . . . . . . . . . . . . . . 236--250

Journal of Computer and System Sciences
Volume 21, Number 3, December, 1980

                 Nancy A. Lynch   Straight-line program length as a
                                  parameter for complexity analysis  . . . 251--280
                G. Naudé   A duality theory for decomposable
                                  systems in a category  . . . . . . . . . 281--291
        Franz-Josef Brandenburg   Multiple equality sets and post machines 292--316
                 Harry R. Lewis   Complexity results for classes of
                                  quantificational formulas  . . . . . . . 317--353
               Gaston H. Gonnet   Open-Addressing Hashing with
                                  Unequal-Probability Keys . . . . . . . . 354--367
                David Maier and   
       Alberto O. Mendelzon and   
            Fereidoon Sadri and   
                Jeffrey Dullman   Adequacy of decompositions of relational
                                  databases  . . . . . . . . . . . . . . . 368--379
                      Anonymous   Author index for volume 21 . . . . . . . 380--380


Journal of Computer and System Sciences
Volume 22, Number 1, February, 1981

                   Shlomo Moran   Some results on relativized
                                  deterministic and nondeterministic time
                                  hierarchies  . . . . . . . . . . . . . . 1--8
              Tsuyoshi Nakamura   Regularity and firing sequences of
                                  computation graphs . . . . . . . . . . . 9--28
             Stephen J. Willson   Growth patterns of ordered cellular
                                  automata . . . . . . . . . . . . . . . . 29--41
                 Keijo Ruohonen   The decidability of the DOL-DTOL
                                  equivalence problem  . . . . . . . . . . 42--52
                  Paul Chew and   
                Michael Machtey   A note on structure and looking back
                                  applied to the relative complexity of
                                  computable functions . . . . . . . . . . 53--59
             Tatsuo Ohtsuki and   
                Hajimu Mori and   
      Toshinobu Kashiwabara and   
                Toshio Fujisawa   On minimal augmentation of a graph to
                                  obtain an interval graph . . . . . . . . 60--97
                Robert Melville   An improved simulation result for
                                  ink-bounded Turing machines  . . . . . . 98--105

Journal of Computer and System Sciences
Volume 22, Number 2, April, 1981

            Gregory A. Riccardi   The independence of control structures
                                  in abstract programming systems  . . . . 107--143
                D. Janssens and   
                   G. Rozenberg   Decision problems for node label
                                  controlled graph grammars  . . . . . . . 144--177
               David A. Workman   SR($s$, $k$) parsers: a class of
                                  shift-reduce bounded-context parsers . . 178--197
                 M. P. Georgeff   Interdependent translation schemes . . . 198--219
            Eitan M. Gurari and   
                Oscar H. Ibarra   The complexity of decision problems for
                                  finite-turn multicounter machines  . . . 220--229
                 John E. Savage   Area-time tradeoffs for matrix
                                  multiplication and related problems in
                                  VLSI models  . . . . . . . . . . . . . . 230--242
              Theodore P. Baker   Extending lookahead for LR parsers . . . 243--259

Journal of Computer and System Sciences
Volume 22, Number 3, June, 1981

            S. Rao Kosaraju and   
                Albert R. Meyer   Editor's foreword  . . . . . . . . . . . 261--261
                Albert R. Meyer   Dedicated to our colleague and friend
                                  Michael Machtey  . . . . . . . . . . . . 262--264
             Mark N. Wegman and   
             J. Lawrence Carter   New Hash Functions and Their Use in
                                  Authentication and Set Equality  . . . . 265--279
                Gilles Brassard   A time-luck tradeoff in relativized
                                  cryptography . . . . . . . . . . . . . . 280--311
                    W. Paul and   
                    R. Reischuk   On time versus space II  . . . . . . . . 312--327
                   Dexter Kozen   Semantics of probabilistic programs  . . 328--350
              Allan Borodin and   
         Michael J. Fischer and   
       David G. Kirkpatrick and   
             Nancy A. Lynch and   
                   Martin Tompa   A time-space tradeoff for sorting on
                                  non-oblivious machines . . . . . . . . . 351--364
                Walter L. Ruzzo   On uniform circuit complexity  . . . . . 365--383
                  Neil Immerman   Number of quantifiers is better than
                                  number of tape cells . . . . . . . . . . 384--406
                Ofer Gabber and   
                      Zvi Galil   Explicit constructions of linear-sized
                                  superconcentrators . . . . . . . . . . . 407--420
                    Janos Simon   Division in idealized unit cost RAMs . . 421--441
            Michael Machtey and   
                     Paul Young   Remarks on Recursion versus
                                  Diagonalization and Exponentially
                                  Difficult Problems . . . . . . . . . . . 442--453
             Nicholas Pippenger   Computational Complexity of Algebraic
                                  Functions  . . . . . . . . . . . . . . . 454--470
                      Anonymous   Author index for volume 22 . . . . . . . 471--471


Journal of Computer and System Sciences
Volume 23, Number 1, August, 1981

               H. A. Maurer and   
                 A. Salomaa and   
                        D. Wood   Completeness of context-free grammar
                                  forms  . . . . . . . . . . . . . . . . . 1--10
             Gérard Huet   A complete proof of correctness of the
                                  Knuth--Bendix completion algorithm . . . 11--21
             Katsuhiko Nakamura   Synchronous to asynchronous
                                  transformation of polyautomata . . . . . 22--37
            Arthur G. Werschulz   On maximal order for local and global
                                  numerical problems . . . . . . . . . . . 38--48
                  R. J. R. Back   On correct refinement of programs  . . . 49--68
                Jean H. Gallier   Recursion-closed algebraic theories  . . 69--105
                   Martin Tompa   Corrigendum  . . . . . . . . . . . . . . 106--106

Journal of Computer and System Sciences
Volume 23, Number 2, October, 1981

          Walter J. Savitch and   
                B. S. Baker and   
                   R. E. Miller   Editor's foreword  . . . . . . . . . . . 107--107
           Wolfgang J. Paul and   
           Joel I. Seiferas and   
                    Janos Simon   An information-theoretic approach to
                                  time bounds for on-line computation  . . 108--126
                   Martin Tompa   An optimal solution to a wire-routing
                                  problem  . . . . . . . . . . . . . . . . 127--150
             Nicholas Pippenger   Pebbling with an auxiliary pushdown  . . 151--165
           Mark H. Overmars and   
                Jan van Leeuwen   Maintenance of configurations in the
                                  plane  . . . . . . . . . . . . . . . . . 166--204
             Deborah Joseph and   
                     Paul Young   Independence results in computer
                                  science? . . . . . . . . . . . . . . . . 205--222
              Hartmut Ehrig and   
                     Bernd Mahr   Complexity of algebraic implementations
                                  for abstract data types  . . . . . . . . 223--253
                 Nancy A. Lynch   Upper bounds for static resource
                                  allocation in a distributed system . . . 254--278
            Albert R. Meyer and   
                   Rohit Parikh   Definability in dynamic logic  . . . . . 279--298

Journal of Computer and System Sciences
Volume 23, Number 3, December, 1981

          Rüdiger Valk and   
               Guy Vidal-Naquet   Petri nets and regular languages . . . . 299--325
                 Alan L. Selman   Some observations on NP real numbers and
                                  P-selective sets . . . . . . . . . . . . 326--332
                Lawrence Snyder   Theft and conspiracy in the take-grant
                                  protection model . . . . . . . . . . . . 333--347
                    Ernst Leiss   The complexity of restricted regular
                                  expressions and the synthesis problem
                                  for finite automata  . . . . . . . . . . 348--354
         Michael L. Fredman and   
               Dennis J. Volper   Query time versus redundancy trade-offs
                                  for range queries  . . . . . . . . . . . 355--365
          Michio Oyamaguchi and   
          Yasuyoshi Inagaki and   
                    Namio Honda   The equivalence problem for two dpda's,
                                  one of which is a finite-turn or
                                  one-counter machine  . . . . . . . . . . 366--382
              Luigia Aiello and   
               Gianfranco Print   An efficient interpreter for the
                                  lambda-calculus  . . . . . . . . . . . . 383--424
                      Anonymous   Author index for volume 23 . . . . . . . 425--425


Journal of Computer and System Sciences
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 and   
                   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
                Jiri Adamek and   
              Evelyn Nelson and   
                  Jan Reiterman   Tree constructions of free continuous
                                  algebras . . . . . . . . . . . . . . . . 114--146
                      Anonymous   Announcement . . . . . . . . . . . . . . 147--147

Journal of Computer and System Sciences
Volume 24, Number 2, April, 1982

                  Anton Nijholt   The equivalence problem for LL- and
                                  LR-regular grammars  . . . . . . . . . . 149--161
                  Michael Rodeh   Finding the median distributively  . . . 162--166
                  J. Albert and   
                       K. Culik   Tree correspondence problems . . . . . . 167--179
              Jerry Goldman and   
                   Steven Homer   Quadratic automata . . . . . . . . . . . 180--196
       Greg N. Frederickson and   
              Donald B. Johnson   The complexity of selection and ranking
                                  in $X + Y$ and matrices with sorted
                                  columns  . . . . . . . . . . . . . . . . 197--208
                  Joseph Ja'Ja'   The computational complexity of a set of
                                  quadratic functions  . . . . . . . . . . 209--223
                Timothy J. Long   A note on sparse oracles for NP  . . . . 224--232
                  K. Hashiguchi   Limitedness theorem on finite automata
                                  with distance functions  . . . . . . . . 233--244

Journal of Computer and System Sciences
Volume 24, Number 3, June, 1982

  Andrea Maggiolo-Schettini and   
                Jozef Winkowski   Processes of transforming structures . . 245--282
           Joost Engelfriet and   
           Gilberto Filé   Simple multi-visit attribute grammars    283--314
           Seymour Ginsburg and   
         Jonathan Goldstine and   
               Edwin H. Spanier   A prime decomposition theorem for
                                  grammatical families . . . . . . . . . . 315--361
             Hajime Machida and   
                   Takumi Kasai   Space complexity in on-line computation  362--372
            M. B. Thuraisingham   Representation of one-one degrees by
                                  decision problems for system functions   373--377
             Deborah Joseph and   
                     Paul Young   Corrigendum  . . . . . . . . . . . . . . 378--378
                      Anonymous   Author index for volume 24 . . . . . . . 379--379


Journal of Computer and System Sciences
Volume 25, Number 1, August, 1982

                 Alan L. Selman   Editor's foreword  . . . . . . . . . . . 1--1
         Mihalis Yannakakis and   
      Christos H. Papadimitriou   Algebraic dependencies . . . . . . . . . 2--41
                 Eugene M. Luks   Isomorphism of graphs of bounded valence
                                  can be tested in polynomial time . . . . 42--65
               Michael O. Rabin   $N$-Process mutual exclusion with
                                  bounded waiting by $ 4 \cdot \Log_2
                                  N$-valued shared variable  . . . . . . . 66--75
                  Neil Immerman   Upper and lower bounds for first order
                                  expressibility . . . . . . . . . . . . . 76--98
              Ashok Chandra and   
                    David Harel   Structure and complexity of relational
                                  queries  . . . . . . . . . . . . . . . . 99--128

Journal of Computer and System Sciences
Volume 25, Number 2, October, 1982

                 Alan L. Selman   Editor's foreword  . . . . . . . . . . . 129--129
             Stephen R. Mahaney   Sparse complete sets for NP: Solution of
                                  a conjecture of Berman and Hartmanis . . 130--143
                David Harel and   
               Dexter Kozen and   
                   Rohit Parikh   Process logic: Expressiveness,
                                  decidability, completeness . . . . . . . 144--170
          Philippe Flajolet and   
                 Andrew Odlyzko   The average height of binary trees and
                                  other simple trees . . . . . . . . . . . 171--213
          Jon Louis Bentley and   
                 Donna J. Brown   A general class of resource tradeoffs    214--238
                Gerard Huet and   
              Jean-Marie Hullot   Proofs by induction in equational
                                  theories with constructors . . . . . . . 239--266

Journal of Computer and System Sciences
Volume 25, Number 3, December, 1982

             J. A. Bergstra and   
                   J. V. Tucker   Expressiveness and the completeness of
                                  Hoare's logic  . . . . . . . . . . . . . 267--284
               Takumi Kasai and   
              Raymond E. Miller   Homomorphisms between models of parallel
                                  computation  . . . . . . . . . . . . . . 285--331
          Christoph M. Hoffmann   Subcomplete generalizations of graph
                                  isomorphism  . . . . . . . . . . . . . . 332--359
                Wolfgang Thomas   Classifying regular events in symbolic
                                  logic  . . . . . . . . . . . . . . . . . 360--376
                       W. Kuich   An algebraic characterization of some
                                  principal regulated rational cones . . . 377--401
          Mordechai Ben-Ari and   
          Joseph Y. Halpern and   
                    Amir Pnueli   Deterministic propositional dynamic
                                  logic: Finite models, complexity, and
                                  completeness . . . . . . . . . . . . . . 402--417
           Joost Engelfriet and   
                     Sven Skyum   The copying power of one-state tree
                                  transducers  . . . . . . . . . . . . . . 418--435
                      Anonymous   Author index for volume 25 . . . . . . . 436--436


Journal of Computer and System Sciences
Volume 26, Number 1, February, 1983

                  Douglas Comer   Effects of Updates on Optimality in
                                  Tries  . . . . . . . . . . . . . . . . . 1--13
                 Michel Latteux   Langages \`a un Compteur. (French)
                                  [One-Counter Languages]  . . . . . . . . 14--33
             A. Ehrenfeucht and   
              J. Engelfriet and   
                   G. Rozenberg   Context Free Normal Systems and ETOL
                                  Systems  . . . . . . . . . . . . . . . . 34--46
            Oscar H. Ibarra and   
             Brian S. Leininger   On the Zero-inequivalence Problem far
                                  Loop Programs  . . . . . . . . . . . . . 47--64
           David A. Carlson and   
                 John E. Savage   Size-Space Tradeoffs for Oblivious
                                  Computations . . . . . . . . . . . . . . 65--81
         Jürgen Albert and   
                    Derick Wood   Checking Sets, Test Sets, Rich Languages
                                  and Commutatively Closed Languages . . . 82--91
              Dave Riffelmacher   Multiplicative Complexity and Algebraic
                                  Structure  . . . . . . . . . . . . . . . 92--106
         Toshimasa Watanabe and   
                 Akira Nakamura   On the Transformation Semigroups of
                                  Finite Automata  . . . . . . . . . . . . 107--138
           John J. Grefenstette   Network Structure and the Firing Squad
                                  Synchronization problem  . . . . . . . . 139--152

Journal of Computer and System Sciences
Volume 26, Number 2, April, 1983

                   Esko Ukkonen   Lower bounds on the size of
                                  deterministic parsers  . . . . . . . . . 153--170
           Seymour Ginsburg and   
         Jonathan Goldstine and   
               Edwin H. Spanier   On the equality of grammatical families  171--196
                Takao Asano and   
                   Tomio Hirata   Edge-contraction problems  . . . . . . . 197--208
                       Ker-I Ko   On self-reducibility and weak
                                  P-selectivity  . . . . . . . . . . . . . 209--221
                David Harel and   
                Amir Pnueli and   
                 Jonathan Stavi   Propositional dynamic logic of
                                  nonregular programs  . . . . . . . . . . 222--243
                Seppo Sippu and   
        Eljas Soisalon-Soininen   On the complexity of LL(k) testing . . . 244--268
               Maurice Tchuente   Computation of Boolean functions on
                                  networks of binary automata  . . . . . . 269--277

Journal of Computer and System Sciences
Volume 26, Number 3, June, 1983

            Richard Demillo and   
              Ronald Rivest and   
                     E. K. Blum   Editors' foreword  . . . . . . . . . . . 279--279
                  Zvi Galil and   
                  Joel Seiferas   Time-space-optimal string matching . . . 280--294
            David E. Muller and   
                 Paul E. Schupp   Groups, the theory of ends, and
                                  context-free languages . . . . . . . . . 295--310
                 Deborah Joseph   Polynomial time computations in models
                                  of ET  . . . . . . . . . . . . . . . . . 311--338
            Daniel Kleitman and   
     Frank Thomson Leighton and   
            Margaret Lepley and   
                 Gary L. Miller   An asymptotically optimal layout for the
                                  shuffle-exchange graph . . . . . . . . . 339--361
          Daniel D. Sleator and   
            Robert Endre Tarjan   A data structure for dynamic trees . . . 362--391
                  Faith E. Fich   Lower bounds for the cycle detection
                                  problem  . . . . . . . . . . . . . . . . 392--409
         K. N. Venkataraman and   
               Ann Yasuhara and   
              Frank M. Hawrusik   A view of computability on term algebras 410--471
                      Anonymous   Author index for volume 26 . . . . . . . 472--472


Journal of Computer and System Sciences
Volume 27, Number 1, August, 1983

            Stephan Heilbrunner   Tests for the LR-, LL-, and LC-regular
                                  conditions . . . . . . . . . . . . . . . 1--13
              Uwe Schöning   A low and a high hierarchy within NP . . 14--28
          Martha Steenstrup and   
           Michael A. Arbib and   
                Ernest G. Manes   Port automata and the algebra of
                                  concurrent processes . . . . . . . . . . 29--50
              Ichiro Suzuki and   
                   Tadao Murata   A method for stepwise refinement and
                                  abstraction of Petri nets  . . . . . . . 51--76
                James A. Storer   On the complexity of chess . . . . . . . 77--100
                  K. Hashiguchi   Representation theorems on regular
                                  languages  . . . . . . . . . . . . . . . 101--115
                  Satoru Miyano   Remarks on multihead pushdown automata
                                  and multihead stack automata . . . . . . 116--124
         Masanobu Itô and   
       Nobuyasu Ôsato and   
                  Masakazu Nasu   Linear cellular automata over $ \mathbb
                                  {Z}_m $  . . . . . . . . . . . . . . . . 125--140

Journal of Computer and System Sciences
Volume 27, Number 2, October, 1983

              J. C. Shepherdson   Calvin C. Elgot 1922--1980 . . . . . . . 141--144
                   R. E. Miller   Reminiscences 1  . . . . . . . . . . . . 145--145
                     E. K. Blum   Reminiscences 2  . . . . . . . . . . . . 146--147
           Stephen L. Bloom and   
          James W. Thatcher and   
             Eric G. Wagner and   
                Jesse B. Wright   Recursion and iteration in continuous
                                  theories: The ``$M$-construction'' . . . 148--164
                Hartmut Schmeck   Algebraic characterization of reducible
                                  flowcharts . . . . . . . . . . . . . . . 165--199
      Francesco Parisi-Presicce   Extensions of iterative congruences on
                                  free iterative algebras  . . . . . . . . 200--220
             Douglas R. Troeger   An axiomatization of D-scheme strong
                                  equivalence  . . . . . . . . . . . . . . 221--224
               Stephen L. Bloom   All solutions of a system of recursion
                                  equations in infinite trees and other
                                  contraction theories . . . . . . . . . . 225--255
               Michael O. Rabin   Transaction protection by beacons  . . . 256--267
               J. A. Goguen and   
                    J. Meseguer   Correctness of recursive parallel
                                  nondeterministic flow programs . . . . . 268--290
                 Z. Ésik   Algebras of iteration theories . . . . . 291--303
             Edward K. Blum and   
      Francesco Parisi-Presicce   Implementation of data types by
                                  algebraic methods  . . . . . . . . . . . 304--330

Journal of Computer and System Sciences
Volume 27, Number 3, December, 1983

                   Richard Hull   Acyclic join dependency and data base
                                  projections  . . . . . . . . . . . . . . 331--349
             Nancy A. Lynch and   
             Michael J. Fischer   A technique for decomposing algorithms
                                  which use a single shared variable . . . 350--377
         Bernard R. Hodgson and   
                Clement F. Kent   A normal form for arithmetical
                                  representation of NP-sets  . . . . . . . 378--388
           Egidio Astesiano and   
                  Gerardo Costa   The insensitivity theorem for
                                  nonreducing reflexive types  . . . . . . 389--399
         Richard J. Lorentz and   
                David B. Benson   Deterministic and nondeterministic
                                  flowchart interpretations  . . . . . . . 400--433
                 Ludwig Staiger   Finite-state $ \omega $-languages  . . . 434--448
                      Anonymous   Author index for volume 27 . . . . . . . 449--449


Journal of Computer and System Sciences
Volume 28, Number 1, February, 1984

              Alfred V. Aho and   
                     E. K. Blum   Editors' foreword  . . . . . . . . . . . 1--1
            Anthony C. Klug and   
                  Alfred V. Aho   Obituary . . . . . . . . . . . . . . . . 2--2
                 Moshe Y. Vardi   The implication and finite implication
                                  problems for typed template dependencies 3--28
          Marco A. Casanova and   
               Ronald Fagin and   
      Christos H. Papadimitriou   Inclusion dependencies and their
                                  interaction with functional dependencies 29--59
             Nathan Goodman and   
                   Oded Shmueli   The tree projection theorem and
                                  relational query processing  . . . . . . 60--79
        Tomasz Imieli\'nski and   
                  Witold Lipski   The relational model of data and
                                  cylindric algebras . . . . . . . . . . . 80--102
        Paris C. Kanellakis and   
      Christos H. Papadimitriou   Is distributed locking harder? . . . . . 103--120
             Marc H. Graham and   
             Mihalis Yannakakis   Independent database schemas . . . . . . 121--141
                  Carlo Zaniolo   Database relations with null values  . . 142--166
              D. S. Johnson and   
                        A. Klug   Testing containment of conjunctive
                                  queries under functional and inclusion
                                  dependencies . . . . . . . . . . . . . . 167--189

Journal of Computer and System Sciences
Volume 28, Number 2, April, 1984

              Harry R. A. Lewis   Editor's foreword  . . . . . . . . . . . 191--191
          Yishai A. Feldman and   
                    David Harel   A probabilistic dynamic logic  . . . . . 193--215
            Walter L. Ruzzo and   
                Janos Simon and   
                   Martin Tompa   Space-bounded hierarchies and
                                  probabilistic computations . . . . . . . 216--230
              Martin Fürer   Data structures for distributed counting 231--243
        C. H. Papadimitriou and   
                  M. Yannakakis   The complexity of facets (and some
                                  facets of complexity)  . . . . . . . . . 244--259
  Christos H. Papadimitriou and   
                 Michael Sipser   Communication complexity . . . . . . . . 260--269
           Shafi Goldwasser and   
                  Silvio Micali   Probabilistic Encryption . . . . . . . . 270--299
           Sandeep N. Bhatt and   
         Frank Thomson Leighton   A framework for solving VLSI graph
                                  layout problems  . . . . . . . . . . . . 300--343

Journal of Computer and System Sciences
Volume 28, Number 3, June, 1984

         Manfred K. Warmuth and   
                 David Haussler   On the complexity of iterated shuffle    345--358
                 Michael C. Low   Minimizing access pointers into trees
                                  and arrays . . . . . . . . . . . . . . . 359--378
                 Dan E. Willard   New trie data structures which support
                                  very fast search operations  . . . . . . 379--394
                 H. B. Hunt and   
              D. J. Rosenkrantz   The complexity of monadic recursion
                                  schemes: exponential time bounds . . . . 395--419
             Errol L. Lloyd and   
                     S. S. Ravi   One-layer routing without component
                                  constraints  . . . . . . . . . . . . . . 420--438
                   Robin Milner   A complete inference system for a class
                                  of regular behaviours  . . . . . . . . . 439--466
                      Anonymous   Author index for volume 28 . . . . . . . 467--467


Journal of Computer and System Sciences
Volume 29, Number 1, August, 1984

                    Luc Devroye   Exponential bounds for the running time
                                  of a selection algorithm . . . . . . . . 1--7
              David A. Plaisted   Complete problems in the first-order
                                  predicate calculus . . . . . . . . . . . 8--35
               Kokichi Sugihara   An $ n \log n $ algorithm for
                                  determining the congruity of polyhedra   36--47
                   Jan K. Pachl   Finding pseudoperipheral nodes in graphs 48--53
                 M. Latteux and   
                   G. Rozenberg   Commutative One-counter languages are
                                  regular  . . . . . . . . . . . . . . . . 54--57
                Tsong Yueh Chen   On the fixpoints of nondeterministic
                                  recursive definitions  . . . . . . . . . 58--79
                 F. Kröger   A generalized nexttime operator in
                                  temporal logic . . . . . . . . . . . . . 80--98
             Douglas R. Troeger   Weak equivalence in a class of
                                  structured program schemes . . . . . . . 99--117
          Walter J. Savitch and   
              Patrick W. Dymond   Consistency in nondeterministic storage  118--132

Journal of Computer and System Sciences
Volume 29, Number 2, October, 1984

                  W. J. Hsu and   
                       M. W. Du   New algorithms for the LCS problem . . . 133--152
            Antonio Restivo and   
          Christophe Reutenauer   On cancellation properties of languages
                                  which are supports of rational power
                                  series . . . . . . . . . . . . . . . . . 153--159
            Albert R. Meyer and   
                   Jerzy Tiuryn   Equivalences among logics of programs    160--170
            Hiromi Miyajima and   
             Masateru Harao and   
                Shoichi Noguchi   Indecomposable maps in tessellation
                                  structures of arbitrary dimension  . . . 171--182
                   Yaacov Yesha   Time-space tradeoffs for matrix
                                  multiplication and the Discrete Fourier
                                  Transform on any general sequential
                                  random-access computer . . . . . . . . . 183--197
                 Sara Porat and   
                  Michael Yoeli   Towards a hierarchy of nets  . . . . . . 198--206
               Shojiro Muro and   
                Tiko Kameda and   
                Toshimi Minoura   Multi-version concurrency control scheme
                                  for a database system  . . . . . . . . . 207--224
              Simeon Ntafos and   
               Teofilo Gonzalez   On the computational complexity of path
                                  cover problems . . . . . . . . . . . . . 225--242
                 John E. Savage   The performance of multilective VLSI
                                  algorithms . . . . . . . . . . . . . . . 243--273
                   John H. Reif   The complexity of two-player games of
                                  incomplete information . . . . . . . . . 274--301

Journal of Computer and System Sciences
Volume 29, Number 3, December, 1984

      Paul M. B. Vitányi   On two-tape real-time computation and
                                  queues . . . . . . . . . . . . . . . . . 303--311
                 Tatsuya Motoki   An application of Cohen's result on star
                                  height to the theory of control
                                  structures . . . . . . . . . . . . . . . 312--329
            Mikhail Atallah and   
                    Uzi Vishkin   Finding Euler tours in parallel  . . . . 330--337
             Nathan Goodman and   
               Oded Shmueli and   
                      Y. C. Tay   GYO reductions, canonical connections,
                                  tree and cyclic schemas, and tree
                                  projections  . . . . . . . . . . . . . . 338--358
                   D. Harel and   
                 M. S. Paterson   Undecidability of PDL with $ L = \{ a^{2
                                  i} |; i \geq 0 \} $  . . . . . . . . . . 359--365
           Joost Engelfriet and   
                  Giora Slutzki   Extended macro grammars and stack
                                  controlled machines  . . . . . . . . . . 366--408
              Clement T. Yu and   
         Z. Meral Ozsoyoglu and   
                         K. Lam   Optimization of distributed tree queries 409--445
                      Anonymous   Author index for volume 29 . . . . . . . 446--446


Journal of Computer and System Sciences
Volume 30, Number 1, February, 1985

           E. Allen Emerson and   
              Joseph Y. Halpern   Decision procedures and expressiveness
                                  in the temporal logic of branching time  1--24
            Karl M. Schimpf and   
                Jean H. Gallier   Tree pushdown automata . . . . . . . . . 25--40
                  John Reif and   
                   A. P. Sistla   A multiprocess network logic with
                                  temporal and spatial modalities  . . . . 41--53
            Norishige Chiba and   
            Takao Nishizeki and   
              Shigenobu Abe and   
                    Takao Ozawa   A linear algorithm for embedding planar
                                  graphs using PQ-trees  . . . . . . . . . 54--76
                  Marek Chrobak   Variations on the technique of Duris and
                                  Galil  . . . . . . . . . . . . . . . . . 77--85
               Joost Engelfriet   Hierarchies of hyper-AFLs  . . . . . . . 86--115
          Richard E. Ladner and   
              Jeffrey K. Norman   Solitaire automata . . . . . . . . . . . 116--129
                 A. Borodin and   
                 J. E. Hopcroft   Routing, merging, and sorting on
                                  parallel models of computation . . . . . 130--145
                      Anonymous   Announcement . . . . . . . . . . . . . . 146--146

Journal of Computer and System Sciences
Volume 30, Number 2, April, 1985

            Walter L. Ruzzo and   
                 Edward K. Blum   Editors' foreword  . . . . . . . . . . . 147--147
          Patrick W. Dymond and   
                   Martin Tompa   Speedups of deterministic machines by
                                  synchronous parallel machines  . . . . . 149--161
                   Dexter Kozen   A probabilistic PDL  . . . . . . . . . . 162--178
               Susan Landau and   
                Gary Lee Miller   Solvability by radicals is in polynomial
                                  time . . . . . . . . . . . . . . . . . . 179--208
            Harold N. Gabow and   
            Robert Endre Tarjan   A linear-time algorithm for a special
                                  case of disjoint set union . . . . . . . 209--221
           Ashok K. Chandra and   
             Steven Fortune and   
                 Richard Lipton   Unbounded fan-in circuits and
                                  associative functions  . . . . . . . . . 222--234
               Arjen K. Lenstra   Factoring multivariate polynomials over
                                  finite fields  . . . . . . . . . . . . . 235--248

Journal of Computer and System Sciences
Volume 30, Number 3, June, 1985

            J. Gonczarowski and   
                      E. Shamir   Pattern selector grammars and several
                                  parsing algorithms in the context-free
                                  style  . . . . . . . . . . . . . . . . . 249--273
              Antonio Bahamondf   Cost functors and optimal realization    274--290
               Hirotomo Aso and   
                    Namio Honda   Dynamical characteristics of linear
                                  cellular automata  . . . . . . . . . . . 291--317
            Michael G. Main and   
                David B. Benson   Free semiring-representations and
                                  nondeterminism . . . . . . . . . . . . . 318--328
            Ferng-Ching Lin and   
                      I-Chen Wu   Area-period tradeoffs for multiplication
                                  of rectangular matrices  . . . . . . . . 329--342
          Paliath Narendran and   
Colm Ó'Dúnlaing and   
           Heinrich Rolletschek   Complexity of certain decision problems
                                  about congruential languages . . . . . . 343--358
              William M. Kantor   Sylow's theorem in polynomial time . . . 359--394
             Ronald V. Book and   
            Timothy J. Long and   
                 Alan L. Selman   Qualitative relativizations of
                                  complexity classes . . . . . . . . . . . 395--413
                      Anonymous   Author index for volume 30 . . . . . . . 414--414


Journal of Computer and System Sciences
Volume 31, Number 1, August, 1985

                    Rami Melhem   Formal analysis of a systolic system for
                                  finite element stiffness matrices  . . . 1--27
                Juraj Hromkovic   On the power of alternation in automata
                                  theory . . . . . . . . . . . . . . . . . 28--39
          Martin E. Kaliski and   
               Quentin L. Klein   Behavior of a class of nonlinear
                                  discrete-time systems  . . . . . . . . . 40--62
             Mikhail J. Atallah   A matching problem in the plane  . . . . 63--70
           Joost Engelfriet and   
                   Heiko Vogler   Macro tree transducers . . . . . . . . . 71--146

Journal of Computer and System Sciences
Volume 31, Number 2, October, 1985

                Lawrence Snyder   Editor's foreword  . . . . . . . . . . . 147--147
               Harold N. Garbow   Scaling algorithms for network problems  148--168
          Christopher B. Wilson   Relativized circuit complexity . . . . . 169--181
          Philippe Flajolet and   
                G. Nigel Martin   Probabilistic Counting Algorithms for
                                  Data Base Applications . . . . . . . . . 182--209
              Janet Incerpi and   
               Robert Sedgewick   Improved upper bounds on shellsort . . . 210--224
         Joachim von zur Gathen   Irreducibility of multivariate
                                  polynomials  . . . . . . . . . . . . . . 225--264
     Joachim von zur Gathen and   
                 Erich Kaltofen   Factoring sparse multivariate
                                  polynomials  . . . . . . . . . . . . . . 265--287
      Christos H. Papadimitriou   Games against nature . . . . . . . . . . 288--301

Journal of Computer and System Sciences
Volume 31, Number 3, December, 1985

                 G. Senizergues   The equivalence and inclusion problems
                                  for NTS languages  . . . . . . . . . . . 303--331
                 L. Boasson and   
                 G. Senizergues   NTS languages are deterministic and
                                  congruential . . . . . . . . . . . . . . 332--342
         Patrick C. Fischer and   
         Lawrence V. Saxton and   
             Stan J. Thomas and   
                 Dirk Van Gucht   Interactions between dependencies and
                                  nested relational structures . . . . . . 343--354
        Philip A. Bernstein and   
                 Nathan Goodman   Serializability theory for replicated
                                  databases  . . . . . . . . . . . . . . . 355--374
           Stephen L. Bloom and   
             Zoltán Esik   Axiomatizing schemes and their behaviors 375--393
              A. Apostolico and   
                F. P. Preparata   Structural properties of the string
                                  statistics problem . . . . . . . . . . . 394--411
                      Anonymous   Author index for volume 31 . . . . . . . 412--412


Journal of Computer and System Sciences
Volume 32, Number 1, February, 1986

             Shuo-Yen Robert Li   Binary trees and uniform distribution of
                                  traffic cutback  . . . . . . . . . . . . 1--14
              Peter Gács   Reliable computation with cellular
                                  automata . . . . . . . . . . . . . . . . 15--78
            Dennis de Champeaux   About the Paterson--Wegman linear
                                  unification algorithm  . . . . . . . . . 79--90
                   Ingo Wegener   Time-space trade-offs for branching
                                  programs . . . . . . . . . . . . . . . . 91--96
                 Pawel Urzyczyn   ``During'cannot be expressed by
                                  ``after''  . . . . . . . . . . . . . . . 97--104
            Louis E. Rosier and   
                   Hsu-Chun Yen   A multiparameter analysis of the
                                  boundedness problem for vector addition
                                  systems  . . . . . . . . . . . . . . . . 105--135
              V. Kantabutra and   
                 S. R. Kosaraju   New algorithms for multilink robot arms  136--153

Journal of Computer and System Sciences
Volume 32, Number 2, April, 1986

         Richard A. DeMillo and   
                 Edward K. Blum   Editors' foreword  . . . . . . . . . . . 155--155
               Bernard Chazelle   Reporting and counting segment
                                  intersections  . . . . . . . . . . . . . 156--182
             Moshe Y. Vardi and   
                  Pierre Wolper   Automata-theoretic techniques for modal
                                  logics of programs . . . . . . . . . . . 183--221
                Ravi B. Boppana   Threshold functions and bounded depth
                                  monotone circuits  . . . . . . . . . . . 222--229
                Danny Dolev and   
          Joseph Y. Halpern and   
              H. Raymond Strong   On the possibility and impossibility of
                                  achieving clock synchronization  . . . . 230--250
             Michael Ben-Or and   
               Dexter Kozen and   
                      John Reif   The complexity of elementary algebra and
                                  geometry . . . . . . . . . . . . . . . . 251--264

Journal of Computer and System Sciences
Volume 32, Number 3, June, 1986

                 Gary L. Miller   Finding small simple cycle separators
                                  for $2$-connected planar graphs  . . . . 265--279
               John H. Reif and   
                 Harry R. Lewis   Efficient symbolic analysis of programs  280--314
          J. Karhumäki and   
                        Y. Maon   A simple undecidable problem:
                                  Existential agreement of inverses of two
                                  morphisms on a regular language  . . . . 315--322
             J. A. Bergstra and   
                     J. W. Klop   Conditional rewrite rules: Confluence
                                  and termination  . . . . . . . . . . . . 323--362
         Bernard R. Hodgson and   
                Clement F. Kent   Uniform normal form for general
                                  time-bounded complexity classes  . . . . 363--369
                James C. Owings   Effective choice functions and index
                                  sets . . . . . . . . . . . . . . . . . . 370--373
              Bogdan S. Chlebus   Domino-tiling games  . . . . . . . . . . 374--392
           Dominique Perrin and   
                  Jean-Eric Pin   First-order logic and star-free sets . . 393--406
            N. Lakshmipathy and   
                 Karl Winklmann   ``Global'' graph problems tend to be
                                  intractable  . . . . . . . . . . . . . . 407--428
                      Anonymous   Author index for volume 32 . . . . . . . 429--429


Journal of Computer and System Sciences
Volume 33, Number 1, August, 1986

               Larry Stockmeyer   Editor's foreword  . . . . . . . . . . . 1--1
                 Ketan Mulmuley   Fully abstract submodels of typed lambda
                                  calculi  . . . . . . . . . . . . . . . . 2--46
                  Amos Fiat and   
                     Adi Shamir   Polymorphic arrays: a novel VLSI layout
                                  for systolic computers . . . . . . . . . 47--65
                   J. Ian Munro   An implicit data structure supporting
                                  insertion, deletion, and search in $
                                  O(\log^2 n) $ time . . . . . . . . . . . 66--74
              Miklos Santha and   
              Umesh V. Vazirani   Generating Quasi-Random Sequences from
                                  Semi-Random Sources  . . . . . . . . . . 75--87
        Albert G. Greenberg and   
                     Alan Weiss   A lower bound for probabilistic
                                  algorithms for finite state machines . . 88--105
           Ramamohan Paturi and   
                    Janos Simon   Probabilistic communication complexity   106--123

Journal of Computer and System Sciences
Volume 33, Number 2, October, 1986

                    Jeff Ullman   Editor's foreword  . . . . . . . . . . . 125--125
             Heikki Mannila and   
           Karijouko Raihä   Design by example: an application of
                                  Armstrong relations  . . . . . . . . . . 126--141
                 Moshe Y. Vardi   Querying logical databases . . . . . . . 142--160
               Ouri Wolfson and   
             Mihalis Yannakakis   Deadlock-freedom (and safety) of
                                  transactions in a distributed database   161--178
           Giorgio Ausiello and   
          Alessandro D'Atri and   
               Marina Moscarini   Chordality properties on graphs and
                                  minimal conceptual connections in
                                  semantic data models . . . . . . . . . . 179--202
      Stavros S. Cosmadakis and   
        Paris C. Kanellakis and   
               Nicolas Spyratos   Partition semantics for relations  . . . 203--233
                    Tim Connors   Equivalence of views by query capacity   234--274
                 Yehoshua Sagiv   Concurrent operations on B$^*$-trees
                                  with overtaking  . . . . . . . . . . . . 275--296
        Thanasis Hadzilacos and   
      Christos H. Papadimitriou   Algorithmic aspects of multiversion
                                  concurrency control  . . . . . . . . . . 297--310
                  T. Imielinski   Witold Lipski, Jr. (1949--1985)  . . . . 311--311

Journal of Computer and System Sciences
Volume 33, Number 3, December, 1986

              Orna Grumberg and   
             Nissim Francez and   
                    Shmuel Katz   A complete rule for equifair termination 313--332
               Andrzej Tarlecki   Quasi-varieties in abstract algebraic
                                  institutions . . . . . . . . . . . . . . 333--360
            Serge Abiteboul and   
                  Nicole Bidoit   Non First Normal Form relations: an
                                  algebra allowing data restructuring  . . 361--393
          Martin E. Kaliski and   
          S. Yunkap Kwankam and   
             Pamela Halpern and   
                  David Shulman   A theory of orbital behavior in a class
                                  of nonlinear systems: Chaos and a
                                  signature-based approach . . . . . . . . 394--414
              Dirk Janssens and   
         Grzegorz Rozenberg and   
                      Emo Welzl   The bounded degree problem for NLC
                                  grammars is decidable  . . . . . . . . . 415--422
               Günter Hotz   A representation theorem of infinite
                                  dimensional algebras and applications to
                                  language theory  . . . . . . . . . . . . 423--455
             Elias Dahlhaus and   
             Manfred K. Warmuth   Membership for growing context-sensitive
                                  grammars is polynomial . . . . . . . . . 456--472
                 H. C. Card and   
             A. Thanailakis and   
                   W. Pries and   
                   R. D. McLeod   Analysis of bounded linear cellular
                                  automata based on a method of image
                                  charges  . . . . . . . . . . . . . . . . 473--480
                      Anonymous   Author index for volume 33 . . . . . . . 481--481


Journal of Computer and System Sciences
Volume 34, Number 1, February, 1987

                 D. Cantone and   
                   A. Ferro and   
                 J. T. Schwartz   Decision procedures for elementary
                                  sublanguages of set theory. V.
                                  Multilevel syllogistic extended by the
                                  general union operator . . . . . . . . . 1--18
           Greg N. Frederickson   Upper bounds for time-space trade-offs
                                  in sorting and selection . . . . . . . . 19--26
                   Amihood Amir   Expressive completeness failure in
                                  branching time structures  . . . . . . . 27--42
              Andranik Mirzaian   River routing in VLSI  . . . . . . . . . 43--54
           Rodney R. Howell and   
                Louis E. Rosier   An analysis of the nonemptiness problem
                                  for classes of reversal-bounded
                                  multicounter machines  . . . . . . . . . 55--74
                   Ker-I Ko and   
                  Chin-Ming Hua   A note on the two-variable
                                  pattern-finding problem  . . . . . . . . 75--86
                   Heiko Vogler   Basic tree transducers . . . . . . . . . 87--128
             Karl R. Abrahamson   Succinct representation of regular sets
                                  using gotos and boolean variables  . . . 129--148

Journal of Computer and System Sciences
Volume 34, Number 2--3, April / June, 1987

                  Hartmut Ehrig   Editor's foreword  . . . . . . . . . . . 149--149
            Donald Sannella and   
               Andrzej Tarlecki   On observational equivalence and
                                  algebraic specification  . . . . . . . . 150--178
                 Peter Padawitz   Parameter-preserving data type
                                  specifications . . . . . . . . . . . . . 179--209
              Ilaria Castellani   Bisimulations and abstraction
                                  homomorphisms  . . . . . . . . . . . . . 210--235
                   Manfred Broy   Specification and top-down design of
                                  distributed systems  . . . . . . . . . . 236--265
                 J. A. Makowsky   Why horn formulas matter in computer
                                  science: Initial structures and generic
                                  examples . . . . . . . . . . . . . . . . 266--292
                 E. K. Blum and   
                   H. Ehrig and   
             F. Parisi-Presicce   Algebraic specification of modules and
                                  their basic interconnections . . . . . . 293--339
         Axel Poigné and   
                     Josef Voss   On the implementation of abstract data
                                  types by programming language constructs 340--376
                 Paul Boehm and   
          Harald-Reto Fonio and   
                 Annegret Habel   Amalgamation of graph transformations: A
                                  synchronization mechanism  . . . . . . . 377--408
                 R. M. Burstall   Inductively defined functions in
                                  functional programming languages . . . . 409--421
           Pierpaolo Degano and   
                  Ugo Montanari   Concurrent histories: a basis for
                                  observing distributed systems  . . . . . 422--461
                      Anonymous   Author index for volume 34 . . . . . . . 462--462


Journal of Computer and System Sciences
Volume 35, Number 1, August, 1987

             Joachim Biskup and   
                   Renate Meyer   Design of relational database schemes by
                                  deleting attributes in the canonical
                                  decomposition  . . . . . . . . . . . . . 1--22
                    David Peleg   Communication in concurrent dynamic
                                  logic  . . . . . . . . . . . . . . . . . 23--58
                  R. P. Kurshan   Complementing deterministic Büchi
                                  automata in polynomial time  . . . . . . 59--71
      Francesco Parisi-Presicce   Union and actualization of module
                                  specifications: Some compatibility
                                  results  . . . . . . . . . . . . . . . . 72--95
         Toshimasa Watanabe and   
                 Akira Nakamura   Edge-connectivity augmentation problems  96--144

Journal of Computer and System Sciences
Volume 35, Number 2, October, 1987

                 Seinosuke Toda   $ \Sigma_2 $ SPACE($n$) is closed under
                                  complement . . . . . . . . . . . . . . . 145--152
 László Babai and   
        Péter Hajnal and   
     Endre Szemerédi and   
       György Turán   A lower bound for read-once-only
                                  branching programs . . . . . . . . . . . 153--162
         Gheorghe \cSteffanescu   On flowchart theories. Part I. The
                                  deterministic case . . . . . . . . . . . 163--191
            Michael G. Main and   
             Grzegorz Rozenberg   Handle NLC grammars and R. E. languages  192--205
     Józef Winkowski and   
      Andrea Maggiolo-Schettini   An algebra of processes  . . . . . . . . 206--228
        Vera Trnková and   
                  Jan Reiterman   Dynamic algebras with test . . . . . . . 229--242
       Jean-Michel Autebert and   
                Luc Boasson and   
Géraud Sénizergues   Groups and NTS languages . . . . . . . . 243--267

Journal of Computer and System Sciences
Volume 35, Number 3, December, 1987

         Michael L. Fredman and   
              Thomas H. Spencer   Refined complexity analysis for heap
                                  operations . . . . . . . . . . . . . . . 269--284
                 Friedrich Otto   On deciding the confluence of a finite
                                  string-rewriting system on a given
                                  congruence class . . . . . . . . . . . . 285--310
               J. Beauquier and   
                M. Blattner and   
                     M. Latteux   On commutative context-free languages    311--320
                      N. Bidoit   The verso algebra or how to answer
                                  queries with fewer joins . . . . . . . . 321--364
            David B. Benson and   
             Ir\`ene Guessarian   Algebraic solutions to recursion schemes 365--400
                      Anonymous   Author index for volume 35 . . . . . . . 401--401


Journal of Computer and System Sciences
Volume 36, Number 1, February, 1988

                   Pierre Baldi   Group actions and learning for a family
                                  of automata  . . . . . . . . . . . . . . 1--15
               Peter A. Lindsay   On alternating $ \omega $-automata . . . 16--24
                Masashi Katsura   Automorphism groups and factor automata
                                  of strongly connected automata . . . . . 25--65
                 Z. Ésik   Independence of the equational axioms
                                  for iteration theories . . . . . . . . . 66--76
             Dirk Van Gucht and   
             Patrick C. Fischer   Multilevel nested relational structures  77--105

Journal of Computer and System Sciences
Volume 36, Number 2, April, 1988

                 Andrew Odlyzko   Editor's foreword  . . . . . . . . . . . 107--107
                  Robert Wilber   White pebbles help . . . . . . . . . . . 108--124
          Peter Gács and   
                      John Reif   A simple three-dimensional real-time
                                  reliable cellular array  . . . . . . . . 125--147
             F. R. K. Chung and   
               D. J. Hajela and   
                  P. D. Seymour   Self-organizing sequential search and
                                  Hilbert's inequalities . . . . . . . . . 148--157
            J. W. de Bakker and   
            J.-J. Ch. Meyer and   
              E.-R. Olderog and   
                   J. I. Zucker   Transition systems, metric spaces and
                                  ready sets in the semantics of uniform
                                  concurrency  . . . . . . . . . . . . . . 158--224
            Richard M. Karp and   
                  Eli Upfal and   
                  Avi Wigderson   The complexity of parallel search  . . . 225--253
 László Babai and   
                   Shlomo Moran   Arthur--Merlin games: a randomized proof
                                  system, and a hierarchy of complexity
                                  classes  . . . . . . . . . . . . . . . . 254--276

Journal of Computer and System Sciences
Volume 36, Number 3, June, 1988

             Stephen R. Mahaney   Editor's foreword  . . . . . . . . . . . 277--277
               Ian Parberry and   
                Georg Schnitger   Parallel computation with threshold
                                  functions  . . . . . . . . . . . . . . . 278--302
          Christopher B. Wilson   A measure of relativized space which is
                                  faithful with respect to depth . . . . . 303--312
      Martin Dietzfelbinger and   
                 Wolfgang Maass   Lower bound arguments with
                                  ``Inaccessible'' numbers . . . . . . . . 313--335
               Eric W. Allender   Isomorphisms and $ 1 - L $ reductions    336--350
               Jonathan F. Buss   Relativized alternation and
                                  space-bounded computation  . . . . . . . 351--378
                 Michael Sipser   Expanders, randomness, or time versus
                                  space  . . . . . . . . . . . . . . . . . 379--383
               Kenneth W. Regan   The topology of provability in
                                  complexity theory  . . . . . . . . . . . 384--432
                 Stathis Zachos   Probabilistic quantifiers and games  . . 433--451
                Anne Condon and   
              Richard E. Ladner   Probabilistic game automata  . . . . . . 452--489
                Mark W. Krentel   The complexity of optimization problems  490--509
                      Anonymous   Author index for volume 36 . . . . . . . 510--510


Journal of Computer and System Sciences
Volume 37, Number 1, August, 1988

                  Jeff Lagarias   Editor's foreword  . . . . . . . . . . . 1--1
  Christos H. Papadimitriou and   
                    David Wolfe   The complexity of facets resolved  . . . 2--13
       Lefteris M. Kirousis and   
      Christos H. Papadimitriou   The complexity of recognizing polyhedral
                                  scenes . . . . . . . . . . . . . . . . . 14--38
             Eugene M. Luks and   
                Pierre McKenzie   Parallel algorithms for solvable
                                  permutation groups . . . . . . . . . . . 39--62
              Gad M. Landau and   
                    Uzi Vishkin   Fast string matching with k differences  63--78
           David S. Johnson and   
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   How easy is local search?  . . . . . . . 79--100
                        Ming Li   Simulating two pushdown stores by one
                                  tape in $ O(n^{1.5} \sqrt {\log n}) $
                                  time . . . . . . . . . . . . . . . . . . 101--116

Journal of Computer and System Sciences
Volume 37, Number 2, October, 1988

                    Ravi Kannan   Editors's foreword . . . . . . . . . . . 117--117
                  Noga Alon and   
                Wolfgang Maasst   Meanders and their applications in lower
                                  bounds arguments . . . . . . . . . . . . 118--129
             Prabhakar Raghavan   Probabilistic construction of
                                  deterministic algorithms: Approximating
                                  packing integer programs . . . . . . . . 130--143
              Marek Chrobak and   
                        Ming Li   k + 1Heads are better than k for PDAs    144--155
            Gilles Brassard and   
                David Chaum and   
          Claude Crépeau   Minimum disclosure proofs of knowledge   156--189
            Philip N. Klein and   
                   John H. Reif   An efficient parallel algorithm for
                                  planarity  . . . . . . . . . . . . . . . 190--246
            Stuart A. Kurtz and   
         Stephen R. Mahaney and   
                 James S. Royer   Collapsing degrees . . . . . . . . . . . 247--268

Journal of Computer and System Sciences
Volume 37, Number 3, December, 1988

                  Tat-Hung Chan   Pushdown automata with reversal-bounded
                                  counters . . . . . . . . . . . . . . . . 269--291
             Errol L. Lloyd and   
             Mary Lou Soffa and   
                 Ching-Chy Wang   On locating minimum feedback vertex sets 292--311
              Uwe Schöning   Graph isomorphism is in the low
                                  hierarchy  . . . . . . . . . . . . . . . 312--323
               Mary G. O'Connor   An unpredictability approach to
                                  finite-state randomness  . . . . . . . . 324--336
           Greg N. Frederickson   Distributed algorithms for selection in
                                  sets . . . . . . . . . . . . . . . . . . 337--348
           Rodney R. Howell and   
                Louis E. Rosier   Completeness results for conflict-free
                                  vector replacement systems . . . . . . . 349--366
                    Kai Salomaa   Deterministic tree pushdown automata and
                                  monadic tree rewriting systems . . . . . 367--394
             Nicholas Pippenger   Correction to ``Computational complexity
                                  of algebraic functions'' . . . . . . . . 395--399
                      Anonymous   Author index for volume 37 . . . . . . . 400--400


Journal of Computer and System Sciences
Volume 38, Number 1, February, 1989

                Juris Hartmanis   Editor's foreword  . . . . . . . . . . . 1--1
              E. G. Coffman and   
                 F. T. Leighton   A provably efficient algorithm for
                                  dynamic storage allocation . . . . . . . 2--35
             Mihalis Yannakakis   Embedding planar graphs in four pages    36--67
                     Jin-Yi Cai   With probability one, a random oracle
                                  separates PSPACE from the
                                  polynomial-time hierarchy  . . . . . . . 68--85
          James R. Driscoll and   
                Neil Sarnak and   
          Daniel D. Sleator and   
               Robert E. Tarjan   Making data structures persistent  . . . 86--124
        Miklós Ajtai and   
 János Komlós and   
              W. L. Steiger and   
         Endre Szemerédi   Optimal parallel selection has
                                  complexity $ O (\Log \Log N) $ . . . . . 125--133
                  Zvi Galil and   
                Ravi Kannan and   
         Endre Szemerédi   On nontrivial separators for $k$-page
                                  graphs and simulations by
                                  nondeterministic one-tape Turing
                                  machines . . . . . . . . . . . . . . . . 134--149
            David A. Barrington   Bounded-width polynomial-size branching
                                  programs recognize exactly those
                                  languages in NC 1  . . . . . . . . . . . 150--164
       Herbert Edelsbrunner and   
             Leonidas J. Guibas   Topologically sweeping an arrangement    165--194
          Joseph Y. Halpern and   
                 Moshe Y. Vardi   The complexity of reasoning about
                                  knowledge and time. I. Lower bounds  . . 195--237

Journal of Computer and System Sciences
Volume 38, Number 2, April, 1989

               Avi Silberschatz   Editor's foreword  . . . . . . . . . . . 239--239
             Heikki Mannila and   
     Kari-Jouko Räihä   Automatic generation of test data for
                                  relational queries . . . . . . . . . . . 240--258
            Jeffrey F. Naughton   Data independent recursion in deductive
                                  databases  . . . . . . . . . . . . . . . 259--289
              Nicole Bidoit and   
                   Richard Hull   Minimalism, justification and
                                  non-monotonicity in deductive databases  290--325
  François Bancilhon and   
              Setrag Khoshafian   A calculus for complex objects . . . . . 326--340
                Foto Afrati and   
  Christos H. Papadimitriou and   
        George Papageorgiou and   
             Athena Roussou and   
             Yehoshua Sagiv and   
              Jeffrey D. Ullman   On the convergence of query evaluation   341--359
        Thanasis Hadzilacos and   
             Nihalis Yannakakis   Deleting completed transactions  . . . . 360--379
             Yehoshua Sagiv and   
                   Oded Shmueli   A characterization of finite
                                  fd-acyclicity  . . . . . . . . . . . . . 380--404
                Frank Olken and   
                    Doron Rotem   Rearranging data to maximize the
                                  efficiency of compression  . . . . . . . 405--430

Journal of Computer and System Sciences
Volume 38, Number 3, June, 1989

            Juraj Hromkovic and   
             Katsushi Inoue and   
                 Itsuo Takanami   Lower bounds for language recognition on
                                  two-dimensional alternating multihead
                                  machines . . . . . . . . . . . . . . . . 431--451
            Oscar H. Ibarra and   
                  Tao Jiang and   
                   Jik H. Chang   On iterative and cellular tree arrays    452--473
         Marie-Paule Flé   Serialization of concurrent programs . . 474--493
                 Victor Pan and   
                      John Reif   Fast and efficient solution of path
                                  algebra problems . . . . . . . . . . . . 494--510
                  Craig A. Rich   Positive relativizations of the P =? NP
                                  problem  . . . . . . . . . . . . . . . . 511--523
                      Anonymous   Author index for volume 38 . . . . . . . 524--524


Journal of Computer and System Sciences
Volume 39, Number 1, August, 1989

              Steve Mahaney and   
                 Alan L. Selman   Editors' foreword  . . . . . . . . . . . 1--1
            Moon Jung Chung and   
                   B. Ravikumar   Strong nondeterministic Turing reduction
                                  --- A technique for proving
                                  intractability . . . . . . . . . . . . . 2--20
        Martín Abadi and   
            Joan Feigenbaum and   
                     Joe Kilian   On hiding information from an oracle . . 21--50
                 Daniel Leivant   Descriptive characterizations of
                                  computational complexity . . . . . . . . 51--83
              Uwe Schöning   Probabilistic complexity classes and
                                  lowness  . . . . . . . . . . . . . . . . 84--100
               Eric W. Allender   Some consequences of the existence of
                                  pseudorandom generators  . . . . . . . . 101--124

Journal of Computer and System Sciences
Volume 39, Number 2, October, 1989

                       Chef Yap   Guest Editor's foreword  . . . . . . . . 125--125
         Leonidas J. Guibas and   
               John Hershberger   Optimal shortest path queries in a
                                  simple polygon . . . . . . . . . . . . . 126--152
                  N. Dadoun and   
              D. G. Kirkpatrick   Parallel construction of subdivision
                                  hierarchies  . . . . . . . . . . . . . . 153--165
           Joseph Culberson and   
              Robert A. Reckhow   Orthogonally convex coverings of
                                  orthogonal polygons without holes  . . . 166--204
                   L. Paul Chew   There are planar graphs almost as good
                                  as the complete graph  . . . . . . . . . 205--219
                   Subhash Suri   Computing geodesic furthest neighbors in
                                  simple polygons  . . . . . . . . . . . . 220--235
               Kokichi Sugihara   On finite-precision representations of
                                  geometric objects  . . . . . . . . . . . 236--247

Journal of Computer and System Sciences
Volume 39, Number 3, December, 1989

              Steve Mahaney and   
                 Alan L. Selman   Editors' foreword  . . . . . . . . . . . 249--249
              Klaus Ambos-Spies   Honest polynomial time reducibilities
                                  and the P=?NP problem  . . . . . . . . . 250--281
                      Jim Kadin   P$^{NP[O(\log n)]}$ and sparse
                                  Turing-complete sets for NP  . . . . . . 282--298
            Lane A. Hemachandra   The strong exponential hierarchy
                                  collapses  . . . . . . . . . . . . . . . 299--322
               Raymond Greenlaw   Ordered vertex removal and subgraph
                                  problems . . . . . . . . . . . . . . . . 323--342
             Pierre America and   
                     Jan Rutten   Solving reflexive domain equations in a
                                  category of complete metric spaces . . . 343--375
             A. G. Robinson and   
                  A. J. Goldman   The set coincidence game: Complexity,
                                  attainability, and symmetric strategies  376--387
                      Anonymous   Author index for volume 39 . . . . . . . 388--388


Journal of Computer and System Sciences
Volume 40, Number 1, February, 1990

         Christopher J. Van Wyk   Editor's foreword  . . . . . . . . . . . 1--1
                  Chee-Keng Yap   A geometric consistency theorem for a
                                  symbolic perturbation scheme . . . . . . 2--18
             Rajeev Motwani and   
         Arvind Raghunathan and   
                    Huzur Saran   Covering orthogonal polygons with star
                                  polygons: The perfect graph approach . . 19--48
                  Marshall Bern   Hidden surface removal for rectangles    49--69
               David Dobkin and   
                 Deborah Silver   Applied computational geometry: Towards
                                  robust solutions of basic problems . . . 70--87
          Joseph S. B. Mitchell   On maximum flows in polyhedral domains   88--123

Journal of Computer and System Sciences
Volume 40, Number 2, April, 1990

          Kevin E. Flannery and   
             Johannes J. Martin   The Hoare and Smyth power domain
                                  constructors commute under composition   125--135
              Etienne Grandjean   First-order spectra with one variable    136--153
                  J. Dassow and   
              H. Jürgensen   Soliton automata . . . . . . . . . . . . 154--181
                Damas P. Gruska   Genomorphisms of semi-modular lattices   182--187
            Michael G. Main and   
             Grzegorz Rozenberg   Edge-label controlled graph grammars . . 188--228
             Axel Poigné   Parametrization for order-sorted
                                  algebraic specification  . . . . . . . . 229--268
               Georg Lausen and   
    Eljas Soisalon-Soininen and   
                 Peter Widmayer   On the power of safe locking . . . . . . 269--288

Journal of Computer and System Sciences
Volume 40, Number 3, June, 1990

                  Changwook Kim   Picture iteration and picture ambiguity  289--306
           Joost Engelfriet and   
                George Leih and   
                      Emo Welzl   Boundary graph grammars with dynamic
                                  edge relabeling  . . . . . . . . . . . . 307--345
           Seymour Ginsburg and   
                       Dan Tian   Input-dependent-only object histories    346--375
   Ijsbrand Jan Aalbersberg and   
           Joost Engelfriet and   
             Grzegorz Rozenberg   The complexity of regular DNLC graph
                                  languages  . . . . . . . . . . . . . . . 376--404
         Gultekin Ozsoyoglu and   
                    Tzong-An Su   On inference control in semantic data
                                  models for statistical databases . . . . 405--443
                   Mark A. Fulk   A note on A.E. $h$-complex functions . . 444--449
                      Anonymous   Author index for volume 40 . . . . . . . 450--450


Journal of Computer and System Sciences
Volume 41, Number 1, August, 1990

                 Moshe Y. Vardi   Editor's foreword  . . . . . . . . . . . 1--1
                   Rina Dechter   Decomposing a relation into a tree of
                                  binary relations . . . . . . . . . . . . 2--24
               Paolo Atzeni and   
    Maria Cristina De Bernardis   A new interpretation for null values in
                                  the weak instance model  . . . . . . . . 25--43
               Gabriel M. Kuper   Logic programming with sets  . . . . . . 44--64
                Alan Fekete and   
                Nancy Lynch and   
            Michael Merritt and   
                  William Weihl   Commutativity-based locking for nested
                                  transactions . . . . . . . . . . . . . . 65--156

Journal of Computer and System Sciences
Volume 41, Number 2, October, 1990

              Catriel Beeri and   
           Paris Kanellakis and   
  François Bancilhon and   
             Raghu Ramakrishnan   Bounds on the propagation of selection
                                  into logic programs  . . . . . . . . . . 157--180
            Serge Abiteboul and   
                   Victor Vianu   Procedural languages for database
                                  queries and updates  . . . . . . . . . . 181--229
         Manuel E. Bermudez and   
                Karl M. Schimpf   Practical arbitrary lookahead LR parsing 230--250
        Lane A. Hemachandra and   
                  Steven Rudich   On the complexity of ranking . . . . . . 251--271

Journal of Computer and System Sciences
Volume 41, Number 3, December, 1990

              Richard E. Ladner   Editor's foreword  . . . . . . . . . . . 273--273
    David A. Mix Barrington and   
              Neil Immerman and   
               Howard Straubing   On uniformity within NC 1  . . . . . . . 274--306
                   Jack H. Lutz   Pseudorandom sources for BPP . . . . . . 307--320
             Juichi Shinoda and   
             Theodore A. Slaman   On the theory of the PTIME degrees of
                                  the recursive sets . . . . . . . . . . . 321--366
  JoséL. Balcázar   Self-reducibility  . . . . . . . . . . . 367--388
         Luc Longpré and   
                     Paul Young   Cook reducibility is faster than Karp
                                  reducibility in NP . . . . . . . . . . . 389--401
          Bernd Halstenberg and   
          Rüdiger Reischuk   Relations between communication
                                  complexity classes . . . . . . . . . . . 402--429
               Leonard Pitt and   
             Manfred K. Warmuth   Prediction-preserving reducibility . . . 430--467
                      Anonymous   Author index for volume 41 . . . . . . . 468--468


Journal of Computer and System Sciences
Volume 42, Number 1, February, 1991

               Manfred Broy and   
             Christian Lengauer   On denotational versus predicative
                                  semantics  . . . . . . . . . . . . . . . 1--29
                      Eric Bach   Realistic analysis of some randomized
                                  algorithms . . . . . . . . . . . . . . . 30--53
                   Jia-Hual You   Unification modulo an equality theory
                                  for equational logic programming . . . . 54--75
                 Richard Beigel   Relativized counting classes: Relations
                                  among thresholds, parity, and mods . . . 76--96
               H. L. Bodlaender   Some lower bound results for
                                  decentralized extrema-finding in rings
                                  of processors  . . . . . . . . . . . . . 97--118
                    Ming Li and   
                   Yaacov Yesha   Resource bounds for parallel computation
                                  of threshold and symmetric functions . . 119--137

Journal of Computer and System Sciences
Volume 42, Number 2, April, 1991

           Elio Giovannetti and   
               Giorgio Levi and   
              Corrado Moiso and   
           Catuscia Palamidessi   Kernel-LEAF: a logic plus functional
                                  language . . . . . . . . . . . . . . . . 139--185
             Friedrich Otto and   
                 Celia Wrathall   Overlaps in free partially commutative
                                  monoids  . . . . . . . . . . . . . . . . 186--198
            Jeffrey F. Naughton   One-sided recursions . . . . . . . . . . 199--236
                 Max Garzon and   
            Yechezkel Zalcstein   On isomorphism testing of a class of
                                  $2$-Nilpotent groups . . . . . . . . . . 237--248
                      Anonymous   Corrigendum  . . . . . . . . . . . . . . 249--251

Journal of Computer and System Sciences
Volume 42, Number 3, June, 1991

                S. Rao Kosaraju   Editor's foreword  . . . . . . . . . . . 253--253
                Pavol Duris and   
                      Zvi Galil   Two lower bounds in asynchronous
                                  distributed computation  . . . . . . . . 254--266
            Andrew Chi-Chih Yao   Lower bounds to randomized algorithms
                                  for graph properties . . . . . . . . . . 267--287
            Arkady Kanevsky and   
            Vijaya Ramachandran   Improved algorithms for graph four-
                                  connectivity . . . . . . . . . . . . . . 288--306
              Abhiram G. Ranade   How to emulate shared memory . . . . . . 307--326
             William Aiello and   
                   Johan Hastad   Statistical zero-knowledge languages can
                                  be recognized in two rounds  . . . . . . 327--345
                  Yuri Gurevich   Average case completeness  . . . . . . . 346--398
                      Anonymous   Author index for volume 42 . . . . . . . 399--399


Journal of Computer and System Sciences
Volume 43, Number 1, August, 1991

             Mihalis Yannakakis   Editor's foreword  . . . . . . . . . . . 1--1
        Thanasis Hadzilacos and   
              Vassos Hadzilacos   Transaction synchronisation in object
                                  bases  . . . . . . . . . . . . . . . . . 2--24
         Maurice P. Herlihy and   
               William E. Weihl   Hybrid concurrency control for abstract
                                  data types . . . . . . . . . . . . . . . 25--61
            Serge Abiteboul and   
                   Victor Vianu   Datalog extensions for database queries
                                  and updates  . . . . . . . . . . . . . . 62--124
        Phokion G. Kolaitis and   
      Christos H. Papadimitriou   Why not negation by fixpoint?  . . . . . 125--144
           Ramsey W. Haddad and   
           Jeffrey F. Naughtont   A counting algorithm for a cyclic binary
                                  query  . . . . . . . . . . . . . . . . . 145--169
              O. P. Buneman and   
             S. B. Davidson and   
                     A. Watters   A semantics for complex objects and
                                  approximate answers  . . . . . . . . . . 170--218
               Richard Hull and   
                     Jianwen Su   On the expressive power of database
                                  queries with intermediate types  . . . . 219--267

Journal of Computer and System Sciences
Volume 43, Number 2, October, 1991

                Karl Abrahamson   Time-space tradeoffs for algebraic
                                  problems on general sequential machines  269--289
                  Noga Alon and   
              Amotz Bar-Noy and   
              Nathan Linial and   
                    David Peleg   A lower bound for radio broadcast  . . . 290--298
              Oscar Habarra and   
                      Tao Jiang   Learning regular languages from
                                  counterexamples  . . . . . . . . . . . . 299--316
                  Danny Krizanc   Oblivious routing with limited buffer
                                  capacity . . . . . . . . . . . . . . . . 317--327
           Joost Engelfriet and   
                   Linda Heyker   The string generating power of
                                  context-free hypergraph grammars . . . . 328--360
                 Sabine Stifter   An axiomatic approach to
                                  Voronoi-diagrams in $3$D . . . . . . . . 361--379
               H. Venkateswaran   Properties that characterize LOGCFL  . . 380--404

Journal of Computer and System Sciences
Volume 43, Number 3, December, 1991

              Jeffrey D. Ullman   Editor's foreword  . . . . . . . . . . . 405--405
                  Amos Fiat and   
               J. Ian Munro and   
                  Moni Naor and   
 Alejandro A. Schäffer and   
        Jeanette P. Schmidt and   
                    Alan Siegel   An implicit data structure for searching
                                  a multikey table in logarithmic time . . 406--424
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   Optimization, approximation, and
                                  complexity classes . . . . . . . . . . . 425--440
             Mihalis Yannakakis   Expressing combinatorial optimization
                                  problems by Linear Programs  . . . . . . 441--466
               N. E. Fenton and   
                   R. W. Whitty   Program structures: Some new
                                  characterisations  . . . . . . . . . . . 467--483
                     M. Ito and   
          H. Jürgensen and   
                 H. J. Shyr and   
                    G. Thierrin   Outfix and infix codes and related
                                  classes of languages . . . . . . . . . . 484--508
                  Leong Kwan Li   On computing decision regions with
                                  neural nets  . . . . . . . . . . . . . . 509--512
                      Anonymous   Author index for volume 43 . . . . . . . 513--513


Journal of Computer and System Sciences
Volume 44, Number 1, February, 1992

          Edward P. F. Chan and   
                   Paolo Atzeni   Connection-trap-free database schemes    1--22
              Razvan Diaconescu   Contraction algebras and unification of
                                  (infinite) terms . . . . . . . . . . . . 23--42
               D. E. Muller and   
                F. P. Preparata   Parallel restructuring and evaluation of
                                  expressions  . . . . . . . . . . . . . . 43--62
                T. Lengauer and   
                   K. W. Wagner   The correlation between the complexities
                                  of the nonhierarchical and hierarchical
                                  versions of graph problems . . . . . . . 63--93
             Elias Dahlhaus and   
                Marek Karpinski   Perfect matching for regular graphs is
                                  AC$^0$-hard for the general matching
                                  problem  . . . . . . . . . . . . . . . . 94--102
                Prabhakar Ragde   Processor-time tradeoffs in PRAM
                                  simulations  . . . . . . . . . . . . . . 103--113
              Satoshi Takahashi   Self-similarity of linear cellular
                                  automata . . . . . . . . . . . . . . . . 114--140
       Ravinderpal Singh Sandhu   Undecidability of safety for the
                                  schematic protection model with cyclic
                                  creates  . . . . . . . . . . . . . . . . 141--159
                  Thomas Herbst   Some remarks on a theorem of Sakarovitch 160--165

Journal of Computer and System Sciences
Volume 44, Number 2, April, 1992

                     Paul Young   Editor's foreword  . . . . . . . . . . . 167--167
             Wolfgang Maass and   
             Theodore A. Slaman   The complexity types of computable sets  168--192
             Shai Ben-David and   
                 Benny Chor and   
             Oded Goldreich and   
                    Michel Luby   On the theory of average case complexity 193--219
                   Jack H. Lutz   Almost everywhere high nonuniform
                                  complexity . . . . . . . . . . . . . . . 220--258
                Uriel Feige and   
                     Adi Shamir   Multi-oracle interactive protocols with
                                  constant space verifiers . . . . . . . . 259--271
            Johannes Kobler and   
              Uwe Sch\"\ing and   
             Seinosuke Toda and   
            Jacobo Torán   Turing machines with few accepting
                                  computations and low sets for PP . . . . 272--286
               Steven Homer and   
                 Alan L. Selman   Oracles for structural properties: The
                                  isomorphism problem and public-key
                                  cryptography . . . . . . . . . . . . . . 287--301
              Ernst W. Mayr and   
              Ashok Subramanian   The complexity of circuit value and
                                  network stability  . . . . . . . . . . . 302--323
                Tak Wah Lam and   
                Walter L. Ruzzo   Results on communication complexity
                                  classes  . . . . . . . . . . . . . . . . 324--342
                    Ming Li and   
      Paul M. B. Vitányi   Inductive reasoning and Kolmogorov
                                  complexity . . . . . . . . . . . . . . . 343--384

Journal of Computer and System Sciences
Volume 44, Number 3, June, 1992

                 Steven Lindell   The invariant problem for binary string
                                  structures and the parallel complexity
                                  theory of queries  . . . . . . . . . . . 385--410
                     A. Klapper   Distributed event algebras . . . . . . . 411--424
           Michael Kaminski and   
              Shlomit S. Pinter   Finite automata on directed graphs . . . 425--446
               Manuel Silva and   
                   Tadao Murata   B-fairness and structural B-fairness in
                                  Petri net models of concurrent systems   447--477
    David A. Mix Barrington and   
              Kevin Compton and   
           Howard Straubing and   
           Denis Thérien   Regular languages in NC 1  . . . . . . . 478--499
                 Osamu Watanabe   On polynomial time one-truth-table
                                  reducibility to a sparse set . . . . . . 500--516
                      Anonymous   Author index for volume 44 . . . . . . . 517--517


Journal of Computer and System Sciences
Volume 45, Number 1, August, 1992

                   Xin Wang and   
                 Edward K. Blum   Discrete-time versus continuous-time
                                  models of neural networks  . . . . . . . 1--19
              Eduardo D. Sontag   Feedforward nets for interpolation and
                                  classification . . . . . . . . . . . . . 20--48
              Furio Honsell and   
   Simonetta Ronchi Della Rocca   An approximation theorem for topological
                                  lambda models and the topological
                                  incompleteness of lambda calculus  . . . 49--75
               Marl Gyssens and   
                 Dirk Van Gucht   The powerset algebra as a natural tool
                                  to handle nested database relations  . . 76--103
          Reuven Bar-Yehuda and   
             Oded Goldreich and   
                      Alon Itai   On the time-complexity of broadcast in
                                  multi-hop radio networks: an exponential
                                  gap between determinism and
                                  randomization  . . . . . . . . . . . . . 104--126
                Iain A. Stewart   Using the Hamiltonian path operator to
                                  capture NP . . . . . . . . . . . . . . . 127--151

Journal of Computer and System Sciences
Volume 45, Number 2, October, 1992

      Christos H. Papadimitriou   Editor's foreword  . . . . . . . . . . . 153--153
            Jean-Camille Birget   Positional simulation of two-way
                                  automata: Proof of a conjecture of R.
                                  Kannan and generalizations . . . . . . . 154--179
              Allan Borodin and   
            Walter L. Ruzzo and   
                  Martin Tompat   Lower bounds on the length of universal
                                  traversal sequences  . . . . . . . . . . 180--203
 László Babai and   
                Noam Nisant and   
    Márió Szegedy   Multiparty protocols, pseudorandom
                                  generators for logspace, and time-space
                                  trade-offs . . . . . . . . . . . . . . . 204--232
             Tomás Feder   A new fixed point approach for stable
                                  networks and stable marriages  . . . . . 233--284

Journal of Computer and System Sciences
Volume 45, Number 3, December, 1992

               Kenneth W. Regan   Minimum-complexity pairing functions . . 285--295
                    Tak Lam and   
             Prasoon Tiwari and   
                   Martin Tompa   Trade-offs between communication and
                                  space  . . . . . . . . . . . . . . . . . 296--315
                    Pascal Weil   Closure of varieties of languages under
                                  products with counter  . . . . . . . . . 316--339
              Said Bettayeb and   
                Zevi Miller and   
              I. Hal Sudborough   Embedding grids into hypercubes  . . . . 340--366
               Ian F. Carlstrom   Foreground automata  . . . . . . . . . . 367--384
                     Rod Downey   Nondiamond theorems for polynomial time
                                  reducibility . . . . . . . . . . . . . . 385--395
                    Daniel Krob   Models of a K-rational identity system   396--434
                Li-Yan Yuan and   
             Z. Meral Ozsoyoglu   Design of desirable relational database
                                  schemes  . . . . . . . . . . . . . . . . 435--470
            Zoran Obradovic and   
                   Ian Parberry   Computing with discrete multi-valued
                                  neurons  . . . . . . . . . . . . . . . . 471--492
                  U. Schmid and   
                  J. Blieberger   Some investigations on FCFS scheduling
                                  in hard real time applications . . . . . 493--512
                      Anonymous   Author index for volume 45 . . . . . . . 513--513


Journal of Computer and System Sciences
Volume 46, Number 1, February, 1993

           Rodney R. Howell and   
            Louis E. Rosier and   
                   Hsu-Chun Yen   Normal and sinkless petri nets . . . . . 1--26
                   Klaus Jansen   The interconnection problem  . . . . . . 27--38
                Wojciech Ziarko   Variable precision rough set model . . . 39--59
                D. Janssens and   
                    M. Lens and   
                   G. Rozenberg   Computation graphs for actor grammars    60--90
         Toshimasa Watanabe and   
                 Akira Nakamura   A minimum $3$-connectivity augmentation
                                  of a graph . . . . . . . . . . . . . . . 91--128

Journal of Computer and System Sciences
Volume 46, Number 2, April, 1993

       András Hajnal and   
             Wolfgang Maass and   
        Pavel Pudlák and   
Márió Szegedy and   
       György Turán   Threshold circuits of bounded depth  . . 129--154
                  J. Dassow and   
              H. Jürgensen   Deterministic soliton automata with at
                                  most one cycle . . . . . . . . . . . . . 155--197
           Santosh S. Venkatesh   Directed drift: a new linear threshold
                                  algorithm for learning binary weights
                                  on-line  . . . . . . . . . . . . . . . . 198--217
            Bruno Courcelle and   
           Joost Engelfriet and   
             Grzegorz Rozenberg   Handle-rewriting hypergraph grammars . . 218--270

Journal of Computer and System Sciences
Volume 46, Number 3, June, 1993

          Joëlle Cohen and   
           Dominique Perrin and   
                  Jean-Eric Pin   On the expressive power of temporal
                                  logic  . . . . . . . . . . . . . . . . . 271--294
          Mitsunori Ogiwara and   
            Lane A. Hemachandra   A complexity theory for feasible closure
                                  properties . . . . . . . . . . . . . . . 295--325
                 S. S. Ravi and   
                 Errol L. Lloyd   Graph theoretic analysis of PLA folding
                                  heuristics . . . . . . . . . . . . . . . 326--348
             Judy Goldsmith and   
             Deborah Joseph and   
                     Paul Young   A note on bi-immunity and $p$-closeness
                                  of $p$-cheatable sets in P/poly  . . . . 349--362
        Lane A. Hemachandra and   
                 Albrecht Hoeno   Collapsing degrees via strong
                                  computation  . . . . . . . . . . . . . . 363--380
           Stephen L. Bloom and   
      Zoltán Ésik   Matrix and matricial iteration theories,
                                  Part I . . . . . . . . . . . . . . . . . 381--408
           Stephen L. Bloom and   
      Zoltán Ésik   Matrix and matricial iteration theories,
                                  Part II  . . . . . . . . . . . . . . . . 409--439
                      Anonymous   Author index for volume 46 . . . . . . . 440--440


Journal of Computer and System Sciences
Volume 47, Number 1, August, 1993

               Ashok K. Chandra   Editor's foreword  . . . . . . . . . . . 1--1
            Simona R. Cohen and   
                   Ouri Wolfson   Why a single parallelization strategy is
                                  not enough in knowledge bases  . . . . . 2--44
           Theodore Johnson and   
                  Dennis Shasha   B-trees with inserts and deletes: Why
                                  free-at-empty is better than
                                  merge-at-half  . . . . . . . . . . . . . 45--76
              Michael Kifer and   
                       James Wu   A logic for programming with complex
                                  objects  . . . . . . . . . . . . . . . . 77--120
               Richard Hull and   
                     Jianwen Su   Algebraic and calculus query languages
                                  for recursively typed complex objects    121--156
               William E. Weihl   The impact of recovery on concurrency
                                  control  . . . . . . . . . . . . . . . . 157--184
               Allen Van Gelder   The alternating fixpoint of logic
                                  programs with negation . . . . . . . . . 185--221
         Raghu Ramakrishnan and   
             Yehoshua Sagiv and   
          Jeffrey D. Ullman and   
                 Moshe Y. Vardi   Logical query optimization by proof-tree
                                  transformation . . . . . . . . . . . . . 222--248

Journal of Computer and System Sciences
Volume 47, Number 2, October, 1993

                   Dexter Kozen   Editor's foreword  . . . . . . . . . . . 249--249
                   Michael Luby   Removing randomness in parallel
                                  computation without a processor penalty  250--286
           David McAllester and   
         Prakash Panangaden and   
              Vasant Shanbhogue   Nonexpressibility of fairness and
                                  signaling  . . . . . . . . . . . . . . . 287--321
László Lovasz and   
                   Michael Saks   Communication complexity and
                                  combinatorial lattice theory . . . . . . 322--349
 János Komlós and   
               Ramamohan Paturi   Effect of connectivity in an associative
                                  memory model . . . . . . . . . . . . . . 350--373

Journal of Computer and System Sciences
Volume 47, Number 3, December, 1993

                Harold N. Gabow   Editor's Foreword  . . . . . . . . . . . 375--375
            J. Håstad and   
              A. W. Schrift and   
                      A. Shamir   The discrete logarithm modulo a
                                  composite hides $ 0 (n) $ Bits . . . . . 376--404
                  Mario Szegedy   Functions with bounded symmetric
                                  communication complexity, programs over
                                  commutative monoids, and ACC . . . . . . 405--423
         Michael L. Fredman and   
                 Dan E. Willard   Surpassing the information theoretic
                                  bound with fusion trees  . . . . . . . . 424--436
                 Ketan Mulmuley   Output sensitive and dynamic
                                  constructions of higher order Voronoi
                                  diagrams and levels in arrangements  . . 437--458
              Ming-Yang Kao and   
                Philip N. Klein   Towards overcoming the
                                  transitive-closure bottleneck: Efficient
                                  parallel algorithms for planar digraphs  459--500
              Robert Cypher and   
                C. Greg Plaxton   Deterministic sorting in nearly
                                  logarithmic time on the hypercube and
                                  related computers  . . . . . . . . . . . 501--548
                Manuel Blum and   
               Michael Luby and   
               Ronitt Rubinfeld   Self-testing/correcting with
                                  applications to numerical problems . . . 549--595
                      Anonymous   Author index for volume 47 . . . . . . . 596--596


Journal of Computer and System Sciences
Volume 48, Number 1, February, 1994

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
Mihály Geréb-Graus and   
                        Ming Li   Three one-way heads cannot do string
                                  matching . . . . . . . . . . . . . . . . 1--8
              Stephen J. Hegner   Unique complements and decompositions of
                                  database schemata  . . . . . . . . . . . 9--57
           Joost Engelfriet and   
                   Linda Heyker   Hypergraph languages of bounded degree   58--89
            Guy E. Blelloch and   
                James J. Little   Parallel solutions to geometric problems
                                  in the scan model of computation . . . . 90--115
          Stephen A. Fenner and   
           Lance J. Fortnow and   
                Stuart A. Kurtz   Gap-definable counting classes . . . . . 116--148
                    Jarkko Kari   Reversibility and surjectivity problems
                                  of cellular automata . . . . . . . . . . 149--182
                 Jin-yi Cai and   
                Anne Condon and   
              Richard J. Lipton   PSPACE is provable by two provers in one
                                  round  . . . . . . . . . . . . . . . . . 183--193
                  Noga Alon and   
                   Pavel Pudlak   Superconcentrators of depths 2 and 3;
                                  odd levels help (rarely) . . . . . . . . 194--202

Journal of Computer and System Sciences
Volume 48, Number 2, April, 1994

                  Leong Kwan Li   Learning fixed point patterns by
                                  recurrent networks . . . . . . . . . . . 203--213
               Omer Berkman and   
                    Uzi Vishkin   Finding level-ancestors in trees . . . . 214--230
      Martin Dietzfelbinger and   
        Miroslaw Kutylowski and   
          Rüdiger Reischuk   Exact lower time bounds for computing
                                  Boolean functions on CREW PRAMs  . . . . 231--254
               Marco Cadoli and   
             Maurizio Lenzerini   The complexity of propositional closed
                                  world reasoning and circumscription  . . 255--310
           Gyora M. Benedek and   
                      Alon Itai   Nonuniform learnability  . . . . . . . . 311--323
               Steven Homer and   
             Luc Longpré   On reductions of NP sets to sparse sets  324--336
                  D. R. Stinson   Combinatorial Techniques for Universal
                                  Hashing  . . . . . . . . . . . . . . . . 337--346
              Kai-Yeung Siu and   
                 Amir Dembo and   
                 Thomas Kailath   On the perceptron learning algorithm on
                                  data with high precision . . . . . . . . 347--356
                 Alan L. Selman   A taxonomy of complexity classes of
                                  functions  . . . . . . . . . . . . . . . 357--381

Journal of Computer and System Sciences
Volume 48, Number 3, June, 1994

             Mihalis Yannakakis   Editor's foreword  . . . . . . . . . . . 383--383
              Marshall Bern and   
             David Eppstein and   
                   John Gilbert   Provably good mesh generation  . . . . . 384--409
                  Amos Fiat and   
               Yuval Rabani and   
                  Yiftach Ravid   Competitive $k$-server algorithms  . . . 410--428
                 C. Andrew Neff   Specified precision polynomial root
                                  isolation is in NC . . . . . . . . . . . 429--463
          Michael J. Kearns and   
             Robert E. Schapire   Efficient distribution-free learning of
                                  probabilistic concepts . . . . . . . . . 464--497
      Christos H. Papadimitriou   On the complexity of the parity argument
                                  and other inefficient proofs of
                                  existence  . . . . . . . . . . . . . . . 498--532
         Michael L. Fredman and   
                 Dan E. Willard   Trans-dichotomous algorithms for minimum
                                  spanning trees and shortest paths  . . . 533--551
                      Anonymous   Author index for volume 48 . . . . . . . 552--552


Journal of Computer and System Sciences
Volume 49, Number 1, August, 1994

                      Anonymous   Editorial Board  . . . . . . . . . . . . i--i
                 Seinosuke Toda   Simple characterizations of P(#P) and
                                  complete problems  . . . . . . . . . . . 1--17
                  Tadakazu Sato   Group structured linear cellular
                                  automata over $ \mathbb {Z} m $  . . . . 18--23
              Richard Chang and   
                 Benny Chor and   
             Oded Goldreich and   
            Juris Hartmanis and   
         Johan Håstad and   
                Desh Ranjan and   
                 Pankaj Rohatgi   The random oracle hypothesis is false    24--39
                Takashi Hattori   Time-extraction for temporal logic-logic
                                  programming and local process time . . . 40--56
                     Egon Wanke   The complexity of connectivity problems
                                  on context-free graph languages  . . . . 57--82
             Nicholas Pippenger   Symmetry in self-correcting cellular
                                  automata . . . . . . . . . . . . . . . . 83--95
                Sanjay Jain and   
                    Arun Sharma   Characterizing language identification
                                  by standardizing operations  . . . . . . 96--107
                 Vijay Raghavan   Bounded degree graph inference from
                                  walks  . . . . . . . . . . . . . . . . . 108--132
                 E. Fachini and   
                       A. Monti   A kleene-like characterization of
                                  languages accepted by systolic tree
                                  automata . . . . . . . . . . . . . . . . 133--147

Journal of Computer and System Sciences
Volume 49, Number 2, October, 1994

                 Noam Nisan and   
                  Avi Wigderson   Hardness vs randomness . . . . . . . . . 149--167
            Taishin Nishida and   
                Youichi Kobuchi   Invariant sets for substitution  . . . . 168--174
         Narayanan Krishnakumar   On computing serial dependency relations 175--188
                  John Case and   
                Sanjay Jain and   
                    Arun Sharma   Vacillatory learning of nearly minimal
                                  size grammars  . . . . . . . . . . . . . 189--207
               Amihood Amir and   
              Martin Farach and   
                  Zvi Galil and   
         Raffaele Giancarlo and   
                    Kunsoo Park   Dynamic dictionary matching  . . . . . . 208--222
               Michael Kaminski   A branching time logic with past
                                  operators  . . . . . . . . . . . . . . . 223--246
          Mauricio Karchmer and   
                Ilan Newman and   
                  Mike Saks and   
                  Avi Wigderson   Non-deterministic communication
                                  complexity with few witnesses  . . . . . 247--257
           Joost Engelfriet and   
                   Heiko Vogler   The translation power of top-down
                                  tree-to-graph transducers  . . . . . . . 258--305
               Dexter Kozen and   
              Jens Palsberg and   
        Michael I. Schwartzbach   Efficient inference of partial types . . 306--324
               Vitit Kantabutra   A linear-time near-optimum-length
                                  triangulation algorithm for convex
                                  polygons . . . . . . . . . . . . . . . . 325--333
               Jia-Huai You and   
                    Li Yan Yuan   A three-valued semantics for deductive
                                  databases and logic programs . . . . . . 334--361
                Kai Salomaa and   
                       Sheng Yu   Measures of nondeterminism for pushdown
                                  automata . . . . . . . . . . . . . . . . 362--374
          Zoran Obradovi\'c and   
                   Ian Parberry   Learning with discrete multivalued
                                  neurons  . . . . . . . . . . . . . . . . 375--390
               Kokichi Sugihara   Robust gift wrapping for the
                                  three-dimensional convex hull  . . . . . 391--407
            Leslie Ann Goldberg   Listing graphs that satisfy first-order
                                  sentences  . . . . . . . . . . . . . . . 408--424

Journal of Computer and System Sciences
Volume 49, Number 3, December, 1994

                      Zvi Galil   Editor's foreword  . . . . . . . . . . . 425--425
                 Ketan Mulmuley   An efficient algorithm for hidden
                                  surface removal, II  . . . . . . . . . . 427--453
              Bonnie Berger and   
                John Rompel and   
                  Peter W. Shor   Efficient NC algorithms for set cover
                                  with applications to learning and
                                  geometry . . . . . . . . . . . . . . . . 454--477
             Rajeev Motwani and   
        Joseph (Seffi) Naor and   
                      Moni Naor   The probabilistic method yields
                                  deterministic parallel algorithms  . . . 478--516
        Vijaya Ramachandran and   
                      John Reif   Planarity testing in parallel  . . . . . 517--561
               Miklos Ajtai and   
                  Yuri Gurevich   Datalog vs first-order logic . . . . . . 562--588
                  Mark Fulk and   
                Sanjay Jain and   
             Daniel N. Osherson   Open problems in ``systems that learn''  589--604
                 Jin-yi Cai and   
                Juris Hartmanis   On Hausdorff and topological dimensions
                                  of the Kolmogorov complexity of the real
                                  line . . . . . . . . . . . . . . . . . . 605--619
                    Zhenyu Qian   Another look at parameterization for
                                  order-sorted algebraic specifications    620--666
                 Joan Boyar and   
                  Kim S. Larsen   Efficient rebalancing of chromatic
                                  search trees . . . . . . . . . . . . . . 667--682
                Mark Levene and   
                  George Loizou   The nested universal relation data model 683--717
                   Bruno Durand   The surjectivity problem for 2D cellular
                                  automata . . . . . . . . . . . . . . . . 718--725
                 Minoru Ito and   
               Grant E. Weddell   Implication problems for functional
                                  constraints on databases supporting
                                  complex objects  . . . . . . . . . . . . 726--768
         Michael R. Fellows and   
            Michael A. Langston   On search, decision, and the efficiency
                                  of polynomial-time algorithms  . . . . . 769--779
                      Anonymous   Author index for volume 49 . . . . . . . 780--781


Journal of Computer and System Sciences
Volume 50, Number 1, February, 1995

                K. Kalpakis and   
                       Y. Yesha   On the Power of the Linear Array
                                  Architecture for Performing
                                  Tree-Structured Computations . . . . . . 1--10
               J. Karhumaki and   
              W. Plandowski and   
                      W. Rytter   Polynomial Size Test Sets For
                                  Context-Free Languages . . . . . . . . . 11--19
              S. A. Goldman and   
                   M. J. Kearns   On the Complexity of Teaching  . . . . . 20--31
                    A. Blum and   
             L. Hellerstein and   
                 N. Littlestone   Learning in the Presence of Finitely or
                                  Infinitely Many Irrelevant Attributes    32--40
                  E. Kinber and   
                C. H. Smith and   
          M. Velauthapillai and   
                    R. Wiehagen   On Learning Multiple Concepts in
                                  Parallel . . . . . . . . . . . . . . . . 41--52
                   T. Jiang and   
                 A. Salomaa and   
                 K. Salomaa and   
                          S. Yu   Decision Problems for Patterns . . . . . 53--63
                    I. Parberry   Load Sharing with Parallel Priority
                                  Queues . . . . . . . . . . . . . . . . . 64--73

Journal of Computer and System Sciences
Volume 50, Number 2, April, 1995

                 J. Halpern and   
                B. Awerbuch and   
                   M. Benor and   
                 A. Chandra and   
              J. Feigenbaum and   
            J. Vonzurgathen and   
                  L. Guibas and   
                    L. Pitt and   
                    M. Saks and   
                  D. Shmoys and   
                 D. Sleator and   
                   E. Upfal and   
                U. Vazirani and   
                         A. Yao   Editors' Foreword  . . . . . . . . . . . 189--189
                  R. Beigel and   
                N. Reingold and   
                    D. Spielman   PP Is Closed under Intersection  . . . . 191--202
                    J. Matousek   Approximations and Optimal Geometric
                                  Divide-and-Conquer . . . . . . . . . . . 203--208
              M. Yannakakis and   
                         D. Lee   Testing Finite State Machines: Fault
                                  Detection  . . . . . . . . . . . . . . . 209--227
                T. Leighton and   
                 F. Makedon and   
                 S. Plotkin and   
                   C. Stein and   
                  E. Tardos and   
                   S. Tragoudas   Fast Approximation Algorithms for
                                  Multicommodity Flow Problems . . . . . . 228--243
                 A. Borodin and   
                   S. Irani and   
                P. Raghavan and   
                    B. Schieber   Competitive Paging with Locality of
                                  Reference  . . . . . . . . . . . . . . . 244--258
                    H. N. Gabow   A Matroid Approach to Finding Edge
                                  Connectivity and Packing Arborescences   259--273
                    E. Kaltofen   Effective Noether Irreducibility Forms
                                  and Applications . . . . . . . . . . . . 274--295
                   L. Babai and   
               G. Cooperman and   
             L. Finkelstein and   
                    E. Luks and   
                      A. Seress   Fast Monte Carlo Algorithms for
                                  Permutation Groups . . . . . . . . . . . 296--308
               S. Abiteboul and   
                       V. Vianu   Computing with First-Order Logic . . . . 309--335
               Dana Angluin and   
             Michael Kharitonov   When Won't Membership Queries Help?  . . 336--355

Journal of Computer and System Sciences
Volume 50, Number 3, June, 1995

                    N. Immerman   Editor's Foreword  . . . . . . . . . . . 357--357
                   R. Chang and   
                   J. Kadin and   
                     P. Rohatgi   On Unique Satisfiability and the
                                  Threshold Behavior of Randomized
                                  Reductions . . . . . . . . . . . . . . . 359--373
        D. A. M. Barrington and   
                   H. Straubing   Superlinear Lower Bounds for
                                  Bounded-Width Branching Programs . . . . 374--381
                D. P. Bovet and   
               P. Crescenzi and   
                   R. Silvestri   Complexity Classes and Sparse Oracles    382--390
             P. G. Kolaitis and   
                   M. N. Thakur   Approximation Properties of NP
                                  Minimization Classes . . . . . . . . . . 391--411
                       S. Gupta   Closure Properties and Witness Reduction 412--432
                  M. Grigni and   
                      M. Sipser   Monotone Separation of Logarithmic Space
                                  from Logarithmic Depth . . . . . . . . . 433--437
                        T. Long   Editor's Foreword  . . . . . . . . . . . 439--439
                 M. Beaudry and   
                    P. Mckenzie   Circuits, Matrices, and Nonassociative
                                  Computation  . . . . . . . . . . . . . . 441--455
                   F. Green and   
                  J. Kobler and   
                K. W. Regan and   
              T. Schwentick and   
                       J. Toran   The Power of the Middle Bit of a #P
                                  Function . . . . . . . . . . . . . . . . 456--467
                     R. Gavalda   Bounding the Complexity of Advice
                                  Functions  . . . . . . . . . . . . . . . 468--475
                     P. Rohatgi   Saving Queries with Randomness . . . . . 476--492
                  S. Saluja and   
         K. V. Subrahmanyam and   
                   M. N. Thakur   Descriptive Complexity of #P Functions   493--505
                  A. Condon and   
                      R. Ladner   Interactive Proof Systems with
                                  Polynomially Bounded Strategies  . . . . 506--518
                          M. Li   Editor's Foreword  . . . . . . . . . . . 519--519
              N. H. Bshouty and   
              T. R. Hancock and   
                 L. Hellerstein   Learning Boolean Read-Once Formulas over
                                  Generalized Bases  . . . . . . . . . . . 521--542
                     Y. Mansour   An $ O(n^{\log \log n}) $ Learning
                                  Algorithm for DNF under the Uniform
                                  Distribution . . . . . . . . . . . . . . 543--550
             D. P. Helmbold and   
                  M. K. Warmuth   On Weak Learning . . . . . . . . . . . . 551--573
                   R. Daley and   
          B. Kalyansundaram and   
              M. Velauthapillai   Breaking the Probability 12 Barrier in
                                  FIN-Type Learning  . . . . . . . . . . . 574--599
                  M. Kharitonov   Cryptographic Lower Bounds for
                                  Learnability of Boolean Functions on the
                                  Uniform Distribution . . . . . . . . . . 600--610
                      Anonymous   Author Index for Volume 50 . . . . . . . 611--611


Journal of Computer and System Sciences
Volume 51, Number 1, August, 1995

                       Y. Sagiv   Editor's Foreword  . . . . . . . . . . . 1--1
                 F. Kabanza and   
             J. M. Stevenne and   
                      P. Wolper   Handling Infinite Temporal Data  . . . . 3--17
               R. J. Lipton and   
                 J. F. Naughton   Query Size Estimation by Adaptive
                                  Sampling . . . . . . . . . . . . . . . . 18--25
           P. C. Kanellakis and   
                G. M. Kuper and   
                   P. Z. Revesz   Constraint Query Languages . . . . . . . 26--52
                 D. Agrawal and   
                    A. Elabbadi   Constrained Shared Locks for Increasing
                                  Concurrency in Databases . . . . . . . . 53--63
                  J. S. Schlipf   The Expressive Powers of the Logic
                                  Programming Semantics  . . . . . . . . . 64--86
                  Y. P. Saraiya   On the Efficiency of Transforming
                                  Database Logic Programs  . . . . . . . . 87--109
             P. G. Kolaitis and   
                    M. Y. Vardi   On the Expressive Power of Datalog:
                                  Tools and a Case Study . . . . . . . . . 110--134

Journal of Computer and System Sciences
Volume 51, Number 2, October, 1995

                A. O. Mendelzon   Editor's Foreword  . . . . . . . . . . . 135--135
                S. Seshadri and   
                 J. F. Naughton   On the Expected Size of Recursive
                                  Datalog Queries  . . . . . . . . . . . . 137--148
                S. Grumbach and   
                       V. Vianu   Tractable Query Languages for Complex
                                  Object Databases . . . . . . . . . . . . 149--167
              D. B. Johnson and   
                        L. Raab   A Tight Upper Bound on the Benefits of
                                  Replica Control Protocols  . . . . . . . 168--176
                  F. Afrati and   
           S. S. Cosmadakis and   
                  M. Yannakakis   On Datalog vs Polynomial Time  . . . . . 177--196
                    R. Helm and   
                K. Marriott and   
                     M. Odersky   Spatial Query Optimization: From Boolean
                                  Constraints to Range Queries . . . . . . 197--210
            H. Garciamolina and   
                       K. Salem   Non-deterministic Queue Operations . . . 211--222
                   C. Beeri and   
                        T. Milo   Subtyping in OODBs . . . . . . . . . . . 223--243
                 S. Ganguly and   
                   S. Greco and   
                     C. Zaniolo   Extrema Predicates in Deductive
                                  Databases  . . . . . . . . . . . . . . . 244--259
                   T. Feder and   
                     R. Motwani   Clique Partitions, Graph Compression and
                                  Speeding-Up Algorithms . . . . . . . . . 261--272
                  G. Baliga and   
                    J. Case and   
                        S. Jain   Language Learning with Some Negative
                                  Information  . . . . . . . . . . . . . . 273--285
                    R. Cole and   
                     O. Zajicek   The Expected Advantage of Asynchrony . . 286--300
                  H. H. Ali and   
                    H. Elrewini   An Optimal Algorithm for Scheduling
                                  Interval Ordered Tasks with
                                  Communication on $ N $ Processors  . . . 301--306
                    V. Grolmusz   Separating the Communication
                                  Complexities of MOD $m$ and MOD $p$
                                  Circuits . . . . . . . . . . . . . . . . 307--313
                   J. Desel and   
                     J. Esparza   Shortest Paths in Reachability Graphs    314--323
               F. Blanchetsadri   Some Logical Characterizations of the
                                  Dot-Depth Hierarchy and Applications . . 324--337

Journal of Computer and System Sciences
Volume 51, Number 3, December, 1995

                       W. Maass   Editor's Foreword  . . . . . . . . . . . 339--339
                  Y. Bartal and   
                    A. Fiat and   
                      Y. Rabani   Competitive Algorithms for Distributed
                                  Data Management  . . . . . . . . . . . . 341--358
                  Y. Bartal and   
                    A. Fiat and   
                 H. Karloff and   
                       R. Vohra   New Algorithms for an Ancient Scheduling
                                  Problem  . . . . . . . . . . . . . . . . 359--366
                    A. Blum and   
                      S. Rudich   Fast Learning of $k$-Term DNF Formulas
                                  with Queries . . . . . . . . . . . . . . 367--373
                 M. T. Goodrich   Planar Separators and Parallel Polygon
                                  Triangulation  . . . . . . . . . . . . . 374--389
                    J. Kahn and   
                      J. H. Kim   Entropy and Sorting  . . . . . . . . . . 390--399
                      R. Seidel   On the All-Pairs-Shortest-Path Problem
                                  in Unweighted Undirected Graphs  . . . . 400--403
              T. Imielinski and   
            R. Vandermeyden and   
                K. V. Vadaparty   Complexity Tailored Design: a New Design
                                  Methodology for Databases With
                                  Incomplete Information . . . . . . . . . 405--432
               S. Abiteboul and   
              P. Kanellakis and   
               S. Ramaswamy and   
                      E. Waller   Method Schemas . . . . . . . . . . . . . 433--455
                     C. Seo and   
                     J. Lim and   
                      H. C. Eun   On Comparison and Analysis of Algorithms
                                  for Multiplication in GF$ (2^m) $  . . . 456--459
                  J. Adamek and   
                  E. Nelson and   
                   J. Reiterman   Continuous Algebras Revisited  . . . . . 460--471
                K. Skodinis and   
                       E. Wanke   Emptiness Problems of eNCE Graph
                                  Languages  . . . . . . . . . . . . . . . 472--485
                 C. R. Vela and   
                   A. Bahamonde   The Best Nondeterministic
                                  Representations of Finite Orderings  . . 486--494
                Y. Benasher and   
                      I. Newman   Decision Trees with Boolean Threshold
                                  Queries  . . . . . . . . . . . . . . . . 495--502
                       T. Asano   An $ O(n \log \log n) $ Time Algorithm
                                  for Constructing a Graph of Maximum
                                  Connectivity with Prescribed Degrees . . 503--510
                    N. Creignou   A Dichotomy Theorem for Maximum
                                  Generalized Satisfiability Problems  . . 511--522
                J. Chomicki and   
                    D. Niwinski   On the Feasibility of Checking Temporal
                                  Integrity Constraints  . . . . . . . . . 523--535
                      Anonymous   Author Index for Volume 51 . . . . . . . 536--536


Journal of Computer and System Sciences
Volume 52, Number 1, February, 1996

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

Journal of Computer and System Sciences
Volume 52, Number 2, April, 1996

                 Wolfgang Maass   Editor's Foreword  . . . . . . . . . . . 199--199
         Robert E. Schapire and   
                Linda M. Sellie   Learning Sparse Multivariate Polynomials
                                  over a Field with Queries and
                                  Counterexamples  . . . . . . . . . . . . 201--213
              Martin Kummer and   
                  Frank Stephan   On the Structure of Degrees of
                                  Inferability . . . . . . . . . . . . . . 214--238
              Hans Ulrich Simon   General Bounds on the Number of Examples
                                  Needed for Learning Probabilistic
                                  Concepts . . . . . . . . . . . . . . . . 239--254
           Sally A. Goldman and   
               H. David Mathias   Teaching a Smarter Learner . . . . . . . 255--267
           Nader H. Bshouty and   
           Sally A. Goldman and   
          Thomas R. Hancock and   
                  Sleiman Matar   Asking Questions to Minimize Errors  . . 268--286
           Ajay D. Kshemkalyani   Temporal Interactions of Intervals in
                                  Distributed Systems  . . . . . . . . . . 287--298
               Amihood Amir and   
                Gary Benson and   
                  Martin Farach   Let Sleeping Files Lie: Pattern Matching
                                  in Z-Compressed Files  . . . . . . . . . 299--307
             Rainer Schuler and   
              Tomoyuki Yamakami   Structural Average Case Complexity . . . 308--327
             Vijay K. Vaishnavi   On $k$-Dimensional Balanced Binary Trees 328--348
                Gavin J. Gibson   Exact Classification with Two-Layer
                                  Neural Nets  . . . . . . . . . . . . . . 349--356
               Marc Andries and   
                  Jan Paredaens   On Instance-Completeness for Database
                                  Query Languages involving Object
                                  Creation . . . . . . . . . . . . . . . . 357--373
               Shao C. Fang and   
           Santosh S. Venkatesh   Learning Binary Perceptrons Perfectly
                                  Efficiently  . . . . . . . . . . . . . . 374--389

Journal of Computer and System Sciences
Volume 52, Number 3, June, 1996

            William Gasarch and   
                        Ming Li   Editors' Foreword  . . . . . . . . . . . 391--391
                Sanjay Jain and   
                    Arun Sharma   The Intrinsic Complexity of Language
                                  Identification . . . . . . . . . . . . . 393--402
              Martin Kummer and   
                  Frank Stephan   Inclusion Problems in Parallel Learning
                                  and Games  . . . . . . . . . . . . . . . 403--420
           Nader H. Bshouty and   
              Richard Cleve and   
           Ricard Gavald\`a and   
             Sampath Kannan and   
                Christino Tamon   Oracles and Queries That Are Sufficient
                                  for Exact Learning . . . . . . . . . . . 421--433
          Peter L. Bartlett and   
             Philip M. Long and   
           Robert C. Williamson   Fat-Shattering and the Learnability of
                                  Real-Valued Functions  . . . . . . . . . 434--452
            David P. Dobkin and   
        Dimitrios Gunopulos and   
                 Wolfgang Maass   Computing the Maximum Bichromatic
                                  Discrepancy, with Applications to
                                  Computer Graphics and Machine Learning   453--470
            Michael Frazier and   
              Sally Goldman and   
                Nina Mishra and   
                   Leonard Pitt   Learning from a Consistently Ignorant
                                  Teacher  . . . . . . . . . . . . . . . . 471--492
                  Catriel Beeri   Editor's Foreword  . . . . . . . . . . . 493--493
                   Limsoon Wong   Normal Forms and Conservative Extension
                                  Properties for Query Languages over
                                  Collection Types . . . . . . . . . . . . 495--505
             Shinichi Morishita   An Extension of Van Gelder's Alternating
                                  Fixpoint to Magic Programs . . . . . . . 506--521
                Tirza Hirst and   
                    David Harel   Completeness Results for Recursive Data
                                  Bases  . . . . . . . . . . . . . . . . . 522--536
        Jan Van den Bussche and   
             Dirk van Gucht and   
               Gottfried Vossen   Reflective Programming in the Relational
                                  Algebra  . . . . . . . . . . . . . . . . 537--549
              Peter J. Haas and   
        Jeffrey F. Naughton and   
                S. Seshadri and   
                  Arun N. Swami   Selectivity and Cost Estimation for
                                  Joins Based on Random Sampling . . . . . 550--569
   Stéphane Grumbach and   
                      Tova Milo   Towards Tractable Algebras for Bags  . . 570--588
           Paris Kanellakis and   
          Sridhar Ramaswamy and   
         Darren E. Vengroff and   
           Jeffrey Scott Vitter   Indexing for Data Models with
                                  Constraints and Classes  . . . . . . . . 589--612
                      Anonymous   Author Index for Volume 52 . . . . . . . 613--613


Journal of Computer and System Sciences
Volume 53, Number 1, August, 1996

                  Narayan Vikas   An $ O(n) $ Algorithm for Abelian
                                  $p$-Group Isomorphism and an $ O(n \log
                                  n)$ Algorithm for Abelian Group
                                  Isomorphism  . . . . . . . . . . . . . . 1--9
            Jeffrey Shallit and   
                 Yuri Breitbart   Automaticity I: Properties of a Measure
                                  of Descriptional Complexity  . . . . . . 10--25
              Ganesh Baliga and   
                      John Case   Learnability: Admissible, Co-Finite, and
                                  Hypersimple Languages  . . . . . . . . . 26--32
                   Frank Drewes   Language Theoretic and Algorithmic
                                  Properties of $d$-dimensional Collages
                                  and Patterns in a Grid . . . . . . . . . 33--60
               Shlomo Moran and   
            Gadi Taubenfeld and   
                     Irit Yadin   Concurrent Counting  . . . . . . . . . . 61--78
                 Detlef Sieling   New Lower Bounds and Hierarchy Results
                                  for Restricted Branching Programs  . . . 79--87
              Steffen Lange and   
                Thomas Zeugmann   Incremental Learning from Positive Data  88--103
              Faith E. Fich and   
        Russell Impagliazzo and   
               Bruce Kapron and   
               Valerie King and   
            Miroslaw Kutylowski   Limits on the Power of Parallel Random
                                  Access Machines with Weak Forms of Write
                                  Conflict Resolution  . . . . . . . . . . 104--111
                       Feng Gao   Towards Structured Parallel Computing on
                                  Architecture-Independent Parallel
                                  Algorithm Design for Distributed-Memory
                                  Architectures  . . . . . . . . . . . . . 112--128
            Harold N. Gabow and   
                        Ying Xu   Efficient Theoretic and Practical
                                  Algorithms for Linear Matroid
                                  Intersection Problems  . . . . . . . . . 129--147
                  Paul F. Dietz   A Space Efficient Variant of Path
                                  Copying for Partially Persistent Sorted
                                  Sets . . . . . . . . . . . . . . . . . . 148--152

Journal of Computer and System Sciences
Volume 53, Number 2, October, 1996

                   Steven Homer   Editor's Foreword  . . . . . . . . . . . 153--153
           Manindra Agrawal and   
                Somenath Biswas   Polynomial-Time Isomorphism of $ 1 - L
                                  $-Complete Sets  . . . . . . . . . . . . 155--160
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   On Limited Nondeterminism and the
                                  Complexity of the V--C Dimension . . . . 161--170
          Mitsunori Ogihara and   
            Thomas Thierauf and   
             Seinosuke Toda and   
                 Osamu Watanabe   On Closure Properties of $ \# P $ in the
                                  Context of $ P F \cdot \# P $  . . . . . 171--179
                Tirza Hirst and   
                    David Harel   Taking It to the Limit: On Infinite
                                  Variants of NP-Complete Problems . . . . 180--193
         Edith Hemaspaandra and   
             Ashish V. Naik and   
          Mitsunori Ogihara and   
                 Alan L. Selman   P-Selective Sets and Reducing Search to
                                  Decision vs Self-Reducibility  . . . . . 194--209
              Harry Buhrman and   
                Leen Torenvliet   P-Selective Self-Reducible Sets: a New
                                  Characterization of P  . . . . . . . . . 210--217
          Patrick W. Dymond and   
              Faith E. Fich and   
            Naomi Nishimura and   
            Prabhakar Ragde and   
                Walter L. Ruzzo   Pointers versus Arithmetic in PRAMs  . . 218--232
              Uwe Schöning   Editor's Foreword: Special Issue on the
                                  9th Annual Structure in Complexity
                                  Theory Conference in Amsterdam, June
                                  28--July 1, 1994 . . . . . . . . . . . . 233--233
            Steven M. Kautz and   
            Peter Bro Miltersen   Relative to a Random Oracle, NP Is Not
                                  Small  . . . . . . . . . . . . . . . . . 235--250
            Gábor Tardos   Multi-prover Encoding Schemes and
                                  Three-prover Proof Systems . . . . . . . 251--260
              Harry Buhrman and   
                  Pekka Orponen   Random Strings Make Hard Instances . . . 261--266
               Manindra Agrawal   On the Isomorphism Conjecture for Weak
                                  Reducibilities . . . . . . . . . . . . . 267--282
           Kevin J. Compton and   
              Erich Grädel   Logical Definability of Counting
                                  Functions  . . . . . . . . . . . . . . . 283--297
                  Richard Chang   On the Query Complexity of Clique Size
                                  and Maximum Satisfiability . . . . . . . 298--313

Journal of Computer and System Sciences
Volume 53, Number 3, December, 1996

                      Anonymous   Editors' Foreword  . . . . . . . . . . . 315--315
           Michael Mitzenmacher   Bounds on the Greedy Routing Algorithm
                                  for Array Networks . . . . . . . . . . . 317--327
            Eric J. Schwabe and   
              Ian M. Sutherland   Improved Parity-Declustered Layouts for
                                  Disk Arrays  . . . . . . . . . . . . . . 328--343
           Margaret Reid-Miller   List Ranking and List Scan on the Cray
                                  C90  . . . . . . . . . . . . . . . . . . 344--356
              Bhaskar Ghosh and   
               S. Muthukrishnan   Dynamic Load Balancing by Random
                                  Matchings  . . . . . . . . . . . . . . . 357--370
                   Hisao Tamaki   Construction of the Mesh and the Torus
                                  Tolerating a Large Number of Faults  . . 371--379
                    M. Leoncini   On the Parallel Complexity of Gaussian
                                  Elimination with Pivoting  . . . . . . . 380--394
              Shay Halperin and   
                      Uri Zwick   An Optimal Randomised Logarithmic Time
                                  Connectivity Algorithm for the EREW PRAM 395--416
         Phillip B. Gibbons and   
               Yossi Matias and   
            Vijaya Ramachandran   Efficient Low-Contention Parallel
                                  Algorithms . . . . . . . . . . . . . . . 417--442
              Carlo Meghini and   
              Costantino Thanos   An Optimal Predicate Locking Scheduler   443--468
                 Andreas Goerdt   A Threshold for Unsatisfiability . . . . 469--486
                  Lila Kari and   
               Gabriel Thierrin   Maximal and Minimal Solutions to
                                  Language Equations . . . . . . . . . . . 487--496
               Thomas Eiter and   
                  Georg Gottlob   The Complexity of Nested Counterfactuals
                                  and Iterated Knowledge Base Revisions    497--512
                  Tao Jiang and   
                        Ming Li   $k$ One-Way Heads Cannot Do
                                  String-Matching  . . . . . . . . . . . . 513--524
           Jean R. S. Blair and   
                 Errol L. Lloyd   River Routing with a Generalized Model   525--544
               Suresh Chari and   
                 Pankaj Rohatgi   On Completeness under Random Reductions  545--555
           Joost Engelfriet and   
            Vincent van Oostrom   Regular Description of Context-free
                                  Graph Languages  . . . . . . . . . . . . 556--574
    Jerzy W. Grzymala-Busse and   
                       Soe Than   Partition Triples: a Tool for Reduction
                                  of Data Sets . . . . . . . . . . . . . . 575--582
                    Sanjay Jain   Program Synthesis in the Presence of
                                  Infinite Number of Inaccuracies  . . . . 583--591
                      Anonymous   Author Index for Volume 53 . . . . . . . 592--592


Journal of Computer and System Sciences
Volume 54, Number 1, February, 1997

                   Ronald Fagin   Editor's Foreword  . . . . . . . . . . . 1--1
              Catriel Beeri and   
                      Tova Milo   Comparison of Functional and Predicative
                                  Query Paradigms  . . . . . . . . . . . . 3--33
        Jan Van den Bussche and   
                 Dirk Van Gucht   A Semideterministic Approach to Object
                                  Creation and Nondeterminism in Database
                                  Queries  . . . . . . . . . . . . . . . . 34--47
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   Tie-Breaking Semantics and Structural
                                  Totality . . . . . . . . . . . . . . . . 48--60
          Surajit Chaudhuri and   
                 Moshe Y. Vardi   On the Equivalence of Recursive and
                                  Nonrecursive Datalog Programs  . . . . . 61--78
            Kenneth A. Ross and   
                 Yehoshua Sagiv   Monotonic Aggregation in Deductive
                                  Databases  . . . . . . . . . . . . . . . 79--97
          Gösta Grahne and   
       Alberto O. Mendelzon and   
                Peter Z. Revesz   Knowledgebase Transformations  . . . . . 98--112
             Ron van der Meyden   The Complexity of Querying Indefinite
                                  Data about Linearly Ordered Domains  . . 113--135
          Anthony J. Bonner and   
              Tomasz Imielinski   Reusing and Modifying Rulebases by
                                  Predicate Substitution . . . . . . . . . 136--166
                 Wolfgang Maass   Editor's Foreword  . . . . . . . . . . . 167--167
            Marek Karpinski and   
                Angus Macintyre   Polynomial Bounds for VC Dimension of
                                  Sigmoidal and General Pfaffian Neural
                                  Networks . . . . . . . . . . . . . . . . 169--176
                  Pascal Koiran   A Weak Version of the Blum, Shub, and
                                  Smale Model  . . . . . . . . . . . . . . 177--189
              Pascal Koiran and   
              Eduardo D. Sontag   Neural Networks with Quadratic VC
                                  Dimension  . . . . . . . . . . . . . . . 190--198
   György Turán and   
                  Farrokh Vatan   On the Computation of Boolean Functions
                                  by Analog Circuits of Bounded Fan-In . . 199--212

Journal of Computer and System Sciences
Volume 54, Number 2, April, 1997

                 Michael Sipser   Editor's Foreword  . . . . . . . . . . . 213--213
               Dror Lapidot and   
                     Adi Shamir   Fully Parallelized Multi-prover
                                  Protocols for NEXP-Time  . . . . . . . . 215--220
         Jaikumar Radhakrishnan   Better Lower Bounds for Monotone
                                  Threshold Formulas . . . . . . . . . . . 221--226
          Donald B. Johnson and   
             Panagiotis Metaxas   Connected Components in $ O(\log^{3 / 2}
                                  n) $ Parallel Time for the CREW PRAM . . 227--242
                  Zvi Galil and   
                  Oded Margalit   All Pairs Shortest Paths for Graphs with
                                  Small Integer Length Edges . . . . . . . 243--254
                  Noga Alon and   
                  Zvi Galil and   
                  Oded Margalit   On the Exponent of the All Pairs
                                  Shortest Path Problem  . . . . . . . . . 255--262
                  David Epstein   Editor's Foreword  . . . . . . . . . . . 263--263
               Tom Leighton and   
                    Yuan Ma and   
                C. Greg Plaxton   Breaking the $ \Theta (n \log^2 n) $
                                  Barrier for Sorting with Faults  . . . . 265--304
                    Uriel Feige   A Spectrum of Time-Space Trade-offs for
                                  Undirected $s$--$t$ Connectivity . . . . 305--316
              Sanjeev Arora and   
 László Babai and   
              Jacques Stern and   
                     Z. Sweedyk   The Hardness of Approximate Optima in
                                  Lattices, Codes, and Systems of Linear
                                  Equations  . . . . . . . . . . . . . . . 317--331
       Charles E. Leiserson and   
                 Satish Rao and   
                   Sivan Toledo   Efficient Out-of-Core Algorithms for
                                  Linear Relaxation Using Blocking Covers  332--344
          Amir M. Ben-Amram and   
                      Zvi Galil   When Can We Sort in $ o(n \log n) $
                                  Time?  . . . . . . . . . . . . . . . . . 345--370
              Avrim L. Blum and   
               Ravindran Kannan   Learning an Intersection of a Constant
                                  Number of Halfspaces over a Uniform
                                  Distribution . . . . . . . . . . . . . . 371--380

Journal of Computer and System Sciences
Volume 54, Number 3, June, 1997

                  Eric Allender   Editor's Foreword  . . . . . . . . . . . 381--381
               Manindra Agrawal   DSPACE($n$) $ = ?$ NSPACE($n$): a Degree
                                  Theoretic Characterization . . . . . . . 383--392
              Harry Buhrman and   
               Elvira Mayordomo   An Excursion to the Kolmogorov Random
                                  Strings  . . . . . . . . . . . . . . . . 393--399
                Kousha Etessami   Counting Quantifiers, Successor
                                  Relations, and Logarithmic Space . . . . 400--411
                    John Rogers   The Isomorphism Conjecture Holds and
                                  One-Way Functions Exist Relative to an
                                  Oracle . . . . . . . . . . . . . . . . . 412--423
                 James S. Royer   Semantics vs Syntax vs Computations:
                                  Machine Models for Type-2
                                  Polynomial-Time Bounded Functionals  . . 424--436
                  Nicholas Tran   On P-Immunity of Exponential Time
                                  Complete Sets  . . . . . . . . . . . . . 437--440
               Domenico Sacc\`a   The Expressive Powers of Stable Models
                                  for Bound and Unbound DATALOG Queries    441--464
                 Liming Cai and   
                    Jianer Chen   On Fixed-Parameter Tractability and
                                  Approximability of NP Optimization
                                  Problems . . . . . . . . . . . . . . . . 465--474
             Yosi Ben-Asher and   
                    Ilan Newman   Geometric Approach for Optimal Routing
                                  on a Mesh with Buses . . . . . . . . . . 475--486
               H. David Mathias   A Model of Interactive Teaching  . . . . 487--501
                    Karl Meinke   A Completeness Theorem for the
                                  Expressive Power of Higher-Order
                                  Algebraic Specifications . . . . . . . . 502--519
                      Anonymous   Author Index for Volume 54 . . . . . . . 520--520


Journal of Computer and System Sciences
Volume 55, Number 1, August, 1997

             Richard Beigel and   
               Roberto Tamassia   Guest Editors' Foreword  . . . . . . . . 1--1
        Monika R. Henzinger and   
               Philip Klein and   
                 Satish Rao and   
             Sairam Subramanian   Faster Shortest-Path Algorithms for
                                  Planar Graphs  . . . . . . . . . . . . . 3--23
      Alexander A. Razborov and   
                  Steven Rudich   Natural Proofs . . . . . . . . . . . . . 24--35
            Andrew Chi-Chih Yao   Decision Tree Complexity and Betti
                                  Numbers  . . . . . . . . . . . . . . . . 36--43
               Ramesh Hariharan   Optimal Parallel Suffix Tree
                                  Construction . . . . . . . . . . . . . . 44--69
                    Ming Li and   
            Paul Vitányi   Editors' Foreword  . . . . . . . . . . . 71--71
              Ray J. Solomonoff   The Discovery of Algorithmic Probability 73--88
                    J. Rissanen   Stochastic Complexity in Learning  . . . 89--95
                     V. G. Vovk   Learning about the Parameter of the
                                  Bernoulli Model  . . . . . . . . . . . . 96--104
                Kenji Yamanishi   On-Line Maximum Likelihood Prediction
                                  with Respect to General Loss Functions   105--118
                Yoav Freund and   
             Robert E. Schapire   A Decision-Theoretic Generalization of
                                  On-Line Learning and an Application to
                                  Boosting . . . . . . . . . . . . . . . . 119--139
                Dale Schuurmans   Characterizing Rational versus
                                  Exponential Learning Curves  . . . . . . 140--160
             Leonid Gurvits and   
                  Pascal Koiran   Approximation and Learning of Convex
                                  Superpositions . . . . . . . . . . . . . 161--170
             Shai Ben-David and   
             Michael Lindenbaum   Learning Distributions by Their Density
                                  Levels: A Paradigm for Learning without
                                  a Teacher  . . . . . . . . . . . . . . . 171--182
                  John Case and   
           Susanne Kaufmann and   
                Efim Kinber and   
                  Martin Kummer   Learning Recursive Functions from
                                  Approximations . . . . . . . . . . . . . 183--196

Journal of Computer and System Sciences
Volume 55, Number 2, October, 1997

            Sushant Patnaik and   
                  Neil Immerman   Dyn-FO: a Parallel, Dynamic Complexity
                                  Class  . . . . . . . . . . . . . . . . . 199--209
                 Foto N. Afrati   Bounded Arity fDatalog(/=) Queries on
                                  Graphs . . . . . . . . . . . . . . . . . 210--228
         Christos Faloutsos and   
                  Ibrahim Kamel   Relaxing the Uniformity and Independence
                                  Assumptions Using the Concept of Fractal
                                  Dimension  . . . . . . . . . . . . . . . 229--240
              Leonid Libkin and   
                   Limsoon Wong   Query Languages for Bags and Aggregate
                                  Functions  . . . . . . . . . . . . . . . 241--272
   Stéphane Grumbach and   
                     Jianwen Su   Finitely Representable Databases . . . . 273--298
                  Dan Suciu and   
                     Val Tannen   A Query Language for NC  . . . . . . . . 299--321
                  Dan Suciu and   
                  Jan Paredaens   The Complexity of the Evaluation of
                                  Complex Algebra Expressions  . . . . . . 322--343
            V. Krishnaswamy and   
                 D. Agrawal and   
                J. L. Bruno and   
                   A. El Abbadi   Relative Serializability: an Approach
                                  for Relaxing the Atomicity of
                                  Transactions . . . . . . . . . . . . . . 344--354
          Surajit Chaudhuri and   
            Phokion G. Kolaitis   Can Datalog Be Approximated? . . . . . . 355--369

Journal of Computer and System Sciences
Volume 55, Number 3, December, 1997

           Shafi Goldwasser and   
                S. Rao Kosaraju   Editors' Foreword  . . . . . . . . . . . 371--371
         Rakesh Kumar Sinha and   
           Jayram S. Thathachar   Efficient Oblivious Branching Programs
                                  for Threshold and Mod Functions  . . . . 373--384
               Dan Kleitman and   
               Tom Leighton and   
                        Yuan Ma   On the Design of Reliable Boolean
                                  Circuits That Contain Partially
                                  Unreliable Gates . . . . . . . . . . . . 385--401
            David R. Karger and   
                  Daphne Koller   (De)randomized Construction of Small
                                  Sample Spaces in NC  . . . . . . . . . . 402--413
             Jeffrey C. Jackson   An Efficient Membership-Query Algorithm
                                  for Learning DNF with Respect to the
                                  Uniform Distribution . . . . . . . . . . 414--440
                    Edith Cohen   Size-Estimation Framework with
                                  Applications to Transitive Closure and
                                  Reachability . . . . . . . . . . . . . . 441--453
                  Karsten Weihe   Maximum $ (s, t)$-Flows in Planar
                                  Networks in $ O(|V| \log |V|)$ Time  . . 454--475
               Jean Berstel and   
                     L. Boasson   The Set of Minimal Words of a
                                  Context-free Language is Context-free    477--488
           Joost Engelfriet and   
            Vincent van Oostrom   Logical Description of Context-free
                                  Graph Languages  . . . . . . . . . . . . 489--503
                 Joan Boyar and   
             Rolf Fagerberg and   
                  Kim S. Larsen   Amortization Results for Chromatic
                                  Search Trees, with an Application to
                                  Priority Queues  . . . . . . . . . . . . 504--521
             Eddy Fromentin and   
                  Michel Raynal   Shared Global States in Distributed
                                  Computations . . . . . . . . . . . . . . 522--528
                  G. Y. Yan and   
                A. Albrecht and   
             G. H. F. Young and   
                     C. K. Wong   The Steiner Tree Problem in Orientation
                                  Metrics  . . . . . . . . . . . . . . . . 529--546
       Lane A. Hemaspaandra and   
              Mitsunori Ogihara   Universally Serializable Computation . . 547--560
                      Anonymous   Author Index for Volume 55 . . . . . . . 561--561


Journal of Computer and System Sciences
Volume 56, Number 1, February, 1998

           Seymour Ginsburg and   
                   X. Sean Wang   Regular Sequence Operations and Their
                                  Use in Database Queries  . . . . . . . . 1--26
                  Giorgio Satta   Trading Independent for Synchronized
                                  Parallelism in Finite Copying Parallel
                                  Rewriting Systems  . . . . . . . . . . . 27--45
                  Andreas Weber   Transforming a Single-Valued Transducer
                                  Into a Mealy Machine . . . . . . . . . . 46--59
           Giovanni Manzini and   
                Luciano Margara   Invertible Linear Cellular Automata over
                                  $ \mathbf {Z}_m $:: Algorithmic and
                                  Dynamical Aspects  . . . . . . . . . . . 60--67
             Rajeev Rastogi and   
            Sharad Mehrotra and   
             Yuri Breitbart and   
             Henry F. Korth and   
               Avi Silberschatz   On Correctness of Nonserializable
                                  Executions . . . . . . . . . . . . . . . 68--82
    Sanguthevar Rajasekaran and   
                  Shibu Yooseph   TAL Recognition in $ O(M(n^2)) $ Time    83--89
                Pavol Duris and   
        José D. P. Rolim   Lower Bounds on the Multiparty
                                  Communication Complexity . . . . . . . . 90--95
          Richard E. Ladner and   
            Anthony LaMarca and   
                   Ewan Tempero   Counting Protocols for Reliable
                                  End-to-End Transmission  . . . . . . . . 96--111
              Daoud Bshouty and   
               Nader H. Bshouty   On Interpolating Arithmetic Read-Once
                                  Formulas with Exponentiation . . . . . . 112--124
               Juha Kortelainen   Remarks about Commutative Context-Free
                                  Languages  . . . . . . . . . . . . . . . 125--129

Journal of Computer and System Sciences
Volume 56, Number 2, April, 1998

              Robert E. Shapire   Guest Editor's Foreword  . . . . . . . . 131--131
                   Dana Ron and   
               Yoram Singer and   
                 Naftali Tishby   On the Learnability and Usage of Acyclic
                                  Probabilistic Finite Automata  . . . . . 133--152
                        V. Vovk   A Game of Prediction with Expert Advice  153--173
          Peter L. Bartlett and   
                 Philip M. Long   Prediction, Learning, Uniform
                                  Convergence, and Scale-Sensitive
                                  Dimensions . . . . . . . . . . . . . . . 174--190
             Javed A. Aslam and   
               Scott E. Decatur   Specification and Simulation of
                                  Statistical Query Algorithms for
                                  Efficiency and Noise Tolerance . . . . . 191--208
                 Avrim Blum and   
           Prasad Chalasani and   
           Sally A. Goldman and   
                Donna K. Slonim   Learning with Unreliable Boundary
                                  Queries  . . . . . . . . . . . . . . . . 209--222
              Jeong Han Kim and   
                 James R. Roche   Covering Cubes by Random Half Cubes,
                                  with Applications to Binary Neural
                                  Networks . . . . . . . . . . . . . . . . 223--252

Journal of Computer and System Sciences
Volume 56, Number 3, June, 1998

                Lucian Ilie and   
                   Arto Salomaa   $2$-Testability and Relabelings Produce
                                  Everything . . . . . . . . . . . . . . . 253--262
              Christer Berg and   
                Staffan Ulfberg   A Lower Bound for Perceptrons and an
                                  Oracle Separation of the PP$^{PH}$
                                  Hierarchy  . . . . . . . . . . . . . . . 263--271
                    Arun Sharma   A Note on Batch and Incremental
                                  Learnability . . . . . . . . . . . . . . 272--276
             Shai Ben-David and   
                 Eli Dichterman   Learning with Restricted Focus of
                                  Attention  . . . . . . . . . . . . . . . 277--298
 Francesco Mario Malvestuto and   
               Marina Moscarini   A Fast Algorithm for Query Optimization
                                  in Universal-Relation Databases  . . . . 299--309
              Nader Bshouty and   
               Lisa Hellerstein   Attribute-Efficient Learning in Query
                                  and Mistake-Bound Models . . . . . . . . 310--319
                       Lin Chen   Optimal Circular Arc Representations:
                                  Properties, Recognition, and
                                  Construction . . . . . . . . . . . . . . 320--331
           Joost Engelfriet and   
                   Heiko Vogler   The Equivalence of Bottom-Up and
                                  Top-Down Tree-to-Graph Transducers . . . 332--356
                      Anonymous   Author Index for Volume 56 . . . . . . . 357--357


Journal of Computer and System Sciences
Volume 57, Number 1, August, 1998

                Harold N. Gabow   Guest Editor's Foreword  . . . . . . . . 1--1
                 Paul Beame and   
               Stephen Cook and   
               Jeff Edmonds and   
        Russell Impagliazzo and   
                Toniann Pitassi   The Relative Complexity of NP Search
                                  Problems . . . . . . . . . . . . . . . . 3--19
                P. Diaconis and   
                L. Saloff-Coste   What Do We Know about the Metropolis
                                  Algorithm? . . . . . . . . . . . . . . . 20--36
        Peter Bro Miltersen and   
                 Noam Nisan and   
               Shmuel Safra and   
                  Avi Wigderson   On Data Structures and Asymmetric
                                  Communication Complexity . . . . . . . . 37--49
           Lydia E. Kavraki and   
        Jean-Claude Latombe and   
             Rajeev Motwani and   
             Prabhakar Raghavan   Randomized Query Processing in Robot
                                  Path Planning  . . . . . . . . . . . . . 50--60
              Jon Kleinberg and   
              Éva Tardos   Approximations for the Disjoint Paths
                                  Problem in High-Diameter Planar Networks 61--73
             Arne Andersson and   
             Torben Hagerup and   
             Stefan Nilsson and   
                   Rajeev Raman   Sorting in Linear Time?  . . . . . . . . 74--93
        Thomas A. Henzinger and   
             Peter W. Kopke and   
                  Anuj Puri and   
                 Pravin Varaiya   What's Decidable about Hybrid Automata?  94--124

Journal of Computer and System Sciences
Volume 57, Number 2, October, 1998

                 Jin-Yi Cai and   
                    Alan Selman   Editors' Foreword  . . . . . . . . . . . 125--125
           Manindra Agrawal and   
              Eric Allender and   
                  Steven Rudich   Reductions in Circuit Complexity: an
                                  Isomorphism Theorem and a Gap Theorem    127--143
                Ian Barland and   
        Phokion G. Kolaitis and   
             Madhukar N. Thakur   Integer Programming as a Framework for
                                  Optimization and Approximability . . . . 144--161
             Samuel R. Buss and   
                Toniann Pitassi   Good Degree Bounds on Nullstellensatz
                                  Refutations of the Induction Principle   162--171
                  Eric Bach and   
                Anne Condon and   
               Elton Glaser and   
                 Celena Tanguay   DNA Models and Algorithms for
                                  NP-Complete Problems . . . . . . . . . . 172--186
                Uriel Feige and   
                     Joe Kilian   Zero Knowledge and the Chromatic Number  187--199
     Hervé Caussinus and   
            Pierre McKenzie and   
       Denis Thérien and   
               Heribert Vollmer   Nondeterministic NC$^1$ Computation  . . 200--212
           Dieter van Melkebeek   Deterministic and Randomized Bounded
                                  Truth-Table Reductions of P, NL, and L
                                  to Sparse Sets . . . . . . . . . . . . . 213--232

Journal of Computer and System Sciences
Volume 57, Number 3, December, 1998

                Serge Abiteboul   Guest Editor's Foreword  . . . . . . . . 233--233
             Anthony Bonner and   
            Giansalvatore Mecca   Sequences, Datalog, and Transducers  . . 234--259
          Vinay K. Chaudhri and   
              Vassos Hadzilacos   Safe Locking Policies for Dynamic
                                  Databases  . . . . . . . . . . . . . . . 260--271
         Mariano P. Consens and   
                      Tova Milo   Algebras for Querying Text Regions:
                                  Expressive Power and Optimization  . . . 272--288
                Guozhu Dong and   
                     Jianwen Su   Arity Bounds in First-Order Incremental
                                  Evaluation and Definition of Polynomial
                                  Time Database Queries  . . . . . . . . . 289--308
                Idit Keidar and   
                    Danny Dolev   Increasing the Resilience of Distributed
                                  and Replicated Database Systems  . . . . 309--324
           Philippe Picouet and   
                   Victor Vianu   Semantics and Expressiveness Issues in
                                  Active Databases . . . . . . . . . . . . 325--355
                    Sanjay Jain   Learning with Refutation . . . . . . . . 356--365
             Torben Hagerup and   
           Jyrki Katajainen and   
            Naomi Nishimura and   
                Prabhakar Ragde   Characterizing Multiterminal Flow
                                  Networks and Computing Flows in Networks
                                  of Small Treewidth . . . . . . . . . . . 366--375
                 Peter Auer and   
             Philip M. Long and   
             Aravind Srinivasan   Approximating Hyper-Rectangles: Learning
                                  and Pseudorandom Sets  . . . . . . . . . 376--388
              Eugene Asarin and   
                     Oded Maler   Achilles and the Tortoise Climbing Up
                                  the Arithmetical Hierarchy . . . . . . . 389--398
            Leonard J. Schulman   A Three-Party Communication Problem  . . 399--401
                      Anonymous   Author Index for Volume 57 . . . . . . . 402--402


Journal of Computer and System Sciences
Volume 58, Number 1, February, 1999

                   Richard Hull   Editor's Foreword  . . . . . . . . . . . iv--iv
             Takeshi Fukuda and   
          Yasuhiko Morimoto and   
         Shinichi Morishita and   
               Takeshi Tokuyama   Mining Optimized Association Rules for
                                  Numeric Attributes . . . . . . . . . . . 1--12
             H. V. Jagadish and   
       Alberto O. Mendelzon and   
          Inderpal Singh Mumick   Managing Conflicts between Rules . . . . 13--28
          CH. Papadimitriou and   
                   D. Suciu and   
                       V. Vianu   Topological Queries in Spatial Databases 29--53
            Serge Abiteboul and   
               Laurent Herr and   
            Jan Van den Bussche   Temporal Connectives versus Explicit
                                  Timestamps to Query Temporal Databases   54--68
               Alon Y. Levy and   
            Anand Rajaraman and   
              Jeffrey D. Ullman   Answering Queries Using Limited External
                                  Query Processors . . . . . . . . . . . . 69--82
                   Ronald Fagin   Combining Fuzzy Information from
                                  Multiple Systems . . . . . . . . . . . . 83--99
        Monika R. Henzinger and   
               Ronitt Rubinfeld   Editors' Foreword  . . . . . . . . . . . 100--100
                 Avrim Blum and   
                    R. Ravi and   
                Santosh Vempala   A Constant-Factor Approximation
                                  Algorithm for the $k$-MST Problem  . . . 101--108
             Michael Kearns and   
                 Yishay Mansour   On the Boosting Ability of Top-Down
                                  Decision Tree Learning Algorithms  . . . 109--128
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
               Adi Rosén   Characterizing Linear Size Circuits in
                                  Terms of Privacy . . . . . . . . . . . . 129--136
                  Noga Alon and   
               Yossi Matias and   
                  Mario Szegedy   The Space Complexity of Approximating
                                  the Frequency Moments  . . . . . . . . . 137--147
                 Noam Nisan and   
                  Amnon Ta-Shma   Extracting Randomness: a Survey and New
                                  Constructions  . . . . . . . . . . . . . 148--173
               Amir Ben-Dor and   
                Anna Karlin and   
              Nathan Linial and   
                Yuri Rabinovich   A Note on the Influence of an $ \epsilon
                                  $-Biased Random Source . . . . . . . . . 174--176
                Marcus Schaefer   Deciding the Vapnik--Cervonenkis
                                  Dimension is P$ \Sigma^p_3 $-complete    177--182
               Joel Ratsaby and   
                 Vitaly Maiorov   On the Learnability of Rich Function
                                  Classes  . . . . . . . . . . . . . . . . 183--192
              Sanjeev Arora and   
               David Karger and   
                Marek Karpinski   Polynomial Time Approximation Schemes
                                  for Dense Instances of NP-Hard Problems  193--210
                  John Case and   
                   Mark A. Fulk   Maximal Machine Learnable Classes  . . . 211--214
          Gheorghe Antonoiu and   
              Pradip K. Srimani   A Self-Stabilizing Distributed Algorithm
                                  to Find the Median of a Tree Graph . . . 215--221
               Carsten Lund and   
            Steven Phillips and   
                  Nick Reingold   Paging against a Distribution and IP
                                  Networking . . . . . . . . . . . . . . . 222--231
        Leslie Ann Goldberg and   
            Philip D. MacKenzie   Analysis of Practical Backoff Protocols
                                  for Contention Resolution with Multiple
                                  Servers  . . . . . . . . . . . . . . . . 232--258

Journal of Computer and System Sciences
Volume 58, Number 2, April, 1999

          Pankaj K. Agarwal and   
                   Stephen Cook   Guest Editors' Foreword  . . . . . . . . 259--259
                   Robert Beals   Algorithms for Matrix Groups and the
                                  Tits Alternative . . . . . . . . . . . . 260--279
                 Jin-Yi Cai and   
                   D. Sivakumar   Sparse Hard Sets for P: Resolution of a
                                  Conjecture of Hartmanis  . . . . . . . . 280--296
               Tamal K. Dey and   
                   Sumanta Guha   Transforming Curves on Surfaces  . . . . 297--325
                Armin Haken and   
                Stephen A. Cook   An Exponential Lower Bound for the Size
                                  of Monotone Real Circuits  . . . . . . . 326--335
                  Moni Naor and   
                  Omer Reingold   Synthesizers and Their Application to
                                  the Parallel Construction of
                                  Pseudo-Random Functions  . . . . . . . . 336--375
               Michael Saks and   
                     Shiyu Zhou   BP$_H$SPACE(S) $ \subseteq $ DSPACE ($
                                  S^{3 / 2}$)  . . . . . . . . . . . . . . 376--403

Journal of Computer and System Sciences
Volume 58, Number 3, June, 1999

                      Anonymous   Editor's Foreword  . . . . . . . . . . . 405--406
  Christos H. Papadimitriou and   
             Mihalis Yannakakis   On the Complexity of Database Queries    407--427
            Serge Abiteboul and   
                   Victor Vianu   Regular Path Queries with Constraints    428--452
        Giansalvatore Mecca and   
                   Paolo Atzeni   Cut and Paste  . . . . . . . . . . . . . 453--482
               Marc Gyssens and   
        Jan Van den Bussche and   
                 Dirk Van Gucht   Complete Geometric Query Languages . . . 483--511
              Joseph Albert and   
           Yannis Ioannidis and   
             Raghu Ramakrishnan   Equivalence of Keyed Relational Schemas
                                  by Conjunctive Queries . . . . . . . . . 512--534
           Freddy Dumortier and   
               Marc Gyssens and   
             Luc Vandeurzen and   
                 Dirk Van Gucht   On the Decidability of Semilinearity for
                                  Semialgebraic Sets and Its Implications
                                  for Spatial Databases  . . . . . . . . . 535--571
           Jonathan F. Buss and   
        Gudmund S. Frandsen and   
             Jeffrey O. Shallit   The Computational Complexity of Some
                                  Problems of Linear Algebra . . . . . . . 572--596
           Giovanni Manzini and   
                Luciano Margara   Attractors of Linear Cellular Automata   597--610
         Jürgen Dassow and   
                 Victor Mitrana   Stack Cooperation in Multistack Pushdown
                                  Automata . . . . . . . . . . . . . . . . 611--621
                Jianer Chen and   
          Donald K. Friesen and   
                      Hao Zheng   Tight Bound on Johnson's Algorithm for
                                  Maximum Satisfiability . . . . . . . . . 622--640
                  Adam Krawczyk   The Complexity of Finding a Second
                                  Hamiltonian Cycle in Cubic Graphs  . . . 641--647
       Lane A. Hemaspaandra and   
                Jörg Rothe   Creating Strong, Total, Commutative,
                                  Associative One-Way Functions from Any
                                  One-Way Function in Complexity Theory    648--659
                      Anonymous   Author Index for Volume 58 . . . . . . . 660--660


Journal of Computer and System Sciences
Volume 59, Number 1, August, 1999

            Oscar H. Ibarra and   
                     Jianwen Su   A Technique for Proving Decidability of
                                  Containment and Equivalence of Linear
                                  Constraint Queries . . . . . . . . . . . 1--28
             Yuri Breitbart and   
                 Henry F. Korth   Replication and Consistency in a
                                  Distributed Environment  . . . . . . . . 29--69
              Zhixiang Chen and   
                    Foued Ameur   The Learnability of Unions of Two
                                  Rectangles in the Two-Dimensional
                                  Discretized Space  . . . . . . . . . . . 70--83
               Pranay Chaudhuri   A Self-Stabilizing Algorithm for
                                  Detecting Fundamental Cycles in a Graph  84--93
          Marianne Baudinet and   
               Jan Chomicki and   
                  Pierre Wolper   Constraint-Generating Dependencies . . . 94--115
          Gösta Grahne and   
         Matti Nykänen and   
                   Esko Ukkonen   Reasoning about Strings in Databases . . 116--162

Journal of Computer and System Sciences
Volume 59, Number 2, October, 1999

            Joan Feigenbaum and   
                    Alan Selman   Guest Editors' Foreword  . . . . . . . . 163--163
              Eric Allender and   
            Klaus Reinhardt and   
                     Shiyu Zhou   Isolation, Matching, and Counting
                                  Uniform and Nonuniform Upper Bounds  . . 164--181
              Harry Buhrman and   
                  Lance Fortnow   Two Queries  . . . . . . . . . . . . . . 182--194
                Amos Beimel and   
                Anna Gál   On Arithmetic Branching Programs . . . . 195--220
                 Jin-Yi Cai and   
                  Ajay Nerurkar   Approximating the SVP to within a Factor
                                  $ (1 + 1 / \dim \epsilon) $ Is NP-Hard
                                  under Randomized Reductions  . . . . . . 221--239
              Lance Fortnow and   
                    John Rogers   Complexity Limitations on Quantum
                                  Computation  . . . . . . . . . . . . . . 240--252
             Oded Goldreich and   
                    Madhu Sudan   Computational Indistinguishability: a
                                  Sample Hierarchy . . . . . . . . . . . . 253--269
                   D. Sivakumar   On Membership Comparable Sets  . . . . . 270--280
                   John Watrous   Space-Bounded Quantum Complexity . . . . 281--326
              Harry Buhrman and   
           Dieter van Melkebeek   Hard Sets Are Hard to Find . . . . . . . 327--345
                    Ran Raz and   
        Gábor Tardos and   
             Oleg Verbitsky and   
           Nikolai Vereshchagin   Arthur--Merlin Games in Boolean Decision
                                  Trees  . . . . . . . . . . . . . . . . . 346--372

Journal of Computer and System Sciences
Volume 59, Number 3, December, 1999

    Stéphane Gaubert and   
                Alessandro Giua   Petri Net Languages and Infinite Subsets
                                  of $ N^m $ . . . . . . . . . . . . . . . 373--391
          Nicol\`o Cesa-Bianchi   Analysis of Two Gradient-Based
                                  Algorithms for On-Line Regression  . . . 392--411
           Flavio Corradini and   
            Rocco De Nicola and   
                   Anna Labella   Models of Nondeterministic Regular
                                  Expressions  . . . . . . . . . . . . . . 412--449
                       Lin Chen   Graph Isomorphism and Identification
                                  Matrices: Sequential Algorithms  . . . . 450--475
                Petr Jancar and   
             Javier Esparza and   
                   Faron Moller   Petri Nets and Regular Processes . . . . 476--503
                    B. P. Weems   Bistable Versions of the Marriages and
                                  Roommates Problems . . . . . . . . . . . 504--520
                    Leo Liberti   Structure of the Invertible CA
                                  Transformations Group  . . . . . . . . . 521--536
            Roberto Barbuti and   
     Nicoletta De Francesco and   
          Antonella Santone and   
               Gigliola Vaglini   Selective Mu-Calculus and Formula-Based
                                  Equivalence of Transition Systems  . . . 537--556
                      Anonymous   Corrigendum: Volume 58, Number 3 (1999),
                                  in Article No. ``On the Decidability of
                                  Semilinearity for Semialgebraic Sets and
                                  Its Implications for Spatial
                                  Databases,'' by Freddy Dumortier, Marc
                                  Gyssens, Luc Vandeurzen, and Dirk Van
                                  Gucht, pages 535--571  . . . . . . . . . 557--562
                      Anonymous   Author Index for Volume 59 . . . . . . . 563--563


Journal of Computer and System Sciences
Volume 60, Number 1, February, 2000

                     Bin Ma and   
                   Lusheng Wang   On the Inapproximability of Disjoint
                                  Paths and Minimum Steiner Forest with
                                  Bandwidth Constraints  . . . . . . . . . 1--12
                    Wan Fokkink   Rooted Branching Bisimulation as a
                                  Congruence . . . . . . . . . . . . . . . 13--37
                      Jinde Cao   Global Exponential Stability and
                                  Periodic Solutions of Delayed Cellular
                                  Neural Networks  . . . . . . . . . . . . 38--46
               Tatsuaki Okamoto   On Relationships between Statistical
                                  Zero-Knowledge Proofs  . . . . . . . . . 47--108
      Klaus-Jörn Lange and   
               Rolf Niedermeier   Data Independence of Read, Write, and
                                  Control Structures in PRAM Computations  109--144
József Békési and   
      Gábor Galambos and   
                  Hans Kellerer   A $ 5 / 4 $ Linear Time Bin Packing
                                  Algorithm  . . . . . . . . . . . . . . . 145--160
              Rocco A. Servedio   Computational Sample Complexity and
                                  Attribute-Efficient Learning . . . . . . 161--178
                  Jinde Cao and   
                       Qing Tao   Estimation of the Domain of Attraction
                                  and the Convergence Rate of a Hopfield
                                  Associative Memory and an Application    179--186
             Christel Baier and   
            Bettina Engelen and   
         Mila Majster-Cederbaum   Deciding Bisimilarity and Similarity for
                                  Probabilistic Processes  . . . . . . . . 187--231

Journal of Computer and System Sciences
Volume 60, Number 2, April, 2000

                 Vijay Raghavan   Editor's Foreword  . . . . . . . . . . . 233--233
                  John Case and   
                Sanjay Jain and   
               Matthias Ott and   
                Arun Sharma and   
                  Frank Stephan   Robust Learning Aided by Context . . . . 234--257
         Andreas Birkendorf and   
            Norbert Klasner and   
         Christian Kuhlmann and   
                  Hans U. Simon   Structural Results about Exact Learning
                                  with Unspecified Attribute Values  . . . 258--277
           Christopher D. Rosin   Sample Complexity of Model-Based Search  278--301
      Rüdiger Reischuk and   
                Thomas Zeugmann   An Average-Case Optimal One-Variable
                                  Pattern Language Learner . . . . . . . . 302--335
 José L. Balcázar   Editor's Foreword  . . . . . . . . . . . 336--336
                  Lance Fortnow   Time-Space Tradeoffs for Satisfiability  337--353
      Klaus-Jörn Lange and   
            Pierre McKenzie and   
                     Alain Tapp   Reversible Space Equals Deterministic
                                  Space  . . . . . . . . . . . . . . . . . 354--367
           Cristopher Moore and   
       Denis Thérien and   
    François Lemieux and   
              Joshua Berman and   
                  Arthur Drisko   Circuits and Expressions with
                                  Nonassociative Gates . . . . . . . . . . 368--394
           Manindra Agrawal and   
              Eric Allender and   
                    Samir Datta   On TC$^0$, AC$^0$, and Arithmetic
                                  Circuits . . . . . . . . . . . . . . . . 395--421
             Richard Beigel and   
                         Bin Fu   Circuits over PP and PL  . . . . . . . . 422--441
              Daniel Hammer and   
        Andrei Romashchenko and   
             Alexander Shen and   
           Nikolai Vereshchagin   Inequalities for Shannon Entropy and
                                  Kolmogorov Complexity  . . . . . . . . . 442--464
                 Rod Downey and   
              André Nies   Undecidability Results for Low
                                  Complexity Time Classes  . . . . . . . . 465--479
                      Anonymous   Papers to Appear in Forthcoming Issues   480--480

Journal of Computer and System Sciences
Volume 60, Number 3, June, 2000

               Fan Chung Graham   Guest Editor's Foreword  . . . . . . . . 481--481
             William Aiello and   
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
               Adi Rosén   Adaptive Packet Routing for Bursty
                                  Adversarial Traffic  . . . . . . . . . . 482--509
                    Uriel Feige   Approximating the Bandwidth via Volume
                                  Respecting Embeddings  . . . . . . . . . 510--539
             Oded Goldreich and   
               Shafi Goldwasser   On the Limits of Nonapproximability of
                                  Lattice Problems . . . . . . . . . . . . 540--563
            Gruia Calinescu and   
             Howard Karloff and   
                   Yuval Rabani   An Improved Approximation Algorithm for
                                  MULTIWAY CUT . . . . . . . . . . . . . . 564--574
             Sanjeev Khanna and   
                     Shiyu Zhou   On Indexed Data Broadcast  . . . . . . . 575--591
               Yael Gertner and   
                Yuval Ishai and   
           Eyal Kushilevitz and   
                     Tal Malkin   Protecting Data Privacy in Private
                                  Information Retrieval Schemes  . . . . . 592--629
           Andrei Z. Broder and   
             Moses Charikar and   
             Alan M. Frieze and   
           Michael Mitzenmacher   Min-Wise Independent Permutations  . . . 630--659
               Miklos Ajtai and   
               Ronald Fagin and   
               Larry Stockmeyer   The Closure of Monadic NP  . . . . . . . 660--716
           Funda Ergün and   
             Sampath Kannan and   
              S. Ravi Kumar and   
           Ronitt Rubinfeld and   
             Mahesh Viswanathan   Spot-Checkers  . . . . . . . . . . . . . 717--751
                      Anonymous   Papers to Appear in Forthcoming Issues   752--752
                      Anonymous   Author Index for Volume 60 . . . . . . . 753--753


Journal of Computer and System Sciences
Volume 61, Number 1, August, 2000

             Roderick Bloem and   
               Joost Engelfriet   A Comparison of Tree Transductions
                                  Defined by Monadic Second Order Logic
                                  and by Attribute Grammars  . . . . . . . 1--50
             Dario Catalano and   
                Rosario Gennaro   New Efficient and Secure Protocols for
                                  Verifiable Signature Sharing and Other
                                  Applications . . . . . . . . . . . . . . 51--80
               Suresh Chari and   
             Pankaj Rohatgi and   
             Aravind Srinivasan   Improved Algorithms via Approximations
                                  of Probability Distributions . . . . . . 81--107
                  Gheorghe Paun   Computing with Membranes . . . . . . . . 108--143
                      Anonymous   Papers to Appear in Forthcoming Issues   144--144

Journal of Computer and System Sciences
Volume 61, Number 2, October, 2000

                  Jan Paredaens   Guest Editor's Foreword  . . . . . . . . 145--145
              Peter Buneman and   
                 Wenfei Fan and   
                Scott Weinstein   Path Constraints in Semistructured
                                  Databases  . . . . . . . . . . . . . . . 146--193
          Pankaj K. Agarwal and   
                  Lars Arge and   
              Jeff Erickson and   
         Paulo G. Franciosa and   
           Jeffrey Scott Vitter   Efficient Searching with Linear
                                  Constraints  . . . . . . . . . . . . . . 194--216
  Christos H. Papadimitriou and   
         Prabhakar Raghavan and   
               Hisao Tamaki and   
                Santosh Vempala   Latent Semantic Indexing: a
                                  Probabilistic Analysis . . . . . . . . . 217--235
            Serge Abiteboul and   
               Victor Vianu and   
               Brad Fordham and   
                   Yelena Yesha   Relational Transducers for Electronic
                                  Commerce . . . . . . . . . . . . . . . . 236--269
               Luc Segoufin and   
                   Victor Vianu   Querying Spatial Databases via
                                  Topological Invariants . . . . . . . . . 270--301
        Phokion G. Kolaitis and   
                 Moshe Y. Vardi   Conjunctive-Query Containment and
                                  Constraint Satisfaction  . . . . . . . . 302--332
                      Anonymous   Papers to Appear in Forthcoming Issues   333--333

Journal of Computer and System Sciences
Volume 61, Number 3, December, 2000

          Klaus Ambos-Spies and   
                 Levke Bentzien   Separating NP-Completeness Notions under
                                  Strong Hypotheses  . . . . . . . . . . . 335--361
              Mihir Bellare and   
                 Joe Kilian and   
                Phillip Rogaway   The Security of the Cipher Block
                                  Chaining Message Authentication Code . . 362--399
          Francesco Quaglia and   
            Roberto Baldoni and   
                  Bruno Ciciani   On the No-Z-Cycle Property in
                                  Distributed Executions . . . . . . . . . 400--427
             Michael Kearns and   
                       Dana Ron   Testing Problems with Sublearning Sample
                                  Complexity . . . . . . . . . . . . . . . 428--456
          Sheng-Tzong Cheng and   
              Chia-Mei Chen and   
             Satish K. Tripathi   A Fault-Tolerance Model for
                                  Multiprocessor Real-Time Systems . . . . 457--477
               Thomas Eiter and   
          Toshihide Ibaraki and   
                Kazuhisa Makino   On the Difference of Horn Theories . . . 478--507
                  Kim S. Larsen   AVL Trees with Relaxed Balance . . . . . 508--522
          Jun-ichi Takeuchi and   
                  Naoki Abe and   
                Shun-ichi Amari   The Lob-Pass Problem . . . . . . . . . . 523--557
               Beate Bollig and   
                   Ingo Wegener   Asymptotically Optimal Bounds for OBDDs
                                  and the Solution of Some Basic OBDD
                                  Problems . . . . . . . . . . . . . . . . 558--579
                      Anonymous   Papers to Appear in Forthcoming Issues   580--580
                      Anonymous   Author Index for Volume 61 . . . . . . . 581--581


Journal of Computer and System Sciences
Volume 62, Number 1, February, 2001

                Silvia Ghilezan   Full Intersection Types and Topologies
                                  in Lambda Calculus . . . . . . . . . . . 1--14
            Fosca Giannotti and   
             Dino Pedreschi and   
                  Carlo Zaniolo   Semantics and Expressive Power of
                                  Nondeterministic Constructs in Deductive
                                  Databases  . . . . . . . . . . . . . . . 15--42
           Paolo Liberatore and   
                  Marco Schaerf   Belief Revision and Update: Complexity
                                  of Model Checking  . . . . . . . . . . . 43--72
             Anna Philippou and   
                   David Walker   A Process-Calculus Analysis of
                                  Concurrent Operations on B-Trees . . . . 73--122
           Sally A. Goldman and   
            Stephen S. Kwek and   
               Stephen D. Scott   Agnostic Learning of Geometric Patterns  123--151
            Richard J. Cole and   
             Bruce M. Maggs and   
            Ramesh K. Sitaraman   On the Benefit of Supporting Virtual
                                  Channels in Wormhole Routers . . . . . . 152--177
                Sanjay Jain and   
                 Carl Smith and   
                  Rolf Wiehagen   Robust Learning Is Rich  . . . . . . . . 178--212
                      Anonymous   Papers to Appear in Forthcoming Issues   213--213

Journal of Computer and System Sciences
Volume 62, Number 2, March, 2001

                  Lance Fortnow   Guest Editor's Foreword  . . . . . . . . 215--215
               J. Maurice Rojas   Computational Arithmetic Geometry: I.
                                  Sentences Nearly in the Polynomial
                                  Hierarchy  . . . . . . . . . . . . . . . 216--235
                Madhu Sudan and   
              Luca Trevisan and   
                   Salil Vadhan   Pseudorandom Generators without the XOR
                                  Lemma  . . . . . . . . . . . . . . . . . 236--266
                   Sam Buss and   
             Dima Grigoriev and   
        Russell Impagliazzo and   
                Toniann Pitassi   Linear Gaps between Degrees for the
                                  Polynomial Calculus Modulo Distinct
                                  Primes . . . . . . . . . . . . . . . . . 267--289
                Marcus Schaefer   Graph Ramsey Theory and the Polynomial
                                  Hierarchy  . . . . . . . . . . . . . . . 290--322
          Stephen J. Ponzio and   
     Jaikumar Radhakrishnan and   
                   S. Venkatesh   The Communication Complexity of Pointer
                                  Chasing  . . . . . . . . . . . . . . . . 323--355
              Eric Allender and   
               Michael Saks and   
               Igor Shparlinski   A Lower Bound for Primality  . . . . . . 356--366
        Russell Impagliazzo and   
               Ramamohan Paturi   On the Complexity of $k$-SAT . . . . . . 367--375
                   John Watrous   Quantum Simulations of Classical Random
                                  Walks and Undirected Graph Connectivity  376--391
                      Anonymous   Papers to Appear in Forthcoming Issues   392--392

Journal of Computer and System Sciences
Volume 62, Number 3, May, 2001

            Baruch Awerbuch and   
                 Yossi Azar and   
              Serge Plotkin and   
                    Orli Waarts   Competitive Routing of Virtual Circuits
                                  with Unknown Duration  . . . . . . . . . 385--397
                   John H. Reif   Parallel Output-Sensitive Algorithms for
                                  Combinatorial and Linear Algebra
                                  Problems . . . . . . . . . . . . . . . . 398--412
                  John Case and   
                    Sanjay Jain   Synthesizing Learners Tolerating
                                  Computable Noisy Data  . . . . . . . . . 413--441
         Vincent D. Blondel and   
            Olivier Bournez and   
              Pascal Koiran and   
             John N. Tsitsiklis   The Stability of Saturated Linear
                                  Dynamical Systems Is Undecidable . . . . 442--462
       Francesco Buccafurri and   
               Thomas Eiter and   
              Georg Gottlob and   
                   Nicola Leone   On ACTL Formulas Having Linear
                                  Counterexamples  . . . . . . . . . . . . 463--515
                      Yi Li and   
             Philip M. Long and   
             Aravind Srinivasan   Improved Bounds on the Sample Complexity
                                  of Learning  . . . . . . . . . . . . . . 516--527
                  Jinde Cao and   
                       Qing Tao   Estimation on Domain of Attraction and
                                  Convergence Rate of Hopfield Continuous
                                  Feedback Neural Networks . . . . . . . . 528--534
                      Anonymous   Papers to Appear in Forthcoming Issues   535--535

Journal of Computer and System Sciences
Volume 62, Number 4, June, 2001

          Yasunori Ishihara and   
             Shougo Shimizu and   
              Hiroyuki Seki and   
                     Minoru Ito   Refinements of Complexity Results on
                                  Type Consistency for Object-Oriented
                                  Databases  . . . . . . . . . . . . . . . 537--564
            Juraj Hromkovic and   
          Sebastian Seibert and   
                   Thomas Wilke   Translating Regular Expressions into
                                  Small $ \epsilon $-Free Nondeterministic
                                  Finite Automata  . . . . . . . . . . . . 565--588
             Yonatan Aumann and   
         Johan Håstad and   
           Michael O. Rabin and   
                    Madhu Sudan   Linear-Consistency Testing . . . . . . . 589--607
                  Changwook Kim   Separation Results for Separated Apex
                                  NLC and NCE Graph Languages  . . . . . . 608--628
          Clemens Lautemann and   
            Pierre McKenzie and   
          Thomas Schwentick and   
               Heribert Vollmer   The Descriptive Complexity Approach to
                                  LOGCFL . . . . . . . . . . . . . . . . . 629--652
                  Marcus Hutter   New Error Bounds for Solomonoff
                                  Prediction . . . . . . . . . . . . . . . 653--667
               Yonit Kesten and   
                Amir Pnueli and   
                 Moshe Y. Vardi   Verification by Augmented Abstraction:
                                  The Automata-Theoretic View  . . . . . . 668--690
                      Anonymous   Papers to Appear in Forthcoming Issues   691--691
                      Anonymous   Author Index for Volume 62 . . . . . . . 692--692


Journal of Computer and System Sciences
Volume 63, Number 1, August, 2001

               Fan Chung Graham   Editor's Foreword  . . . . . . . . . . . 1--1
              Jon Kleinberg and   
               Yuval Rabani and   
              Éva Tardos   Fairness in Routing and Load Balancing   2--20
            Joan Feigenbaum and   
  Christos H. Papadimitriou and   
                  Scott Shenker   Sharing the Cost of Multicast
                                  Transmissions  . . . . . . . . . . . . . 21--41
                 Ravi Kumar and   
         Prabhakar Raghavan and   
        Sridhar Rajagopalan and   
                 Andrew Tomkins   Recommendation Systems: a Probabilistic
                                  Analysis . . . . . . . . . . . . . . . . 42--61
                Ashish Goel and   
              Adam Meyerson and   
                  Serge Plotkin   Combining Fairness with Throughput:
                                  Online Routing with Multiple Objectives  62--79
           Philip J. Hanlon and   
                 Dean Chung and   
      Siddhartha Chatterjee and   
             Daniela Genius and   
            Alvin R. Lebeck and   
                    Erin Parker   The Combinatorics of Cache Misses during
                                  Matrix Multiplication  . . . . . . . . . 80--126
                Micah Adler and   
                   Tom Leighton   Compression Using Efficient Multicasting 127--145
                      Anonymous   Papers to Appear in Forthcoming Issues   146--146

Journal of Computer and System Sciences
Volume 63, Number 2, September, 2001

            Pavel Pudlák   Guest Editor's Foreword  . . . . . . . . 147--147
            Andris Ambainis and   
              Harry Buhrman and   
            William Gasarch and   
       Bala Kalyanasundaram and   
                Leen Torenvliet   The Communication Complexity of
                                  Enumeration, Elimination, and Selection  148--185
       David Mix Barrington and   
                Peter Kadau and   
      Klaus-Jörn Lange and   
                Pierre McKenzie   On the Complexity of Some Problems on
                                  Groups Input as Multiplication Tables    186--200
    André Berthiaume and   
                Wim van Dam and   
                Sophie Laplante   Quantum Kolmogorov Complexity  . . . . . 201--221
                    Oliver Giel   Branching Program Size Is Almost Linear
                                  in Formula Size  . . . . . . . . . . . . 222--235
             Valentine Kabanets   Easiness Assumptions and Hardness Tests:
                                  Trading Time for Zero Error  . . . . . . 236--252
             Ketan Mulmuley and   
                   Pradyut Shah   A Lower Bound for the Shortest Path
                                  Problem  . . . . . . . . . . . . . . . . 253--267
               Iannis Tourlakis   Time-Space Tradeoffs for SAT on
                                  Nonuniform Machines  . . . . . . . . . . 268--287
                        Ke Yang   Integer Circuit Evaluation Is
                                  PSPACE-Complete  . . . . . . . . . . . . 288--303
                      Anonymous   Papers to Appear in Forthcoming Issues   304--304

Journal of Computer and System Sciences
Volume 63, Number 3, November, 2001

                Sanjay Jain and   
                Efim Kinber and   
                  Rolf Wiehagen   Language Learning from Texts: Degrees of
                                  Intrinsic Complexity and Their
                                  Characterizations  . . . . . . . . . . . 305--354
               Sanjay Gupta and   
                   R. K. P. Zia   Quantum Neural Networks  . . . . . . . . 355--383
                     Hing Leung   Tight Lower Bounds on the Size of
                                  Sweeping Automata  . . . . . . . . . . . 384--393
                  Nicolas Bedon   Logic over Words on Denumerable Ordinals 394--431
                  Fan Chung and   
               Mark Garrett and   
              Ronald Graham and   
               David Shallcross   Distance Realization Problems with
                                  Applications to Internet Tomography  . . 432--448
         Satyanarayana V. Lokam   Spectral Methods for Matrix Rigidity
                                  with Applications to Size-Depth
                                  Trade-offs and Communication Complexity  449--473
                David Peleg and   
                   Eilon Reshef   Low Complexity Variants of the Arrow
                                  Distributed Directory  . . . . . . . . . 474--485
             Jay Sethuraman and   
                 Chung-Piaw Teo   A Polynomial-time Algorithm for the
                                  Bistable Roommates Problem . . . . . . . 486--497
             Johan Håstad   A Slight Sharpening of LMN . . . . . . . 498--508
                      Anonymous   Papers to Appear in Forthcoming Issues   509--509

Journal of Computer and System Sciences
Volume 63, Number 4, December, 2001

                 Rajeev Motwani   Guest Editor's Foreword  . . . . . . . . 511--511
        Russell Impagliazzo and   
           Ramamohan Paturi and   
                   Francis Zane   Which Problems Have Strongly Exponential
                                  Complexity?  . . . . . . . . . . . . . . 512--530
    W. Fernandez de la Vega and   
                  Claire Kenyon   A Randomized Approximation Scheme for
                                  Metric MAX-CUT . . . . . . . . . . . . . 531--541
                 Paul Beame and   
               T. S. Jayram and   
                   Michael Saks   Time-Space Tradeoffs for Branching
                                  Programs . . . . . . . . . . . . . . . . 542--572
                Micah Adler and   
                 Bruce M. Maggs   Protocols for Asymmetric Communication
                                  Channels . . . . . . . . . . . . . . . . 573--596
              Christopher Umans   The Minimum Equivalent DNF Problem and
                                  Shortest Implicants  . . . . . . . . . . 597--611
          Alexander Russell and   
                David Zuckerman   Perfect Information Leader Election in $
                                  \log^* n + O(1) $ Rounds . . . . . . . . 612--626
                    Piotr Indyk   On Approximate Nearest Neighbors under $
                                  l_\infty $ Norm  . . . . . . . . . . . . 627--638
                Uriel Feige and   
                     Joe Kilian   Heuristics for Semirandom Graph Problems 639--671
        Russell Impagliazzo and   
                  Avi Wigderson   Randomness vs Time: Derandomization
                                  under a Uniform Assumption . . . . . . . 672--688
                      Anonymous   Papers to Appear in Forthcoming Issues   689--689
                      Anonymous   Author Index for Volume 63 . . . . . . . 690--690


Journal of Computer and System Sciences
Volume 64, Number 1, February, 2002

                  Sally Goldman   Guest Editor's Foreword  . . . . . . . . 1--1
José L. Balcázar and   
               Jorge Castro and   
                 David Guijarro   A New Abstract Combinatorial Dimension
                                  for Exact Learning via Queries . . . . . 2--21
             Shai Ben-David and   
                Nadav Eiron and   
              Hans Ulrich Simon   The Computational Complexity of Densest
                                  Region Detection . . . . . . . . . . . . 22--47
                 Peter Auer and   
      Nicol\`o Cesa-Bianchi and   
                Claudio Gentile   Adaptive and Self-Confident On-Line
                                  Learning Algorithms  . . . . . . . . . . 48--75
        Jürgen Forster and   
             Manfred K. Warmuth   Relative Expected Instantaneous Loss
                                  Bounds . . . . . . . . . . . . . . . . . 76--102
             Yishay Mansour and   
               David McAllester   Boosting Using Branching Programs  . . . 103--112
                Yoav Freund and   
                  Manfred Opper   Drifting Games and Brownian Motion . . . 113--132
          Peter L. Bartlett and   
                Jonathan Baxter   Estimation and Approximation Bounds for
                                  Gradient-Based Reinforcement Learning    133--150
                      Anonymous   Papers to Appear in Forthcoming Issues   151--151

Journal of Computer and System Sciences
Volume 64, Number 2, March, 2002

                      Mark Fulk   Inductive Inference with Additional
                                  Information  . . . . . . . . . . . . . . 153--159
            Cristina Bazgan and   
              Miklos Santha and   
                     Zsolt Tuza   Efficient Approximation Algorithms for
                                  the Subset-Sums Equality Problem . . . . 160--170
   Martin Große-Rhode and   
  Francesco Parisi Presicce and   
                  Marta Simeoni   Formal Software Specification with
                                  Refinements and Modules of Typed Graph
                                  Transformation Systems . . . . . . . . . 171--218
          Minos Garofalakis and   
           Yannis Ioannidis and   
            Banu Özden and   
               Avi Silberschatz   Competitive On-line Scheduling of
                                  Continuous-Media Streams . . . . . . . . 219--248
               Frank Drewes and   
          Berthold Hoffmann and   
                   Detlef Plump   Hierarchical Graph Transformation  . . . 249--283
               T. H. Westerdale   Minimality of an Automaton Cascade
                                  Decomposition for Learning System
                                  Environments . . . . . . . . . . . . . . 284--307
          Martin R. Bridson and   
               Robert H. Gilman   Context-Free Languages of
                                  Sub-exponential Growth . . . . . . . . . 308--310
       Lane A. Hemaspaandra and   
          Mitsunori Ogihara and   
                  Gerd Wechsung   Reducing the Number of Solutions of NP
                                  Functions  . . . . . . . . . . . . . . . 311--328
        J. M. Hélary and   
              A. Mostefaoui and   
                      M. Raynal   Interval Consistency of Asynchronous
                                  Distributed Computations . . . . . . . . 329--349
           Joost Engelfriet and   
               Sebastian Maneth   Output String Languages of Compositions
                                  of Deterministic Macro Tree Transducers  350--395
             Volker Diekert and   
                    Paul Gastin   LTL Is Expressively Complete for
                                  Mazurkiewicz Traces  . . . . . . . . . . 396--418
                 Detlef Sieling   Lower Bounds for Linearly Transformed
                                  OBDDs and FBDDs  . . . . . . . . . . . . 419--438
                      Anonymous   Papers to Appear in Forthcoming Issues   439--439

Journal of Computer and System Sciences
Volume 64, Number 3, May, 2002

           Yannis Ioannidis and   
         Christos Papadimitriou   Guest Editors' Foreword  . . . . . . . . 441--442
            Diego Calvanese and   
        Giuseppe De Giacomo and   
         Maurizio Lenzerini and   
                 Moshe Y. Vardi   Rewriting of Regular Expressions and
                                  Regular Path Queries . . . . . . . . . . 443--465
             Stavros Cosmadakis   Inherent Complexity of Recursive Queries 466--495
              Steven Dawson and   
Sabrina De Capitani di Vimercati and   
            Patrick Lincoln and   
            Pierangela Samarati   Maximizing Sharing of Protected
                                  Information  . . . . . . . . . . . . . . 496--541
            Venkatesh Ganti and   
            Johannes Gehrke and   
         Raghu Ramakrishnan and   
                    Wei-Yin Loh   A Framework for Measuring Differences in
                                  Data Characteristics . . . . . . . . . . 542--578
              Georg Gottlob and   
               Nicola Leone and   
            Francesco Scarcello   Hypertree Decompositions and Tractable
                                  Queries  . . . . . . . . . . . . . . . . 579--627
           Michael Benedikt and   
                  Leonid Libkin   Aggregate Operators in Constraint Query
                                  Languages  . . . . . . . . . . . . . . . 628--654
                Yaron Kanza and   
                Werner Nutt and   
                 Yehoshua Sagiv   Querying Incomplete Information in
                                  Semistructured Data  . . . . . . . . . . 655--693
        Jan Van den Bussche and   
                Emmanuel Waller   Polymorphic Type Inference for the
                                  Relational Algebra . . . . . . . . . . . 694--718
                  Noga Alon and   
         Phillip B. Gibbons and   
               Yossi Matias and   
                  Mario Szegedy   Tracking Join and Self-Join Sizes in
                                  Limited Storage  . . . . . . . . . . . . 719--747
                      Anonymous   Papers to Appear in Forthcoming Issues   748--748

Journal of Computer and System Sciences
Volume 64, Number 4, June, 2002

                 Sanjeev Khanna   Guest Editor's Foreword  . . . . . . . . 749--749
                Andris Ambainis   Quantum Lower Bounds by Quantum
                                  Arguments  . . . . . . . . . . . . . . . 750--767
                      Dan Boneh   Finding Smooth Integers in Short
                                  Intervals Using CRT Decoding . . . . . . 768--784
             Moses Charikar and   
               Ronald Fagin and   
       Venkatesan Guruswami and   
              Jon Kleinberg and   
         Prabhakar Raghavan and   
                     Amit Sahai   Query Strategies for Priced Information  785--819
                David Kempe and   
              Jon Kleinberg and   
                     Amit Kumar   Connectivity and Inference Problems for
                                  Temporal Networks  . . . . . . . . . . . 820--842
              Alexis Maciel and   
            Toniann Pitassi and   
                  Alan R. Woods   A New Proof of the Weak Pigeonhole
                                  Principle  . . . . . . . . . . . . . . . 843--872
                Omer Barkol and   
                   Yuval Rabani   Tighter Lower Bounds for Nearest
                                  Neighbor Search and Related Problems in
                                  the Cell Probe Model . . . . . . . . . . 873--896
                      Anonymous   Papers to Appear in Forthcoming Issues   897--897
                      Anonymous   Author Index for Volume 64 . . . . . . . 898--898


Journal of Computer and System Sciences
Volume 65, Number 1, August, 2002

               Lenore Cowen and   
               Ronald Fagin and   
                 Joe Kilian and   
                  Jon Kleinberg   Guest Editor's Foreword  . . . . . . . . 1--1
            Miklós Ajtai   Determinism versus Nondeterminism for
                                  Linear Time RAMs with Memory
                                  Restrictions . . . . . . . . . . . . . . 2--37
                 Paul Beame and   
                  Faith E. Fich   Optimal Bounds for the Predecessor
                                  Problem and Related Problems . . . . . . 38--72
                    Ming Li and   
                     Bin Ma and   
                   Lusheng Wang   Finding Similar Regions in Many
                                  Sequences  . . . . . . . . . . . . . . . 73--96
                    Ran Raz and   
              Omer Reingold and   
                   Salil Vadhan   Extracting all the Randomness and
                                  Reducing the Error in Trevisan's
                                  Extractors . . . . . . . . . . . . . . . 97--128
             Moses Charikar and   
               Sudipto Guha and   
          Éva Tardos and   
                David B. Shmoys   A Constant-Factor Approximation
                                  Algorithm for the $k$-Median Problem . . 129--149
               Valerie King and   
                   Garry Sagert   A Fully Dynamic Algorithm for
                                  Maintaining the Transitive Closure . . . 150--167
                      Anonymous   Papers to Appear in Forthcoming Issues   168--168

Journal of Computer and System Sciences
Volume 65, Number 2, September, 2002

                Charles Stewart   Reducibility between Classes of Port
                                  Graph Grammar  . . . . . . . . . . . . . 169--223
         Atsuyoshi Nakamura and   
                      Naoki Abe   Online Learning of Binary and $n$-ary
                                  Relations over Clustered Domains . . . . 224--256
                  V. Arvind and   
           Johannes Köbler   New Lowness Results for ZPP NP and Other
                                  Complexity Classes . . . . . . . . . . . 257--277
                 Tero Harju and   
               Oscar Ibarra and   
      Juhani Karhumäki and   
                   Arto Salomaa   Some Decision Problems Concerning
                                  Semilinearity and Commutation  . . . . . 278--294
                 Dan E. Willard   An Algorithm for Handling Many
                                  Relational Calculus Queries Efficiently  295--331
               Piotr Berman and   
            Marek Karpinski and   
        Lawrence L. Larmore and   
        Wojciech Plandowski and   
                Wojciech Rytter   On the Complexity of Pattern Matching
                                  for Highly Compressed Two-Dimensional
                                  Texts  . . . . . . . . . . . . . . . . . 332--350
                K. Skodinis and   
                       E. Wanke   Node Replacements in Embedding Normal
                                  Form . . . . . . . . . . . . . . . . . . 351--376
                   Juha Honkala   The Equivalence Problem for DF0L
                                  Languages and Power Series . . . . . . . 377--392
        Giovanni Pighizzini and   
            Jeffrey Shallit and   
                  Ming-wei Wang   Unary Context-Free Grammars and Pushdown
                                  Automata, Descriptional Complexity and
                                  Auxiliary Space Lower Bounds . . . . . . 393--414
                 Llew Mason and   
          Peter L. Bartlett and   
                  Mostefa Golea   Generalization Error of Combined
                                  Classifiers  . . . . . . . . . . . . . . 415--438
                      Anonymous   Papers to Appear in Forthcoming Issues   439--439

Journal of Computer and System Sciences
Volume 65, Number 3, November, 2002

                      Anonymous   Advertisement #sciencejobs\_N  . . . . . ii--ii
                    Ming Li and   
              Pavel Pevzner and   
                     Ron Shamir   Foreword . . . . . . . . . . . . . . . . 441--441
               Nadia El-Mabrouk   Reconstructing an ancestral genome using
                                  minimum segments duplications and
                                  reversals  . . . . . . . . . . . . . . . 442--464
                 Guohui Lin and   
             Zhi-Zhong Chen and   
                  Tao Jiang and   
                    Jianjun Wen   The longest common subsequence problem
                                  for sequences with nested arc
                                  annotations  . . . . . . . . . . . . . . 465--480
                   J. Lagergren   Combining polynomial running time and
                                  fast convergence for the disk-covering
                                  method . . . . . . . . . . . . . . . . . 481--493
                Deep Jaitly and   
               Paul Kearney and   
                 Guohui Lin and   
                         Bin Ma   Methods for reconstructing the history
                                  of tandem repeats and their application
                                  to the human genome  . . . . . . . . . . 494--507
        Bernard M. E. Moret and   
                 Jijun Tang and   
                Li-San Wang and   
                   Tandy Warnow   Steps toward accurate reconstructions of
                                  phylogenies from gene-order data . . . . 508--525
          Gopal Pandurangan and   
                      H. Ramesh   The restriction mapping problem
                                  revisited  . . . . . . . . . . . . . . . 526--544
      Rune B. Lyngsò and   
       Christian N. S. Pedersen   The consensus string problem and the
                                  complexity of comparing hidden Markov
                                  models . . . . . . . . . . . . . . . . . 545--569
               Yaw-Ling Lin and   
                  Tao Jiang and   
                   Kun-Mao Chao   Efficient algorithms for locating the
                                  length-constrained heaviest segments
                                  with applications to biomolecular
                                  sequence analysis  . . . . . . . . . . . 570--586
                   Glenn Tesler   Efficient algorithms for
                                  multichromosomal genome rearrangements   587--609
                      Anonymous   Papers to Appear . . . . . . . . . . . . 610--610
                      Anonymous   C3 --- Advertisement #09111  . . . . . . ibc--ibc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 65, Number 4, December, 2002

                      Anonymous   Advertisement  . . . . . . . . . . . . . ii--ii
                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
                    Madhu Sudan   Foreword . . . . . . . . . . . . . . . . 611--611
            Jürgen Forster   A linear lower bound on the unbounded
                                  error probabilistic communication
                                  complexity . . . . . . . . . . . . . . . 612--625
            Albert Atserias and   
              Nicola Galesi and   
            Pavel Pudlák   Monotone simulations of non-monotone
                                  proofs . . . . . . . . . . . . . . . . . 626--638
                   Amir Shpilka   Affine projections of symmetric
                                  polynomials  . . . . . . . . . . . . . . 639--659
            Elchanan Mossel and   
              Christopher Umans   On the complexity of approximating the
                                  VC dimension . . . . . . . . . . . . . . 660--671
        Russell Impagliazzo and   
         Valentine Kabanets and   
                  Avi Wigderson   In search of an easy witness:
                                  exponential time vs. probabilistic
                                  polynomial time  . . . . . . . . . . . . 672--694
              William Hesse and   
              Eric Allender and   
        David A. Mix Barrington   Uniform constant-depth threshold
                                  circuits for division and iterated
                                  multiplication . . . . . . . . . . . . . 695--716
           Michal Koucký   Universal traversal sequences with
                                  backtracking . . . . . . . . . . . . . . 717--726
                      Anonymous   Papers to Appear . . . . . . . . . . . . 727--727
                      Anonymous   Volume Author Index  . . . . . . . . . . 728--728
                      Anonymous   C3 --- Advertisement . . . . . . . . . . ibc--ibc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 66, Number 1, February, 2003

                      Anonymous   Advertisement #praise\_5X8\_els.pdf  . . ii--ii
                      Anonymous   Publisher's Note . . . . . . . . . . . . iii--iv
                  Georg Gottlob   Guest Editor's Foreword  . . . . . . . . 1--1
                 James F. Lynch   Analysis and application of adaptive
                                  sampling . . . . . . . . . . . . . . . . 2--19
             Todd Millstein and   
                Alon Halevy and   
                  Marc Friedman   Query containment for data integration
                                  systems  . . . . . . . . . . . . . . . . 20--39
                 Marc Spielmann   Verification of relational transducers
                                  for electronic commerce  . . . . . . . . 40--65
                  Tova Milo and   
                  Dan Suciu and   
                   Victor Vianu   Typechecking for XML transformers  . . . 66--97
               Zhiyuan Chen and   
                  Flip Korn and   
                Nick Koudas and   
               S. Muthukrishnan   Generalized substring selectivity
                                  estimation . . . . . . . . . . . . . . . 98--132
   Stéphane Grumbach and   
              Leonardo Tininini   On the content of materialized aggregate
                                  views  . . . . . . . . . . . . . . . . . 133--168
           Michael Benedikt and   
               Martin Grohe and   
              Leonid Libkin and   
                   Luc Segoufin   Reachability and connectivity queries in
                                  constraint databases . . . . . . . . . . 169--206
          Pankaj K. Agarwal and   
                  Lars Arge and   
                  Jeff Erickson   Indexing Moving Points . . . . . . . . . 207--243
              Jon Kleinberg and   
     Christos Papadimitriou and   
             Prabhakar Raghavan   Auditing Boolean attributes  . . . . . . 244--253
                 Wenfei Fan and   
Jérôme Siméon   Integrity constraints for XML  . . . . . 254--291
                      Anonymous   Papers to Appear . . . . . . . . . . . . 292--292
                      Anonymous   Advertisement #HA08111M  . . . . . . . . ibc--ibc
                      Anonymous   Ed. Board  . . . . . . . . . . . . . . . ifc--ifc
                      Anonymous   TOC  . . . . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 66, Number 2, March, 2003

                      Anonymous   Advertisement #HA05062O (FTP file \tt
                                  HA05062ABCNOP.pdf.sea) . . . . . . . . . ii--ii
         Vincenza Carchiolo and   
            Michele Malgeri and   
              Giuseppe Mangioni   TTL: a modular language for
                                  hardware/software systems design . . . . 293--315
                    Simone Tini   An axiomatic semantics for the
                                  synchronous language Gentzen . . . . . . 316--348
              Hans Kellerer and   
             Renata Mansini and   
            Ulrich Pferschy and   
          Maria Grazia Speranza   An efficient fully polynomial
                                  approximation scheme for the Subset-Sum
                                  Problem  . . . . . . . . . . . . . . . . 349--370
                Marcos Kiwi and   
Frédéric Magniez and   
                  Miklos Santha   Approximate testing with error relative
                                  to input size  . . . . . . . . . . . . . 371--392
                    M. Reynolds   The complexity of the temporal logic
                                  with ``until'' over general linear time  393--426
                      Anonymous   Papers to Appear . . . . . . . . . . . . 427--427
                      Anonymous   C3 --- Advertisement #better\_5X8\_els
                                  (FTP file #better\_5X8\_els.pdf) in
                                  generic folder . . . . . . . . . . . . . ibc--ibc
                      Anonymous   C1--C2 Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 66, Number 3, May, 2003

                      Anonymous   Blank  . . . . . . . . . . . . . . . . . III
                      Anonymous   Advertisement #HA03022M (FTP file
                                  HA03022LMS.sea)  . . . . . . . . . . . . IV
                      Anonymous   Advertisement #HA05062O (FTP file
                                  HA05062ABCNOP.pdf.sea) . . . . . . . . . V
                      Anonymous   Advertisement #AM01053M (FTP file
                                  HA01053LMS.zip)  . . . . . . . . . . . . VI
         Hirotada Kobayashi and   
                Keiji Matsumoto   Quantum multi-prover interactive proof
                                  systems with limited prior entanglement  429--450
                 Viliam Geffert   Translation of binary regular
                                  expressions into nondeterministic $
                                  \epsilon $-free automata with $ O(n \log
                                  n)$ transitions  . . . . . . . . . . . . 451--472
               Martin Sauerhoff   Guess-and-verify versus unrestricted
                                  nondeterminism for OBDDs and one-way
                                  Turing machines  . . . . . . . . . . . . 473--495
             Shai Ben-David and   
                Nadav Eiron and   
                 Philip M. Long   On the difficulty of approximately
                                  maximizing agreements  . . . . . . . . . 496--514
               Bruno Gaujal and   
                Stefan Haar and   
                  Jean Mairesse   Blocking a transition in a free choice
                                  net and what it tells about its
                                  throughput . . . . . . . . . . . . . . . 515--548
              Birgit Jenner and   
       Johannes Köbler and   
            Pierre McKenzie and   
            Jacobo Torán   Completeness results for graph
                                  isomorphism  . . . . . . . . . . . . . . 549--566
        Monika R. Henzinger and   
               Stefano Leonardi   Scheduling multicasts on unit-capacity
                                  trees and meshes . . . . . . . . . . . . 567--611
                      Anonymous   Papers to Appear . . . . . . . . . . . . 612--612
                      Anonymous   C3 --- Advertisement #HA06043M (FTP file
                                  HA06043LMSU.zip) . . . . . . . . . . . . ibc--ibc
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 66, Number 4, June, 2003

                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
                      Anonymous   Advertisement #HA03022M (FTP file
                                  HA03022LMS.sea)  . . . . . . . . . . . . IX
                      Anonymous   Advertisement #HA05062N (FTP file \tt
                                  HA05062ABCNOP.pdf.sea) . . . . . . . . . X
                      Anonymous   Advertisement #AM01053M (FTP file
                                  AM01053LMS.zip)  . . . . . . . . . . . . XI
                  Peter Buneman   Guest Editor's Foreword  . . . . . . . . 613--613
               Ronald Fagin and   
                Amnon Lotem and   
                      Moni Naor   Optimal aggregation algorithms for
                                  middleware . . . . . . . . . . . . . . . 614--656
                  Kim S. Larsen   Relaxed multi-way trees with group
                                  updates  . . . . . . . . . . . . . . . . 657--670
            Dimitris Achlioptas   Database-friendly random projections:
                                  Johnson--Lindenstrauss with binary coins 671--687
                  Noga Alon and   
                  Tova Milo and   
                Frank Neven and   
                  Dan Suciu and   
                   Victor Vianu   XML with data values: typechecking
                                  revisited  . . . . . . . . . . . . . . . 688--727
            Nilesh N. Dalvi and   
           Sumit K. Sanghai and   
                 Prasan Roy and   
                   S. Sudarshan   Pipelining in multi-query optimization   728--762
            Paolo Ferragina and   
                Nick Koudas and   
           S. Muthukrishnan and   
              Divesh Srivastava   Two-dimensional substring indexing . . . 763--774
              Georg Gottlob and   
               Nicola Leone and   
            Francesco Scarcello   Robbers, marshals, and guards: game
                                  theoretic and logical characterizations
                                  of hypertree width . . . . . . . . . . . 775--808
            Anand Rajaraman and   
              Jeffrey D. Ullman   Querying websites using compact
                                  skeletons  . . . . . . . . . . . . . . . 809--851
                      Anonymous   Papers to Appear . . . . . . . . . . . . 852--852
                      Anonymous   Volume Author Index  . . . . . . . . . . 853--853
                      Anonymous   C3 --- Advertisement #HA06043M (FTP file
                                  HA06043LMSU.zip) . . . . . . . . . . . . ibc--ibc
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc


Journal of Computer and System Sciences
Volume 67, Number 1, August, 2003

                      Anonymous   Ad #HA06043M (FTP file HA06043LMSU.zip)  ii--ii
                      Anonymous   Ad #econdirectM (FTP file
                                  econdirectLMS.zip) . . . . . . . . . . . III
               Hwakyung Rim and   
               Ju-wook Jang and   
                   Sungchun Kim   A simple reduction of non-uniformity in
                                  dynamic load balancing of quantized
                                  loads on hypercube multiprocessors and
                                  hiding balancing overheads . . . . . . . 1--25
               Shlomi Dolev and   
                Sergio Rajsbaum   Stability of long-lived consensus  . . . 26--45
                Peter Damaschke   On parallel attribute-efficient learning 46--62
            William Gasarch and   
                 Evan Golub and   
                  Clyde Kruskal   Constant time parallel sorting: an
                                  empirical view . . . . . . . . . . . . . 63--91
                Edith Cohen and   
                Haim Kaplan and   
                      Uri Zwick   Connection caching: model and algorithms 92--126
                      K. Meinke   Proof theory of higher-order equations:
                                  conservativity, normal forms and term
                                  rewriting  . . . . . . . . . . . . . . . 127--173
             J.-P. Allouche and   
                     G. Skordev   Remarks on permutive cellular automata   174--182
              Marek Chrobak and   
               Leah Epstein and   
                  John Noga and   
        Ji\vrí Sgall and   
                Robvan Stee and   
Tomá\vs Tichýd and   
                Nodari Vakhania   Preemptive scheduling in overloaded
                                  systems  . . . . . . . . . . . . . . . . 183--197
              Abhiram G. Ranade   Scheduling loosely connected task graphs 198--208
                      Anonymous   Papers to Appear . . . . . . . . . . . . 209--209
                      Anonymous   C3 --- Ad #AM01053M (FTP file
                                  AM01053LMS.zip)  . . . . . . . . . . . . ibc--ibc
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 67, Number 2, September, 2003

                      Anonymous   Advertisement: AS007M (FTP file
                                  AS007M.pdf)  . . . . . . . . . . . . . . ii--ii
                      Anonymous   Advertisement: AS004M (FTP file
                                  AS004M.pdf)  . . . . . . . . . . . . . . III
                   John H. Reif   Guest Editor's Foreword  . . . . . . . . 211--211
                  Noga Alon and   
    W. Fernandez de la Vega and   
                Ravi Kannan and   
                Marek Karpinski   Random sampling and approximation of
                                  MAX-CSPs . . . . . . . . . . . . . . . . 212--243
                   Saugata Basu   Computing the Betti numbers of
                                  arrangements via spectral sequences  . . 244--262
                Steve Chien and   
             Lars Rasmussen and   
              Alistair Sinclair   Clifford algebras and approximating the
                                  permanent  . . . . . . . . . . . . . . . 263--290
                 Mary Cryan and   
                    Martin Dyer   A polynomial-time algorithm to
                                  approximately count contingency tables
                                  when the number of rows is constant  . . 291--310
               Xiaotie Deng and   
     Christos Papadimitriou and   
                   Shmuel Safra   On the complexity of price equilibria    311--324
              Sanjeev Arora and   
                   Subhash Khot   Fitting algebraic curves to noisy data   325--340
                Tim Roughgarden   The price of anarchy is independent of
                                  the network topology . . . . . . . . . . 341--364
            Marcus Schaefer and   
              Eric Sedgwick and   
             Daniel Stefankovic   Recognizing string graphs in NP  . . . . 365--380
Gerth Stòlting Brodal and   
         George Lagogiannis and   
            Christos Makris and   
      Athanasios Tsakalidis and   
                Kostas Tsichlas   Optimal finger search trees in the
                                  pointer machine  . . . . . . . . . . . . 381--418
              Christopher Umans   Pseudo-random generators for all
                                  hardnesses . . . . . . . . . . . . . . . 419--440
        Dimitris Achlioptas and   
               Cristopher Moore   Almost all graphs with average degree 4
                                  are $3$-colorable  . . . . . . . . . . . 441--471
                      Anonymous   Papers to Appear . . . . . . . . . . . . 472--472
                      Anonymous   C3 --- AS008M (FTP file AS008M.pdf)  . . ibc--ibc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Ed. Board  . . . . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 67, Number 3, November, 2003

                      Anonymous   sdmathM (FTP file sdmathLMS.zip) . . . . ii--ii
       Venkatesan Guruswami and   
             Sanjeev Khanna and   
         Rajmohan Rajaraman and   
             Bruce Shepherd and   
             Mihalis Yannakakis   Near-optimal hardness results and
                                  approximation algorithms for
                                  edge-disjoint paths and related problems 473--496
                     Olivier Ly   Automatic graphs and D0L-sequences of
                                  finite graphs  . . . . . . . . . . . . . 497--545
                Sanjay Jain and   
                    Efim Kinber   Intrinsic complexity of learning
                                  geometrical concepts from positive data  546--607
       Christopher M. Homan and   
                   Mayur Thakur   One-way permutations and self-witnessing
                                  languages  . . . . . . . . . . . . . . . 608--622
               Chunguang Li and   
              Xiaofeng Liao and   
                     Juebang Yu   Complex-valued wavelet network . . . . . 623--632
             Aravind Srinivasan   On the approximability of clique and
                                  related maximization problems  . . . . . 633--651
                      Anonymous   Papers to Appear . . . . . . . . . . . . 652--652
                      Anonymous   Ed. Board  . . . . . . . . . . . . . . . ifc--ifc
                      Anonymous   HA11093M (FTP file HA11093LMS.zip) . . . ibc--ibc
                      Anonymous   TOC  . . . . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 67, Number 4, December, 2003

                      Anonymous   Advertisement  . . . . . . . . . . . . . ii--ii
                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
                Jianer Chen and   
             Michael R. Fellows   Foreword from the guest editors  . . . . 653--653
                   Marco Cesati   The Turing way to parameterized
                                  complexity . . . . . . . . . . . . . . . 654--685
               Carlos Cotta and   
                  Pablo Moscato   The $k$-Feature Set problem is $
                                  W[2]$-complete . . . . . . . . . . . . . 686--690
             James Cheetham and   
                Frank Dehne and   
         Andrew Rau-Chaplin and   
               Ulrike Stege and   
               Peter J. Taillon   Solving large FPT problems on
                                  coarse-grained parallel machines . . . . 691--706
               R. Sai Anand and   
            Thomas Erlebach and   
             Alexander Hall and   
            Stamatis Stefanakos   Call control with k rejections . . . . . 707--722
                 Jens Gramm and   
               Rolf Niedermeier   A fixed-parameter algorithm for minimum
                                  quartet inconsistency  . . . . . . . . . 723--741
             J. A. Makowsky and   
            J. P. Mariño   The parametrized complexity of knot
                                  polynomials  . . . . . . . . . . . . . . 742--756
             Krzysztof Pietrzak   On the parameterized complexity of the
                                  fixed alphabet shortest common
                                  supersequence and longest common
                                  subsequence problems . . . . . . . . . . 757--771
               Peter Heusch and   
            Stefan Porschen and   
             Ewald Speckenmeyer   Improving a fixed parameter tractability
                                  time bound for the shadow problem  . . . 772--788
                 Liming Cai and   
                   David Juedes   On the existence of subexponential
                                  parameterized algorithms . . . . . . . . 789--807
               Jochen Alber and   
             Henning Fernau and   
               Rolf Niedermeier   Graph separators: a parameterized view   808--832
                Jianer Chen and   
                   Iyad A. Kanj   Constrained minimum vertex cover in
                                  bipartite graphs: complexity and
                                  parameterized algorithms . . . . . . . . 833--847
                      Anonymous   Papers to Appear . . . . . . . . . . . . 848--848
                      Anonymous   Volume Author Index  . . . . . . . . . . 849--849
                      Anonymous   C3 --- Advertisement . . . . . . . . . . ibc--ibc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Ed. Board  . . . . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 68, Number 1, February, 2004

                      Anonymous   Advertisement  . . . . . . . . . . . . . ii--ii
                      Anonymous   Advertisement  . . . . . . . . . . . . . III
                      Anonymous   Advertisement  . . . . . . . . . . . . . IV
                      Anonymous   Advertisement  . . . . . . . . . . . . . V
         Alexandru Mateescu and   
               Arto Salomaa and   
                       Sheng Yu   Subword histories and Parikh matrices    1--21
              Kwok Pui Choi and   
                   Louxin Zhang   Sensitivity analysis and efficient
                                  method for identifying optimal spaced
                                  seeds  . . . . . . . . . . . . . . . . . 22--40
           Ng\.oc-Minh Lê   Abstract Voronoi diagram in $3$-space    41--79
             Luca Becchetti and   
           Stefano Leonardi and   
               S. Muthukrishnan   Average stretch without migration  . . . 80--95
              Rod G. Downey and   
       Denis R. Hirschfeldt and   
                  Geoff LaForte   Randomness and reducibility  . . . . . . 96--114
                   Deng-Feng Li   Some measures of dissimilarity in
                                  intuitionistic fuzzy structures  . . . . 115--122
                E. Anceaume and   
        A. Fernández and   
              A. Mostefaoui and   
                  G. Neiger and   
                      M. Raynal   A necessary and sufficient condition for
                                  transforming limited accuracy failure
                                  detectors  . . . . . . . . . . . . . . . 123--133
            Wolfgang Merkle and   
                  Frank Stephan   Trees and learning . . . . . . . . . . . 134--156
          James H. Anderson and   
               Anand Srinivasan   Mixed Pfair/ERfair scheduling of
                                  asynchronous periodic tasks  . . . . . . 157--204
           Nader H. Bshouty and   
         Jeffrey C. Jackson and   
                Christino Tamon   More efficient PAC-learning of DNF with
                                  membership queries under the uniform
                                  distribution . . . . . . . . . . . . . . 205--234
                      Anonymous   Papers to Appear . . . . . . . . . . . . 235--235
                      Anonymous   C3 --- Advertisement . . . . . . . . . . ibc--ibc
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 68, Number 2, March, 2004

             Sampath Kannan and   
             Mihalis Yannakakis   Guest Editors' foreword  . . . . . . . . 237--237
        Dimitris Achlioptas and   
                 Paul Beame and   
                 Michael Molloy   A sharp threshold in proof complexity
                                  yields lower bounds for satisfiability
                                  search . . . . . . . . . . . . . . . . . 238--268
           Bernard Chazelle and   
                       Ding Liu   Lower bounds for intersection searching
                                  and fractional cascading in higher
                                  dimension  . . . . . . . . . . . . . . . 269--284
                   Martin Grohe   Computing crossing numbers in quadratic
                                  time . . . . . . . . . . . . . . . . . . 285--302
            Adam R. Klivans and   
              Rocco A. Servedio   Learning DNF in time $ 2^{O(n^{1 / 3})}
                                  $  . . . . . . . . . . . . . . . . . . . 303--318
            Marcus Schaefer and   
         Daniel \vStefankovi\vc   Decidability of string graphs  . . . . . 319--334
               John Dunagan and   
                Santosh Vempala   Optimal outlier removal in
                                  high-dimensional spaces  . . . . . . . . 335--373
             Luca de Alfaro and   
                 Rupak Majumdar   Quantitative solution of omega-regular
                                  games  . . . . . . . . . . . . . . . . . 374--397
                Andris Ambainis   A new protocol and lower bounds for
                                  quantum coin flipping  . . . . . . . . . 398--416
             Moses Charikar and   
                 Rina Panigrahy   Clustering to minimize the sum of
                                  cluster diameters  . . . . . . . . . . . 417--441
          Michel X. Goemans and   
            David P. Williamson   Approximation algorithms for Max-3-Cut
                                  and other problems via complex
                                  semidefinite programming . . . . . . . . 442--470
                      Anonymous   Papers to Appear . . . . . . . . . . . . 471--471
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 68, Number 3, May, 2004

                  Narayan Vikas   Computational complexity of compaction
                                  to irreflexive cycles  . . . . . . . . . 473--496
                Wojciech Palacz   Algebraic hierarchical graph
                                  transformation . . . . . . . . . . . . . 497--520
                 P. Kuusela and   
                       D. Ocone   Learning with side information: PAC
                                  learning bounds  . . . . . . . . . . . . 521--545
          Etienne Grandjean and   
   Frédéric Olive   Graph properties checkable in linear
                                  time in the number of vertices . . . . . 546--597
               Hung-Min Sun and   
            Bing-Chang Chen and   
                   Her-Tyan Yeh   On the design of time-stamped signatures 598--610
               Frank Drewes and   
               Joost Engelfriet   Branching synchronization grammars with
                                  nested tables  . . . . . . . . . . . . . 611--656
           Christopher M. Homan   Tight lower bounds on the ambiguity of
                                  strong, total, associative, one-way
                                  functions  . . . . . . . . . . . . . . . 657--674
                Pavol Duris and   
            Juraj Hromkovic and   
                 Katsushi Inoue   On the power of nondeterminism and Las
                                  Vegas randomization for two-dimensional
                                  finite automata  . . . . . . . . . . . . 675--699
                      Anonymous   Papers to Appear . . . . . . . . . . . . 700--700
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 68, Number 4, June, 2004

                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
                Edith Cohen and   
           Venkatesan Guruswami   Guest Editors' foreword  . . . . . . . . 701--701
             Ziv Bar-Yossef and   
               T. S. Jayram and   
                 Ravi Kumar and   
                   D. Sivakumar   An information statistics approach to
                                  data stream and communication complexity 702--732
                Jon Feldman and   
                David R. Karger   Decoding turbo-like codes via linear
                                  programming  . . . . . . . . . . . . . . 733--752
              Eldar Fischer and   
                Guy Kindler and   
                   Dana Ron and   
               Shmuel Safra and   
             Alex Samorodnitsky   Testing juntas . . . . . . . . . . . . . 753--787
        Gianni Franceschini and   
             Roberto Grossi and   
               J. Ian Munro and   
                    Linda Pagli   Implicit B-trees: a new data structure
                                  for the dictionary problem . . . . . . . 788--807
            Adam R. Klivans and   
             Ryan O'Donnell and   
              Rocco A. Servedio   Learning intersections and thresholds of
                                  halfspaces . . . . . . . . . . . . . . . 808--840
            Santosh Vempala and   
                     Grant Wang   A spectral algorithm for learning
                                  mixture models . . . . . . . . . . . . . 841--860
                      Anonymous   Papers to Appear . . . . . . . . . . . . 861--861
                      Anonymous   Volume Author Index  . . . . . . . . . . 862--862
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc


Journal of Computer and System Sciences
Volume 69, Number 1, August, 2004

                    Anne Condon   Guest Editor's foreword  . . . . . . . . 1--2
          Alexander A. Razborov   Resolution lower bounds for perfect
                                  matching principles  . . . . . . . . . . 3--27
                 Frederic Green   The correlation between parity and
                                  quadratic polynomials mod 3  . . . . . . 28--44
                Uriel Feige and   
             Daniele Micciancio   The inapproximability of lattice and
                                  coding problems with preprocessing . . . 45--67
                 Ryan O'Donnell   Hardness amplification within NP . . . . 68--94
                      Anonymous   Papers to Appear . . . . . . . . . . . . 95--95
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 69, Number 2, September, 2004

          John M. Hitchcock and   
               Jack H. Lutz and   
               Elvira Mayordomo   Scaled dimension and nonuniform
                                  complexity . . . . . . . . . . . . . . . 97--122
                  John Case and   
                Sanjay Jain and   
              Frank Stephan and   
                  Rolf Wiehagen   Robust learning-rich and poor  . . . . . 123--165
            Erik D. Demaine and   
  Mohammad Taghi Hajiaghayi and   
            Naomi Nishimura and   
            Prabhakar Ragde and   
          Dimitrios M. Thilikos   Approximation algorithms for classes of
                                  graphs excluding single-crossing graphs
                                  as minors  . . . . . . . . . . . . . . . 166--195
              Deepak Chawla and   
                     Lin Li and   
                  Stephen Scott   On approximating weighted sums with
                                  exponentially many terms . . . . . . . . 196--234
                  Boris Alexeev   Minimal DFA for testing divisibility . . 235--243
              Howard Barnum and   
                   Michael Saks   A lower bound on the quantum query
                                  complexity of read-once functions  . . . 244--258
               Carsten Damm and   
            Matthias Krause and   
           Christoph Meinel and   
                  Stephan Waack   On relations between counting
                                  communication complexity classes . . . . 259--280
           Andrew Lomonosov and   
             Meera Sitharam and   
                    Kihong Park   Network QoS games: stability vs
                                  optimality tradeoff  . . . . . . . . . . 281--302
                      Anonymous   Papers to Appear . . . . . . . . . . . . 303--303
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 69, Number 3, November, 2004

             Sanjeev Khanna and   
             Aravind Srinivasan   Special issue: 35th Annual ACM Symposium
                                  on Theory of Computing . . . . . . . . . 305--305
                 Rene Beier and   
          Berthold Vöcking   Random knapsack in expected polynomial
                                  time . . . . . . . . . . . . . . . . . . 306--329
                  Mikkel Thorup   Integer priority queues with decrease
                                  key in constant time and the single
                                  source shortest paths problem  . . . . . 330--353
                  Noga Alon and   
                   Asaf Shapira   Testing subgraphs in directed graphs . . 354--382
                 Yossi Azar and   
                Edith Cohen and   
                  Amos Fiat and   
                Haim Kaplan and   
              Harald Räcke   Optimal oblivious routing in polynomial
                                  time . . . . . . . . . . . . . . . . . . 383--394
         Iordanis Kerenidis and   
                 Ronald de Wolf   Exponential lower bound for $2$-query
                                  locally decodable codes via a quantum
                                  argument . . . . . . . . . . . . . . . . 395--420
            Elchanan Mossel and   
             Ryan O'Donnell and   
              Rocco A. Servedio   Learning functions of k relevant
                                  variables  . . . . . . . . . . . . . . . 421--434
               T. S. Jayram and   
               Subhash Khot and   
                 Ravi Kumar and   
                   Yuval Rabani   Cell-probe lower bounds for the partial
                                  match problem  . . . . . . . . . . . . . 435--447
                 Leonid Gurvits   Classical complexity and quantum
                                  entanglement . . . . . . . . . . . . . . 448--484
      Jittat Fakcharoenphol and   
                 Satish Rao and   
                   Kunal Talwar   A tight bound on approximating arbitrary
                                  metrics by tree metrics  . . . . . . . . 485--497
                      Anonymous   Papers to Appear . . . . . . . . . . . . 498--498
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 69, Number 4, December, 2004

                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
          Mitsunori Ogihara and   
                    Till Tantau   On the reducibility of sets inside NP to
                                  sets with low information content  . . . 499--524
               Dan Gusfield and   
                     Jens Stoye   Linear time algorithms for finding and
                                  representing all the tandem repeats in a
                                  string . . . . . . . . . . . . . . . . . 525--546
          Reuven Bar-Yehuda and   
                  Zehavit Kehat   Approximating the dense set-cover
                                  problem  . . . . . . . . . . . . . . . . 547--561
                  Eric Bach and   
          Susan Coppersmith and   
       Marcel Paz Goldschen and   
               Robert Joynt and   
                   John Watrous   One-dimensional quantum walks with
                                  absorbing boundaries . . . . . . . . . . 562--592
             Wolfgang Maass and   
                  Henry Markram   On the computational power of circuits
                                  of spiking neurons . . . . . . . . . . . 593--616
             Luc Vandeurzen and   
               Marc Gyssens and   
                 Dirk Van Gucht   An expressive language for linear
                                  spatial database queries . . . . . . . . 617--655
                 Stefan Szeider   Minimal unsatisfiable formulas with
                                  bounded clause-variable difference are
                                  fixed-parameter tractable  . . . . . . . 656--674
                  Ning Chen and   
               Xiaotie Deng and   
                   Xiaoming Sun   On complexity of single-minded auction   675--687
                   He Huang and   
                  Jinde Cao and   
                     Yuzhong Qu   Global robust stability of delayed
                                  neural networks with a class of general
                                  activation functions . . . . . . . . . . 688--700
                      Anonymous   Papers to Appear . . . . . . . . . . . . 701--701
                      Anonymous   Volume Author Index  . . . . . . . . . . 702--702
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc


Journal of Computer and System Sciences
Volume 70, Number 1, February, 2005

              Sergio Flesca and   
                   Sergio Greco   Partially ordered regular languages for
                                  graph queries  . . . . . . . . . . . . . 1--25
              Chongfu Huang and   
                 Claudio Moraga   Extracting fuzzy if-then rules by using
                                  the information matrix technique . . . . 26--52
       Robert A. Legenstein and   
                 Wolfgang Maass   Wire length as a circuit complexity
                                  measure  . . . . . . . . . . . . . . . . 53--72
                   Deng-Feng Li   Multiattribute decision making models
                                  and methods using intuitionistic fuzzy
                                  sets . . . . . . . . . . . . . . . . . . 73--85
               Jin Hyun Son and   
               Jung Sun Kim and   
                  Myoung Ho Kim   Extracting the workflow critical path
                                  from the extended well-formed workflow
                                  schema . . . . . . . . . . . . . . . . . 86--106
                    Wenxing Zhu   A provable better Branch and Bound
                                  method for a nonconvex integer quadratic
                                  programming problem  . . . . . . . . . . 107--117
                   Guy Even and   
            Peter-M. Seidel and   
             Warren E. Ferguson   A parametric error analysis of
                                  Goldschmidt's division algorithm . . . . 118--139
                 Sun-Yuan Hsieh   Efficiently parallelizable problems on a
                                  class of decomposable graphs . . . . . . 140--156
                  Lila Kari and   
         Stavros Konstantinidis   Language equations, maximality and
                                  error-detection  . . . . . . . . . . . . 157--178
                      Anonymous   Papers to Appear . . . . . . . . . . . . 179--179
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . ifc--ifc
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 70, Number 2, March, 2005

    David A. Mix Barrington and   
              Neil Immerman and   
          Clemens Lautemann and   
         Nicole Schweikardt and   
           Denis Thérien   First-order expressibility of languages
                                  with neutral letters or: The Crane Beach
                                  conjecture . . . . . . . . . . . . . . . 101--127
      Michael H. Goldwasser and   
              Ming-Yang Kao and   
                     Hsueh-I Lu   Linear-time algorithms for computing
                                  maximum-density sequence segments with
                                  bioinformatics applications  . . . . . . 128--144
             Susanne Albers and   
          Lene M. Favrholdt and   
                    Oliver Giel   On paging with locality of reference . . 145--175
                 Daowen Qiu and   
                  Huaiqing Wang   A probabilistic model of computing with
                                  words  . . . . . . . . . . . . . . . . . 176--200
                    Jia Lee and   
              Susumu Adachi and   
            Ferdinand Peper and   
                 Shinro Mashiko   Delay-insensitive computation in
                                  asynchronous cellular automata . . . . . 201--220
                    Frank Neven   Attribute grammars for unranked trees as
                                  a query language for structured
                                  documents  . . . . . . . . . . . . . . . 221--257
          Antonella Santone and   
               Gigliola Vaglini   A local approach for temporal model
                                  checking of Java bytecode  . . . . . . . 258--281
                      Anonymous   Papers to Appear . . . . . . . . . . . . 282--282
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 70, Number 3, May, 2005

               Richard Karp and   
                    Ming Li and   
              Pavel Pevzner and   
                     Ron Shamir   Guest Editors' foreword  . . . . . . . . 283--283
               Lusheng Wang and   
                 Daming Zhu and   
                Xiaowen Liu and   
                     Shaohan Ma   An O(n2) algorithm for signed
                                  translocation  . . . . . . . . . . . . . 284--299
             Tzvika Hartman and   
                   Roded Sharan   A 1.5-approximation algorithm for
                                  sorting by transpositions and
                                  transreversals . . . . . . . . . . . . . 300--320
                Haim Kaplan and   
                    Elad Verbin   Sorting signed permutations by
                                  reversals, revisited . . . . . . . . . . 321--341
              Jeremy Buhler and   
                  Uri Keich and   
                      Yanni Sun   Designing seeds for similarity search in
                                  genomic DNA  . . . . . . . . . . . . . . 342--363
       Brona Brejová and   
            Daniel G. Brown and   
             Tomás Vinar   Vector seeds: an extension to spaced
                                  seeds  . . . . . . . . . . . . . . . . . 364--380
                   Dan Gusfield   Optimal, efficient reconstruction of
                                  root-unknown phylogenetic networks with
                                  constrained and structured recombination 381--398
             Yonatan Aumann and   
          Efrat Manisterski and   
                  Zohar Yakhini   Designing optimally multiplexed SNP
                                  genotyping assays  . . . . . . . . . . . 399--417
                     Bin Ma and   
             Kaizhong Zhang and   
                 Chengzhi Liang   An effective algorithm for peptide de
                                  novo sequencing from MS/MS spectra . . . 418--430
                      Anonymous   Papers to Appear . . . . . . . . . . . . 431--431
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 70, Number 4, June, 2005

                      Anonymous   Volume TOC . . . . . . . . . . . . . . . III--V
                   Robert Sloan   Special issue on computational learning
                                  theory . . . . . . . . . . . . . . . . . 433--434
           Lisa Hellerstein and   
                 Vijay Raghavan   Exact learning of DNF formulas using DNF
                                  hypotheses . . . . . . . . . . . . . . . 435--470
           Nader H. Bshouty and   
         Jeffrey C. Jackson and   
                Christino Tamon   Exploring learnability between exact and
                                  PAC  . . . . . . . . . . . . . . . . . . 471--484
                        Ke Yang   New lower bounds for statistical query
                                  learning . . . . . . . . . . . . . . . . 485--509
                  Sandra Zilles   Increasing the power of uniform
                                  inductive learners . . . . . . . . . . . 510--538
          Michael V. Vyugin and   
            Vladimir V. V'yugin   Predictive complexity and information    539--554
            Sanjoy Dasgupta and   
                 Philip M. Long   Performance guarantees for hierarchical
                                  clustering . . . . . . . . . . . . . . . 555--569
              Lance Fortnow and   
                   Jack H. Lutz   Prediction and dimension . . . . . . . . 570--589
                      Anonymous   Papers to Appear . . . . . . . . . . . . 590--590
                      Anonymous   Volume Author Index  . . . . . . . . . . 591--591
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4


Journal of Computer and System Sciences
Volume 71, Number 1, July, 2005

                Manuel Koch and   
              L. V. Mancini and   
      Francesco Parisi-Presicce   Graph-based specification of access
                                  control policies . . . . . . . . . . . . 1--33
            Ruggero Lanotte and   
      Andrea Maggiolo-Schettini   Monotonic hybrid systems . . . . . . . . 34--69
                  Tetz C. Huang   A self-stabilizing algorithm for the
                                  shortest path problem assuming
                                  read/write atomicity . . . . . . . . . . 70--85
                   John H. Reif   Efficient parallel factorization and
                                  solution of structured and unstructured
                                  linear systems . . . . . . . . . . . . . 86--143
                      Anonymous   Papers to Appear . . . . . . . . . . . . 144--144
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 71, Number 2, August, 2005

               Piotr Berman and   
           Bhaskar DasGupta and   
                  Ming-Yang Kao   Tight approximability results for test
                                  set problems in bioinformatics . . . . . 145--162
                  Baowen Xu and   
                Yuming Zhou and   
                     Hongmin Lu   An improved accuracy measure for rough
                                  sets . . . . . . . . . . . . . . . . . . 163--173
              Gregory Gutin and   
                  Ton Kloks and   
              Chuan Min Lee and   
                     Anders Yeo   Kernels in planar digraphs . . . . . . . 174--184
                 Eike Kiltz and   
              Hans Ulrich Simon   Threshold circuit lower bounds on
                                  cryptographic functions  . . . . . . . . 185--212
                Amos Beimel and   
                Yuval Ishai and   
               Eyal Kushilevitz   General constructions for
                                  information-theoretic private
                                  information retrieval  . . . . . . . . . 213--247
                      Anonymous   Papers to Appear . . . . . . . . . . . . 248--248
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 71, Number 3, October, 2005

                  Sally Goldman   Special Issue: Learning Theory 2003  . . 249--249
           Nader H. Bshouty and   
            Elchanan Mossel and   
             Ryan O'Donnell and   
              Rocco A. Servedio   Learning DNF from random walks . . . . . 250--265
          Adam Tauman Kalai and   
              Rocco A. Servedio   Boosting in the presence of noise  . . . 266--290
                 Adam Kalai and   
                Santosh Vempala   Efficient algorithms for online decision
                                  problems . . . . . . . . . . . . . . . . 291--307
                  John Case and   
                Sanjay Jain and   
            Franco Montagna and   
                Giulia Simi and   
                   Andrea Sorbi   On learning to coordinate: random bits
                                  help, insightful normal forms, and
                                  competency isomorphisms  . . . . . . . . 308--332
              Matthias Hein and   
           Olivier Bousquet and   
        Bernhard Schölkopf   Maximal margin classification for metric
                                  spaces . . . . . . . . . . . . . . . . . 333--359
             Moses Charikar and   
       Venkatesan Guruswami and   
                  Anthony Wirth   Clustering with qualitative information  360--383
                      Anonymous   Papers to Appear . . . . . . . . . . . . 384--384
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4
                      Anonymous   Learning Theory 2003 . . . . . . . . . . ??

Journal of Computer and System Sciences
Volume 71, Number 4, November, 2005

               Jochen Alber and   
               Hongbing Fan and   
         Michael R. Fellows and   
             Henning Fernau and   
           Rolf Niedermeier and   
              Fran Rosamond and   
                   Ulrike Stege   A refined search tree technique for
                                  Dominating Set on planar graphs  . . . . 385--405
                  Narayan Vikas   A complete and equal computational
                                  complexity classification of compaction
                                  and retraction to all graphs with at
                                  most four vertices and some general
                                  results  . . . . . . . . . . . . . . . . 406--439
         Jonathan Goldstine and   
                 Hing Leung and   
                Detlef Wotschke   Measuring nondeterminism in pushdown
                                  automata . . . . . . . . . . . . . . . . 440--466
           Devdatt Dubhashi and   
             Alessandro Mei and   
       Alessandro Panconesi and   
     Jaikumar Radhakrishnan and   
             Aravind Srinivasan   Fast distributed algorithms for (weakly)
                                  connected dominating sets and
                                  linear-size skeletons  . . . . . . . . . 467--479
           Mehmet Hakan Karaata   An optimal self-stabilizing
                                  strarvation-free alternator  . . . . . . 480--494
    Stavros G. Kolliopoulos and   
                  Neal E. Young   Approximation algorithms for
                                  covering/packing integer programs  . . . 495--505
                   Juha Honkala   An $ n^2$-bound for the ultimate
                                  equivalence problem of certain D0L
                                  systems over an $n$-letter alphabet  . . 506--519
                Philipp Woelfel   Bounds on the OBDD-size of integer
                                  multiplication via universal hashing . . 520--534
               Roberta Gori and   
                   Giorgio Levi   On the verification of finite failure    535--575
                      Anonymous   Papers to Appear . . . . . . . . . . . . 576--576
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4


Journal of Computer and System Sciences
Volume 72, Number 1, February, 2006

            Daniel R. Dooly and   
           Sally A. Goldman and   
                Stephen S. Kwek   Real-valued multiple-instance learning
                                  with queries . . . . . . . . . . . . . . 1--15
               Rajiv Gandhi and   
              Eran Halperin and   
              Samir Khuller and   
               Guy Kortsarz and   
             Aravind Srinivasan   An improved approximation algorithm for
                                  vertex cover with hard capacities  . . . 16--33
             Jörg Flum and   
               Martin Grohe and   
                     Mark Weyer   Bounded fixed-parameter tractability and
                                  log2n nondeterministic bits  . . . . . . 34--71
               Roni Khardon and   
                    Marta Arias   The subsumption lattice and query
                                  learning . . . . . . . . . . . . . . . . 72--94
                  Marcus Hutter   Sequential predictions based on
                                  algorithmic complexity . . . . . . . . . 95--117
            Matthew Andrews and   
                     Lisa Zhang   Minimizing maximum fiber requirement in
                                  optical networks . . . . . . . . . . . . 118--131
               Leah Epstein and   
                    Tamir Tassa   Optimal preemptive scheduling for
                                  general target functions . . . . . . . . 132--162
            Pierre McKenzie and   
          Thomas Schwentick and   
       Denis Thérien and   
               Heribert Vollmer   The many faces of a translation  . . . . 163--179
               G. Geeraerts and   
               J.-F. Raskin and   
                   L. Van Begin   Expand, Enlarge and Check: New
                                  algorithms for the coverability problem
                                  of WSTS  . . . . . . . . . . . . . . . . 180--203
                      Anonymous   Papers to Appear . . . . . . . . . . . . 204--204
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 72, Number 2, March, 2006

            Chandra Chekuri and   
             Daniele Micciancio   Special Issue: FOCS 2003 . . . . . . . . 205--205
                   Subhash Khot   Hardness of approximating the Shortest
                                  Vector Problem in high $ \ell_p $ norms  206--219
                Andris Ambainis   Polynomial degree vs. quantum query
                                  complexity . . . . . . . . . . . . . . . 220--238
              Milena Mihail and   
     Christos Papadimitriou and   
                    Amin Saberi   On certain connectivity properties of
                                  the Internet topology  . . . . . . . . . 239--251
        Nayantara Bhatnagar and   
          Parikshit Gopalan and   
              Richard J. Lipton   Symmetric polynomials over $ \mathbb
                                  {Z}_m $ and simultaneous communication
                                  protocols  . . . . . . . . . . . . . . . 252--285
        Russell Impagliazzo and   
                Bruce M. Kapron   Logics for reasoning about cryptographic
                                  constructions  . . . . . . . . . . . . . 286--320
                 Boaz Barak and   
             Yehuda Lindell and   
                   Salil Vadhan   Lower bounds for non-black-box zero
                                  knowledge  . . . . . . . . . . . . . . . 321--391
László Lovász and   
                Santosh Vempala   Simulated annealing in convex bodies and
                                  an O*(n4) volume algorithm . . . . . . . 392--417
                      Anonymous   Papers to Appear . . . . . . . . . . . . 418--418
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 72, Number 3, May, 2006

               Fan Chung Graham   Foreword . . . . . . . . . . . . . . . . 419--419
               Fan Chung Graham   A brief overview of network algorithms   420--424
                C. Greg Plaxton   Approximation algorithms for
                                  hierarchical location problems . . . . . 425--443
               Richard Cole and   
             Yevgeniy Dodis and   
                Tim Roughgarden   How much can taxes help selfish routing? 444--467
             Jiangzhuo Chen and   
         Rajmohan Rajaraman and   
                  Ravi Sundaram   Meet and merge: Approximation algorithms
                                  for confluent flows  . . . . . . . . . . 468--489
           R. Elsässer and   
                 L. G\kasieniec   Radio communication in random graphs . . 490--506
                      Anonymous   Papers to Appear . . . . . . . . . . . . 507--507
                      Anonymous   C2 --- Ed. Board . . . . . . . . . . . . CO2
                      Anonymous   C4 --- TOC . . . . . . . . . . . . . . . CO4

Journal of Computer and System Sciences
Volume 72, Number 4, June, 2006

           Lars Engebretsen and   
                Marek Karpinski   TSP with bounded metrics . . . . . . . . 509--546
                   S. Demri and   
             F. Laroussinie and   
                Ph. Schnoebelen   A parametric analysis of the
                                  state-explosion problem in model
                                  checking . . . . . . . . . . . . . . . . 547--575
        David Gross-Amblard and   
            Michel de Rougemont   Uniform generation in spatial constraint
                                  databases and applications . . . . . . . 576--591
              Yehuda Hassin and   
                    David Peleg   Average probe complexity in quorum
                                  systems  . . . . . . . . . . . . . . . . 592--616
              Blaise Genest and   
              Anca Muscholl and   
               Helmut Seidl and   
                   Marc Zeitoun   Infinite-state high-level MSCs:
                                  Model-checking and realizability . . . . 617--647
              Michael Elkin and   
                   Guy Kortsarz   Sublogarithmic approximation for
                                  telephone multicast  . . . . . . . . . . 648--659
           Holger Spakowski and   
                 Rahul Tripathi   LWPP and WPP are not uniformly
                                  gap-definable  . . . . . . . . . . . . . 660--689
                     Zuhua Shao   Security of the design of time-stamped
                                  signatures . . . . . . . . . . . . . . . 690--705
                 Li Chunlin and   
                      Li Layuan   A distributed multiple dimensional QoS
                                  constrained resource scheduling
                                  optimization policy in computational
                                  grid . . . . . . . . . . . . . . . . . . 706--726
                  I-En Liao and   
              Cheng-Chi Lee and   
               Min-Shiang Hwang   A password authentication scheme over
                                  insecure networks  . . . . . . . . . . . 727--740
              Hui-Cheng Xia and   
               Deng-Feng Li and   
                Ji-Yan Zhou and   
                 Jian-Ming Wang   Fuzzy LINMAP method for multiattribute
                                  decision making under fuzzy environments 741--759
          John M. Hitchcock and   
            N. V. Vinodchandran   Dimension, entropy rates, and
                                  compression  . . . . . . . . . . . . . . 760--782
              Birgit Jenner and   
       Johannes Köbler and   
            Pierre McKenzie and   
            Jacobo Torán   Corrigendum to ``Completeness results
                                  for graph isomorphism'' [J. Comput.
                                  System Sci. \bf 66 (2003) 549--566]  . . 783--783
                      Anonymous   Papers to appear in forthcoming issues   784--784
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 72, Number 5, August, 2006

                 Moses Charikar   Guest Editor's foreword  . . . . . . . . 785--785
              Amnon Ta-Shma and   
            David Zuckerman and   
                   Shmuel Safra   Extractors from Reed--Muller codes . . . 786--812
           Camil Demetrescu and   
           Giuseppe F. Italiano   Fully dynamic all pairs shortest paths
                                  with real edge weights . . . . . . . . . 813--837
             Lisa Fleischer and   
                 Kamal Jain and   
            David P. Williamson   Iterative rounding $2$-approximation
                                  algorithms for minimum-cost vertex
                                  connectivity problems  . . . . . . . . . 838--867
      Jittat Fakcharoenphol and   
                     Satish Rao   Planar graphs, negative weight edges,
                                  shortest paths, and near linear time . . 868--889
                Yair Bartal and   
Béla Bollobás and   
                   Manor Mendel   Ramsey-type theorems for metric spaces
                                  with applications to online problems . . 890--921
                Tim Roughgarden   On the severity of Braess's Paradox:
                                  Designing networks for selfish users is
                                  hard . . . . . . . . . . . . . . . . . . 922--953
                      Anonymous   Papers to appear in forthcoming issues   954--954
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 72, Number 6, September, 2006

           Yogish Sabharwal and   
             Nishant Sharma and   
                    Sandeep Sen   Nearest neighbors search using point
                                  location in balls with applications to
                                  approximate Voronoi decompositions . . . 955--977
          Mario Di Raimondo and   
                Rosario Gennaro   Provably secure threshold
                                  password-authenticated key exchange  . . 978--1001
               Hung-Min Sun and   
                   Her-Tyan Yeh   Password-based authentication and key
                                  distribution protocols with perfect
                                  forward secrecy  . . . . . . . . . . . . 1002--1011
              Michal Parnas and   
                   Dana Ron and   
               Ronitt Rubinfeld   Tolerant property testing and distance
                                  approximation  . . . . . . . . . . . . . 1012--1042
          Elmar Böhler and   
     Christian Glaßer and   
                 Daniel Meister   Error-bounded probabilistic computations
                                  between MA and AM  . . . . . . . . . . . 1043--1076
               James Aspnes and   
                Kevin Chang and   
           Aleksandr Yampolskiy   Inoculation strategies for victims of
                                  viruses and the sum-of-squares partition
                                  problem  . . . . . . . . . . . . . . . . 1077--1093
           Anand Srinivasan and   
              James H. Anderson   Optimal rate-based scheduling on
                                  multiprocessors  . . . . . . . . . . . . 1094--1117
                      Anonymous   Contents . . . . . . . . . . . . . . . . CO4
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 72, Number 7, November, 2006

                     Irfan Awan   Performance modelling and evaluation of
                                  computer systems . . . . . . . . . . . . 1119--1120
              Armando Ferro and   
               Igor Delgado and   
          Alex Muñoz and   
                  Fidel Liberal   An analytical model for loss estimation
                                  in network traffic analysis systems  . . 1121--1133
              Alessio Botta and   
                Donato Emma and   
     Antonio Pescapé and   
                 Giorgio Ventre   Systematic performance modeling and
                                  characterization of heterogeneous IP
                                  networks . . . . . . . . . . . . . . . . 1134--1143
                 Inn Inn Er and   
             Winston K. G. Seah   Clustering overhead and convergence time
                                  analysis of the mobility-based multi-hop
                                  clustering algorithm for mobile ad hoc
                                  networks . . . . . . . . . . . . . . . . 1144--1155
            Almudena Konrad and   
                Ben Y. Zhao and   
              Anthony D. Joseph   Determining model accuracy of network
                                  traces . . . . . . . . . . . . . . . . . 1156--1171
  E. Grishikashvili Pereira and   
                 R. Pereira and   
               A. Taleb-Bendiab   Performance evaluation for self-healing
                                  distributed services and fault detection
                                  mechanisms . . . . . . . . . . . . . . . 1172--1182
               Makoto Ikeda and   
            Leonard Barolli and   
                Akio Koyama and   
              Arjan Durresi and   
          Giuseppe De Marco and   
                  Jiro Iwashige   Performance evaluation of an intelligent
                                  CAC and routing framework for multimedia
                                  applications in broadband networks . . . 1183--1200
                  Guang Tan and   
              Stephen A. Jarvis   Prediction of short-lived TCP transfer
                                  latency on bandwidth asymmetric links    1201--1210
              Satoshi Itaya and   
        Naohiro Hayashibara and   
             Tomoya Enokido and   
                Makoto Takizawa   HAMS: Scalable peer-to-peer multimedia
                                  streaming model in heterogeneous
                                  networks . . . . . . . . . . . . . . . . 1211--1225
            Muhammad Younas and   
                  Kuo-Ming Chao   A tentative commit protocol for
                                  composite web services . . . . . . . . . 1226--1237
                    L. Guan and   
             M. E. Woodward and   
                     I. U. Awan   Control of queueing delay in a buffer
                                  with time-varying arrival rate . . . . . 1238--1248
                      Anonymous   Papers to appear in forthcoming issues   1249--1249
                      Anonymous   Contents . . . . . . . . . . . . . . . . CO4
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 72, Number 8, December, 2006

                      Anonymous   Contents of Volume 72  . . . . . . . . . III--VII
                   Jon Grov and   
                 Ragnar Normann   Technical note: Replication graphs
                                  revisited  . . . . . . . . . . . . . . . 1251--1261
          Bogdan S. Chlebus and   
            Dariusz R. Kowalski   Robust gossiping with an application to
                                  consensus  . . . . . . . . . . . . . . . 1262--1281
                  Michael Elkin   A faster distributed protocol for
                                  constructing a minimum spanning tree . . 1282--1308
                  Fan Chung and   
              Ronald Graham and   
            Ranjita Bhagwan and   
              Stefan Savage and   
            Geoffrey M. Voelker   Maximizing data locality in distributed
                                  systems  . . . . . . . . . . . . . . . . 1309--1316
     Christopher L. Barrett and   
              Harry B. Hunt and   
          Madhav V. Marathe and   
                 S. S. Ravi and   
      Daniel J. Rosenkrantz and   
             Richard E. Stearns   Complexity of reachability problems for
                                  finite discrete dynamical systems  . . . 1317--1345
                Jianer Chen and   
              Xiuzhen Huang and   
               Iyad A. Kanj and   
                         Ge Xia   Strong computational lower bounds via
                                  parameterized complexity . . . . . . . . 1346--1367
             Yousuke Takada and   
            Teijiro Isokawa and   
            Ferdinand Peper and   
                Nobuyuki Matsui   Construction universality in purely
                                  asynchronous cellular automata . . . . . 1368--1385
                  Jiong Guo and   
                 Jens Gramm and   
          Falk Hüffner and   
           Rolf Niedermeier and   
             Sebastian Wernicke   Compression-based fixed-parameter
                                  algorithms for feedback vertex set and
                                  edge bipartization . . . . . . . . . . . 1386--1396
               Sara Gradara and   
          Antonella Santone and   
            Maria Luisa Villani   DELFIN +: an efficient deadlock
                                  detection tool for CCS processes . . . . 1397--1412
                      Anonymous   Papers to appear in forthcoming issues   1413--1413
                      Anonymous   Author Index for Volume 72 . . . . . . . 1414--1415
                      Anonymous   Contents . . . . . . . . . . . . . . . . CO4
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2


Journal of Computer and System Sciences
Volume 73, Number 1, February, 2007

 Véronique Bruy\`ere and   
                 Olivier Carton   Automata on linear orderings . . . . . . 1--24
                     Jin-Yi Cai   S$^p_2 \subseteq $ ZPP$^{NP}$  . . . . . 25--35
         Christian Glaßer   Languages polylog-time reducible to
                                  dot-depth 1/2  . . . . . . . . . . . . . 36--56
           Rodney G. Downey and   
             Catherine McCartin   Online promise problems with online
                                  width metrics  . . . . . . . . . . . . . 57--72
         Edith Hemaspaandra and   
           Lane A. Hemaspaandra   Dichotomy for voting systems . . . . . . 73--83
                    Lin Lin and   
               Xue-Hai Yuan and   
                   Zun-Quan Xia   Multicriteria fuzzy decision-making
                                  methods based on intuitionistic fuzzy
                                  sets . . . . . . . . . . . . . . . . . . 84--88
                Sanjay Jain and   
                Yen Kaow Ng and   
                 Tiong Seng Tay   Learning languages in a union  . . . . . 89--108
     Valentina S. Harizanov and   
                  Frank Stephan   On the learnability of vector spaces . . 109--122
          Sheng-Tzong Cheng and   
                  Ming-Hung Tao   Quantum cooperative search algorithm for
                                  $3$-SAT  . . . . . . . . . . . . . . . . 123--136
          Petr Sosík and   
Alfonso Rodríguez-Patón   Membrane computing and complexity
                                  theory: A characterization of PSPACE . . 137--152
                      Anonymous   Papers to appear in forthcoming issues   153--153
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2
                      Anonymous   Volume 73, Number 1, February 2007 . . . CO4

Journal of Computer and System Sciences
Volume 73, Number 2, March, 2007

           Christopher Gill and   
                  Oleg Sokolsky   Guest Editors' Foreword  . . . . . . . . 155--155
                Rajeev Alur and   
      Arun Chandrashekharapuram   Dispatch sequences for embedded control
                                  models . . . . . . . . . . . . . . . . . 156--170
Krishnakumar Balasubramanian and   
  Jaiganesh Balasubramanian and   
               Jeff Parsons and   
          Aniruddha Gokhale and   
             Douglas C. Schmidt   A Platform-Independent Component
                                  Modeling Language for Distributed
                                  Real-time and Embedded Systems . . . . . 171--185
         Rodolfo Pellizzoni and   
                Giuseppe Lipari   Holistic analysis of asynchronous
                                  real-time transactions with earliest
                                  deadline scheduling  . . . . . . . . . . 186--206
           Ernesto Wandeler and   
                  Lothar Thiele   Workload correlations in multi-processor
                                  hard real-time systems . . . . . . . . . 207--224
       Björn Andersson and   
                 Cecilia Ekelin   Exact admission-control for integrated
                                  aperiodic and periodic tasks . . . . . . 225--241
                      Anonymous   Papers to appear in forthcoming issues   242--242
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2
                      Anonymous   Volume 73, Number 2, March 2007  . . . . CO4

Journal of Computer and System Sciences
Volume 73, Number 3, May, 2007

               Michael Benedikt   Database Theory 2004 . . . . . . . . . . 243--244
                Mayank Bawa and   
           Aristides Gionis and   
       Hector Garcia-Molina and   
                 Rajeev Motwani   The price of validity in dynamic
                                  networks . . . . . . . . . . . . . . . . 245--264
                Edith Cohen and   
                    Haim Kaplan   Spatially-decaying aggregation over a
                                  network  . . . . . . . . . . . . . . . . 265--288
              Thomas Schwentick   Automata for XML-A survey  . . . . . . . 289--315
             Susan Davidson and   
                 Wenfei Fan and   
                    Carmem Hara   Propagating XML constraints to relations 316--361
                Wim Martens and   
                    Frank Neven   Frontiers of tractability for
                                  typechecking simple XML transformations  362--390
             Ziv Bar-Yossef and   
            Marcus Fontoura and   
               Vanja Josifovski   On the memory requirements of XPath
                                  evaluation over XML streams  . . . . . . 391--441
               Alin Deutsch and   
                 Liying Sui and   
                   Victor Vianu   Specification and verification of
                                  data-driven Web applications . . . . . . 442--474
        Francesco Scarcello and   
            Gianluigi Greco and   
                   Nicola Leone   Weighted hypertree decompositions and
                                  optimal query plans  . . . . . . . . . . 475--506
              Gerome Miklau and   
                      Dan Suciu   A formal analysis of information
                                  disclosure in data exchange  . . . . . . 507--534
                      Anonymous   Papers to appear in forthcoming issues   535--535
                      Anonymous   Contents . . . . . . . . . . . . . . . . CO4
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2

Journal of Computer and System Sciences
Volume 73, Number 4, June, 2007

                      Dan Suciu   Special issue on database theory . . . . 537--537
              Dirk Leinders and   
            Jan Van den Bussche   On the complexity of division and set
                                  joins in the relational algebra  . . . . 538--549
                Wim Martens and   
                Joachim Niehren   On the minimization of XML Schemas and
                                  tree automata for unranked trees . . . . 550--583
             Wolfgang Faber and   
            Gianluigi Greco and   
                   Nicola Leone   Magic Sets and their application to data
                                  integration  . . . . . . . . . . . . . . 584--609
               Ariel Fuxman and   
         Renée J. Miller   First-order query rewriting for
                                  inconsistent databases . . . . . . . . . 610--635
                  Solmaz Kolahi   Dependency-preserving normalization of
                                  relational and XML data  . . . . . . . . 636--647
                 Sara Cohen and   
                 Yehoshua Sagiv   An incremental algorithm for computing
                                  ranked full disjunctions . . . . . . . . 648--668
           J. Nathan Foster and   
       Michael B. Greenwald and   
       Christian Kirkegaard and   
         Benjamin C. Pierce and   
                   Alan Schmitt   Exploiting schemas in data
                                  synchronization  . . . . . . . . . . . . 669--689
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 73, Number 5, August, 2007

              Peter Jonsson and   
                 Andrei Krokhin   Maximum H-colourable subdigraphs and
                                  constraint optimization with arbitrary
                                  weights  . . . . . . . . . . . . . . . . 691--702
             Foto N. Afrati and   
                    Chen Li and   
              Jeffrey D. Ullman   Using views to generate efficient
                                  evaluation plans for queries . . . . . . 703--724
                 Martin Anthony   On the generalization error of fixed
                                  combinations of classifiers  . . . . . . 725--734
     Christian Glaßer and   
          Mitsunori Ogihara and   
                   A. Pavan and   
             Alan L. Selman and   
                     Liyu Zhang   Autoreducibility, mitoticity, and
                                  immunity . . . . . . . . . . . . . . . . 735--754
   MohammadTaghi Hajiaghayi and   
                Naomi Nishimura   Subgraph isomorphism, log-bounded
                                  fragmentation, and graphs of (locally)
                                  bounded treewidth  . . . . . . . . . . . 755--768
                 Rod Downey and   
       Denis R. Hirschfeldt and   
                  Geoff LaForte   Undecidability of the structure of the
                                  Solovay degrees of c.e. reals  . . . . . 769--787
          Yasunori Ishihara and   
           Toshiyuki Morita and   
              Hiroyuki Seki and   
                     Minoru Ito   An equational logic based approach to
                                  the security problem against inference
                                  attacks on object-oriented databases . . 788--817
                 Joan Boyar and   
          Lene M. Favrholdt and   
                  Kim S. Larsen   The relative worst-order ratio applied
                                  to paging  . . . . . . . . . . . . . . . 818--843
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 73, Number 6, September, 2007

           Gabriel M. Kuper and   
                     Jianwen Su   A representation independent language
                                  for planar spatial databases with
                                  Euclidean distance . . . . . . . . . . . 845--874
           Stefano Leonardi and   
                      Danny Raz   Approximating total flow time on
                                  parallel machines  . . . . . . . . . . . 875--891
                Jianer Chen and   
               Iyad A. Kanj and   
        Ljubomir Perkovi\'c and   
              Eric Sedgwick and   
                         Ge Xia   Genus characterizes the complexity of
                                  certain graph problems: Some tight
                                  results  . . . . . . . . . . . . . . . . 892--907
            Gregor Gramlich and   
                Georg Schnitger   Minimizing nfa's and regular expressions 908--923
José L. Balcázar and   
               Jorge Castro and   
             David Guijarro and   
       Johannes Köbler and   
               Wolfgang Lindner   A general dimension for query learning   924--940
              Parke Godfrey and   
                     Jarek Gryz   View disassembly: a rewrite that
                                  extracts portions of views . . . . . . . 941--961
           Denis Xavier Charles   Counting lattice vectors . . . . . . . . 962--972
              Harry Buhrman and   
             Hartmut Klauck and   
       Nikolai Vereshchagin and   
            Paul Vitányi   Individual communication complexity  . . 973--985
                     T. Kavitha   Linear time algorithms for Abelian group
                                  isomorphism and related problems . . . . 986--996
                     Bin Ma and   
               Lusheng Wang and   
                        Ming Li   Near optimal multiple alignment within a
                                  band in polynomial time  . . . . . . . . 997--1011
           Radim Belohlavek and   
  Jirí Dvorák and   
                    Jan Outrata   Fast factorization by similarity in
                                  formal concept analysis of data with
                                  fuzzy attributes . . . . . . . . . . . . 1012--1022
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 73, Number 7, November, 2007

               Richard Karp and   
                    Ming Li and   
              Pavel Pevzner and   
                     Ron Shamir   Special issue on computational molecular
                                  biology  . . . . . . . . . . . . . . . . 1023--1023
                     Bin Ma and   
                        Ming Li   On the complexity of the spaced seeds    1024--1034
       Martin Farach-Colton and   
              Gad M. Landau and   
           S. Cenk Sahinalp and   
                     Dekel Tsur   Optimal spaced seeds for faster
                                  approximate string matching  . . . . . . 1035--1044
                    Yun Cui and   
               Lusheng Wang and   
                     Daming Zhu   A 1.75-approximation algorithm for
                                  unsigned translocation distance  . . . . 1045--1059
       Brona Brejová and   
            Daniel G. Brown and   
             Tomás Vinar   The most probable annotation problem in
                                  HMMs and its application to
                                  bioinformatics . . . . . . . . . . . . . 1060--1077
               Shlomo Moran and   
                      Sagi Snir   Efficient approximation of convex
                                  recolorings  . . . . . . . . . . . . . . 1078--1089
                F. K. Hwang and   
                    F. H. Chang   The identification of positive clones in
                                  a general inhibitor model  . . . . . . . 1090--1094
              Gad M. Landau and   
               Eugene Myers and   
             Michal Ziv-Ukelson   Two algorithms for LCS Consecutive
                                  Suffix Alignment . . . . . . . . . . . . 1095--1117
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 73, Number 8, December, 2007

            H. Sarbazi-Azad and   
                L. M. Mackenzie   Network-based computing  . . . . . . . . 1119--1120
                 N. Alzeidi and   
                A. Khonsari and   
             M. Ould-Khaoua and   
                   L. Mackenzie   A new approach to model virtual channels
                                  in interconnection networks  . . . . . . 1121--1130
                  F. Safaei and   
                A. Khonsari and   
                   M. Fathy and   
                 M. Ould-Khaoua   Communication delay analysis of
                                  fault-tolerant pipelined circuit
                                  switching in torus . . . . . . . . . . . 1131--1144
                    Yu Jiao and   
                  Ali R. Hurson   Energy-efficient wireless information
                                  retrieval  . . . . . . . . . . . . . . . 1145--1163
   Rafael Moreno-Vozmediano and   
          Krishna Nadiminti and   
         Srikumar Venugopal and   
        Ana B. Alonso-Conde and   
            Hussein Gibbins and   
                 Rajkumar Buyya   Portfolio and investment risk analysis
                                  on global grids  . . . . . . . . . . . . 1164--1175
               Riky Subrata and   
           Albert Y. Zomaya and   
                Bjorn Landfeldt   Artificial life techniques for load
                                  balancing in computational grids . . . . 1176--1190
                     Kai Lu and   
               Riky Subrata and   
               Albert Y. Zomaya   On the performance-driven load
                                  distribution for heterogeneous
                                  computational grids  . . . . . . . . . . 1191--1206
               Xiaolong Jin and   
                     Geyong Min   Performance analysis of priority
                                  scheduling mechanisms under
                                  heterogeneous network traffic  . . . . . 1207--1220
            Maziar Goudarzi and   
        Naser MohammadZadeh and   
                Shaahin Hessabi   Using on-chip networks to implement
                                  polymorphism in the co-design of
                                  object-oriented embedded systems . . . . 1221--1231
                Wenjun Xiao and   
                Behrooz Parhami   Structural properties of Cayley digraphs
                                  with applications to mesh and pruned
                                  torus interconnection networks . . . . . 1232--1239
         Azzedine Boukerche and   
          Raed A. Al-Shaikh and   
Mirela Sechi Moretti Annoni Notare   Towards highly available and scalable
                                  high performance clusters  . . . . . . . 1240--1251
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 74, Number 1, February, 2008

                Sanjoy Dasgupta   Special issue on learning theory . . . . 1--1
             Laurence Bisht and   
           Nader H. Bshouty and   
                Lawrance Khoury   Learning with errors in answers to
                                  membership queries . . . . . . . . . . . 2--15
          Misha Alekhnovich and   
             Mark Braverman and   
             Vitaly Feldman and   
            Adam R. Klivans and   
                Toniann Pitassi   The complexity of properly learning
                                  simple concept classes . . . . . . . . . 16--34
            Adam R. Klivans and   
              Rocco A. Servedio   Learning intersections of halfspaces
                                  with a margin  . . . . . . . . . . . . . 35--48
              Jon Kleinberg and   
                   Mark Sandler   Using mixture models for collaborative
                                  filtering  . . . . . . . . . . . . . . . 49--69
                David Kempe and   
                 Frank McSherry   A decentralized algorithm for spectral
                                  analysis . . . . . . . . . . . . . . . . 70--83
           David McAllester and   
            Michael Collins and   
               Fernando Pereira   Case-factor diagrams for structured
                                  probabilistic modeling . . . . . . . . . 84--96
            Baruch Awerbuch and   
               Robert Kleinberg   Online linear optimization and adaptive
                                  routing  . . . . . . . . . . . . . . . . 97--114
             Sham M. Kakade and   
                 Dean P. Foster   Deterministic calibration and Nash
                                  equilibrium  . . . . . . . . . . . . . . 115--130
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 2, March, 2008

            Muhammad Younas and   
           Elhadi Shakshuki and   
                  Kuo-Ming Chao   Special issue: Web and mobile
                                  information systems  . . . . . . . . . . 131--132
                Maya Rupert and   
             Amjad Rattrout and   
                  Salima Hassas   The web from a complex adaptive systems
                                  perspective  . . . . . . . . . . . . . . 133--145
                 H. N. Chua and   
                S. D. Scott and   
                     Y. W. Choi   Enabling device independent co-browsing
                                  through adaptive view points . . . . . . 146--157
         Arne Ketil Eidsvik and   
              Randi Karlsen and   
               Gordon Blair and   
                     Paul Grace   Interfacing remote transaction services
                                  using UPnP . . . . . . . . . . . . . . . 158--169
               Eric Pardede and   
            J. Wenny Rahayu and   
                   David Taniar   XML data update management in
                                  XML-enabled database . . . . . . . . . . 170--195
                 Binyu Zang and   
                Yinsheng Li and   
                    Wei Xie and   
            Zhuangjian Chen and   
             Chen-Fang Tsai and   
              Christopher Laing   An ontological engineering approach for
                                  automating inspection and quarantine at
                                  airports . . . . . . . . . . . . . . . . 196--210
                 Wei-Li Lin and   
                Chi-Chun Lo and   
              Kuo-Ming Chao and   
                Muhammad Younas   Consumer-centric QoS-aware selection of
                                  web services . . . . . . . . . . . . . . 211--231
                 Irfan Awan and   
              Shakeel Ahmad and   
                   Bashir Ahmad   Performance analysis of multimedia based
                                  web traffic with QoS constraints . . . . 232--242
               Rachid Anane and   
            Sukhvir Dhillon and   
                 Behzad Bordbar   Stateless data concealment for
                                  distributed systems  . . . . . . . . . . 243--254
              Hao Lan Zhang and   
        Clement H. C. Leung and   
          Gitesh K. Raikundalia   Topological analysis of AOCD-based agent
                                  networks and experimental results  . . . 255--278
           Elhadi Shakshuki and   
             Hsiang-Hwa Koo and   
               Darcy Benoit and   
                  Daniel Silver   A distributed multi-agent meeting
                                  scheduler  . . . . . . . . . . . . . . . 279--296
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 3, May, 2008

                  Harry Buhrman   Foreword . . . . . . . . . . . . . . . . 297--297
             Ryan O'Donnell and   
              Rocco A. Servedio   Extremal properties of polynomial
                                  threshold functions  . . . . . . . . . . 298--312
                 Scott Aaronson   Quantum certificate complexity . . . . . 313--322
            Albert Atserias and   
           Víctor Dalmau   A combinatorial characterization of
                                  resolution width . . . . . . . . . . . . 323--334
               Subhash Khot and   
                     Oded Regev   Vertex cover might be hard to
                                  approximate to within $ 2 - \epsilon $   335--349
                Wolfgang Merkle   The complexity of stochastic sequences   350--357
              Lance Fortnow and   
                   A. Pavan and   
                 Samik Sengupta   Proving SAT does not have small circuits
                                  with an application to the two queries
                                  problem  . . . . . . . . . . . . . . . . 358--363
                 Pranab Sen and   
                   S. Venkatesh   Lower bounds for predecessor searching
                                  in the cell probe model  . . . . . . . . 364--385
              Chris Calabro and   
        Russell Impagliazzo and   
         Valentine Kabanets and   
               Ramamohan Paturi   The complexity of Unique $k$-SAT: an
                                  Isolation Lemma for $k$-CNFs . . . . . . 386--393
                 Detlef Sieling   Minimization of decision trees is hard
                                  to approximate . . . . . . . . . . . . . 394--403
             Susan Davidson and   
                 Wenfei Fan and   
                    Carmem Hara   Erratum to ``Propagating XML constraints
                                  to relations'' [J. Comput. System Sci.
                                  \bf 73 (2007) 316--361]  . . . . . . . . 404--405
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 4, June, 2008

                      Anonymous   Obituary for Carl Smith  . . . . . . . . 407--407
                William Gasarch   Memorial issue for Carl Smith  . . . . . 408--408
           Lorenzo Carlucci and   
                  John Case and   
                Sanjay Jain and   
                  Frank Stephan   Non-U-shaped vacillatory and team
                                  learning . . . . . . . . . . . . . . . . 409--430
                Sanjay Jain and   
                    Efim Kinber   Learning languages from positive data
                                  and negative counterexamples . . . . . . 431--456
                Andris Ambainis   Probabilistic and team PFIN-type
                                  learning: General properties . . . . . . 457--489
         William I. Gasarch and   
               Andrew C. Y. Lee   Inferring answers to queries . . . . . . 490--512
       Bala Kalyanasundaram and   
       Mahendran Velauthapillai   Taming teams with mind changes . . . . . 513--526
             Janis Barzdins and   
           Rusins Freivalds and   
                  Carl H. Smith   Learning with belief levels  . . . . . . 527--545
               Dana Angluin and   
                     Jiang Chen   Learning a hidden graph using $ O(\log
                                  n) $ queries per edge  . . . . . . . . . 546--556
                Boaz Leskes and   
                Leen Torenvliet   The value of agreement a new boosting
                                  algorithm  . . . . . . . . . . . . . . . 557--586
               Clyde P. Kruskal   The orchard visibility problem and some
                                  variants . . . . . . . . . . . . . . . . 587--597
               Clyde P. Kruskal   The chromatic number of the plane: The
                                  bounded case . . . . . . . . . . . . . . 598--627
            William Gasarch and   
                James Glenn and   
               Clyde P. Kruskal   Finding large $3$-free sets I: The small
                                  n case . . . . . . . . . . . . . . . . . 628--655
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 5, August, 2008

                  Tao Xiang and   
               Kwok-wo Wong and   
                  Xiaofeng Liao   Cryptanalysis of a password
                                  authentication scheme over insecure
                                  networks . . . . . . . . . . . . . . . . 657--661
               Guy Kortsarz and   
                     Zeev Nutov   Tight approximation algorithm for
                                  connectivity augmentation problems . . . 662--670
            Paola Bonizzoni and   
      Gianluca Della Vedova and   
             Riccardo Dondi and   
                      Tao Jiang   On the Approximation of Correlation
                                  Clustering and Consensus Clustering  . . 671--696
                  Tova Milo and   
                 Assaf Sagi and   
                    Elad Verbin   Compact samples for data dissemination   697--720
                David Cohen and   
              Peter Jeavons and   
                   Marc Gyssens   A unified theory of structural
                                  tractability for constraint satisfaction
                                  problems . . . . . . . . . . . . . . . . 721--743
          Michael A. Bender and   
                Dongdong Ge and   
                   Simai He and   
                 Haodong Hu and   
              Ron Y. Pinter and   
              Steven Skiena and   
                   Firas Swidan   Improved bounds on sorting by
                                  length-weighted reversals  . . . . . . . 744--774
                Marta Arias and   
            Lenore J. Cowen and   
                  Kofi A. Laing   Compact roundtrip routing with
                                  topology-independent node names  . . . . 775--795
          Maxime Crochemore and   
                    Lucian Ilie   Maximal repetitions in strings . . . . . 796--807
         Leszek G\kasieniec and   
               Ralf Klasing and   
             Russell Martin and   
            Alfredo Navarra and   
                  Xiaohui Zhang   Fast periodic graph exploration with
                                  constant memory  . . . . . . . . . . . . 808--822
           Rachid Guerraoui and   
                 Petr Kuznetsov   The gap in circumventing the
                                  impossibility of consensus . . . . . . . 823--830
    François Nicolas and   
                    Eric Rivals   Hardness of optimal spaced seed design   831--849
               Shlomo Moran and   
                      Sagi Snir   Convex recolorings of strings and trees:
                                  Definitions, hardness results and
                                  algorithms . . . . . . . . . . . . . . . 850--869
                   Qiang Li and   
                     Huimin Xie   Finite automata for testing
                                  composition-based reconstructibility of
                                  sequences  . . . . . . . . . . . . . . . 870--874
            Cristina Bazgan and   
                 Zsolt Tuza and   
            Daniel Vanderpooten   Approximation of satisfactory bisection
                                  problems . . . . . . . . . . . . . . . . 875--883
                Martin Kutz and   
          Khaled Elbassioni and   
               Irit Katriel and   
                  Meena Mahajan   Simultaneous matchings: Hardness and
                                  approximation  . . . . . . . . . . . . . 884--897
              Peter Jonsson and   
                 Andrei Krokhin   Computational complexity of auditing
                                  finite attributes in statistical
                                  databases  . . . . . . . . . . . . . . . 898--909
                Mark McCann and   
             Nicholas Pippenger   Fault tolerance in cellular automata at
                                  high fault rates . . . . . . . . . . . . 910--918
          Josep Díaz and   
                Maria Serna and   
          Dimitrios M. Thilikos   Efficient algorithms for counting
                                  parameterized list H-colorings . . . . . 919--937
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 6, September, 2008

             M. Ould-Khaoua and   
                         G. Min   Performance analysis and evaluation of
                                  parallel, cluster, and grid computing
                                  systems  . . . . . . . . . . . . . . . . 939--941
           D. Filippopoulos and   
                     H. Karatza   A two-class parallel system with general
                                  service times of the parallel class  . . 942--964
              Subhash Saini and   
              Robert Ciotti and   
         Brian T. N. Gunney and   
           Thomas E. Spelce and   
              Alice Koniges and   
                  Don Dossa and   
        Panagiotis Adamidis and   
          Rolf Rabenseifner and   
         Sunil R. Tiyyagura and   
               Matthias Mueller   Performance evaluation of supercomputers
                                  using HPCC and IMB Benchmarks  . . . . . 965--982
             Basile Schaeli and   
          Sebastian Gerlach and   
                Roger D. Hersch   A simulator for adaptive parallel
                                  applications . . . . . . . . . . . . . . 983--999
              A. E. Kiasari and   
                H. Sarbazi-Azad   Analytic performance comparison of
                                  hypercubes and star graphs with
                                  implementation constraints . . . . . . . 1000--1012
          Jeremy T. Bradley and   
         Stephen T. Gilmore and   
                  Jane Hillston   Analysing distributed Internet worm
                                  attacks using continuous state-space
                                  approximation of process algebra models  1013--1032
                 N. Alzeidi and   
             M. Ould-Khaoua and   
                    A. Khonsari   A new general method to compute virtual
                                  channels occupancy probabilities in
                                  wormhole networks  . . . . . . . . . . . 1033--1042
         Azzedine Boukerche and   
                 Yunfeng Gu and   
               Regina B. Araujo   An Adaptive Dynamic Grid-Based approach
                                  to DDM for large-scale distributed
                                  simulation systems . . . . . . . . . . . 1043--1054
               Xiaolong Jin and   
                     Geyong Min   A heuristic flow-decomposition approach
                                  for generalized processor sharing under
                                  self-similar traffic . . . . . . . . . . 1055--1066
                   Nigel Thomas   Comparing job allocation schemes where
                                  service demand is unknown  . . . . . . . 1067--1081
      Luiz Angelo Steffenel and   
   Grégory Mounié   A framework for adaptive collective
                                  communications for heterogeneous
                                  hierarchical computing systems . . . . . 1082--1093
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc
                      Anonymous   Editorial Board  . . . . . . . . . . . . obc--obc

Journal of Computer and System Sciences
Volume 74, Number 7, November, 2008

             Katsuhiko Nakamura   Languages not recognizable in real time
                                  by one-dimensional cellular automata . . 1095--1102
             Nadia Creignou and   
           Phokion Kolaitis and   
                Bruno Zanuttini   Structure identification of Boolean
                                  relations and plain bases for co-clones  1103--1115
         Michael Domaratzki and   
                    Kai Salomaa   Lower bounds for the transition
                                  complexity of NFAs . . . . . . . . . . . 1116--1130
             Haik Grigorian and   
             Samvel Shoukourian   The equivalence problem of
                                  multidimensional multitape automata  . . 1131--1138
            Devdatta Gangal and   
                 Abhiram Ranade   Precedence constrained scheduling in $
                                  (2 - 7 / (3 p + 1)) \cdot $ optimal  . . 1139--1146
                 Sara Cohen and   
            Benny Kimelfeld and   
                 Yehoshua Sagiv   Generating all maximal induced subgraphs
                                  for hereditary and connected-hereditary
                                  graph properties . . . . . . . . . . . . 1147--1159
                Guomin Yang and   
             Duncan S. Wong and   
              Huaxiong Wang and   
                   Xiaotie Deng   Two-factor mutual authentication based
                                  on smart cards and passwords . . . . . . 1160--1172
     Christian Glaßer and   
             Alan L. Selman and   
            Stephen Travers and   
                Klaus W. Wagner   The complexity of unions of disjoint
                                  sets . . . . . . . . . . . . . . . . . . 1173--1187
                Jianer Chen and   
             Fedor V. Fomin and   
                   Yang Liu and   
                Songjian Lu and   
                Yngve Villanger   Improved algorithms for feedback vertex
                                  set problems . . . . . . . . . . . . . . 1188--1198
             Martin Gairing and   
        Thomas Lücking and   
        Marios Mavronicolas and   
            Burkhard Monien and   
                    Manuel Rode   Nash equilibria in discrete routing
                                  games with convex latency functions  . . 1199--1225
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 74, Number 8, December, 2008

                 Peter Auer and   
                 Philip M. Long   Guest Editors' introduction: Special
                                  issue on learning theory . . . . . . . . 1227--1227
            Yuri Kalnishkan and   
              Michael V. Vyugin   The weak aggregating algorithm and weak
                                  mixability . . . . . . . . . . . . . . . 1228--1244
       Maria-Florina Balcan and   
                 Avrim Blum and   
          Jason D. Hartline and   
                 Yishay Mansour   Reducing mechanism design to algorithm
                                  design via machine learning  . . . . . . 1245--1270
            Baruch Awerbuch and   
               Robert Kleinberg   Competitive collaborative learning . . . 1271--1288
             Mikhail Belkin and   
                  Partha Niyogi   Towards a theoretical foundation for
                                  Laplacian-based manifold methods . . . . 1289--1308
        Alexander L. Strehl and   
             Michael L. Littman   An analysis of model-based Interval
                                  Estimation for Markov Decision Processes 1309--1331
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 75, Number 1, January, 2009

           Lisa Hellerstein and   
                  Hans U. Simon   Special Issue: Learning Theory 2006  . . 1--1
            Adam R. Klivans and   
          Alexander A. Sherstov   Cryptographic hardness for learning
                                  intersections of halfspaces  . . . . . . 2--12
                 Vitaly Feldman   Hardness of approximate two-level logic
                                  minimization and PAC learning with
                                  membership queries . . . . . . . . . . . 13--26
              Lance Fortnow and   
                Adam R. Klivans   Efficient learning algorithms yield
                                  circuit lower bounds . . . . . . . . . . 27--36
  Benjamin I. P. Rubinstein and   
          Peter L. Bartlett and   
             J. Hyam Rubinstein   Shifting: One-inclusion mistake bounds
                                  and sample compression . . . . . . . . . 37--59
               Dana Angluin and   
               James Aspnes and   
                 Jiang Chen and   
                     Yinghua Wu   Learning a circuit by injecting values   60--77
       Maria-Florina Balcan and   
          Alina Beygelzimer and   
                  John Langford   Agnostic active learning . . . . . . . . 78--89
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 2, February, 2009

              Jonathan Katz and   
                  Chiu-Yuen Koo   On expected constant-round protocols for
                                  Byzantine agreement  . . . . . . . . . . 91--112
                  Lila Kari and   
                Shinnosuke Seki   On pseudoknot-bordered words and their
                                  properties . . . . . . . . . . . . . . . 113--121
               Leah Epstein and   
                     Asaf Levin   Better bounds for minimizing SONET ADMs  122--136
              Meena Mahajan and   
            Venkatesh Raman and   
                 Somnath Sikdar   Parameterizing above or below guaranteed
                                  values . . . . . . . . . . . . . . . . . 137--153
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 3, May, 2009

              Chaim Linhart and   
                     Ron Shamir   Faster pattern matching with character
                                  classes using prime number encoding  . . 155--162
               Felix Brandt and   
              Felix Fischer and   
                  Markus Holzer   Symmetries and the complexity of pure
                                  Nash equilibrium . . . . . . . . . . . . 163--177
     Cristian Martín and   
               Mikel Larrea and   
         Ernesto Jiménez   Implementing the Omega failure detector
                                  in the crash-recovery failure model  . . 178--189
           Vincenzo Auletta and   
          Roberto De Prisco and   
                Paolo Penna and   
              Giuseppe Persiano   The power of verification for
                                  one-parameter agents . . . . . . . . . . 190--211
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 4, June, 2009

      Andrea E. F. Clementi and   
               Angelo Monti and   
         Francesco Pasquale and   
             Riccardo Silvestri   Broadcasting in dynamic radio networks   213--230
         Hans L. Bodlaender and   
         Michael R. Fellows and   
          Dimitrios M. Thilikos   Derivation of algorithms for cutwidth
                                  and related graph layout parameters  . . 231--244
              Eric Allender and   
            Michael Bauland and   
              Neil Immerman and   
            Henning Schnoor and   
               Heribert Vollmer   The complexity of satisfiability
                                  problems: Refining Schaefer's theorem    245--254
        Harumichi Nishimura and   
              Tomoyuki Yamakami   An application of quantum finite
                                  automata to interactive proof systems    255--269
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 5, August, 2009

           Joost Engelfriet and   
           Sebastian Maneth and   
                   Helmut Seidl   Deciding equivalence of top-down XML
                                  transformations in polynomial time . . . 271--286
                Mary Ashley and   
          Tanya Berger-Wolf and   
               Piotr Berman and   
  Wanpracha Chaovalitwongse and   
           Bhaskar DasGupta and   
                  Ming-Yang Kao   On approximating four covering and
                                  packing problems . . . . . . . . . . . . 287--302
                    Sherif Sakr   XML compression techniques: a survey and
                                  comparison . . . . . . . . . . . . . . . 303--322
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 6, September, 2009

           Nader H. Bshouty and   
                      Yi Li and   
                 Philip M. Long   Using the doubling dimension to analyze
                                  the generalization of learning
                                  algorithms . . . . . . . . . . . . . . . 323--335
              Bogdan Cautis and   
            Serge Abiteboul and   
                      Tova Milo   Reasoning about XML update constraints   336--358
               Amihood Amir and   
             Yonatan Aumann and   
                Gary Benson and   
                Avivit Levy and   
                Ohad Lipsky and   
                  Ely Porat and   
              Steven Skiena and   
                     Uzi Vishne   Pattern matching with address errors:
                                  Rearrangement distances  . . . . . . . . 359--370
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 7, November, 2009

               Ting-Yu Chen and   
                 Jih-Chang Wang   Interval-valued fuzzy permutation method
                                  and experimental analysis on cardinal
                                  and ordinal evaluations  . . . . . . . . 371--387
       UmaMaheswari C. Devi and   
              James H. Anderson   Improved conditions for bounded
                                  tardiness under EPDF Pfair
                                  multiprocessor scheduling  . . . . . . . 388--420
             Katsuhiko Nakamura   Erratum to ``Languages not recognizable
                                  in real time by one-dimensional cellular
                                  automata'' [J. Comput. System Sci. \bf
                                  74 (7) (2008) 1095--1102]  . . . . . . . 421--421
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 75, Number 8, December, 2009

         Hans L. Bodlaender and   
           Rodney G. Downey and   
         Michael R. Fellows and   
                 Danny Hermelin   On problems without polynomial kernels   423--434
                Igor Razgon and   
               Barry O'Sullivan   Almost $2$-SAT is fixed-parameter
                                  tractable  . . . . . . . . . . . . . . . 435--450
               Tzu-Chin Lin and   
             Chung-Chin Kuo and   
          Yong-Hsiang Hsieh and   
                Biing-Feng Wang   Efficient algorithms for the inverse
                                  sorting problem with bound constraints
                                  under the $ l_\infty $-norm and the
                                  Hamming distance . . . . . . . . . . . . 451--464
                Prakash Ramanan   Worst-case optimal algorithm for XPath
                                  evaluation over XML streams  . . . . . . 465--485
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 76, Number 1, February, 2010

           Radim Belohlavek and   
                   Rudolf Kruse   Editor's foreword  . . . . . . . . . . . 1--2
           Radim Belohlavek and   
                 Vilem Vychodil   Discovery of optimal factors in binary
                                  data via a novel method of matrix
                                  decomposition  . . . . . . . . . . . . . 3--20
              Christian Borgelt   A conditional independence algorithm for
                                  learning undirected graphical models . . 21--33
          Petr Hájek and   
              Martin Holena and   
                      Jan Rauch   The GUHA method and its meaning for data
                                  mining . . . . . . . . . . . . . . . . . 34--48
      Eyke Hüllermeier and   
        Johannes Fürnkranz   On predictive accuracy and risk
                                  minimization in pairwise label ranking   49--62
                Guoqing Liu and   
              Vladik Kreinovich   Fast convolution and Fast Fourier
                                  Transform under interval and fuzzy
                                  uncertainty  . . . . . . . . . . . . . . 63--76
      Matthias Steinbrecher and   
                   Rudolf Kruse   Visualizing and fuzzy filtering for
                                  discovering temporal trajectories of
                                  association rules  . . . . . . . . . . . 77--87
                Karam Gouda and   
              Mosab Hassaan and   
               Mohammed J. Zaki   Prism: an effective approach for
                                  frequent sequence mining via prime-block
                                  encoding . . . . . . . . . . . . . . . . 88--102
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 76, Number 2, March, 2010

                Marko Samer and   
                 Stefan Szeider   Constraint satisfaction with bounded
                                  treewidth revisited  . . . . . . . . . . 103--114
      Raphaël Clifford and   
             Klim Efremenko and   
                  Ely Porat and   
                Amir Rothschild   Pattern matching with don't cares and
                                  few errors . . . . . . . . . . . . . . . 115--124
           H. M. W. Verbeek and   
                 M. T. Wynn and   
     W. M. P. van der Aalst and   
          A. H. M. ter Hofstede   Reduction rules for reset/inhibitor nets 125--143
             Jean Daligault and   
              Gregory Gutin and   
               Eun Jung Kim and   
                     Anders Yeo   FPT algorithms and kernels for the
                                  Directed $k$-Leaf problem  . . . . . . . 144--152
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 76, Number 3--4, May / June, 2010

                      Anonymous   Obituary for our editor Arthur W. Burks  153--153
     Nikolaj Bjòrner and   
              Andreas Blass and   
                  Yuri Gurevich   Content-dependent chunking for
                                  differential compression, the local
                                  maximum approach . . . . . . . . . . . . 154--203
                Michael Dom and   
                  Jiong Guo and   
               Rolf Niedermeier   Approximation and fixed-parameter
                                  algorithms for consecutive ones
                                  submatrix problems . . . . . . . . . . . 204--221
          Pierre Fraigniaud and   
             David Ilcinkas and   
                   Andrzej Pelc   Communication algorithms with advice . . 222--232
                Sanjay Jain and   
                  Frank Stephan   Numberings optimal for learning  . . . . 233--250
              Alexander Okhotin   Decision problems for language equations 251--266
                Martin Dyer and   
        Leslie Ann Goldberg and   
                    Mark Jerrum   An approximation trichotomy for Boolean
                                  #CSP . . . . . . . . . . . . . . . . . . 267--277
  Benjamin I. P. Rubinstein and   
          Peter L. Bartlett and   
             J. Hyam Rubinstein   Corrigendum to ``Shifting: One-inclusion
                                  mistake bounds and sample compression''
                                  [J. Comput. System Sci. \bf 75 (1)
                                  (2009) 37--59] . . . . . . . . . . . . . 278--280
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 76, Number 5, August, 2010

             Wilfrid Hodges and   
                 Ruy de Queiroz   Editors' foreword for JCSS WoLLIC 2008   281--282
        Christophe Calv\`es and   
       Maribel Fernández   Matching and alpha-equivalence check for
                                  nominal terms  . . . . . . . . . . . . . 283--301
              Olivier Danvy and   
                Jacob Johannsen   Inter-deriving semantic artifacts for
                                  object-oriented programming  . . . . . . 302--323
                     Anuj Dawar   Homomorphism preservation on quasi-wide
                                  classes  . . . . . . . . . . . . . . . . 324--332
          Santiago Figueira and   
        Daniel Gorín and   
                 Rafael Grimson   On the formal semantics of IF-like
                                  logics . . . . . . . . . . . . . . . . . 333--346
              Pascal Koiran and   
         Jürgen Landes and   
            Natacha Portier and   
                    Penghui Yao   Adversary lower bounds for nonadaptive
                                  quantum algorithms . . . . . . . . . . . 347--355
              Ilya Mezhirov and   
           Nikolay Vereshchagin   On abstract resource semantics and
                                  computability logic  . . . . . . . . . . 356--372
                  Livio Robaldo   Interpretation and inference with
                                  maximal referential terms  . . . . . . . 373--388
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 76, Number 6, September, 2010

                Jinjun Chen and   
                     Lizhe Wang   Special issue: Scientific workflow 2009  389--389
                  Ping Yang and   
                 Shiyong Lu and   
          Mikhail I. Gofman and   
                   Zijiang Yang   Information flow analysis of scientific
                                  workflows  . . . . . . . . . . . . . . . 390--402
   Rafael Tolosana-Calasanz and   
José Ángel Bañares and   
       Pedro Álvarez and   
    Joaquín Ezpeleta and   
                      Omer Rana   An uncoordinated asynchronous
                                  checkpointing model for hierarchical
                                  scientific workflows . . . . . . . . . . 403--415
                Wanchun Dou and   
               J. Leon Zhao and   
                    Shaokun Fan   A collaborative scheduling approach for
                                  service-driven scientific workflow
                                  execution  . . . . . . . . . . . . . . . 416--427
            Scott Callaghan and   
                Ewa Deelman and   
                 Dan Gunter and   
                Gideon Juve and   
           Philip Maechling and   
         Christopher Brooks and   
                 Karan Vahi and   
               Kevin Milner and   
              Robert Graves and   
               Edward Field and   
                David Okaya and   
                  Thomas Jordan   Scaling up workflow-based applications   428--446
                Daniel Zinn and   
               Shawn Bowers and   
           Sven Köhler and   
         Bertram Ludäscher   Parallelizing XML data-streaming
                                  workflows via MapReduce  . . . . . . . . 447--463
                Jinjun Chen and   
                       Yun Yang   Localising temporal constraints in
                                  scientific workflows . . . . . . . . . . 464--474
                Jiangang Ma and   
                  Jinli Cao and   
                  Yanchun Zhang   Efficiently supporting secure and
                                  reliable collaboration in scientific
                                  workflows  . . . . . . . . . . . . . . . 475--489
                Jacek Sroka and   
                Jan Hidders and   
              Paolo Missier and   
                   Carole Goble   A formal semantics for the Taverna 2
                                  workflow model . . . . . . . . . . . . . 490--508
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc
                      Anonymous   The 2nd International Workshop on
                                  Workflow Management and Application in
                                  Grid Environments & The 3rd International
                                  Workshop on Workflow Management and
                                  Applications in Grid Environments  . . . ??

Journal of Computer and System Sciences
Volume 76, Number 7, November, 2010

                  V. Arvind and   
               Bireswar Das and   
            Partha Mukhopadhyay   Isomorphism and canonization of
                                  tournaments and hypertournaments . . . . 509--523
            Faisal N. Abu-Khzam   A kernelization algorithm for
                                  $d$-Hitting Set  . . . . . . . . . . . . 524--531
                 Joachim Wehler   Simplified proof of the blocking theorem
                                  for free-choice Petri nets . . . . . . . 532--537
              Bart Kuijpers and   
                  Walied Othman   Trajectory databases: Data models,
                                  uncertainty and complete query languages 538--560
         Edith Hemaspaandra and   
            Henning Schnoor and   
                   Ilka Schnoor   Generalized modal satisfiability . . . . 561--578
                 Hubie Chen and   
            Omer Giménez   Causal graphs and structurally
                                  restricted planning  . . . . . . . . . . 579--592
             Henning Fernau and   
           Michael Kaufmann and   
                  Mathias Poths   Comparing trees via crossing
                                  minimization . . . . . . . . . . . . . . 593--608
         Miroslav \'Ciri\'c and   
   Aleksandar Stamenkovi\'c and   
        Jelena Ignjatovi\'c and   
             Tatjana Petkovi\'c   Fuzzy relation equations and reduction
                                  of fuzzy automata  . . . . . . . . . . . 609--633
               Miki Hermann and   
               Reinhard Pichler   Counting complexity of propositional
                                  abduction  . . . . . . . . . . . . . . . 634--649
              Nathann Cohen and   
             Fedor V. Fomin and   
              Gregory Gutin and   
               Eun Jung Kim and   
              Saket Saurabh and   
                     Anders Yeo   Algorithm for finding $k$-vertex
                                  out-trees and its application to
                                  $k$-internal out-branching problem . . . 650--662
        Jesus Arias Fisteus and   
Norberto Fernández García and   
Luis Sánchez Fernández and   
           Carlos Delgado Kloos   Hashing and canonicalizing Notation 3
                                  graphs . . . . . . . . . . . . . . . . . 663--685
           S. Muthukrishnan and   
              Gopal Pandurangan   Thresholding random geometric graph
                                  properties motivated by ad hoc sensor
                                  networks . . . . . . . . . . . . . . . . 686--696
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 76, Number 8, December, 2010

             Chih-Chiang Yu and   
             Chien-Hsin Lin and   
                Biing-Feng Wang   Improved algorithms for finding
                                  length-bounded two vertex-disjoint paths
                                  in a planar graph and minmax k
                                  vertex-disjoint paths in a directed
                                  acyclic graph  . . . . . . . . . . . . . 697--708
       Friedrich Eisenbrand and   
          Fabrizio Grandoni and   
       Thomas Rothvoß and   
             Guido Schäfer   Connected facility location via random
                                  facility sampling and core detouring . . 709--726
         Michael R. Fellows and   
                  Jiong Guo and   
                      Iyad Kanj   The parameterized complexity of some
                                  minimum label problems . . . . . . . . . 727--740
                     Saehwa Kim   Dual ceiling protocol for real-time
                                  synchronization under preemption
                                  threshold scheduling . . . . . . . . . . 741--750
                     Dekel Tsur   Sequencing by hybridization in few
                                  rounds . . . . . . . . . . . . . . . . . 751--758
                 Ofer Dekel and   
              Felix Fischer and   
             Ariel D. Procaccia   Incentive compatible regression learning 759--777
                       Tony Tan   On pebble automata for data languages
                                  with decidable emptiness problem . . . . 778--791
         Christian Glaßer   Space-efficient informational redundancy 792--811
              Nadja Betzler and   
                    Britta Dorn   Towards a dichotomy for the Possible
                                  Winner problem in elections based on
                                  scoring rules  . . . . . . . . . . . . . 812--836
          Tomás Masopust   Simple restriction in context-free
                                  rewriting  . . . . . . . . . . . . . . . 837--846
                 Hubie Chen and   
                   Martin Grohe   Constraint satisfaction with succinctly
                                  specified relations  . . . . . . . . . . 847--860
                   Arto Salomaa   Subword balance, position indices and
                                  power sums . . . . . . . . . . . . . . . 861--871
              Gregory Gutin and   
               Eun Jung Kim and   
             Matthias Mnich and   
                     Anders Yeo   Betweenness parameterized above tight
                                  lower bound  . . . . . . . . . . . . . . 872--878
             David Gamarnik and   
                   Dmitriy Katz   A deterministic approximation algorithm
                                  for computing the permanent of a 0,1
                                  matrix . . . . . . . . . . . . . . . . . 879--883
               Shlomi Dolev and   
               Ronen I. Kat and   
               Elad M. Schiller   When consensus meets self-stabilization  884--900
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 77, Number 1, January, 2011

                 Jin-Yi Cai and   
                 Alan L. Selman   Foreword . . . . . . . . . . . . . . . . 1--2
               Manindra Agrawal   The isomorphism conjecture for constant
                                  depth reductions . . . . . . . . . . . . 3--13
              Eric Allender and   
       Michal Koucký and   
         Detlef Ronneburger and   
                  Sambuddha Roy   The pervasive reach of resource-bounded
                                  Kolmogorov complexity in computational
                                  complexity theory  . . . . . . . . . . . 14--40
                 Jin-Yi Cai and   
                      Pinyan Lu   Holographic algorithms: From art to
                                  science  . . . . . . . . . . . . . . . . 41--61
              Chandan Dubey and   
                Uriel Feige and   
                   Walter Unger   Hardness results for approximating the
                                  bandwidth  . . . . . . . . . . . . . . . 62--90
              Lance Fortnow and   
                Rahul Santhanam   Infeasibility of instance compression
                                  and succinct PCPs for NP . . . . . . . . 91--106
          Parikshit Gopalan and   
           Venkatesan Guruswami   Hardness amplification within NP against
                                  deterministic algorithms . . . . . . . . 107--121
                Richard M. Karp   Heuristic algorithms in computational
                                  molecular biology  . . . . . . . . . . . 122--128
               Subhash Khot and   
                    Rishi Saket   On the hardness of learning
                                  intersections of two halfspaces  . . . . 129--141
           David Buchfuhrer and   
              Christopher Umans   The complexity of Boolean formula
                                  minimization . . . . . . . . . . . . . . 142--153
              Leslie G. Valiant   A bridging model for multi-core
                                  computing  . . . . . . . . . . . . . . . 154--166
                    Ran Raz and   
                Amir Yehudayoff   Multilinear formulas, maximal-partition
                                  discrepancy and mixed-sources extractors 167--190
                 Jesse Kamp and   
                   Anup Rao and   
               Salil Vadhan and   
                David Zuckerman   Deterministic extractors for small-space
                                  sources  . . . . . . . . . . . . . . . . 191--220
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 77, Number 2, March, 2011

               Rachid Anane and   
                Muhammad Younas   Editorial for the special issue on
                                  ``Adaptivity in Heterogeneous
                                  Environments'' . . . . . . . . . . . . . 221--222
                 Wei-Li Lin and   
                Chi-Chun Lo and   
              Kuo-Ming Chao and   
                    Nick Godwin   Multi-group QoS consensus for web
                                  services . . . . . . . . . . . . . . . . 223--243
          Christian Glasner and   
                   Jens Volkert   Adaps --- a three-phase adaptive
                                  prediction system for the run-time of
                                  jobs based on user behaviour . . . . . . 244--261
    Agustín Caminero and   
                  Omer Rana and   
            Blanca Caminero and   
          Carmen Carrión   Network-aware heuristics for
                                  inter-domain meta-scheduling in Grids    262--281
               Fuad Bajaber and   
                     Irfan Awan   Adaptive decentralized re-clustering
                                  protocol for wireless sensor networks    282--292
             Martin Randles and   
                 David Lamb and   
                    E. Odat and   
               A. Taleb-Bendiab   Distributed redundancy and robustness in
                                  complex systems  . . . . . . . . . . . . 293--304
            Richard Anthony and   
                Mona Ghassemian   Automatic mobility status estimation in
                                  wireless self-organised networks . . . . 305--321
           Sandford Bessler and   
          Alexander Fischer and   
              Eva Kühn and   
           Richard Mordinyi and   
               Slobodanka Tomic   Using tuple-spaces to manage the storage
                                  and dissemination of spatial-temporal
                                  content  . . . . . . . . . . . . . . . . 322--331
        Mohamed A. Ameedeen and   
             Behzad Bordbar and   
                   Rachid Anane   Model interoperability via Model Driven
                                  Development  . . . . . . . . . . . . . . 332--347
                     Q. Shi and   
                   N. Zhang and   
                     M. Merabti   Fair exchange of valuable information: a
                                  generalised framework  . . . . . . . . . 348--371
              Pablo Arrighi and   
              Vincent Nesme and   
                Reinhard Werner   Unitarity plus causality implies
                                  localizability . . . . . . . . . . . . . 372--378
                         Bin Fu   Theory and application of width bounded
                                  geometric separators . . . . . . . . . . 379--392
                   M. Manna and   
               F. Scarcello and   
                       N. Leone   On the complexity of regular-grammars
                                  with integer attributes  . . . . . . . . 393--421
              Gregory Gutin and   
               Eun Jung Kim and   
             Stefan Szeider and   
                     Anders Yeo   A probabilistic approach to problems
                                  parameterized above or below tight
                                  bounds . . . . . . . . . . . . . . . . . 422--429
              Wendy Myrvold and   
                  William Kocay   Errors in graph embedding algorithms . . 430--438
               Leah Epstein and   
                 Asaf Levin and   
           Gerhard J. Woeginger   Graph coloring with rejection  . . . . . 439--447
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 77, Number 3, May, 2011

                 Marcelo Arenas   Guest editorial: Special issue on
                                  database theory  . . . . . . . . . . . . 449--449
      Henrik Björklund and   
                Wim Martens and   
              Thomas Schwentick   Conjunctive query containment over trees 450--472
               Nilesh Dalvi and   
             Christopher Re and   
                      Dan Suciu   Queries and materialized views on
                                  probabilistic databases  . . . . . . . . 473--490
              Floris Geerts and   
            Jan Van den Bussche   Relational completeness of query
                                  languages for annotated databases  . . . 491--504
              Wouter Gelade and   
                    Frank Neven   Succinctness of pattern-based schema
                                  languages for XML  . . . . . . . . . . . 505--519
          Claudio Gutierrez and   
          Carlos A. Hurtado and   
       Alberto O. Mendelzon and   
             Jorge Pérez   Foundations of Semantic Web databases    520--541
              Leonid Libkin and   
             Cristina Sirangelo   Data exchange and schema mappings in
                                  open and closed worlds . . . . . . . . . 542--571
                Riccardo Rosati   On the finite controllability of
                                  conjunctive query answering in databases
                                  under open-world assumption  . . . . . . 572--594
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 77, Number 4, July, 2011

                Fatos Xhafa and   
                Leonard Barolli   Special issue foreword: Advances in
                                  pervasive computing systems and
                                  applications . . . . . . . . . . . . . . 595--596
      François Siewe and   
              Hussein Zedan and   
                    Antonio Cau   The Calculus of Context-aware Ambients   597--620
          George Papamarkos and   
    Alexandra Poulovassilis and   
                  Peter T. Wood   Performance modelling of
                                  Event-Condition-Action rules in P2P
                                  networks . . . . . . . . . . . . . . . . 621--636
                Kefeng Xuan and   
                  Geng Zhao and   
               David Taniar and   
               Wenny Rahayu and   
              Maytham Safar and   
                Bala Srinivasan   Voronoi-based range and continuous range
                                  query processing in mobile databases . . 637--651
             Jason B. Ernst and   
                 Mieso K. Denko   The design and evaluation of fair
                                  scheduling in wireless mesh networks . . 652--664
                   Jie Wang and   
                   Lin Guan and   
               Lee Booi Lim and   
                 X. G. Wang and   
                   A. Grigg and   
                    I. Awan and   
                 I. Philips and   
                         X. Chi   QoS enhancements and performance
                                  analysis for delay sensitive
                                  applications . . . . . . . . . . . . . . 665--676
              Arjan Durresi and   
             Mimoza Durresi and   
                Leonard Barolli   Network trust management in emergency
                                  situations . . . . . . . . . . . . . . . 677--686
                   Hai Dong and   
    Farookh Khadeer Hussain and   
                Elizabeth Chang   A framework for discovering and
                                  classifying ubiquitous services in
                                  digital health ecosystems  . . . . . . . 687--704
          Tarek R. Sheltami and   
        Elhadi M. Shakshuki and   
             Hussein T. Mouftah   Video streaming application over WEAC
                                  protocol in MANET  . . . . . . . . . . . 705--719
              Hui-Huang Hsu and   
                Hsuan-Ting Liao   A mobile RFID-based tour system with
                                  instant microblogging  . . . . . . . . . 720--727
                Timothy Y. Chow   Almost-natural proofs  . . . . . . . . . 728--737
      Sebastiaan A. Terwijn and   
            Leen Torenvliet and   
      Paul M. B. Vitányi   Nonapproximability of the normalized
                                  information distance . . . . . . . . . . 738--742
     Émilie Charlier and   
          Marion Le Gonidec and   
                    Michel Rigo   Representing real numbers in a
                                  generalized numeration system  . . . . . 743--759
                Sanjay Jain and   
              Frank Stephan and   
                  Jason Teutsch   Index sets and universal numberings  . . 760--773
              Nadja Betzler and   
                  Jiong Guo and   
      Christian Komusiewicz and   
               Rolf Niedermeier   Average parameterization and partial
                                  kernelization for computing medians  . . 774--789
             Ren-Chiun Wang and   
            Wen-Shenq Juang and   
                 Chin-Laung Lei   Provably secure and efficient
                                  identification and key agreement
                                  protocol with user anonymity . . . . . . 790--798
         Michael R. Fellows and   
           Guillaume Fertin and   
             Danny Hermelin and   
       Stéphane Vialette   Upper and lower bounds for finding
                                  connected motifs in vertex-colored
                                  graphs . . . . . . . . . . . . . . . . . 799--811
         Cristian S. Calude and   
            Nicholas J. Hay and   
                  Frank Stephan   Representation of left-computable $
                                  \epsilon $-random reals  . . . . . . . . 812--819
            Vincent Blondel and   
    Stéphane Gaubert and   
                Natacha Portier   The set of realizations of a max-plus
                                  linear sequence is semi-polyhedral . . . 820--833
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 77, Number 5, September, 2011

                   Lin Guan and   
               Xingang Wang and   
                 Irfan Awan and   
              Waltenegus Dargie   Performance modeling and evaluation of
                                  heterogeneous computer networks  . . . . 835--836
              Glenford Mapp and   
             Dhawal Thakker and   
              Orhan Gemikonakli   Exploring gate-limited analytical models
                                  for high-performance network storage
                                  servers  . . . . . . . . . . . . . . . . 837--851
          Waltenegus Dargie and   
               Alexander Schill   Stability and performance analysis of
                                  randomly deployed wireless networks  . . 852--860
           Richard G. Clegg and   
                 Raul Landa and   
                     Miguel Rio   Criticisms of modelling packet traffic
                                  using long-range dependence (extended
                                  version) . . . . . . . . . . . . . . . . 861--868
                Jinpyo Hong and   
                   Hwangnam Kim   An empirical framework for user mobility
                                  models: Refining and modeling user
                                  registration patterns  . . . . . . . . . 869--883
 Sureshkumar V. Subramanian and   
                    Rudra Dutta   A study of performance and scalability
                                  metrics of a SIP proxy server --- a
                                  practical approach . . . . . . . . . . . 884--897
                  L. B. Lim and   
                    L. Guan and   
                   A. Grigg and   
             I. W. Phillips and   
                 X. G. Wang and   
                     I. U. Awan   Controlling mean queuing delay under
                                  multi-class bursty and correlated
                                  traffic  . . . . . . . . . . . . . . . . 898--916
               Dong Kun Noh and   
                  Kyungtae Kang   Balanced energy allocation scheme for a
                                  solar-powered sensor system and its
                                  effects on network-wide performance  . . 917--932
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 77, Number 6, November, 2011

          Alfredo Cuzzocrea and   
                   David Taniar   Distributed XML Processing and
                                  Management: Theory and Practice  . . . . 933--935
               S. Abiteboul and   
                 G. Gottlob and   
                       M. Manna   Distributed XML design . . . . . . . . . 936--964
          Alfredo Cuzzocrea and   
                  Elisa Bertino   Privacy Preserving OLAP over Distributed
                                  XML Data: A Theoretically-Sound
                                  Secure-Multiparty-Computation Approach   965--987
               Sergio Greco and   
            Francesco Gullo and   
             Giovanni Ponti and   
               Andrea Tagarelli   Collaborative clustering of XML
                                  documents  . . . . . . . . . . . . . . . 988--1008
        Leonardo O. Moreira and   
  Flávio R. C. Sousa and   
               Javam C. Machado   A distributed concurrency control
                                  mechanism for XML data . . . . . . . . . 1009--1022
               Stasys Jukna and   
                Georg Schnitger   Min-rank conjecture for log-depth
                                  circuits . . . . . . . . . . . . . . . . 1023--1038
             Sung-Soon Choi and   
                Kyomin Jung and   
                  Jeong Han Kim   Almost tight upper bound for finding
                                  Fourier coefficients of bounded
                                  pseudo-Boolean functions . . . . . . . . 1039--1053
                     Bang Ye Wu   A note on approximating the min-max
                                  vertex disjoint paths on directed
                                  acyclic graphs . . . . . . . . . . . . . 1054--1057
                  Iyad Kanj and   
       Michael J. Pelsmajer and   
            Marcus Schaefer and   
                         Ge Xia   On the induced matching problem  . . . . 1058--1070
      Stéphane Bessy and   
             Fedor V. Fomin and   
              Serge Gaspers and   
            Christophe Paul and   
              Anthony Perez and   
              Saket Saurabh and   
 Stéphan Thomassé   Kernels for feedback arc set in
                                  tournaments  . . . . . . . . . . . . . . 1071--1078
                Foto Afrati and   
                  Rada Chirkova   Selecting and using views to compute
                                  aggregate queries  . . . . . . . . . . . 1079--1107
           Feodor F. Dragan and   
             Fedor V. Fomin and   
               Petr A. Golovach   Spanners in sparse graphs  . . . . . . . 1108--1119
                Prakash Ramanan   Memory lower bounds for XPath evaluation
                                  over XML streams . . . . . . . . . . . . 1120--1140
         Michael R. Fellows and   
                  Jiong Guo and   
               Hannes Moser and   
               Rolf Niedermeier   A generalization of Nemhauser and
                                  Trotter's local optimization theorem . . 1141--1158
                 Omid Amini and   
             Fedor V. Fomin and   
                  Saket Saurabh   Implicit branching and parameterized
                                  partial cover problems . . . . . . . . . 1159--1171
            Carme \`Alvarez and   
            Joaquim Gabarro and   
                    Maria Serna   Equilibria problems on games: Complexity
                                  versus succinctness  . . . . . . . . . . 1172--1197
                      Anonymous   Contents . . . . . . . . . . . . . . . . ibc--ibc
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc


Journal of Computer and System Sciences
Volume 78, Number 1, January, 2012

                 Luigi Palopoli   Editor's foreword  . . . . . . . . . . . 1--1
           Vincent Conitzer and   
                Tuomas Sandholm   Computing optimal outcomes under an
                                  expressive representation of settings
                                  with externalities . . . . . . . . . . . 2--14
           Shahar Dobzinski and   
                 Noam Nisan and   
               Michael Schapira   Truthful randomized mechanisms for
                                  combinatorial auctions . . . . . . . . . 15--25
            Diego Calvanese and   
        Giuseppe De Giacomo and   
         Maurizio Lenzerini and   
                Riccardo Rosati   View-based query answering in
                                  Description Logics: Semantics and
                                  complexity . . . . . . . . . . . . . . . 26--46
               Thomas Eiter and   
            Magdalena Ortiz and   
                  Mantas Simkus   Conjunctive query answering in the
                                  description logic SH using knots . . . . 47--85
                  D. Pearce and   
                    A. Valverde   Synonymous theories and knowledge
                                  representations in answer set
                                  programming  . . . . . . . . . . . . . . 86--104
              Sivan Albagli and   
  Rachel Ben-Eliyahu-Zohary and   
             Solomon E. Shimony   Markov network based ontology matching   105--118
         Alessandro Armando and   
         Enrico Giunchiglia and   
              Marco Maratea and   
             Serena Elisa Ponta   An action-based approach to the formal
                                  specification and automatic analysis of
                                  business processes under authorization
                                  constraints  . . . . . . . . . . . . . . 119--141
           Marko Hölbl and   
             Tatjana Welzer and   
                 Bostjan Brumen   An improved two-party identity-based
                                  authenticated key agreement protocol
                                  using pairings . . . . . . . . . . . . . 142--150
              Gregory Gutin and   
             Leo van Iersel and   
             Matthias Mnich and   
                     Anders Yeo   Every ternary permutation constraint
                                  satisfaction problem parameterized above
                                  average has a kernel with a quadratic
                                  number of variables  . . . . . . . . . . 151--163
             Zhi-Zhong Chen and   
                     Bin Ma and   
                   Lusheng Wang   A three-string approach to the closest
                                  string problem . . . . . . . . . . . . . 164--178
             Luke Mathieson and   
                 Stefan Szeider   Editing graphs to satisfy degree
                                  constraints: A parameterized approach    179--191
            Franco P. Preparata   Accurate and precise aggregation
                                  counting . . . . . . . . . . . . . . . . 192--197
      Henrik Björklund and   
                    Wim Martens   The tractability frontier for NFA
                                  minimization . . . . . . . . . . . . . . 198--210
                Jianer Chen and   
                       Jie Meng   A 2 k kernel for the cluster editing
                                  problem  . . . . . . . . . . . . . . . . 211--220
                Florentin Ipate   Learning finite cover automata from
                                  queries  . . . . . . . . . . . . . . . . 221--244
               Klaus Jansen and   
                       Hu Zhang   Scheduling malleable tasks with
                                  precedence constraints . . . . . . . . . 245--259
         Vladimir Braverman and   
           Rafail Ostrovsky and   
                  Carlo Zaniolo   Optimal sampling from sliding windows    260--272
            Yung-Hsing Peng and   
            Chang-Biau Yang and   
           Chiou-Ting Tseng and   
                   Chiou-Yi Hor   A new efficient indexing algorithm for
                                  one-dimensional real scaled patterns . . 273--278
              Moran Feldman and   
               Guy Kortsarz and   
                     Zeev Nutov   Improved approximation algorithms for
                                  Directed Steiner Forest  . . . . . . . . 279--292
         Jürgen Dassow and   
          Tomás Masopust   On restricted context-free grammars  . . 293--304
              Serge Gaspers and   
              Gregory B. Sorkin   A universally fastest algorithm for Max
                                  2-Sat, Max 2-CSP, and everything in
                                  between  . . . . . . . . . . . . . . . . 305--335
           Matthijs Bomhoff and   
                Walter Kern and   
                    Georg Still   On bounded block decomposition problems
                                  for under-specified systems of equations 336--347
           Jürg Kohlas and   
                 Marc Pouly and   
                Cesar Schneuwly   Generic local computation  . . . . . . . 348--369
          Amir Talaei-Khoei and   
              Terje Solvoll and   
                Pradeep Ray and   
           Nandan Parameshwaran   Maintaining awareness using policies;
                                  Enabling agents to identify relevance of
                                  information  . . . . . . . . . . . . . . 370--391
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 78, Number 2, March, 2012

                   Helmut Veith   Special Issue: Games in Verification . . 393--393
      Krishnendu Chatterjee and   
            Thomas A. Henzinger   A survey of stochastic $ \omega
                                  $-regular games  . . . . . . . . . . . . 394--413
              Sharon Shoham and   
                  Orna Grumberg   Multi-valued model checking games  . . . 414--429
             Keijo Heljanko and   
         Misa Keinänen and   
               Martin Lange and   
             Ilkka Niemelä   Solving parity games by a reduction to
                                  SAT  . . . . . . . . . . . . . . . . . . 430--440
          Barbara Jobstmann and   
              Stefan Staber and   
         Andreas Griesmayer and   
                 Roderick Bloem   Finding and fixing faults  . . . . . . . 441--460
                  Markus Lohrey   Model-checking hierarchical structures   461--490
          Emilio Di Giacomo and   
              Walter Didimo and   
            Giuseppe Liotta and   
                    Henk Meijer   Drawing a tree as a minimum spanning
                                  tree approximation . . . . . . . . . . . 491--503
                  Jing Tian and   
                 Xianzhong Zhao   Representations of commutative
                                  asynchronous automata  . . . . . . . . . 504--516
              Nicolas Bedon and   
            Chloé Rispal   Schützenberger and Eilenberg theorems for
                                  words on linear orderings  . . . . . . . 517--536
         Christos Kapoutsis and   
    Richard Královic and   
              Tobias Mömke   Size complexity of rotating and sweeping
                                  automata . . . . . . . . . . . . . . . . 537--558
             Mathias Weller and   
      Christian Komusiewicz and   
           Rolf Niedermeier and   
               Johannes Uhlmann   On making directed graphs transitive . . 559--574
                 Pedro Lara and   
        Fábio Borges and   
            Renato Portugal and   
                   Nadia Nedjah   Parallel modular exponentiation using
                                  load balancing without precomputation    575--582
              Daniel Deutch and   
                      Tova Milo   A structural/temporal query language for
                                  Business Processes . . . . . . . . . . . 583--609
                 Zehui Shao and   
                   Fei Deng and   
              Meilian Liang and   
                    Xiaodong Xu   On sets without $k$-term arithmetic
                                  progression  . . . . . . . . . . . . . . 610--618
             Jesper Jansson and   
          Kunihiko Sadakane and   
                  Wing-Kin Sung   Ultra-succinct representation of ordered
                                  trees with applications  . . . . . . . . 619--631
                 Raphael Yuster   Approximate shortest paths in weighted
                                  graphs . . . . . . . . . . . . . . . . . 632--637
          Andrei A. Bulatov and   
       Víctor Dalmau and   
               Martin Grohe and   
             Dániel Marx   Enumerating homomorphisms  . . . . . . . 638--650
              Jonathan Katz and   
           Philip MacKenzie and   
              Gelareh Taban and   
                  Virgil Gligor   Two-server password-only authenticated
                                  key exchange . . . . . . . . . . . . . . 651--669
     Ken-ichi Kawarabayashi and   
               Yusuke Kobayashi   A linear time algorithm for the induced
                                  disjoint paths problem in planar graphs  670--680
             Andrei Bulatov and   
                Martin Dyer and   
        Leslie Ann Goldberg and   
           Markus Jalsenius and   
                Mark Jerrum and   
                 David Richerby   The complexity of weighted and
                                  unweighted #CSP  . . . . . . . . . . . . 681--688
                      Anonymous   Contents . . . . . . . . . . . . . . . . ibc--ibc
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 78, Number 3, May, 2012

                  Minghui Jiang   Approximability of constrained LCS . . . 689--697
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
            Venkatesh Raman and   
              Saket Saurabh and   
          B. V. Raghavendra Rao   Faster algorithms for finding and
                                  counting subgraphs . . . . . . . . . . . 698--706
         Michael R. Fellows and   
             Fedor V. Fomin and   
          Daniel Lokshtanov and   
           Frances Rosamond and   
              Saket Saurabh and   
                Yngve Villanger   Local search: Is brute-force avoidable?  707--719
                 Guohui Lin and   
               Randy Goebel and   
                   Zhong Li and   
                   Lusheng Wang   An improved approximation algorithm for
                                  the complementary maximal strip recovery
                                  problem  . . . . . . . . . . . . . . . . 720--730
               Bruno Durand and   
        Andrei Romashchenko and   
                 Alexander Shen   Fixed-point tile sets and their
                                  applications . . . . . . . . . . . . . . 731--764
                Samir Datta and   
            Raghav Kulkarni and   
           Raghunath Tewari and   
            N. V. Vinodchandran   Space complexity of perfect matching in
                                  bounded genus bipartite graphs . . . . . 765--779
               Benedek Nagy and   
                 Friedrich Otto   On CD-systems of stateless deterministic
                                  R-automata with window size one  . . . . 780--806
                   Tianrong Lin   Another approach to the equivalence of
                                  measure-many one-way quantum finite
                                  automata and its application . . . . . . 807--821
            Ahmed Bouajjani and   
                David Harel and   
                    Lenore Zuck   Editor's foreword  . . . . . . . . . . . 822--822
           Krzysztof R. Apt and   
           Frank S. de Boer and   
 Ernst-Rüdiger Olderog and   
                  Stijn de Gouw   Verification of object-oriented
                                  programs: A transformational approach    823--852
              Ittai Balaban and   
                Amir Pnueli and   
                Yaniv Sa'ar and   
                 Lenore D. Zuck   Verification of multi-linked heaps . . . 853--876
          Albert Benveniste and   
             Timothy Bourke and   
         Beno\^\it Caillaud and   
                    Marc Pouzet   Non-standard semantics of hybrid systems
                                  modelers . . . . . . . . . . . . . . . . 877--910
             Roderick Bloem and   
          Barbara Jobstmann and   
               Nir Piterman and   
                Amir Pnueli and   
                    Yaniv Sa'ar   Synthesis of Reactive(1) designs . . . . 911--938
           Egon Börger and   
         Antonio Cisternino and   
               Vincenzo Gervasi   Ambient Abstract State Machines with
                                  applications . . . . . . . . . . . . . . 939--959
                 Nissim Francez   When are different type-logical semantic
                                  definitions defining equivalent
                                  meanings?  . . . . . . . . . . . . . . . 960--969
                David Harel and   
                    Itai Segall   Synthesis from scenario-based
                                  specifications . . . . . . . . . . . . . 970--980
             Orna Kupferman and   
                Amir Pnueli and   
                 Moshe Y. Vardi   Once and for all . . . . . . . . . . . . 981--996
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 78, Number 4, July, 2012

                 Chunfu Wei and   
                  Zheng Pei and   
                      Huamin Li   An induced OWA operator in coal mine
                                  safety evaluation  . . . . . . . . . . . 997--1005
                Prakash Ramanan   Rewriting XPath queries using
                                  materialized XPath views . . . . . . . . 1006--1025
                 Sebastian Link   Characterisations of multivalued
                                  dependency implication over undetermined
                                  universes  . . . . . . . . . . . . . . . 1026--1044
              M. W. Vincent and   
                     J. Liu and   
                     M. Mohania   The implication problem for `closest
                                  node' functional dependencies in
                                  complete XML documents . . . . . . . . . 1045--1098
                Xiaowen Lou and   
                     Daming Zhu   A new approximation algorithm for
                                  cut-and-paste sorting of unsigned
                                  circular permutations  . . . . . . . . . 1099--1114
       Anahí Gajardo and   
                Jarkko Kari and   
          Andrés Moreira   On time-symmetry in cellular automata    1115--1126
                Yicheng Wen and   
                       Asok Ray   Vector space formulation of
                                  probabilistic finite state automata  . . 1127--1141
                Amos Beimel and   
             Yeow Meng Chee and   
              Huaxiong Wang and   
               Liang Feng Zhang   Communication-efficient distributed
                                  oblivious transfer . . . . . . . . . . . 1142--1157
                Rahat Iqbal and   
                   Nazaraf Shah   Information Retrieval, Decision Making
                                  Process and User Needs . . . . . . . . . 1158--1159
           Jonathan Gemmell and   
           Thomas Schimoler and   
           Bamshad Mobasher and   
                    Robin Burke   Resource recommendation in social
                                  annotation systems: A linear-weighted
                                  hybrid approach  . . . . . . . . . . . . 1160--1174
         Magdalini Eirinaki and   
              Shamita Pisal and   
                 Japinder Singh   Feature-based opinion mining and ranking 1175--1184
               Haifeng Shen and   
                    Mark Reilly   Personalized multi-user view and content
                                  synchronization and retrieval in
                                  real-time mobile social software
                                  applications . . . . . . . . . . . . . . 1185--1203
         Adam Grzywaczewski and   
                    Rahat Iqbal   Task-specific information retrieval
                                  systems for software engineers . . . . . 1204--1218
           Fazilatur Rahman and   
                  Jawed Siddiqi   Semantic annotation of digital music . . 1219--1231
                   G. Fenza and   
                   D. Furno and   
                        V. Loia   Hybrid approach for context-aware
                                  service discovery in healthcare domain   1232--1247
   Pir Abdul Rasool Qureshi and   
                Nasrullah Memon   Hybrid model of content extraction . . . 1248--1257
               Kashif Iqbal and   
         Michael O. Odetayo and   
                     Anne James   Content-based image retrieval approach
                                  for biometric security using colour,
                                  texture and shape features controlled by
                                  fuzzy heuristics . . . . . . . . . . . . 1258--1277
                      Anonymous   Contents . . . . . . . . . . . . . . . . ibc--ibc
                      Anonymous   Contents . . . . . . . . . . . . . . . . obc--obc
                      Anonymous   Editorial Board  . . . . . . . . . . . . ifc--ifc

Journal of Computer and System Sciences
Volume 78, Number 5, September, 2012

                Jinjun Chen and   
                     Lizhe Wang   Special Issue: Cloud Computing 2011  . . 1279--1279
                  Linlin Wu and   
         Saurabh Kumar Garg and   
                 Rajkumar Buyya   SLA-based admission control for a
                                  Software-as-a-Service provider in Cloud
                                  computing environments . . . . . . . . . 1280--1299
   Rafael Tolosana-Calasanz and   
José Ángel Bañares and   
               Congduc Pham and   
                   Omer F. Rana   Enforcing QoS in scientific workflow
                                  systems enacted over Cloud
                                  infrastructures  . . . . . . . . . . . . 1300--1315
                Lianyong Qi and   
                Wanchun Dou and   
                Xuyun Zhang and   
                    Jinjun Chen   A QoS-aware composition method
                                  supporting cross-platform service
                                  invocation in cloud environment  . . . . 1316--1329
             David Villegas and   
             Norman Bobroff and   
                Ivan Rodero and   
             Javier Delgado and   
                 Yanbin Liu and   
         Aditya Devarakonda and   
                 Liana Fong and   
          S. Masoud Sadjadi and   
                Manish Parashar   Cloud federation in a layered service
                                  model  . . . . . . . . . . . . . . . . . 1330--1344
                    Jing He and   
              Yanchun Zhang and   
             Guangyan Huang and   
                   Yong Shi and   
                        Jie Cao   Distributed data possession checking for
                                  securing multiple replicas in
                                  geographically-dispersed clouds  . . . . 1345--1358
          David W. Chadwick and   
                   Kaniz Fatema   A privacy preserving authorisation
                                  system for the cloud . . . . . . . . . . 1359--1373
              Gaofeng Zhang and   
                   Yun Yang and   
                    Jinjun Chen   A historical probability based noise
                                  generation strategy for privacy
                                  protection in cloud computing  . . . . . 1374--1381
           Fabrizio Marozzo and   
             Domenico Talia and   
                  Paolo Trunfio   P2P-MapReduce: Parallel data processing
                                  in dynamic Cloud environments  . . . . . 1382--1402
              Alexander Rakhlin   Foreword . . . . . . . . . . . . . . . . 1403--1403
      Nicol\`o Cesa-Bianchi and   
            Gábor Lugosi   Combinatorial bandits  . . . . . . . . . 1404--1422
             A. S. Dalalyan and   
                 A. B. Tsybakov   Sparse regression learning by
                                  aggregation and Langevin Monte-Carlo . . 1423--1443
                 Vitaly Feldman   A complete characterization of
                                  statistical query learning with
                                  applications to evolvability . . . . . . 1444--1459
                 Daniel Hsu and   
             Sham M. Kakade and   
                     Tong Zhang   A spectral algorithm for learning Hidden
                                  Markov Models  . . . . . . . . . . . . . 1460--1480
          Adam Tauman Kalai and   
               Varun Kanade and   
                 Yishay Mansour   Reliable agnostic learning . . . . . . . 1481--1495
             Samory Kpotufe and   
                Sanjoy Dasgupta   A tree-based regressor that adapts to
                                  intrinsic dimension  . . . . . . . . . . 1496--1515
         Alessandro Lazaric and   
              Rémi Munos   Learning with stochastic inputs and
                                  adversarial outputs  . . . . . . . . . . 1516--1537
                 Yisong Yue and   
               Josef Broder and   
           Robert Kleinberg and   
              Thorsten Joachims   The $K$-armed dueling bandits problem    1538--1556
             Charles Jordan and   
                Thomas Zeugmann   Testable and untestable classes of
                                  first-order formulae . . . . . . . . . . 1557--1578
             Prasad Chebolu and   
        Leslie Ann Goldberg and   
                 Russell Martin   The complexity of approximately counting
                                  stable roommate assignments  . . . . . . 1579--1605
              Frederic Dorn and   
             Fedor V. Fomin and