Journal: J. Comput. Syst. Sci.

Volume 49, Issue 2

149 -- 167Noam Nisan, Avi Wigderson. Hardness vs Randomness
168 -- 174Taishin Y. Nishida, Youichi Kobuchi. Invariant Sets for Substitution
175 -- 188Narayanan Krishnakumar. On Computing Serial Dependency Relations
189 -- 207John Case, Sanjay Jain, Arun Sharma. Vacillatory Learning of Nearly Minimal Size Grammars
208 -- 222Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park. Dynamic Dictionary Matching
223 -- 246Michael Kaminski. A Branching Time Logic with Past Operators
247 -- 257Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson. Non-Deterministic Communication Complexity with Few Witnesses
258 -- 305Joost Engelfriet, Heiko Vogler. The Translation Power of Top-Down Tree-to-Graph Transducers
306 -- 324Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach. Efficient Inference of Partial Types
325 -- 333Vitit Kantabutra. A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons
334 -- 361Jia-Huai You, Li-Yan Yuan. A Three-Valued Semantics for Deductive Databases and Logic Programs
362 -- 374Kai Salomaa, Sheng Yu. Measures of Nondeterminism for Pushdown Automata
375 -- 390Zoran Obradovic, Ian Parberry. Learning with Discrete Multi-valued Neurons
391 -- 407Kokichi Sugihara. Robust Gift Wrapping for the Three-Dimensional Convex Hull
408 -- 424Leslie Ann Goldberg. Listing Graphs That Satisfy First-Order Sentences