@article{Maurer-Salomaa-Wood/81b,
AUTHOR = {Maurer, H.A. and Salomaa, A. and Wood, D.},
TITLE = {Completeness of context-free grammar forms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {1-10},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. Graz, Graz, Austria},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Huet/81,
AUTHOR = {Huet, G{\'e}rard},
TITLE = {A complete proof of correctness of the Knuth-Bendix completion algorithm},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {11-21},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {INRIA, Domaine de Voluceau-Rocquencourt, Le Chesnay, France},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Nakamura/81a,
AUTHOR = {Nakamura, K.},
TITLE = {Synchronous to asynchronous transformation of polyautomata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {22-37},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Systems Engng., Tokyo Denki Univ., Hatoyama-Mura, Saitama-Ken, Japan},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Werschulz/81,
AUTHOR = {Werschulz, A.G.},
TITLE = {On maximal order for local and global numerical problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {38-48},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Math., Univ. of Maryland Baltimore County, Catonsville, MD, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Back/81,
AUTHOR = {Back, R.J.R.},
TITLE = {On correct refinement of programs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {49-68},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gallier/81,
AUTHOR = {Gallier, J.H.},
TITLE = {Recursion-closed algebraic theories},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {1},
PAGES = {69-105},
YEAR = {1981, August},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer and Information Sci., Moore School of Electrical Engng., Univ. of Pennsylvania, Philadelphia, PA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Paul-Seiferas-Simon/81,
AUTHOR = {Paul, Wolfgang J. and Seiferas, Joel I. and Simon, Janos},
TITLE = {An information-theoretic approach to time bounds for on-line computation},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {108-126},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Fakult{\"a}t f{\"u}r Math., Univ. Bielefeld, Bielefeld, Germany},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Tompa/81a,
AUTHOR = {Tompa, M.},
TITLE = {An optimal solution to a wire-routing problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {127-150},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Pippenger/81a,
AUTHOR = {Pippenger, N.},
TITLE = {Pebbling with an auxiliary pushdown},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {151-165},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {IBM Res. Lab., San Jose, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Overmars-van_Leeuwen/81a,
AUTHOR = {Overmars, M.H. and van Leeuwen, J.},
TITLE = {Maintenance of configurations in the plane},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {166-204},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ehrig-Mahr/81,
AUTHOR = {Ehrig, H. and Mahr, B.},
TITLE = {Complexity of algebraic implementations for abstract data types},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {223-253},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Fachbereich Informatik, Tech. Univ. Berlin, Berlin, Germany},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lynch/81,
AUTHOR = {Lynch, N.A.},
TITLE = {Upper bounds for static resource allocation in a distributed system},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {254-278},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Meyer-Parikh/81,
AUTHOR = {Meyer, A.R. and Parikh, R.},
TITLE = {Definability in dynamic logic},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {2},
PAGES = {279-298},
YEAR = {1981, October},
PUBLISHER = {Academic Press},
INSTITUTION = {Lab. for Computer Sci., MIT, Cambridge, MA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Valk-Vidal-Naquet/81,
AUTHOR = {Valk, R{\"u}diger and Vidal-Naquet, Guy},
TITLE = {Petri nets and regular languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {299-325},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Fachbereich Informatik, Univ. Hamburg, Hamburg, Germany},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Selman/81,
AUTHOR = {Selman, A.L.},
TITLE = {Some observations on $NP$, real numbers and $P$-selective sets},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {326-332},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Iowa State Univ., Ames, IA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Snyder/81,
AUTHOR = {Snyder, L.},
TITLE = {Theft and conspiracy in the Take-Grant protection model},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {333-347},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Purdue Univ., West Lafayette, IN, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Leiss/81b,
AUTHOR = {Leiss, Ernst},
TITLE = {The complexity of restricted regular expressions and the synthesis problem for finite automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {348-354},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Houston, Houston, TX, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Fredman-Volper/81,
AUTHOR = {Fredman, M.L. and Volper, D.J.},
TITLE = {Query time versus redundancy trade-offs for range queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {355-365},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Electrical Engng. and Computer Sci., Univ. of California, San Diego, La Jolla, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Oyamaguchi-Inagaki-Honda/81,
AUTHOR = {Oyamaguchi, M. and Inagaki, Y. and Honda, N.},
TITLE = {The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {366-382},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Faculty of Engng., Mie Univ., Tsu, Japan},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Aiello-Prini/81,
AUTHOR = {Aiello, L. and Prini, G.},
TITLE = {An efficient interpreter for the lambda-calculus},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {23},
NUMBER = {3},
PAGES = {383-424},
YEAR = {1981, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Istituto di Elaborazione Dell'Informazione, CNR, Pisa, Italy},
ADDRESS = {New York-San Francisco-London-San Diego},
}