2009

Fundamental Problems in Computing

Essays in Honor of Professor Daniel J. Rosenkrantz

Editors:

ISBN: 978-1-4020-9687-7 (Print) 978-1-4020-9688-4 (Online)

Table of contents (18 chapters)

  1. Front Matter

    Pages i-xxi

  2. Selected Reprints from Professor Rosenkrantz’s Seminal Contributions

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-11

      Matrix Equations and Normal Forms for Context-Free Grammars

    3. No Access

      Book Chapter

      Pages 13-43

      Attributed Translations

    4. No Access

      Book Chapter

      Pages 45-69

      An analysis of several heuristics for the traveling salesman problem

    5. No Access

      Book Chapter

      Pages 71-98

      System Level Concurrency Control for Distributed Database Systems

    6. No Access

      Book Chapter

      Pages 99-132

      Consistency and serializability in concurrent database systems

    7. No Access

      Book Chapter

      Pages 133-162

      An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks

    8. No Access

      Book Chapter

      Pages 163-208

      Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications

    9. No Access

      Book Chapter

      Pages 209-240

      The Complexity of Processing Hierarchical Specifications

    10. No Access

      Book Chapter

      Pages 241-266

      Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

    11. No Access

      Book Chapter

      Pages 267-297

      Efficient Algorithms for Segmentation of Item-Set Time Series

  3. Contributed Articles

    1. Front Matter

      Pages 299-299

    2. No Access

      Book Chapter

      Pages 301-325

      Sums-of-Products and Subproblem Independence

    3. No Access

      Book Chapter

      Pages 327-351

      An Optimistic Concurrency Control Protocol for Replicated Databases

    4. No Access

      Book Chapter

      Pages 353-373

      SNAPSHOT Isolation: Why Do Some People Call it SERIALIZABLE?

    5. No Access

      Book Chapter

      Pages 375-406

      A Richer Understanding of the Complexity of Election Systems

    6. No Access

      Book Chapter

      Pages 407-434

      Fully Dynamic Bin Packing

    7. No Access

      Book Chapter

      Pages 435-454

      Online Job Admission

    8. No Access

      Book Chapter

      Pages 455-476

      A Survey of Graph Algorithms Under Extended Streaming Models of Computation

    9. No Access

      Book Chapter

      Pages 477-507

      Interactions among human behavior, social networks, and societal infrastructures: A Case Study in Computational Epidemiology

  4. Back Matter

    Pages 509-515