STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science Orsay, France, January 16 18, 1986
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | , |
| フォーマット: | Livre numérique |
| 言語: | Anglais Français |
| 出版事項: |
Berlin ; Heidelberg :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
210 |
| 主題: | |
| オンライン･アクセス: | 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: | • STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, edited by B. Monien and G. Vidal-Naquet, 1986, Berlin, Springer, 1 vol. (IX-368 p.), Lecture notes in computer science, 0-387-16078-7 • STACS 86, Texte imprimé, 9783662162118 |
目次:
- Abstract interpretation of denotational definitions
- Temporal reasoning under generalized fairness constraints
- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples
- Some probabilistic powerdomains in the category SFP
- Ions and local definitions in logic programming
- Input sensitive, optimal parallel randomized algorithms for addition and identification
- A parallel statistical cooling algorithm
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Polynomial time algorithms for finding integer relations among real numbers
- New upperbounds for decentralized extrema-finding in a ring of processors
- Algorithms for visibility representations of planar graphs
- Speeding up random access machines by few processors
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
- On sparseness, ambiguity and other decision problems for acceptors and transducers
- Varietes de Semis Groupes et Mots Infinis
- Equations in free partially commutative monoids
- Separating and testing
- Decomposition de Fonctions Rationnelles
- Long unavoidable patterns
- Abstract implementations and correctness proofs
- Strictness and serializability
- Towards specification and proof of asynchronous systems
- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)
- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata
- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ?-machines
- On sparse oracles separating feasible complexity classes
- On generalized kolmogorov complexity
- Area-time optimal division for T=?((logn)1+? )
- A time-spacetradeoff for element distinctness
- Parallel machines and their communication theoretical limits.