Journals in DBLP
J. ACM Wolfgang Bibel On Matrices with Connections. [Citation Graph (1, 0)][DBLP ] Journal ] Donald W. Loveland , C. R. Reddy Deleting Repeated Goals in the Problem Reduction Format. [Citation Graph (0, 0)][DBLP ] Journal ] Guy Latouche Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System. [Citation Graph (0, 0)][DBLP ] Journal ] David Maier , Yehoshua Sagiv , Mihalis Yannakakis On the Complexity of Testing Implications of Functional and Join Dependencies. [Citation Graph (13, 0)][DBLP ] Journal ] Michael L. Fredman A Lower Bound on the Complexity of Orthogonal Range Queries. [Citation Graph (3, 0)][DBLP ] Journal ] Andrzej Ehrenfeucht , Grzegorz Rozenberg , Keijo Ruohonen A Morphic Representation of Complements of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP ] Journal ] Mehdi Jazayeri A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. [Citation Graph (0, 0)][DBLP ] Journal ] Ernest Davis , Jeffrey M. Jaffe Algorithms for Scheduling Tasks on Unrelated Processors. [Citation Graph (0, 0)][DBLP ] Journal ] Stefania Gnesi , Ugo Montanari , Alberto Martelli Dynamic Programming as Graph Searching: An Algebraic Approach. [Citation Graph (0, 0)][DBLP ] Journal ] Naoki Katoh , Toshihide Ibaraki , H. Mine An Algorithm for the K Best Solutions of the Resource Allocation Problem. [Citation Graph (0, 0)][DBLP ] Journal ] Christos H. Papadimitriou On the complexity of integer programming. [Citation Graph (1, 0)][DBLP ] Journal ] Robert E. Shostak Deciding Linear Inequalities by Computing Loop Residues. [Citation Graph (0, 0)][DBLP ] Journal ] Andrew Chi-Chih Yao A Lower Bound to Finding Convex Hulls. [Citation Graph (0, 0)][DBLP ] Journal ] 