Journal: J. Comput. Syst. Sci.

Volume 49, Issue 3

427 -- 453Ketan Mulmuley. An Efficient Algorithm for Hidden Surface Removal, II
454 -- 477Bonnie Berger, John Rompel, Peter W. Shor. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry
478 -- 516Rajeev Motwani, Joseph Naor, Moni Naor. The Probabilistic Method Yields Deterministic Parallel Algorithms
517 -- 561Vijaya Ramachandran, John H. Reif. Planarity Testing in Parallel
562 -- 588Miklós Ajtai, Yuri Gurevich. Datalog vs First-Order Logic
589 -- 604Mark A. Fulk, Sanjay Jain, Daniel N. Osherson. Open Problems in Systems That Learn
605 -- 619Jin-yi Cai, Juris Hartmanis. On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line
620 -- 666Zhenyu Qian. Another Look at Parameterization for Order-Sorted Algebraic Specifications
667 -- 682Joan Boyar, Kim S. Larsen. Efficient Rebalancing of Chromatic Search Trees
683 -- 717Mark Levene, George Loizou. The Nested Universal Relation Data Model
718 -- 725Bruno Durand. The Surjectivity Problem for 2D Cellular Automata
726 -- 768Minoru Ito, Grant E. Weddell. Implication Problems for Functional Constraints on Databases Supporting Complex Objects
769 -- 779Michael R. Fellows, Michael A. Langston. On Search, Decision, and the Efficiency of Polynomial-Time Algorithms

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

Volume 49, Issue 1

1 -- 17Seinosuke Toda. Simple Characterizations of P(#P) and Complete Problems
18 -- 23Tadakazu Sato. Group Structured Linear Cellular Automata over Zm
24 -- 39Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi. The Random Oracle Hypothesis Is False
40 -- 56Takashi Hattori. Time-Extraction for Temporal Logic-Logic Programming and Local Process Time
57 -- 82Egon Wanke. The Complexity of Connectivity Problems on Context-Free Graph Languages
83 -- 95Nicholas Pippenger. Symmetry in Self-Correcting Cellular Automata
96 -- 107Sanjay Jain, Arun Sharma. Characterizing Language Identification by Standardizing Operations
108 -- 132Vijay V. Raghavan. Bounded Degree Graph Inference from Walks
133 -- 147Emanuela Fachini, Angelo Monti. A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata