Journals in DBLP

J. Comput. Syst. Sci.
1999, volume: 58, number: 1

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