- David Nassimi, Sartaj Sahni:
An optimal routing algorithm for mesh-connected Parallel computers. J. ACM 27(1): 6-29 (1980) - Greg Nelson, Derek C. Oppen:
Fast Decision Procedures Based on Congruence Closure. J. ACM 27(2): 356-364 (1980) - Derek C. Oppen:
Reasoning About Recursively Defined Data Structures. J. ACM 27(3): 403-411 (1980) - Christos H. Papadimitriou, Paris C. Kanellakis:
Flowshop scheduling with limited temporary storage. J. ACM 27(3): 533-549 (1980) - Rainer Parchmann:
Corrigendum: "Control System Model for Critically Timed Success". J. ACM 27(2): 402 (1980) - Krzysztof Pawlikowski:
Message Waiting Time in a Packet Switching System. J. ACM 27(1): 30-41 (1980) - Marshall C. Pease, Robert E. Shostak, Leslie Lamport:
Reaching Agreement in the Presence of Faults. J. ACM 27(2): 228-234 (1980) - Bhaskaram Prabhala, Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions. J. ACM 27(1): 146-163 (1980) - Andrzej Proskurowski:
On the Generation of Binary Trees. J. ACM 27(1): 1-2 (1980) - K. G. Ramakrishnan:
Solving Two-Commodity Transportation Problems with Coupling Constraints. J. ACM 27(4): 736-757 (1980) - Jean-Claude Raoult, Jean Vuillemin:
Operational and Semantic Equivalence Between Recursive Programs. J. ACM 27(4): 772-796 (1980) - Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game. J. ACM 27(4): 839-849 (1980) - Martin Reiser, Stephen S. Lavenberg:
Mean-Value Analysis of Closed Multichain Queuing Networks. J. ACM 27(2): 313-322 (1980) - Raymond Reiter:
Equality and Domain Closure in First-Order Databases. J. ACM 27(2): 235-249 (1980) - Yehoshua Sagiv:
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic. J. ACM 27(2): 250-262 (1980) - Yehoshua Sagiv, Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655 (1980) - Sartaj Sahni, Yookun Cho:
Scheduling Independent Tasks with Due Times on a Uniform Processor System. J. ACM 27(3): 550-563 (1980) - Jacob T. Schwartz:
Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM 27(4): 701-717 (1980) - Ravi Sethi, Adrian Tang:
Constructing Call-by-Value Continuation Semantics. J. ACM 27(3): 580-597 (1980) - Yossi Shiloach:
A Polynomial Solution to the Undirected Two Paths Problem. J. ACM 27(3): 445-456 (1980) - Abraham Silberschatz, Zvi M. Kedem:
Consistency in Hierarchical Database Systems. J. ACM 27(1): 72-80 (1980) - Marvin H. Solomon, Raphael A. Finkel:
A Note on Enumerating Binary Trees. J. ACM 27(1): 3-5 (1980) - Norihisa Suzuki, David Jefferson:
Verification Decidability of Presburger Array Programs. J. ACM 27(1): 191-205 (1980) - G. Boyd Swartz:
Polling in a Loop System. J. ACM 27(1): 42-59 (1980) - Donald F. Towsley:
Queuing Network Models with State-Dependent Routing. J. ACM 27(2): 323-337 (1980) - Kishor S. Trivedi, Robert A. Wagner, Timothy M. Sigmon:
Optimal Selection of CPU Speed, Device Capacities, and File Assignments. J. ACM 27(3): 457-473 (1980) - Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi:
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset. J. ACM 27(4): 619-632 (1980) - Mitchell Wand:
Continuation-Based Program Transformation Strategies. J. ACM 27(1): 164-180 (1980) - Stephen A. Ward, Robert H. Halstead Jr.:
A Syntactic Theory of Message Passing. J. ACM 27(2): 365-383 (1980) - Grzegorz W. Wasilkowski:
Can Any Stationary Iteration Using Linear Information Be Globally Convergent?. J. ACM 27(2): 263-269 (1980)