Fundamental Problems in Computing

Essays in Honor of Professor Daniel J. Rosenkrantz

By Sekharipuram S. Ravi , Sandeep Kumar Shukla

Fundamental Problems in Computing Cover Image

Published in honor of Prof. Daniel J. Rosenkrantz, a distinguished computer science researcher, this volume collects a number of his seminal papers on subjects as varied as algorithm analysis and computational epidemiology, as well as papers by other authors.

Full Description

  • ISBN13: 978-1-4020-9687-7
  • 540 Pages
  • User Level: Science
  • Publication Date: April 21, 2009
  • Available eBook Formats: PDF
  • eBook Price: $129.00
Buy eBook Buy Print Book Add to Wishlist

Related Titles

Full Description
Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award.
Table of Contents

Table of Contents

  1. Part I: Selected Reprints from Professor Rosenkrantz’s Seminal Contributions. 1. Matrix Equations and Normal Forms for Context
  2. Free Grammars. 2. Attributed Translations. 3. An Analysis of Several Heuristics for the Traveling Salesman Problem. 4. System Level Concurrency Control for Distributed Database Systems. 5. Consistency and Serializability of Concurrent Database Systems. 6. An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. 7. Representability of Design Objects by Ancestor
  3. Controlled Hierarchical Specifications. 8 The Complexity of Processing Hierarchical Specifications. 9. Approximation Algorithms for Degree
  4. Constrained Minimum
  5. Cost Network
  6. Design Problems. 10. Efficient Algorithms for Segmentation of Item
  7. Set Time Series. Part II: Contributed Articles. 1. Structure Trees and Subproblem Independence. 2. Optimistic Concurrency Control Protocol for Replicated Databases. 3. SNAPSHOT Isolation: Why do Some People Call it SERIALIZABLE? 4. A Richer Understanding of the Complexity of Election Systems. 5. Fully Dynamic Bin Packing. 6. Online Job Admission. 7. A Survey of Graph Algorithms in Extensions to the Streaming Model of Computation. 8. Interactions Among Human Behavior, Social Networks and Societal Infrastructures: A Case Study in Computational Epidemiology.
Errata

Please Login to submit errata.

No errata are currently published