Foundations of Software Technology and Theoretical Computer Science

Eighth Conference, Pune, India December 21–23, 1988 Proceedings

Editors:

ISBN: 978-3-540-50517-4 (Print) 978-3-540-46030-5 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-17

    Planar point location revisited (A guided tour of a decade of research)

  3. No Access

    Book Chapter

    Pages 18-29

    Computing a viewpoint of a set of points inside a polygon

  4. No Access

    Book Chapter

    Pages 30-48

    Analysis of preflow push algorithms for maximum network flow

  5. No Access

    Book Chapter

    Pages 49-66

    A new linear algorithm for the two path problem on chordal graphs

  6. No Access

    Book Chapter

    Pages 67-79

    Extending planar graph algorithms to K 3,3-free graphs

  7. No Access

    Book Chapter

    Pages 80-87

    Constant-space string-matching

  8. No Access

    Book Chapter

    Pages 88-107

    Inherent nonslicibility of rectangular duals in VLSI floorplanning

  9. No Access

    Book Chapter

    Pages 108-121

    Path planning with local information

  10. No Access

    Book Chapter

    Pages 122-122

    Linear broadcast routing

  11. No Access

    Book Chapter

    Pages 123-142

    Predicting deadlock in store-and-forward networks

  12. No Access

    Book Chapter

    Pages 143-153

    On parallel sorting and addition with concurrent writes

  13. No Access

    Book Chapter

    Pages 154-160

    An optimal parallel algorithm for sorting presorted files

  14. No Access

    Book Chapter

    Pages 161-174

    Superlinear speedup in parallel state-space search

  15. No Access

    Book Chapter

    Pages 175-192

    Circuit definitions of nondeterministic complexity classes

  16. No Access

    Book Chapter

    Pages 193-210

    Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes

  17. No Access

    Book Chapter

    Pages 211-224

    Padding, commitment and self-reducibility

  18. No Access

    Book Chapter

    Pages 225-239

    The complexity of a counting finite-state automaton

  19. No Access

    Book Chapter

    Pages 240-249

    A hierarchy theorem for pram-based complexity classes

  20. No Access

    Book Chapter

    Pages 250-269

    A natural deduction treatment of operational semantics

  21. No Access

    Book Chapter

    Pages 270-285

    Uniformly applicative structures, a theory of computability and polyadic functions

previous Page of 2