Fundamental Problems in Computing
Essays in Honor of Professor Daniel J. Rosenkrantz
Published on 19. October 2010
Book
Paperback/Softback
XXII, 516 pages
978-90-481-8183-4 (ISBN)
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.
More details
Edition
Softcover reprint of hardcover 1st ed. 2009
Language
English
Place of publication
Dordrecht
Netherlands
Target group
Professional and scholarly
Research
Illustrations
XXII, 516 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 29 mm
Weight
809 gr
ISBN-13
978-90-481-8183-4 (9789048181834)
DOI
10.1007/978-1-4020-9688-4
Schweitzer Classification
Other editions
Additional editions
Sekharipuram S. Ravi | Sandeep Kumar Shukla
Fundamental Problems in Computing
Essays in Honor of Professor Daniel J. Rosenkrantz
Book
04/2009
Springer
€106.99
Shipment within 15-20 days
Content
Selected Reprints from Professor Rosenkrantz's Seminal Contributions.- Matrix Equations and Normal Forms for Context-Free Grammars.- Attributed Translations.- An analysis of several heuristics for the traveling salesman problem.- System Level Concurrency Control for Distributed Database Systems.- Consistency and serializability in concurrent database systems.- An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks.- Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications.- The Complexity of Processing Hierarchical Specifications.- Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.- Efficient Algorithms for Segmentation of Item-Set Time Series.- Contributed Articles.- Sums-of-Products and Subproblem Independence.- An Optimistic Concurrency Control Protocol for Replicated Databases.- SNAPSHOT Isolation: Why Do Some People Call it SERIALIZABLE?.- A Richer Understanding of the Complexity of Election Systems.- Fully Dynamic Bin Packing.- Online Job Admission.- A Survey of Graph Algorithms Under Extended Streaming Models of Computation.- Interactions among human behavior, social networks, and societal infrastructures: A Case Study in Computational Epidemiology.