Journal: J. Comput. Syst. Sci.

Volume 58, Issue 3

407 -- 427Christos H. Papadimitriou, Mihalis Yannakakis. On the Complexity of Database Queries
428 -- 452Serge Abiteboul, Victor Vianu. Regular Path Queries with Constraints
453 -- 482Giansalvatore Mecca, Paolo Atzeni. Cut and Paste
483 -- 511Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht. Complete Geometric Query Languages
512 -- 534Joseph Albert, Yannis E. Ioannidis, Raghu Ramakrishnan. Equivalence of Keyed Relational Schemas by Conjunctive Queries
535 -- 571Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht. On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases
572 -- 596Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit. The Computational Complexity of Some Problems of Linear Algebra
597 -- 610Giovanni Manzini, Luciano Margara. Attractors of Linear Cellular Automata
611 -- 621Jürgen Dassow, Victor Mitrana. Stack Cooperation in Multistack Pushdown Automata
622 -- 640Jianer Chen, Donald K. Friesen, Hao Zheng. Tight Bound on Johnson s Algorithm for Maximum Satisfiability
641 -- 647Adam Krawczyk. The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs
648 -- 659Lane A. Hemaspaandra, Jörg Rothe. Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory

Volume 58, Issue 2

260 -- 279Robert Beals. Algorithms for Matrix Groups and the Tits Alternative
280 -- 296Jin-yi Cai, D. Sivakumar. Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
297 -- 325Tamal K. Dey, Sumanta Guha. Transforming Curves on Surfaces
326 -- 335Armin Haken, Stephen A. Cook. An Exponential Lower Bound for the Size of Monotone Real Circuits
336 -- 375Moni Naor, Omer Reingold. Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
376 -- 403Michael E. Saks, Shiyu Zhou. BP ::H::Space(S) subseteq DSPACE(S:::3/2:::)

Volume 58, Issue 1

1 -- 12Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama. Mining Optimized Association Rules for Numeric Attributes
13 -- 28H. V. Jagadish, Alberto O. Mendelzon, Inderpal Singh Mumick. Managing Conflicts Between Rules
29 -- 53Christos H. Papadimitriou, Dan Suciu, Victor Vianu. Topological Queries in Spatial Databases
54 -- 68Serge Abiteboul, Laurent Herr, Jan Van den Bussche. Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases
69 -- 82Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman. Answering Queries Using Limited External Query Processors
83 -- 99Ronald Fagin. Combining Fuzzy Information from Multiple Systems
101 -- 108Avrim Blum, R. Ravi, Santosh Vempala. A Constant-Factor Approximation Algorithm for the ::::k::::-MST Problem
109 -- 128Michael J. Kearns, Yishay Mansour. On the Boosting Ability of Top-Down Decision Tree Learning Algorithms
129 -- 136Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén. Characterizing Linear Size Circuits in Terms of Pricacy
137 -- 147Noga Alon, Yossi Matias, Mario Szegedy. The Space Complexity of Approximating the Frequency Moments
148 -- 173Noam Nisan, Amnon Ta-Shma. Extracting Randomness: A Survey and New Constructions
174 -- 176Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich. A Note on the Influence of an epsilon-Biased Random Source
177 -- 182Marcus Schaefer. Deciding the Vapnik-Cervonenkis Dimension in Sigma:::p:::::3::-Complete
183 -- 192Joel Ratsaby, Vitaly Maiorov. On the Learnability of Rich Function Classes
193 -- 210Sanjeev Arora, David R. Karger, Marek Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
211 -- 214John Case, Mark A. Fulk. Maximal Machine Learnable Classes
215 -- 221Gheorghe Antonoiu, Pradip K. Srimani. A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
222 -- 232Carsten Lund, Steven Phillips, Nick Reingold. Paging Against a Distribution and IP Networking
232 -- 258Leslie Ann Goldberg, Philip D. MacKenzie. Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers