About the Book
Part I: Selected Reprints from Professor Rosenkrantz's Seminal Contributions 1. Matrix Equations and Normal Forms for Context-Free Grammars; Rosenkrantz, D. J. 2. Attributed Translations; Lewis, P. M., Rosenkrantz, D. J., and Stearns, R. E. 3. An Analysis of Several Heuristics for the Traveling Salesman Problem; Rosenkrantz, D. J., Stearns, R. E., and Lewis, P. M. 4. System Level Concurrency Control for Distributed Database Systems; Rosenkrantz, D. J., Stearns, R. E., and Lewis, P. M. II 5. Consistency and Serializability of Concurrent Database Systems; Rosenkrantz, D. J., Stearns, R. E., and Lewis, P. M. II 6. An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks; Bernhard, P. J., and Rosenkrantz, D. J. 7. Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications; Yu, L., and Rosenkrantz, D. J. 8 The Complexity of Processing Hierarchical Specifications; Rosenkrantz, D. J., and Hunt, H. B. III 9. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems; Ravi, R., et al. 10. Efficient Algorithms for Segmentation of Item-Set Time Series; Chundi, P., and Rosenkrantz, D.J.. Part II: Contributed Articles 1. Structure Trees and Subproblem Independence; Stearns, R. E. and Hunt III, H. B. 2. Optimistic Concurrency Control Protocol for Replicated Databases; Breitbart, Y., Korth, H. F. and Silberschatz, A. 3. SNAPSHOT Isolation: Why do Some People Call it SERIALIZABLE?; Lewis II, P. M. 4. A Richer Understanding of the Complexity of Election Systems; Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., and Rothe, J. 5. Fully Dynamic Bin Packing; Ivkovic, Z. and Lloyd, E. L. 6. Online Job Admission; Krumke, S. O., van Stee, R. and Westphal, S. 7. A Survey of Graph Algorithms in Extensions to the Streaming Model of Computation; O'Connell, T. C. 8. Interactions Among Human Behavior, Social Networks and Societal Infrastructures: A Case Study in Computational Epidemiology; Barrett, C. L., et al.
