Fundamental Problems in Computing

Essays in Honor of Professor Daniel J. Rosenkrantz

  • S. S. Ravi
  • Sandeep K. Shukla

Table of contents

  1. Front Matter
    Pages i-xxi
  2. Selected Reprints from Professor Rosenkrantz’s Seminal Contributions

    1. Front Matter
      Pages 1-1
    2. P. M. Lewis, D. J. Rosenkrantz, R. E. Stearns
      Pages 13-43
    3. Daniel J. Rosenkrantz, Richard E. Stearns, Philip M. Lewis II
      Pages 45-69
    4. Daniel J. Rosenkrantz, Richard E. Stearns, Philip M. Lewis II
      Pages 71-98
    5. D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis II
      Pages 99-132
    6. Daniel J. Rosenkrantz, Harry B. Hunt III
      Pages 209-240
    7. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
      Pages 241-266
    8. Parvathi Chundi, Daniel J. Rosenkrantz
      Pages 267-297
  3. Contributed Articles

    1. Front Matter
      Pages 299-299
    2. Richard E. Stearns, Harry B. Hunt III
      Pages 301-325
    3. Yuri Breitbart, Henry F. Korth, Avi Silberschatz
      Pages 327-351
    4. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
      Pages 375-406
    5. Zoran Ivković, Errol L. Lloyd
      Pages 407-434
    6. Sven O. Krumke, Rob van Stee, Stephan Westphal
      Pages 435-454
    7. Christopher L. Barrett, Keith Bisset, Jiangzhuo Chen, Stephen Eubank, Bryan Lewis, V. S. Anil Kumar et al.
      Pages 477-507
  4. Back Matter
    Pages 509-515

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


Action C programming language Processing Text algorithms computer

Editors and affiliations

  • S. S. Ravi
    • 1
  • Sandeep K. Shukla
    • 2
  1. 1.Department of Computer ScienceUniversity at Albany—SUNYAlbanyUSA
  2. 2.Bradley Dept. Electrical and Computer EngineeringVirginia TechBlacksburgUSA

Bibliographic information