Journal: J. Comput. Syst. Sci.

Volume 64, Issue 4

749 -- 0Sanjeev Khanna. Guest Editor s Foreword
750 -- 767Andris Ambainis. Quantum Lower Bounds by Quantum Arguments
768 -- 784Dan Boneh. Finding Smooth Integers in Short Intervals Using CRT Decoding
785 -- 819Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. Query Strategies for Priced Information
820 -- 842David Kempe, Jon M. Kleinberg, Amit Kumar. Connectivity and Inference Problems for Temporal Networks
843 -- 872Alexis Maciel, Toniann Pitassi, Alan R. Woods. A New Proof of the Weak Pigeonhole Principle
873 -- 896Omer Barkol, Yuval Rabani. Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model

Volume 64, Issue 3

441 -- 442Yannis E. Ioannidis, Christos H. Papadimitriou. Special Issue on PODS 1999 - Guest Editors Foreword
443 -- 465Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi. Rewriting of Regular Expressions and Regular Path Queries
466 -- 495Stavros S. Cosmadakis. Inherent Complexity of Recursive Queries
496 -- 541Steven Dawson, Sabrina De Capitani di Vimercati, Patrick Lincoln, Pierangela Samarati. Maximizing Sharing of Protected Information
542 -- 578Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishnan, Wei-Yin Loh. A Framework for Measuring Differences in Data Characteristics
579 -- 627Georg Gottlob, Nicola Leone, Francesco Scarcello. Hypertree Decompositions and Tractable Queries
628 -- 654Michael Benedikt, Leonid Libkin. Aggregate Operators in Constraint Query Languages
655 -- 693Yaron Kanza, Werner Nutt, Yehoshua Sagiv. Querying Incomplete Information in Semistructured Data
694 -- 718Jan Van den Bussche, Emmanuel Waller. Polymorphic Type Inference for the Relational Algebra
719 -- 747Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario Szegedy. Tracking Join and Self-Join Sizes in Limited Storage

Volume 64, Issue 2

153 -- 159Mark A. Fulk. Inductive Inference with Additional Information
160 -- 170Cristina Bazgan, Miklos Santha, Zsolt Tuza. Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem
171 -- 218Martin Große-Rhode, Francesco Parisi-Presicce, Marta Simeoni. Formal Software Specification with Refinements and Modules of Typed Graph Transformation Systems
219 -- 248Minos N. Garofalakis, Yannis E. Ioannidis, Banu Özden, Abraham Silberschatz. Competitive On-line Scheduling of Continuous-Media Streams
249 -- 283Frank Drewes, Berthold Hoffmann, Detlef Plump. Hierarchical Graph Transformation
284 -- 307Tom H. Westerdale. Minimality of an Automaton Cascade Decomposition for Learning System Environments
308 -- 310Martin R. Bridson, Robert H. Gilman. Context-Free Languages of Sub-exponential Growth
311 -- 328Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung. Reducing the Number of Solutions of NP Functions
329 -- 349Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal. Interval Consistency of Asynchronous Distributed Computations
350 -- 395Joost Engelfriet, Sebastian Maneth. Output String Languages of Compositions of Deterministic Macro Tree Transducers
396 -- 418Volker Diekert, Paul Gastin. LTL Is Expressively Complete for Mazurkiewicz Traces
419 -- 438Detlef Sieling. Lower Bounds for Linearly Transformed OBDDs and FBDDs

Volume 64, Issue 1

1 -- 0Sally A. Goldman. Special Issue on COLT 2000 - Guest Editor s Foreword
2 -- 21José L. Balcázar, Jorge Castro, David Guijarro. A New Abstract Combinatorial Dimension for Exact Learning via Queries
22 -- 47Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon. The Computational Complexity of Densest Region Detection
48 -- 75Peter Auer, Nicolò Cesa-Bianchi, Claudio Gentile. Adaptive and Self-Confident On-Line Learning Algorithms
76 -- 102Jürgen Forster, Manfred K. Warmuth. Relative Expected Instantaneous Loss Bounds
103 -- 112Yishay Mansour, David A. McAllester. Boosting Using Branching Programs
113 -- 132Yoav Freund, Manfred Opper. Drifting Games and Brownian Motion
133 -- 150Peter L. Bartlett, Jonathan Baxter. Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning