JCSS,
Volume 58
Volume 58,
Number 1,
February 1999
Fifteenth ACM Sigact-Sigmod-Sigart Symposium on Principles of Database Systems
- Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
Mining Optimized Association Rules for Numeric Attributes.
1-12 BibTeX
- H. V. Jagadish, Alberto O. Mendelzon, Inderpal Singh Mumick:
Managing Conflicts Between Rules.
13-28 BibTeX
- Christos H. Papadimitriou, Dan Suciu, Victor Vianu:
Topological Queries in Spatial Databases.
29-53 BibTeX
- Serge Abiteboul, Laurent Herr, Jan Van den Bussche:
Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases.
54-68 BibTeX
- Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman:
Answering Queries Using Limited External Query Processors.
69-82 BibTeX
- Ronald Fagin:
Combining Fuzzy Information from Multiple Systems.
83-99 BibTeX
Twenty-Eighth Annual ACM Symposium on the Theory of Computing
Regular Articles
- Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich:
A Note on the Influence of an epsilon-Biased Random Source.
174-176 BibTeX
- Marcus Schaefer:
Deciding the Vapnik-Cervonenkis Dimension in Sigmap3-Complete.
177-182 BibTeX
- Joel Ratsaby, Vitaly Maiorov:
On the Learnability of Rich Function Classes.
183-192 BibTeX
- Sanjeev Arora, David R. Karger, Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems.
193-210 BibTeX
- John Case, Mark A. Fulk:
Maximal Machine Learnable Classes.
211-214 BibTeX
- Gheorghe Antonoiu, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph.
215-221 BibTeX
- Carsten Lund, Steven Phillips, Nick Reingold:
Paging Against a Distribution and IP Networking.
222-232 BibTeX
- Leslie Ann Goldberg, Philip D. MacKenzie:
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers.
232-258 BibTeX
Volume 58,
Number 2,
April 1999
Special Issue on the 36th IEEE Symposium on the Foundations of Computer Sciende
Volume 58,
Number 3,
June 1999
Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
- Christos H. Papadimitriou, Mihalis Yannakakis:
On the Complexity of Database Queries.
407-427 BibTeX
- Serge Abiteboul, Victor Vianu:
Regular Path Queries with Constraints.
428-452 BibTeX
- Giansalvatore Mecca, Paolo Atzeni:
Cut and Paste.
453-482 BibTeX
- Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Complete Geometric Query Languages.
483-511 BibTeX
- Joseph Albert, Yannis E. Ioannidis, Raghu Ramakrishnan:
Equivalence of Keyed Relational Schemas by Conjunctive Queries.
512-534 BibTeX
- Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht:
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases.
535-571 BibTeX
Regular Articles
- Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra.
572-596 BibTeX
- Giovanni Manzini, Luciano Margara:
Attractors of Linear Cellular Automata.
597-610 BibTeX
- Jürgen Dassow, Victor Mitrana:
Stack Cooperation in Multistack Pushdown Automata.
611-621 BibTeX
- Jianer Chen, Donald K. Friesen, Hao Zheng:
Tight Bound on Johnson's Algorithm for Maximum Satisfiability.
622-640 BibTeX
- Adam Krawczyk:
The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs.
641-647 BibTeX
- Lane A. Hemaspaandra, Jörg Rothe:
Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory.
648-659 BibTeX
Copyright © Sun May 17 00:08:15 2009
by Michael Ley (ley@uni-trier.de)
