Foundations of software technology and theoretical computer science : eighth conference, Pune, India, December 21-23, 1988 : proceedings : FST and TCS 8
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 bet...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
338 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software technology and theoretical computer science, eighth conference, Pune, India, December 21-23, 1988, proceedings, FST and TCS 8, 1988, Berlin, Springer, 1 vol. (IX-519 p.), Lecture notes in computer science, 3-540-50517-2 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662205303 |
Sisällysluettelo:
- Planar point location revisited (A guided tour of a decade of research)
- Computing a viewpoint of a set of points inside a polygon
- Analysis of preflow push algorithms for maximum network flow
- A new linear algorithm for the two path problem on chordal graphs
- Extending planar graph algorithms to K 3,3-free graphs
- Constant-space string-matching
- Inherent nonslicibility of rectangular duals in VLSI floorplanning
- Path planning with local information
- Linear broadcast routing
- Predicting deadlock in store-and-forward networks
- On parallel sorting and addition with concurrent writes
- An optimal parallel algorithm for sorting presorted files
- Superlinear speedup in parallel state-space search
- Circuit definitions of nondeterministic complexity classes
- Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes
- Padding, commitment and self-reducibility
- The complexity of a counting finite-state automaton
- A hierarchy theorem for pram-based complexity classes
- A natural deduction treatment of operational semantics
- Uniformly applicative structures, a theory of computability and polyadic functions
- A proof technique for register atomicity
- Relation level semantics
- A constructive set theory for program development
- McCarthy's amb cannot implement fair merge
- GHC A language for a new age of parallel programming
- Accumulators: New logic variable abstractions for functional languages
- A resolution rule for well-formed formulae
- Algebraic and operational semantics of positive/negative conditional algebraic specifications
- Semi-unification
- A method to check knowledge base consistency
- Knowledgebases as structured theories
- On functional independencies
- A generic algorithm for transaction processingduring network partitioning.