Foundations of software technology and theoretical computer science : ninth conference, Bangalore, India December 19 21, 1989 : proceedings : FST and TCS 9
The papers in this volume accepted for the conference on foundations of software technology and theoretical computer science project research results in - Algorithmics: design and analysis of graph, geometric, algebraic and VLSI algorithms; data structures; average analysis; complexity theory; paral...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
405 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, ninth conference, Bangalore, India, December 19-21, 1989, proceedings, C.E. Veni Madhavan, ed, Berlin, Springer-Verlag, 1989, 1 vol. (VIII-339 p.), Lecture notes in computer science, 0-387-52048-1 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662175736 |
Obsah:
- A linear-time recognition algorithm for P 4-reducible graphs
- Fast parallel approximations of the maximum weighted cut problem through derandomization
- A new class of separators and planarity of chordal graphs
- Optimal parallel algorithms on circular-arc graphs
- Algebraic properties of the space of multivalued and paraconsistent logic programs
- An autoepistemic logical view of knowledge base
- A natural semantics for logic programs with negation
- A transformation system for deductive database modules with perfect model semantics
- An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks
- Impossibility results in the presence of multiple faulty processes
- An adaptive regulator approach for the design of load sharing algorithms
- An algebraic compositional semantics of an object oriented notation with concurrency
- An axiomatization of event structures
- Deducing causal relationships in CCS
- Annotated program transformations
- Algebraic software development concepts for module and configuration families
- On the limitations of locally robust positive reductions
- Query evaluation with null values: How complex is completeness?
- Average case complexity analysis of RETE pattern-match algorithm and average size of join in Databases
- The frobenius problem
- An efficient implicit data structure for path testing and searching in rooted trees and forests
- Robust decompositions of polyhedra
- Gate matrix layout revisited: Algorithmic performance and probabilistic analysis
- Parallel parsing on a one-way linear array of finite-state machines
- Energy-time trade-offs in VLSI computations
- Time and real-time in programs
- A proof system for communicating processes with value-passing (extended abstract).