Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz

Author:   Sekharipuram S. Ravi ,  Sandeep Kumar Shukla
Publisher:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 2009
ISBN:  

9789048181834


Pages:   516
Publication Date:   19 October 2010
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $340.56 Quantity:  
Add to Cart

Share |

Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz


Add your own review!

Overview

Full Product Details

Author:   Sekharipuram S. Ravi ,  Sandeep Kumar Shukla
Publisher:   Springer
Imprint:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 2009
Dimensions:   Width: 15.50cm , Height: 2.70cm , Length: 23.50cm
Weight:   0.819kg
ISBN:  

9789048181834


ISBN 10:   9048181836
Pages:   516
Publication Date:   19 October 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List