Journals in DBLP
J. ACM 1984, volume: 31, number: 2
Allan Gottlieb , Clyde P. Kruskal Complexity Results for Permuting Data and Other Computations on Parallel Processors. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:193-209 [Journal ] Richard Hull Finitely Specifiable Implicational Dependency Families. [Citation Graph (6, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:210-226 [Journal ] Mihalis Yannakakis Serializability by Locking. [Citation Graph (13, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:227-244 [Journal ] Robert Endre Tarjan , Jan van Leeuwen Worst-case Analysis of Set Union Algorithms. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:245-281 [Journal ] Karel Culik II , Tero Harju The omega-Sequence Problem for DOL Systems Is Decidable. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:282-298 [Journal ] Harry B. Hunt III Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:299-318 [Journal ] C. W. Clenshaw , F. W. J. Olver Beyond Floating Point. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:319-328 [Journal ] George M. Trojan Lower Bounds and Fast Algorithms for Sequence Acceleration. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:329-335 [Journal ] Hans Röck The Three-Machine No-Wait Flow Shop is NP-Complete. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:336-345 [Journal ] James McKenna , Debasis Mitra Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:346-360 [Journal ] Akeo Adachi , Shigeki Iwata , Takumi Kasai Some Combinatorial Game Problems Require Omega(n^{k} ) Time. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:361-376 [Journal ] Joseph JáJá The VLSI Complexity of Selected Graph Problems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:377-391 [Journal ] Christos H. Papadimitriou On the complexity of unique solutions. [Citation Graph (1, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:392-400 [Journal ] John H. Reif Symmetric Complementation. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:401-421 [Journal ] John E. Savage Space-Time Trade-Offs for Banded Matrix Problems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:422-437 [Journal ]