STACS 86 [electronic resource] : 3rd Annual Symposium on Theoretical Aspects of Computer Science Orsay, France, January 16–18, 1986 /

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.

Bibliographic Details

Main Authors:	Monien, B. editor., Vidal-Naquet, G. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1985
Subjects:	Computer science., Computers., Algorithms., Computer logic., Mathematical logic., Computer Science., Computation by Abstract Devices., Algorithm Analysis and Problem Complexity., Logics and Meanings of Programs., Mathematical Logic and Formal Languages.,
Online Access:	http://dx.doi.org/10.1007/3-540-16078-7
Tags:	Add Tag No Tags, Be the first to tag this record!