|
|
Journals in DBLP
J. ACM
1981, volume: 28, number: 3
- Mark E. Stickel
A Unification Algorithm for Associative-Commutative Functions. [Citation Graph (4, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:423-434 [Journal]
- Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. [Citation Graph (17, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:435-453 [Journal]
- David P. Dobkin, J. Ian Munro
Optimal Time Minimal Space Selection Algorithms. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:454-461 [Journal]
- Francis Y. L. Chin, Long-Lieh Tsai
On J-maximal and J-minimal Flow-Shop Schedules. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:462-476 [Journal]
- Leonard Kleinrock, Arne A. Nilsson
On Optimal Scheduling Algorithms for Time-Shared Systems. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:477-486 [Journal]
- Hanan Samet
Connected Component Labeling Using Quadtrees. [Citation Graph (2, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:487-501 [Journal]
- Sarangan Krishna Kumar, Melvin A. Breuer
Probabilistic Aspects of Boolean Switching Functions via a New Transform. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:502-520 [Journal]
- Richard P. Brent, H. T. Kung
The Area-Time Complexity of Binary Multiplication. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:521-534 [Journal]
- Eitan M. Gurari, Oscar H. Ibarra
The Complexity of the Equivalence Problem for Simple Programs. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:535-560 [Journal]
- Ernst W. Mayr, Albert R. Meyer
The Complexity of the Finite Containment Problem for Petri Nets. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:561-576 [Journal]
- Robert Endre Tarjan
A Unified Approach to Path Problems. [Citation Graph (1, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:577-593 [Journal]
- Robert Endre Tarjan
Fast Algorithms for Solving Path Problems. [Citation Graph (1, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:594-614 [Journal]
- Andrew Chi-Chih Yao
Should Tables Be Sorted? [Citation Graph (4, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:615-628 [Journal]
- Martin Reiser, Stephen S. Lavenberg
Corrigendum: ``Mean-Value Analysis of Closed Multichain Queuing Networks''. [Citation Graph (0, 0)][DBLP]
J. ACM, 1981, v:28, n:3, pp:629- [Journal]
|
