default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 66
Volume 66, Number 1, February 2003
- Georg Gottlob
:
Guest Editor's Foreword. 1 - James F. Lynch:
Analysis and application of adaptive sampling. 2-19 - Todd D. Millstein, Alon Y. Halevy, Marc T. Friedman:
Query containment for data integration systems. 20-39 - Marc Spielmann:
Verification of relational transducers for electronic commerce. 40-65 - Tova Milo, Dan Suciu, Victor Vianu:
Typechecking for XML transformers. 66-97 - Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan:
Generalized substring selectivity estimation. 98-132 - Stéphane Grumbach, Leonardo Tininini:
On the content of materialized aggregate views. 133-168 - Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and connectivity queries in constraint databases. 169-206 - Pankaj K. Agarwal, Lars Arge, Jeff Erickson:
Indexing Moving Points. 207-243 - Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan:
Auditing Boolean attributes. 244-253 - Wenfei Fan, Jérôme Siméon:
Integrity constraints for XML. 254-291
Volume 66, Number 2, March 2003
- Vincenza Carchiolo, Michele Malgeri, Giuseppe Mangioni:
TTL: a modular language for hardware/software systems design. 293-315 - Simone Tini:
An axiomatic semantics for the synchronous language Gentzen. 316-348 - Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza:
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. 349-370 - Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Approximate testing with error relative to input size. 371-392 - Mark Reynolds:
The complexity of the temporal logic with "until" over general linear time. 393-426
Volume 66, Number 3, May 2003
- Hirotada Kobayashi, Keiji Matsumoto:
Quantum multi-prover interactive proof systems with limited prior entanglement. 429-450 - Viliam Geffert:
Translation of binary regular expressions into nondeterministic ε-free automata with transitions. 451-472 - Martin Sauerhoff:
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. 473-495 - Shai Ben-David, Nadav Eiron, Philip M. Long:
On the difficulty of approximately maximizing agreements. 496-514 - Bruno Gaujal, Stefan Haar, Jean Mairesse:
Blocking a transition in a free choice net and what it tells about its throughput. 515-548 - Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán:
Completeness results for graph isomorphism. 549-566 - Monika Rauch Henzinger, Stefano Leonardi:
Scheduling multicasts on unit-capacity trees and meshes. 567-611
Volume 66, Number 4, June 2003
- Peter Buneman:
Guest Editor's Foreword. 613 - Ronald Fagin, Amnon Lotem, Moni Naor:
Optimal aggregation algorithms for middleware. 614-656 - Kim S. Larsen:
Relaxed multi-way trees with group updates. 657-670 - Dimitris Achlioptas:
Database-friendly random projections: Johnson-Lindenstrauss with binary coins. 671-687 - Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu:
XML with data values: typechecking revisited. 688-727 - Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. Sudarshan:
Pipelining in multi-query optimization. 728-762 - Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Two-dimensional substring indexing. 763-774 - Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. 775-808 - Anand Rajaraman, Jeffrey D. Ullman:
Querying websites using compact skeletons. 809-851
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-02 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
