Journals in DBLP
J. ACM 1980, volume: 27, number: 2
Andrew Chi-Chih Yao New Algorithms for Bin Packing. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:207-227 [Journal ] Marshall C. Pease , Robert E. Shostak , Leslie Lamport Reaching Agreement in the Presence of Faults. [Citation Graph (13, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:228-234 [Journal ] Raymond Reiter Equality and Domain Closure in First-Order Databases. [Citation Graph (9, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:235-249 [Journal ] Yehoshua Sagiv An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. [Citation Graph (5, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:250-262 [Journal ] Grzegorz W. Wasilkowski Can Any Stationary Iteration Using Linear Information Be Globally Convergent?. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:263-269 [Journal ] Tiko Kameda Testing Deadlock-Freedom of Computer Systems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:270-280 [Journal ] We-Min Chow The Cycle Time Distribution of Exponential Cyclic Queues. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:281-286 [Journal ] Teofilo F. Gonzalez , Donald B. Johnson A New Algorithm for Preemptive Scheduling of Trees. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:287-312 [Journal ] Martin Reiser , Stephen S. Lavenberg Mean-Value Analysis of Closed Multichain Queuing Networks. [Citation Graph (3, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:313-322 [Journal ] Donald F. Towsley Queuing Network Models with State-Dependent Routing. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:323-337 [Journal ] Ramachandran Krishnaswamy , Arthur B. Pyster On the Correctness of Semantic-Syntax-Directed Translations. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:338-355 [Journal ] Greg Nelson , Derek C. Oppen Fast Decision Procedures Based on Congruence Closure. [Citation Graph (4, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:356-364 [Journal ] Stephen A. Ward , Robert H. Halstead Jr. A Syntactic Theory of Message Passing. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:365-383 [Journal ] Harold Abelson Lower Bounds on Information Transfer in Distributed Computations. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:384-392 [Journal ] David Lichtenstein , Michael Sipser GO Is Polynomial-Space Hard. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:393-401 [Journal ] Rainer Parchmann Corrigendum: ``Control System Model for Critically Timed Success''. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:2, pp:402- [Journal ]