Foundations of software technology and theoretical computer science : seventh conference, Pune, India, December 17 19, 1987 : proceedings : FST and TCS 7
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
287 |
| Предметы: | |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
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, proceedings, FST and TCS 7, seventh conference, Pune, India, December 17-19, 1987 ; ed. Kesav V. Nori, Kesav V. Nori, Berlin, Springer, 1987, 1 vol. (IX-539 p.), Lecture notes in computer science, 3-540-18625-5 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662215203 |
Оглавление:
- Algebraic operational semantics
- On ambiguity of DTOL systems
- The equivalence problem for n-tape finite automata with simple cycles
- Relating the degree of ambiguity of finite automata to the succinctness of their representation
- Automata, games, and positive monadic theories of trees
- An algorithm for colouring perfect planar graphs
- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs
- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs
- Improved bounds for covering general polygons with rectangles
- Submodule construction as equation solving in CCS
- Computations in undistinguished networks
- A distributed algorithm to implement n-party rendezvous
- Merge and termination in process algebra
- Parallelism and programming: A perspective
- On optimal parallelization of sorting networks
- Parallel algorithms for approximate edge colouring of simple graphs
- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks
- An O(n2) algorithm for fan-out free query optimization
- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols
- Optimizing join queries in distributed databases
- Reasoning in systems of equations and inequations
- Specification=program+types
- Paraconsistent logic programming
- Semantics of distributed Horn clause programs
- The calculus of constructions : State of the art
- Modules for re-use
- Hierarchical refinement of A Z specification
- Lazy pattern matching in the ML language
- Program development using lambda abstraction
- Relativized Arthur-Merlin versus Merlin-Arthur games
- Probabilistic quantifiers vs. distrustful adversaries
- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
- A look-ahead interpreter for sequential Prolog and its implementation
- Extension of weakest precondition formalism to a low level language
- Retrospection on the PQCC compiler structure
- Some recent applications of knowledge.