default search action
IBM Journal of Research and Development, Volume 21, 1977
Please be aware that the table of contents given here is incomplete.
Volume 21, Number 3, May 1977
- Kiyoshi Maruyama, Donald T. Tang:
Discrete Link Capacity and Priority Assignments in Communication Networks. 254-263 - We-Min Chow, Lin S. Woo:
Buffer Performance Analysis of Communication Processors During Slowdown at Network Control. 264-272 - Tomás Lang, Eduardo B. Fernández:
Improving the Computation of Lower Bounds for Optimal Schedules. 273-280 - Chak-Kuen Wong, Donald T. Tang:
Dynamic Memories with Faster Random and Sequential Access. 281-287
Volume 21, Number 4, July 1977
- Lawrence I. Lieberman, Michael A. Wesley:
AUTOPASS: An Automatic Programming System for Computer Controlled Mechanical Assembly. 321-333 - Gregory J. Chaitin:
Algorithmic Information Theory. 350-359 - Kiyoshi Maruyama, Luigi Fratta, Donald T. Tang:
Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets. 360-369 - Simon S. Lam:
Queuing Networks with Population Size Constraints. 370-378 - Simon S. Lam:
An Extension of Moore's Result for Closed Queuing Networks. 384-387
Volume 21, Number 5, September 1977
- Lawrence T. Kou, George Markowsky:
Multidimensional Bin Packing Algorithms. 443-448 - Claude Delobel, Richard G. Casey, Philip A. Bernstein:
Comment on "Decomposition of a Data Base and the Theory of Boolean Switching Functions". IBM J. Res. Dev. 21(5): 484-485 (1977)
Volume 21, Number 6, November 1977
- Brian T. Bennett, Peter A. Franaszek:
Permutation Clustering: An Approach to On-Line Storage Reorganization. 528-533 - Ronald Fagin:
Functional Dependencies in a Relational Data Base and Propositional Logic. 543-544 - David B. Lomet:
Data Flow Analysis in the Presence of Procedure Calls. 559-571
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.