Journals in DBLP
J. Algorithms 1981, volume: 2, number: 3
Witold Lipski Jr. , Christos H. Papadimitriou A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal ] Lloyd Allison Generating Coset Representatives for Permutation Groups. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:227-244 [Journal ] Mark H. Overmars Dynamization of Order Decomposable Set Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:245-260 [Journal ] Ephraim Feig On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:261-281 [Journal ] Jan van Leeuwen , Derick Wood The Measure Problem for Rectangular Ranges in d-Space. [Citation Graph (3, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:282-300 [Journal ] Victor Y. Pan A Unified Approach to the Analysis of Bilinear Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:301-310 [Journal ] Shimon Even , Oded Goldreich The Minimum-Length Generator Sequence Problem is NP-Hard. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:311-313 [Journal ] Leonidas J. Guibas Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:314-315 [Journal ]