Fundamental Problems in Computing

Essays in Honor of Professor Daniel J. Rosenkrantz

Editors: Ravi, Sekharipuram S., Shukla, Sandeep Kumar (Eds.)

  • A convenient collection of many seminal papers in computer science authored by Professor Daniel J. Rosenkrantz
  • Also 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, and concurrency control for databases)
  • Chapters are suitable for self-study by graduate students in computer science and applied mathematics
see more benefits

Buy this book

eBook $109.00
price for USA
  • ISBN 978-1-4020-9688-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $149.00
price for USA
  • ISBN 978-1-4020-9687-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $149.00
price for USA
  • ISBN 978-90-481-8183-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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."

Table of contents (18 chapters)

  • Matrix Equations and Normal Forms for Context-Free Grammars

    Rosenkrantz, Daniel J.

    Pages 3-11

  • Attributed Translations

    Lewis, P. M. (et al.)

    Pages 13-43

  • An analysis of several heuristics for the traveling salesman problem

    Rosenkrantz, Daniel J. (et al.)

    Pages 45-69

  • System Level Concurrency Control for Distributed Database Systems

    Rosenkrantz, Daniel J. (et al.)

    Pages 71-98

  • Consistency and serializability in concurrent database systems

    Rosenkrantz, D. J. (et al.)

    Pages 99-132

Buy this book

eBook $109.00
price for USA
  • ISBN 978-1-4020-9688-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $149.00
price for USA
  • ISBN 978-1-4020-9687-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $149.00
price for USA
  • ISBN 978-90-481-8183-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Fundamental Problems in Computing
Book Subtitle
Essays in Honor of Professor Daniel J. Rosenkrantz
Editors
  • Sekharipuram S. Ravi
  • Sandeep Kumar Shukla
Copyright
2009
Publisher
Springer Netherlands
Copyright Holder
Springer Science+Business Media B.V.
eBook ISBN
978-1-4020-9688-4
DOI
10.1007/978-1-4020-9688-4
Hardcover ISBN
978-1-4020-9687-7
Softcover ISBN
978-90-481-8183-4
Edition Number
1
Number of Pages
XXII, 516
Topics