Fundamental Problems in Computing (Record no. 15625)

MARC details
000 -LEADER
fixed length control field 05916nam a22004815i 4500
001 - CONTROL NUMBER
control field 978-1-4020-9688-4
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170628033530.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2009 ne | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781402096884
-- 978-1-4020-9688-4
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-1-4020-9688-4
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.7-76.73
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.76.C65
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMX
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMC
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051010
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM010000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.13
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Ravi, S. S.
Relator term editor.
245 10 - TITLE STATEMENT
Title Fundamental Problems in Computing
Medium [electronic resource] :
Remainder of title Essays in Honor of Professor Daniel J. Rosenkrantz /
Statement of responsibility, etc edited by S. S. Ravi, Sandeep K. Shukla.
264 #1 -
-- Dordrecht :
-- Springer Netherlands,
-- 2009.
300 ## - PHYSICAL DESCRIPTION
Extent XXII, 516 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): “Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career. From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): “Many of Dan’s publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan’s best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R. Ravi (Carnegie-Mellon University, Pittsburgh, PA): “Professor Rosenkrantz’s work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical forms for grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan’s invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): “I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): “Dan Rosenkrantz’s career spans over 40 years of designing and analyzing algorithms. Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science."
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic design.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programming Languages, Compilers, Interpreters.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic Design.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Shukla, Sandeep K.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781402096877
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="http://dx.doi.org/10.1007/978-1-4020-9688-4">http://dx.doi.org/10.1007/978-1-4020-9688-4</a>
912 ## -
-- ZDB-2-SCS
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Total Checkouts Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     Central Library Central Library 28/06/2017 Springer EBook   E-38804 28/06/2017 28/06/2017 E-Book

Maintained by VTU Library