@article{Comer/83,
AUTHOR = {Comer, D.},
TITLE = {Effects of updates on optimality in tries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {1-13},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Purdue Univ., West Lafayette, IN, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Latteux/83a,
AUTHOR = {Latteux, M.},
TITLE = {Restricted one counter languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {14-33},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Univ. des Sci. et Tech. de Lille I, Uer, Eea, Villeneuve d'Ascq, France},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ehrenfeucht-Engelfriet-Rozenberg/83,
AUTHOR = {Ehrenfeucht, A. and Engelfriet, J. and Rozenberg, G.},
TITLE = {Context free normal systems and ETOL systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {34-46},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ibarra-Leininger/83a,
AUTHOR = {Ibarra, O.H. and Leininger, B.S.},
TITLE = {On the zero-inequivalence problem for loop programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {47-64},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Carlson-Savage/83,
AUTHOR = {Carlson, D.A. and Savage, J.E.},
TITLE = {Size-space tradeoffs for oblivious computations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {65-81},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Brown Univ., Providence, RI, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Albert-Wood/83,
AUTHOR = {Albert, J. and Wood, D.},
TITLE = {Checking sets, test sets, rich languages and commutatively closed languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {82-91},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Inst. f{\"u}r Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe, Germany},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Riffelmacher/83,
AUTHOR = {Riffelmacher, D.},
TITLE = {Multiplicative complexity and algebraic structure},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {92-106},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Bell Labs., Holmdel, NJ, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Watanabe-Nakamura/83,
AUTHOR = {Watanabe, T. and Nakamura, A.},
TITLE = {On the transformation semigroups of finite automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {107-138},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Faculty of Engng., Hiroshima Univ., Higashi-Hiroshima, Japan},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Grefenstette/83,
AUTHOR = {Grefenstette, J.J.},
TITLE = {Network structure and the firing squad synchronization problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {1},
PAGES = {139-152},
YEAR = {1983, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Computer Sci. Dept., Vanderbilt Univ., Nashville, Tn, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ukkonen/83a,
AUTHOR = {Ukkonen, E.},
TITLE = {Lower bounds on the size of deterministic parsers},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {153-170},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ginsburg-Goldstine-Spanier/83,
AUTHOR = {Ginsburg, S. and Goldstine, J. and Spanier, E.H.},
TITLE = {On the equality of grammatical families},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {171-196},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Southern California, Los Angeles, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Asano-Hirata/83,
AUTHOR = {Asano, T. and Hirata, T.},
TITLE = {Edge-contraction problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {197-208},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Math. Engng. and Instrumentation Phys., Univ. of Tokyo, Tokyo, Japan},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ko/83,
AUTHOR = {Ko, Ker-I},
TITLE = {On self-reducibility and weak p-selectivity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {209-221},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Houston, Houston, TX, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Harel-Pnueli-Stavi/83,
AUTHOR = {Harel, D. and Pnueli, A. and Stavi, J.},
TITLE = {Propositional dynamic logic of nonregular programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {222-243},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sippu-Soisalon-Soininen/83,
AUTHOR = {Sippu, S. and Soisalon-Soininen, E.},
TITLE = {On the complexity of LL(k) testing},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {244-268},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Tchuente/83,
AUTHOR = {Tchuente, M.},
TITLE = {Computation of Boolean functions on networks of binary automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {2},
PAGES = {269-277},
YEAR = {1983, April},
PUBLISHER = {Academic Press},
INSTITUTION = {Lab. IMAG, Centre Nat. de la Recherche Sci., Saint Martin d'Heres, France},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Galil-Seiferas/83,
AUTHOR = {Galil, Z. and Seiferas, J.},
TITLE = {Time-space-optimal string matching},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {280-294},
YEAR = {1983, June},
URL = {http://dx.doi.org/10.1016/0022-0000(83)90002-8},
PUBLISHER = {Academic Press},
INSTITUTION = {Computer Sci. Dept., Tel-Aviv Univ., Tel-Aviv, Israel},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Muller-Schupp/83,
AUTHOR = {Muller, D.E. and Schupp, P.E.},
TITLE = {Groups, the theory of ends, and context-free languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {295-310},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Maths., Univ. of Illinois, Urbana, IL, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Joseph/83,
AUTHOR = {Joseph, D.},
TITLE = {Polynomial time computations in models of ET},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {311-338},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Computer Sci. Dept., Univ. of California, Berkeley, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kleitman-Leighton-Lepley-Miller/83,
AUTHOR = {Kleitman, D. and Leighton, F.T. and Lepley, M. and Miller, G.L.},
TITLE = {An asymptotically optimal layout for the shuffle-exchange graph},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {339-361},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Maths. Dept., MIT, Cambridge, MA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sleator-Tarjan/83,
AUTHOR = {Sleator, D.D. and Tarjan, R.E.},
TITLE = {A data structure for dynamic trees},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {362-391},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Fich/83a,
AUTHOR = {Fich, F.E.},
TITLE = {Lower bounds for the cycle detection problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {392-409},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Computer Sci. Div., Univ. of California, Berkeley, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Venkataraman-Yasuhara-Hawrusik/83,
AUTHOR = {Venkataraman, K.N. and Yasuhara, A. and Hawrusik, F.M.},
TITLE = {A view of computability on term algebras},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {26},
NUMBER = {3},
PAGES = {410-471},
YEAR = {1983, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Maths., Tufts Univ., Medford, MA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}