Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Foundations of Software Technology and Theoretical Computer Science

Eighth Conference, Pune, India, December 21-23, 1988. Proceedings

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. Kesav V. Nori
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sanjeev Kumar
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 338)

Included in the following conference series:

Conference proceedings info: FSTTCS 1988.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This volume contains the proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science held in Pune, India, on December 21-23, 1988. This internationally well-established Indian conference series provides a forum for actively investigating the interface between theory and practice of Software Science. It also gives an annual occasion for interaction between active research communities in India and abroad. Besides attractive invited papers the volume contains carefully reviewed submitted papers on the following topics: Automata and Formal Languages, Graph Algorithms and Geometric Algorithms, Distributed Computing, Parallel Algorithms, Database Theory, Logic Programming, Programming Methodology, Theory of Algorithms, Semantics and Complexity.

Similar content being viewed by others

Keywords

Table of contents (33 papers)

  1. Front Matter

    Download chapter PDF

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

    • Franco P. Preparata
    Pages 1-17

  3. Computing a viewpoint of a set of points inside a polygon

    • Subir Kumar Ghosh
    Pages 18-29

  4. Analysis of preflow push algorithms for maximum network flow

    • J. Cheriyan, S. N. Maheshwari
    Pages 30-48

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

    • S. V. Krishnan, C. Pandu Rangan, S. Seshadri
    Pages 49-66

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

    • Samir Khuller
    Pages 67-79

  7. Constant-space string-matching

    • Maxime Crochemore
    Pages 80-87

  8. Inherent nonslicibility of rectangular duals in VLSI floorplanning

    • Susmita Sur-Kolay, Bhargab B. Bhattacharya
    Pages 88-107

  9. Path planning with local information

    • Amitava Datta, Kamala Krithivasan
    Pages 108-121

  10. Linear broadcast routing

    • Ching-Tsun Chou, Inder S. Gopal
    Pages 122-122

  11. Predicting deadlock in store-and-forward networks

    • Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
    Pages 123-142

  12. On parallel sorting and addition with concurrent writes

    • Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
    Pages 143-153

  13. An optimal parallel algorithm for sorting presorted files

    • Christos Levcopoulos, Ola Petersson
    Pages 154-160

  14. Superlinear speedup in parallel state-space search

    • V. Nageshwara Rao, Vipin Kumar
    Pages 161-174

  15. Circuit definitions of nondeterministic complexity classes

    • H. Venkateswaran
    Pages 175-192

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

    • Jürgen Kämper
    Pages 193-210

  17. Padding, commitment and self-reducibility

    • Sanjeev N. Khadilkar, Somenath Biswas
    Pages 211-224

  18. The complexity of a counting finite-state automaton

    • Craig A. Rich, Giora Slutzki
    Pages 225-239

  19. A hierarchy theorem for pram-based complexity classes

    • Walter W. Kirchherr
    Pages 240-249

  20. A natural deduction treatment of operational semantics

    • Rod Burstall, Furio Honsell
    Pages 250-269
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation