External Links

Journal: Communications of the ACM

Volume 21, Issue 7

526 -- 539David L. Waltz. An English Language Query Answering System for a Large Relational Data Base
540 -- 544Michael L. Fredman, Bruce W. Weide. On the Complexity of Computing the Measure of U[ai, bi]
544 -- 549Francis Y. L. Chin. An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products
550 -- 553Yehoshua Perl, Alon Itai, Haim Avni. Interpolation Search - A Log Log N Search
554 -- 557Constantine Halatsis, George Philokyprou. Pseudochaining in Hash Tables
558 -- 565Leslie Lamport. Time, Clocks, and the Ordering of Events in a Distributed System
565 -- 569Henry G. Baker. Shallow Binding in LISP 1.5
570 -- 582Hanan Samet. Proving the Correctness of Heuristically Optimized Code
583 -- 585Robert E. Shostak. An Algorithm for Reasoning About Equality
586 -- 591Rahul Chattergy, Udo W. Pooch. Analysis of the Availability of Computer Systems Using Computer-Aided Algebra
592 -- 0Arne Maus. Interlude on signals and semephores revisited
592 -- 0Niklaus Wirth. Interlude on signals and semphores revisited. author's response
592 -- 593Duane Sand. Thoughtless programming
593 -- 0Percy Tzelnic. On LRU stack model suitability
593 -- 0Marc A. Auslander. Thoughtless programming? author's response
594 -- 0Gerald Held, Michael Stonebraker. On B-trees Re-examined - Authors' Response
594 -- 0Rollins Turner. On LRU stack model suitability. author's response
594 -- 0Lawrence Snyder. On B-trees Re-examined
runs on