Journals in DBLP

J. Comput. Syst. Sci.
1995, volume: 51, number: 3

1. Wolfgang Maass
   Editor's Foreword. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:339- [Journal]
   
2. Yair Bartal, Amos Fiat, Yuval Rabani
   Competitive Algorithms for Distributed Data Management. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:341-358 [Journal]
   
3. Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
   New Algorithms for an Ancient Scheduling Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:359-366 [Journal]
   
4. Avrim Blum, Steven Rudich
   Fast Learning of k-Term DNF Formulas with Queries. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:367-373 [Journal]
   
5. Michael T. Goodrich
   Planar Separators and Parallel Polygon Triangulation. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:374-389 [Journal]
   
6. Jeff Kahn, Jeong Han Kim
   Entropy and Sorting. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:390-399 [Journal]
   
7. Raimund Seidel
   On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:400-403 [Journal]
   
8. Tomasz Imielinski, Ron van der Meyden, Kumar V. Vadaparty
   Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information. [Citation Graph (4, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:405-432 [Journal]
   
9. Serge Abiteboul, Paris C. Kanellakis, Sridhar Ramaswamy, Emmanuel Waller
   Method Schemas. [Citation Graph (3, 0)][DBLP]
   J. Comput. Syst. Sci., 1995, v:51, n:3, pp:433-455 [Journal]
   
10. Changho Seo, Jongin Lim, Hichum Eun
    On Comparison and Analysis of Algorithms for Multiplication in GF(2^m). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:456-459 [Journal]
    
11. Jirí Adámek, Evelyn Nelson, Jan Reiterman
    Continuous Algebras Revisited. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:460-471 [Journal]
    
12. Konstantin Skodinis, Egon Wanke
    Emptiness Problems of eNCE Graph Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:472-485 [Journal]
    
13. Camino R. Vela, Antonio Bahamonde
    The Best Nondeterministic Representations of Finite Orderings. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:486-494 [Journal]
    
14. Yosi Ben-Asher, Ilan Newman
    Decision Trees with Boolean Threshold Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:495-502 [Journal]
    
15. Takao Asano
    An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:503-510 [Journal]
    
16. Nadia Creignou
    A Dichotomy Theorem for Maximum Generalized Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:511-522 [Journal]
    
17. Jan Chomicki, Damian Niwinski
    On the Feasibility of Checking Temporal Integrity Constraints. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:523-535 [Journal]