Journals in DBLP
J. ACM 1982, volume: 29, number: 3
Robert W. Floyd , Jeffrey D. Ullman The Compilation of Regular Expressions into Integrated Circuits. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:603-622 [Journal ] K. Takamizawa , Takao Nishizeki , Nobuji Saito Linear-time computability of combinatorial problems on series-parallel graphs. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:623-641 [Journal ] David Nassimi , Sartaj Sahni Parallel permutation and sorting algorithms and a new generalized connection network. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:642-667 [Journal ] Peter Honeyman Testing satisfaction of functional dependencies. [Citation Graph (50, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:668-677 [Journal ] Seymour Ginsburg , Sami Mohammed Zaiddan Properties of functional-dependency families. [Citation Graph (8, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:678-698 [Journal ] Anthony C. Klug Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. [Citation Graph (79, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:699-717 [Journal ] Mihalis Yannakakis A Theory of Safe Locking Policies in Database Systems. [Citation Graph (22, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:718-740 [Journal ] Dana Angluin Inference of Reversible Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:741-765 [Journal ] Harold N. Gabow An Almost-Linear Algorithm for Two-Processor Scheduling. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:766-780 [Journal ] Errol L. Lloyd Critical Path Scheduling with Resource and Processor Constraints. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:781-811 [Journal ] Charles U. Martel Preemptive Scheduling with Release Times, Deadlines, and Due Times. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:812-829 [Journal ] Christopher L. Samelson , William G. Bulgren A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:830-840 [Journal ] Krzysztof R. Apt , Maarten H. van Emden Contributions to the Theory of Logic Programming. [Citation Graph (34, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:841-862 [Journal ] Eitan M. Gurari , Oscar H. Ibarra Two-Way Counter Machines and Diophantine Equations. [Citation Graph (1, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:863-873 [Journal ] Mark Jerrum , Marc Snir Some Exact Complexity Results for Straight-Line Computations over Semirings. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:874-897 [Journal ] Andrew Chi-Chih Yao On Parallel Computation for the Knapsack Problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:898-903 [Journal ] Richard P. Brent , H. T. Kung Corrigendum: ``The Area-Time Complexity of Binary Multiplication''. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:3, pp:904- [Journal ]