Fundamental problems in computing: essays in honor of professor Daniel J. Rosenkrantz

Fundamental problems in computing: essays in honor of professor Daniel J. Rosenkrantz

Ravi, S.S.
Shukla, S.K.

83,15 €(IVA inc.)

Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz hasmade 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 ComputerScience have earned him many awards including the Fellowship from ACM and theACM SIGMOD Contributions Award. A convenient collection of many seminal papers in computer science authored by Professor Daniel J. Rosenkrantz Contains contributed chapters authored by well known researchers Chapters cover a variety of important topics in computer science (e.g. algorithm analysis, complexity of voting systems, computational epidemiology, concurrency control for databases) INDICE: From the contents Part I: Selected Reprints from Professor Rosenkrantz’s Seminal Contributions. 1. Matrix Equations and Normal Forms for Context-Free Grammars. 2. Attributed Translations. 3. An Analysis of Several Heuristics for the Traveling Salesman Problem. 4. System Level Concurrency Control forDistributed 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-Controlled Hierarchical Specifications. 8 The Complexity of Processing Hierarchical Specifications. 9. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. 10. EfficientAlgorithms for Segmentation of Item-Set Time Series. Part II: Contributed Articles. 1. Structure Trees and Subproblem Independence.

  • ISBN: 978-1-4020-9687-7
  • Editorial: Springer
  • Encuadernacion: Cartoné
  • Páginas: 350
  • Fecha Publicación: 01/04/2009
  • Nº Volúmenes: 1
  • Idioma: Inglés