@article{Vardi/84a,
AUTHOR = {Vardi, M.Y.},
TITLE = {The implication and finite implication problems for typed template dependencies},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {3-28},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Stanford Univ., Stanford, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Casanova-Fagin-Papadimitriou/84,
AUTHOR = {Casanova, M.A. and Fagin, R. and Papadimitriou, C.H.},
TITLE = {Inclusion dependencies and their interaction with functional dependencies},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {29-59},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Sci. Center, IBM, Brasilia, Brazil},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Goodman-Shmueli/84,
AUTHOR = {Goodman, N. and Shmueli, O.},
TITLE = {The tree projection theorem and relational query processing},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {60-79},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Aiken Computation Lab., Harvard Univ., Cambridge, MA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Imielinski-Lipski/84,
AUTHOR = {Imieli{\'n}ski, T. and Lipski, W., Jr.},
TITLE = {The relational model of data and cylindric algebras},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {80-102},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Inst. of Computer Sci., Polish Acad. of Sci., Warsaw, Poland},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Graham-Yannakakis/84,
AUTHOR = {Graham, M.H. and Yannakakis, M.},
TITLE = {Independent database schemas},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {121-141},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Georgia Inst. of Technol., Atlanta, GA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Zaniolo/84,
AUTHOR = {Zaniolo, C.},
TITLE = {Database relations with null values},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {142-166},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Bell Labs., Holmdel, NJ, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Johnson-Klug/84,
AUTHOR = {Johnson, D.S. and Klug, A.},
TITLE = {Testing containment of conjunctive queries under functional and inclusion dependencies},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {1},
PAGES = {167-189},
YEAR = {1984, February},
PUBLISHER = {Academic Press},
INSTITUTION = {Bell Labs., Murray Hill, NJ, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Feldman-Harel/84,
AUTHOR = {Feldman, Y.A. and Harel, D.},
TITLE = {A probabilistic dynamic logic},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {193-215},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ruzzo-Simon-Tompa/84,
AUTHOR = {Ruzzo, W.L. and Simon, J. and Tompa, M.},
TITLE = {Space-bounded hierarchies and probabilistic computations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {216-230},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Furer/84,
AUTHOR = {F{\"u}rer, M.},
TITLE = {Data structures for distributed counting},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {231-243},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Papadimitriou-Yannakakis/84,
AUTHOR = {Papadimitriou, C.H. and Yannakakis, M.},
TITLE = {The complexity of facets (and some facets of complexity)},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {244-259},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Papadimitriou-Sipser/84,
AUTHOR = {Papadimitriou, C.H. and Sipser, M.},
TITLE = {Communication complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {260-269},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Goldwasser-Micali/84,
AUTHOR = {Goldwasser, S. and Micali, S.},
TITLE = {Probabilistic encryption},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {270-299},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bhatt-Leighton/84,
AUTHOR = {Bhatt, S.N. and Leighton, F.T.},
TITLE = {A framework for solving VLSI graph layout problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {2},
PAGES = {300-343},
YEAR = {1984, April},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Warmuth-Haussler/84,
AUTHOR = {Warmuth, M.K. and Haussler, D.},
TITLE = {On the complexity of iterated shuffle},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {345-358},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Loui/84,
AUTHOR = {Loui, M.C.},
TITLE = {Minimizing access pointers into trees and arrays},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {359-378},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Willard/84a,
AUTHOR = {Willard, D.E.},
TITLE = {New trie data structures which support very fast search operations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {379-394},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Bell Labs., Holmdel, NJ, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hunt-Rosenkrantz/84,
AUTHOR = {Hunt III, H.B. and Rosenkrantz, D.J.},
TITLE = {The complexity of monadic recursion schemes: exponential time bounds},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {395-419},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lloyd-Ravi/84,
AUTHOR = {Lloyd, E.L. and Ravi, S.S.},
TITLE = {One-layer routing without component constraints},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {420-438},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. Sci., Pittsburgh Univ., PA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Milner/84,
AUTHOR = {Milner, R.},
TITLE = {A complete inference system for a class of regular behaviours},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {28},
NUMBER = {3},
PAGES = {439-466},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. Sci., Edinburgh Univ., Scotland},
ADDRESS = {New York-San Francisco-London-San Diego},
}