STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986
著者
書誌事項
STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986
（Lecture notes in computer science, 210）
Springer-Verlag, c1986
- : gw
- : us
大学図書館所蔵 件 / 全49件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Organized jointly by the special interest group for theoretical computer science of the Gesellschaft für Informatik (G.I.) and the special interest group for applied mathematic[s] of the Association française des sciences et techniques de l'information, de l'organisation et des systèmes (AFCET)"--Foreword
English and French
内容説明・目次
目次
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-space tradeoff for element distinctness.- Parallel machines and their communication theoretical limits.
「Nielsen BookData」 より