@article{Wang-Blum/92,
AUTHOR = {Wang, Xin and Blum, Edward K.},
TITLE = {Discrete-time versus continuous-time models of neural networks},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {1-19},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sontag/92,
AUTHOR = {Sontag, Eduardo D.},
TITLE = {Feedforward nets for interpolation and classification},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {20-48},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Honsell-Rocca/92,
AUTHOR = {Honsell, Furio and Rocca, Simonetta Ronchi della},
TITLE = {An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {49-75},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gyssens-Gucht/92,
AUTHOR = {Gyssens, Marc and Gucht, Dirk van},
TITLE = {The powerset algebra as a natural tool to handle nested database relations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {76-103},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bar-Yehuda-Goldreich-Itai/92,
AUTHOR = {Bar-Yehuda, Reuven and Goldreich, Oded and Itai, Alon},
TITLE = {On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {104-126},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Stewart/92b,
AUTHOR = {Stewart, Iain A.},
TITLE = {Using the Hamiltonian path operator to capture $NP$},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {127-151},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Birget/92,
AUTHOR = {Birget, Jean-Camille},
TITLE = {Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {154-179},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Borodin-Ruzzo-Tompa/92,
AUTHOR = {Borodin, Allan and Ruzzo, Walter L. and Tompa, Martin},
TITLE = {Lower bounds on the length of universal traversal sequences},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {180-203},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Babai-Nisan-Szegedy/92,
AUTHOR = {Babai, L{\'a}szl{\'o} and Nisan, Noam and Szegedy, M{\'a}ri{\'o}},
TITLE = {Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {204-232},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Feder/92a,
AUTHOR = {Feder, Tom{\'a}s},
TITLE = {A new fixed point approach for stable networks and stable marriages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {233-284},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Regan/92a,
AUTHOR = {Regan, Kenneth W.},
TITLE = {Minimum-complexity pairing functions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {285-295},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lam-Tiwari-Tompa/92,
AUTHOR = {Lam, Tak and Tiwari, Prasoon and Tompa, Martin},
TITLE = {Trade-offs between communication and space},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {296-315},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Weil/92,
AUTHOR = {Weil, Pascal},
TITLE = {Closure of varieties of languages under products with counter},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {316-339},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Bettayeb-Miller-Sudborough/92,
AUTHOR = {Bettayeb, Said and Miller, Zevi and Sudborough, I. Hal},
TITLE = {Embedding grids into hypercubes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {340-366},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Carlstrom/92,
AUTHOR = {Carlstrom, Ian F.},
TITLE = {Foreground automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {367-384},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Downey/92,
AUTHOR = {Downey, Rod},
TITLE = {Nondiamond theorems for polynomial time reducibility},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {385-395},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Krob/92b,
AUTHOR = {Krob, Daniel},
TITLE = {Models of a $K$-rational identity system},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {396-434},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Yuan-Ozsoyoglu/92,
AUTHOR = {Yuan, Li-Yan and Ozsoyoglu, Z. Meral},
TITLE = {Design of desirable relational database schemes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {435-470},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Obradovic-Parberry/92,
AUTHOR = {Obradovic, Zoran and Parberry, Ian},
TITLE = {Computing with discrete multi-valued neurons},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {471-492},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Schmid-Blieberger/92,
AUTHOR = {Schmid, U. and Blieberger, J.},
TITLE = {Some investigations on FCFS scheduling in hard real time applications},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {45},
PAGES = {493-512},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Chan-Atzeni/92,
AUTHOR = {Chan, Edward P.F. and Atzeni, Paolo},
TITLE = {Connection-trap-free database schemes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {1-22},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Diaconescu/92,
AUTHOR = {Diaconescu, R{\u{a}}zvan},
TITLE = {Contraction algebras and unification of (infinite) terms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {23-42},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Muller-Preparata/92,
AUTHOR = {Muller, D.E. and Preparata, F.P.},
TITLE = {Parallel restructuring and evaluation of expressions},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {43-62},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lengauer-Wagner/92,
AUTHOR = {Lengauer, T. and Wagner, K.W.},
TITLE = {The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {63-93},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Dahlhaus-Karpinski/92,
AUTHOR = {Dahlhaus, Elias and Karpinski, Marek},
TITLE = {Perfect matching for regular graphs is $AC^0$-hard for the general matching problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {94-102},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ragde/92,
AUTHOR = {Ragde, Prabhakar},
TITLE = {Processor-time tradeoffs in PRAM simulations},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {103-113},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Takahashi/92,
AUTHOR = {Takahashi, Satoshi},
TITLE = {Self-similarity of linear cellular automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {114-140},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Sandhu/92,
AUTHOR = {Sandhu, Ravinderpal Singh},
TITLE = {Undecidability of safety for the schematic protection model with cyclic creates},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {141-159},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Herbst/92a,
AUTHOR = {Herbst, Thomas},
TITLE = {Some remarks on a theorem of Sakarovitch},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {160-165},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Maass-Slaman/92,
AUTHOR = {Maass, Wolfgang and Slaman, Theodore A.},
TITLE = {The complexity types of computable sets},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {168-192},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ben-David-Chor-Goldreich-Luby/92,
AUTHOR = {Ben-David, Shai and Chor, Benny and Goldreich, Oded and Luby, Michael},
TITLE = {On the theory of average case complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {193-219},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lutz/92,
AUTHOR = {Lutz, Jack H.},
TITLE = {Almost everywhere high nonuniform complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {220-258},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Feige-Shamir/92,
AUTHOR = {Feige, Uriel and Shamir, Adi},
TITLE = {Multi-oracle interactive protocols with constant space verifiers},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {259-271},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kobler-Schoning-Toda-Toran/92,
AUTHOR = {K{\"o}bler, Johannes and Sch{\"o}ning, Uwe and Toda, Seinosuke and Tor{\'a}n, Jacobo},
TITLE = {Turing machines with few accepting computations and low sets for PP},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {272-286},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Homer-Selman/92,
AUTHOR = {Homer, Steven and Selman, Alan L.},
TITLE = {Oracles for structural properties: The isomorphism problem and public-key cryptography},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {287-301},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Mayr-Subramanian/92,
AUTHOR = {Mayr, Ernst W. and Subramanian, Ashok},
TITLE = {The complexity of circuit value and network stability},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {302-323},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lam-Ruzzo/92,
AUTHOR = {Lam, Tak Wah and Ruzzo, Walter L.},
TITLE = {Results on communication complexity classes},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {324-342},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Li-Vitanyi/92,
AUTHOR = {Li, Ming and Vit{\'a}nyi, Paul M.B.},
TITLE = {Inductive reasoning and Kolmogorov complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {343-384},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lindell/92b,
AUTHOR = {Lindell, Steven},
TITLE = {The invariant problem for binary string structures and the parallel complexity theory of queries},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {385-410},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Klapper/92,
AUTHOR = {Klapper, A.},
TITLE = {Distributed event algebras},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {411-424},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Kaminski-Pinter/92,
AUTHOR = {Kaminski, Michael and Pinter, Shlomit S.},
TITLE = {Finite automata on directed graphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {425-446},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Silva-Murata/92,
AUTHOR = {Silva, Manuel and Murata, Tadao},
TITLE = {B-fairness and structural B-fairness in Petri net models of concurrent systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {447-477},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Barrington-Compton-Straubing-Therien/92,
AUTHOR = {Barrington, David A. Mix and Compton, Kevin and Straubing, Howard and Th{\'e}rien, Denis},
TITLE = {Regular languages in $NC^1$},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {478-499},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Watanabe/92a,
AUTHOR = {Watanabe, Osamu},
TITLE = {On polynomial time one-truth-table reducibility to a sparse set},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {44},
PAGES = {500-516},
YEAR = {1992},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}